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

1294 lines
47KB
Raw Blame History 

  1. /*

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

  3.  *

  4.  * This file is part of Libav.

  5.  *

  6.  * Libav 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.  * Libav 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 Libav; 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.     int vqa_version;                /**< VQA version. Used for ADPCM_IMA_WS */

  90. } ADPCMDecodeContext;

  91. 

  92. static av_cold int adpcm_decode_init(AVCodecContext * avctx)

  93. {

  94.     ADPCMDecodeContext *c = avctx->priv_data;

  95.     unsigned int min_channels = 1;

  96.     unsigned int max_channels = 2;

  97. 

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

  99.     case CODEC_ID_ADPCM_EA:

  100.         min_channels = 2;

  101.         break;

  102.     case CODEC_ID_ADPCM_EA_R1:

  103.     case CODEC_ID_ADPCM_EA_R2:

  104.     case CODEC_ID_ADPCM_EA_R3:

  105.     case CODEC_ID_ADPCM_EA_XAS:

  106.         max_channels = 6;

  107.         break;

  108.     }

  109.     if (avctx->channels < min_channels || avctx->channels > max_channels) {

  110.         av_log(avctx, AV_LOG_ERROR, "Invalid number of channels\n");

  111.         return AVERROR(EINVAL);

  112.     }

  113. 

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

  115.     case CODEC_ID_ADPCM_CT:

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

  117.         break;

  118.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  121.             return -1;

  122.         }

  123.         break;

  124.     case CODEC_ID_ADPCM_IMA_APC:

  125.         if (avctx->extradata && avctx->extradata_size >= 8) {

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

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

  128.         }

  129.         break;

  130.     case CODEC_ID_ADPCM_IMA_WS:

  131.         if (avctx->extradata && avctx->extradata_size >= 42)

  132.             c->vqa_version = AV_RL16(avctx->extradata);

  133.         break;

  134.     default:

  135.         break;

  136.     }

  137.     avctx->sample_fmt = AV_SAMPLE_FMT_S16;

  138. 

  139.     avcodec_get_frame_defaults(&c->frame);

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

  141. 

  142.     return 0;

  143. }

  144. 

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

  146. {

  147.     int step_index;

  148.     int predictor;

  149.     int sign, delta, diff, step;

  150. 

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

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

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

  154. 

  155.     sign = nibble & 8;

  156.     delta = nibble & 7;

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

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

  159.      * quickly enough */

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

  161.     predictor = c->predictor;

  162.     if (sign) predictor -= diff;

  163.     else predictor += diff;

  164. 

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

  166.     c->step_index = step_index;

  167. 

  168.     return (short)c->predictor;

  169. }

  170. 

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

  172. {

  173.     int step_index;

  174.     int predictor;

  175.     int diff, step;

  176. 

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

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

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

  180. 

  181.     diff = step >> 3;

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

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

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

  185. 

  186.     if (nibble & 8)

  187.         predictor = c->predictor - diff;

  188.     else

  189.         predictor = c->predictor + diff;

  190. 

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

  192.     c->step_index = step_index;

  193. 

  194.     return c->predictor;

  195. }

  196. 

  197. static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, int nibble)

  198. {

  199.     int predictor;

  200. 

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

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

  203. 

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

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

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

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

  208. 

  209.     return c->sample1;

  210. }

  211. 

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

  213. {

  214.     int sign, delta, diff;

  215.     int new_step;

  216. 

  217.     sign = nibble & 8;

  218.     delta = nibble & 7;

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

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

  221.      * quickly enough */

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

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

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

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

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

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

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

  229. 

  230.     return (short)c->predictor;

  231. }

  232. 

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

  234. {

  235.     int sign, delta, diff;

  236. 

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

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

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

  240. 

  241.     /* clamp result */

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

  243. 

  244.     /* calculate new step */

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

  246.         c->step++;

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

  248.         c->step--;

  249. 

  250.     return (short) c->predictor;

  251. }

  252. 

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

  254. {

  255.     if(!c->step) {

  256.         c->predictor = 0;

  257.         c->step = 127;

  258.     }

  259. 

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

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

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

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

  264.     return c->predictor;

  265. }

  266. 

  267. static int xa_decode(AVCodecContext *avctx,

  268.                      short *out, const unsigned char *in,

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

  270. {

  271.     int i, j;

  272.     int shift,filter,f0,f1;

  273.     int s_1,s_2;

  274.     int d,s,t;

  275. 

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

  277. 

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

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

  280.         if (filter > 4) {

  281.             av_log(avctx, AV_LOG_ERROR,

  282.                    "Invalid XA-ADPCM filter %d (max. allowed is 4)\n",

  283.                    filter);

  284.             return AVERROR_INVALIDDATA;

  285.         }

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

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

  288. 

  289.         s_1 = left->sample1;

  290.         s_2 = left->sample2;

  291. 

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

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

  294. 

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

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

  297.             s_2 = s_1;

  298.             s_1 = av_clip_int16(s);

  299.             *out = s_1;

  300.             out += inc;

  301.         }

  302. 

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

  304.             left->sample1 = s_1;

  305.             left->sample2 = s_2;

  306.             s_1 = right->sample1;

  307.             s_2 = right->sample2;

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

  309.         }

  310. 

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

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

  313.         if (filter > 4) {

  314.             av_log(avctx, AV_LOG_ERROR,

  315.                    "Invalid XA-ADPCM filter %d (max. allowed is 4)\n",

  316.                    filter);

  317.             return AVERROR_INVALIDDATA;

  318.         }

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

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

  321. 

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

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

  324. 

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

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

  327.             s_2 = s_1;

  328.             s_1 = av_clip_int16(s);

  329.             *out = s_1;

  330.             out += inc;

  331.         }

  332. 

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

  334.             right->sample1 = s_1;

  335.             right->sample2 = s_2;

  336.             out -= 1;

  337.         } else {

  338.             left->sample1 = s_1;

  339.             left->sample2 = s_2;

  340.         }

  341.     }

  342. 

  343.     return 0;

  344. }

  345. 

  346. /**

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

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

  349.  * decode with the given buf_size.

  350.  *

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

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

  353.  *                           number of samples in each frame.

  354.  */

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

  356.                           int buf_size, int *coded_samples)

  357. {

  358.     ADPCMDecodeContext *s = avctx->priv_data;

  359.     int nb_samples        = 0;

  360.     int ch                = avctx->channels;

  361.     int has_coded_samples = 0;

  362.     int header_size;

  363. 

  364.     *coded_samples = 0;

  365. 

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

  367.     /* constant, only check buf_size */

  368.     case CODEC_ID_ADPCM_EA_XAS:

  369.         if (buf_size < 76 * ch)

  370.             return 0;

  371.         nb_samples = 128;

  372.         break;

  373.     case CODEC_ID_ADPCM_IMA_QT:

  374.         if (buf_size < 34 * ch)

  375.             return 0;

  376.         nb_samples = 64;

  377.         break;

  378.     /* simple 4-bit adpcm */

  379.     case CODEC_ID_ADPCM_CT:

  380.     case CODEC_ID_ADPCM_IMA_APC:

  381.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

  382.     case CODEC_ID_ADPCM_IMA_WS:

  383.     case CODEC_ID_ADPCM_YAMAHA:

  384.         nb_samples = buf_size * 2 / ch;

  385.         break;

  386.     }

  387.     if (nb_samples)

  388.         return nb_samples;

  389. 

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

  391.     header_size = 0;

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

  393.         case CODEC_ID_ADPCM_4XM:

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

  395.         case CODEC_ID_ADPCM_IMA_AMV:     header_size = 8;           break;

  396.         case CODEC_ID_ADPCM_IMA_SMJPEG:  header_size = 4;           break;

  397.     }

  398.     if (header_size > 0)

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

  400. 

  401.     /* more complex formats */

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

  403.     case CODEC_ID_ADPCM_EA:

  404.         has_coded_samples = 1;

  405.         if (buf_size < 4)

  406.             return 0;

  407.         *coded_samples  = AV_RL32(buf);

  408.         *coded_samples -= *coded_samples % 28;

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

  410.         break;

  411.     case CODEC_ID_ADPCM_IMA_EA_EACS:

  412.         has_coded_samples = 1;

  413.         if (buf_size < 4)

  414.             return 0;

  415.         *coded_samples = AV_RL32(buf);

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

  417.         break;

  418.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

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

  420.         break;

  421.     case CODEC_ID_ADPCM_EA_R1:

  422.     case CODEC_ID_ADPCM_EA_R2:

  423.     case CODEC_ID_ADPCM_EA_R3:

  424.         /* maximum number of samples */

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

  426.         has_coded_samples = 1;

  427.         if (buf_size < 4)

  428.             return 0;

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

  430.         case CODEC_ID_ADPCM_EA_R1:

  431.             header_size    = 4 + 9 * ch;

  432.             *coded_samples = AV_RL32(buf);

  433.             break;

  434.         case CODEC_ID_ADPCM_EA_R2:

  435.             header_size    = 4 + 5 * ch;

  436.             *coded_samples = AV_RL32(buf);

  437.             break;

  438.         case CODEC_ID_ADPCM_EA_R3:

  439.             header_size    = 4 + 5 * ch;

  440.             *coded_samples = AV_RB32(buf);

  441.             break;

  442.         }

  443.         *coded_samples -= *coded_samples % 28;

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

  445.         nb_samples     -= nb_samples % 28;

  446.         break;

  447.     case CODEC_ID_ADPCM_IMA_DK3:

  448.         if (avctx->block_align > 0)

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

  450.         nb_samples = ((buf_size - 16) * 2 / 3 * 4) / ch;

  451.         break;

  452.     case CODEC_ID_ADPCM_IMA_DK4:

  453.         if (avctx->block_align > 0)

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

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

  456.         break;

  457.     case CODEC_ID_ADPCM_IMA_WAV:

  458.         if (avctx->block_align > 0)

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

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

  461.         break;

  462.     case CODEC_ID_ADPCM_MS:

  463.         if (avctx->block_align > 0)

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

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

  466.         break;

  467.     case CODEC_ID_ADPCM_SBPRO_2:

  468.     case CODEC_ID_ADPCM_SBPRO_3:

  469.     case CODEC_ID_ADPCM_SBPRO_4:

  470.     {

  471.         int samples_per_byte;

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

  473.         case CODEC_ID_ADPCM_SBPRO_2: samples_per_byte = 4; break;

  474.         case CODEC_ID_ADPCM_SBPRO_3: samples_per_byte = 3; break;

  475.         case CODEC_ID_ADPCM_SBPRO_4: samples_per_byte = 2; break;

  476.         }

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

  478.             nb_samples++;

  479.             buf_size -= ch;

  480.         }

  481.         nb_samples += buf_size * samples_per_byte / ch;

  482.         break;

  483.     }

  484.     case CODEC_ID_ADPCM_SWF:

  485.     {

  486.         int buf_bits       = buf_size * 8 - 2;

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

  488.         int block_hdr_size = 22 * ch;

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

  490.         int nblocks        = buf_bits / block_size;

  491.         int bits_left      = buf_bits - nblocks * block_size;

  492.         nb_samples         = nblocks * 4096;

  493.         if (bits_left >= block_hdr_size)

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

  495.         break;

  496.     }

  497.     case CODEC_ID_ADPCM_THP:

  498.         has_coded_samples = 1;

  499.         if (buf_size < 8)

  500.             return 0;

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

  502.         *coded_samples -= *coded_samples % 14;

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

  504.         break;

  505.     case CODEC_ID_ADPCM_XA:

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

  507.         break;

  508.     }

  509. 

  510.     /* validate coded sample count */

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

  512.         return AVERROR_INVALIDDATA;

  513. 

  514.     return nb_samples;

  515. }

  516. 

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

  518.                               int *got_frame_ptr, AVPacket *avpkt)

  519. {

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

  521.     int buf_size = avpkt->size;

  522.     ADPCMDecodeContext *c = avctx->priv_data;

  523.     ADPCMChannelStatus *cs;

  524.     int n, m, channel, i;

  525.     short *samples;

  526.     const uint8_t *src;

  527.     int st; /* stereo */

  528.     int count1, count2;

  529.     int nb_samples, coded_samples, ret;

  530.     GetByteContext gb;

  531. 

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

  533.     if (nb_samples <= 0) {

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

  535.         return AVERROR_INVALIDDATA;

  536.     }

  537. 

  538.     /* get output buffer */

  539.     c->frame.nb_samples = nb_samples;

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

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

  542.         return ret;

  543.     }

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

  545. 

  546.     /* use coded_samples when applicable */

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

  548.     if (coded_samples) {

  549.         if (coded_samples != nb_samples)

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

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

  552.     }

  553. 

  554.     src = buf;

  555.     bytestream2_init(&gb, buf, buf_size);

  556. 

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

  558. 

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

  560.     case CODEC_ID_ADPCM_IMA_QT:

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

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

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

  564.             int predictor;

  565.             int step_index;

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

  567.             /* (pppppp) (piiiiiii) */

  568. 

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

  570.             predictor = sign_extend(bytestream2_get_be16u(&gb), 16);

  571.             step_index = predictor & 0x7F;

  572.             predictor &= ~0x7F;

  573. 

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

  575.                 int diff = predictor - cs->predictor;

  576.                 if (diff < 0)

  577.                     diff = - diff;

  578.                 if (diff > 0x7f)

  579.                     goto update;

  580.             } else {

  581.             update:

  582.                 cs->step_index = step_index;

  583.                 cs->predictor = predictor;

  584.             }

  585. 

  586.             if (cs->step_index > 88u){

  587.                 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index[%d] = %i\n",

  588.                        channel, cs->step_index);

  589.                 return AVERROR_INVALIDDATA;

  590.             }

  591. 

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

  593. 

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

  595.                 int byte = bytestream2_get_byteu(&gb);

  596.                 *samples = adpcm_ima_qt_expand_nibble(cs, byte & 0x0F, 3);

  597.                 samples += avctx->channels;

  598.                 *samples = adpcm_ima_qt_expand_nibble(cs, byte >> 4  , 3);

  599.                 samples += avctx->channels;

  600.             }

  601.         }

  602.         break;

  603.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  606.             cs->predictor = *samples++ = sign_extend(bytestream2_get_le16u(&gb), 16);

  607. 

  608.             cs->step_index = sign_extend(bytestream2_get_le16u(&gb), 16);

  609.             if (cs->step_index > 88u){

  610.                 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index[%d] = %i\n",

  611.                        i, cs->step_index);

  612.                 return AVERROR_INVALIDDATA;

  613.             }

  614.         }

  615. 

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

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

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

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

  620.                     int v = bytestream2_get_byteu(&gb);

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

  622.                     samples += avctx->channels;

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

  624.                     samples += avctx->channels;

  625.                 }

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

  627.             }

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

  629.         }

  630.         break;

  631.     case CODEC_ID_ADPCM_4XM:

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

  633.             c->status[i].predictor = sign_extend(bytestream2_get_le16u(&gb), 16);

  634. 

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

  636.             c->status[i].step_index = sign_extend(bytestream2_get_le16u(&gb), 16);

  637.             if (c->status[i].step_index > 88u) {

  638.                 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index[%d] = %i\n",

  639.                        i, c->status[i].step_index);

  640.                 return AVERROR_INVALIDDATA;

  641.             }

  642.         }

  643. 

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

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

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

  647.             for (n = nb_samples >> 1; n > 0; n--) {

  648.                 int v = bytestream2_get_byteu(&gb);

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

  650.                 samples += avctx->channels;

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

  652.                 samples += avctx->channels;

  653.             }

  654.         }

  655.         break;

  656.     case CODEC_ID_ADPCM_MS:

  657.     {

  658.         int block_predictor;

  659. 

  660.         block_predictor = bytestream2_get_byteu(&gb);

  661.         if (block_predictor > 6) {

  662.             av_log(avctx, AV_LOG_ERROR, "ERROR: block_predictor[0] = %d\n",

  663.                    block_predictor);

  664.             return AVERROR_INVALIDDATA;

  665.         }

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

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

  668.         if (st) {

  669.             block_predictor = bytestream2_get_byteu(&gb);

  670.             if (block_predictor > 6) {

  671.                 av_log(avctx, AV_LOG_ERROR, "ERROR: block_predictor[1] = %d\n",

  672.                        block_predictor);

  673.                 return AVERROR_INVALIDDATA;

  674.             }

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

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

  677.         }

  678.         c->status[0].idelta = sign_extend(bytestream2_get_le16u(&gb), 16);

  679.         if (st){

  680.             c->status[1].idelta = sign_extend(bytestream2_get_le16u(&gb), 16);

  681.         }

  682. 

  683.         c->status[0].sample1 = sign_extend(bytestream2_get_le16u(&gb), 16);

  684.         if (st) c->status[1].sample1 = sign_extend(bytestream2_get_le16u(&gb), 16);

  685.         c->status[0].sample2 = sign_extend(bytestream2_get_le16u(&gb), 16);

  686.         if (st) c->status[1].sample2 = sign_extend(bytestream2_get_le16u(&gb), 16);

  687. 

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

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

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

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

  692.         for(n = (nb_samples - 2) >> (1 - st); n > 0; n--) {

  693.             int byte = bytestream2_get_byteu(&gb);

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

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

  696.         }

  697.         break;

  698.     }

  699.     case CODEC_ID_ADPCM_IMA_DK4:

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

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

  702.             cs->predictor  = *samples++ = sign_extend(bytestream2_get_le16u(&gb), 16);

  703.             cs->step_index = sign_extend(bytestream2_get_le16u(&gb), 16);

  704.             if (cs->step_index > 88u){

  705.                 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index[%d] = %i\n",

  706.                        channel, cs->step_index);

  707.                 return AVERROR_INVALIDDATA;

  708.             }

  709.         }

  710.         for (n = nb_samples >> (1 - st); n > 0; n--) {

  711.             int v = bytestream2_get_byteu(&gb);

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

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

  714.         }

  715.         break;

  716.     case CODEC_ID_ADPCM_IMA_DK3:

  717.     {

  718.         int last_byte = 0;

  719.         int nibble;

  720.         int decode_top_nibble_next = 0;

  721.         int diff_channel;

  722.         const int16_t *samples_end = samples + avctx->channels * nb_samples;

  723. 

  724.         bytestream2_skipu(&gb, 10);

  725.         c->status[0].predictor  = sign_extend(bytestream2_get_le16u(&gb), 16);

  726.         c->status[1].predictor  = sign_extend(bytestream2_get_le16u(&gb), 16);

  727.         c->status[0].step_index = bytestream2_get_byteu(&gb);

  728.         c->status[1].step_index = bytestream2_get_byteu(&gb);

  729.         if (c->status[0].step_index > 88u || c->status[1].step_index > 88u){

  730.             av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i/%i\n",

  731.                    c->status[0].step_index, c->status[1].step_index);

  732.             return AVERROR_INVALIDDATA;

  733.         }

  734.         /* sign extend the predictors */

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

  736. 

  737.         /* DK3 ADPCM support macro */

  738. #define DK3_GET_NEXT_NIBBLE() \

  739.     if (decode_top_nibble_next) { \

  740.         nibble = last_byte >> 4; \

  741.         decode_top_nibble_next = 0; \

  742.     } else { \

  743.         last_byte = bytestream2_get_byteu(&gb); \

  744.         nibble = last_byte & 0x0F; \

  745.         decode_top_nibble_next = 1; \

  746.     }

  747. 

  748.         while (samples < samples_end) {

  749. 

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

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

  752. 

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

  754.             DK3_GET_NEXT_NIBBLE();

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

  756. 

  757.             /* process the diff channel predictor */

  758.             DK3_GET_NEXT_NIBBLE();

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

  760. 

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

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

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

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

  765. 

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

  767.             DK3_GET_NEXT_NIBBLE();

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

  769. 

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

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

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

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

  774.         }

  775.         break;

  776.     }

  777.     case CODEC_ID_ADPCM_IMA_ISS:

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

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

  780.             cs->predictor  = sign_extend(bytestream2_get_le16u(&gb), 16);

  781.             cs->step_index = sign_extend(bytestream2_get_le16u(&gb), 16);

  782.             if (cs->step_index > 88u){

  783.                 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index[%d] = %i\n",

  784.                        channel, cs->step_index);

  785.                 return AVERROR_INVALIDDATA;

  786.             }

  787.         }

  788. 

  789.         for (n = nb_samples >> (1 - st); n > 0; n--) {

  790.             int v1, v2;

  791.             int v = bytestream2_get_byteu(&gb);

  792.             /* nibbles are swapped for mono */

  793.             if (st) {

  794.                 v1 = v >> 4;

  795.                 v2 = v & 0x0F;

  796.             } else {

  797.                 v2 = v >> 4;

  798.                 v1 = v & 0x0F;

  799.             }

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

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

  802.         }

  803.         break;

  804.     case CODEC_ID_ADPCM_IMA_APC:

  805.         while (src < buf + buf_size) {

  806.             uint8_t v = *src++;

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

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

  809.         }

  810.         break;

  811.     case CODEC_ID_ADPCM_IMA_WS:

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

  813.             const uint8_t *src0;

  814.             int src_stride;

  815.             int16_t *smp = samples + channel;

  816. 

  817.             if (c->vqa_version == 3) {

  818.                 src0 = src + channel * buf_size / 2;

  819.                 src_stride = 1;

  820.             } else {

  821.                 src0 = src + channel;

  822.                 src_stride = avctx->channels;

  823.             }

  824.             for (n = nb_samples / 2; n > 0; n--) {

  825.                 uint8_t v = *src0;

  826.                 src0 += src_stride;

  827.                 *smp = adpcm_ima_expand_nibble(&c->status[channel], v >> 4  , 3);

  828.                 smp += avctx->channels;

  829.                 *smp = adpcm_ima_expand_nibble(&c->status[channel], v & 0x0F, 3);

  830.                 smp += avctx->channels;

  831.             }

  832.         }

  833.         src = buf + buf_size;

  834.         break;

  835.     case CODEC_ID_ADPCM_XA:

  836.         while (buf_size >= 128) {

  837.             if ((ret = xa_decode(avctx, samples, src, &c->status[0],

  838.                                  &c->status[1], avctx->channels)) < 0)

  839.                 return ret;

  840.             src += 128;

  841.             samples += 28 * 8;

  842.             buf_size -= 128;

  843.         }

  844.         break;

  845.     case CODEC_ID_ADPCM_IMA_EA_EACS:

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

  847. 

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

  849.             c->status[i].step_index = av_clip(bytestream_get_le32(&src), 0, 88);

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

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

  852. 

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

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

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

  856.         }

  857.         break;

  858.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

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

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

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

  862.         }

  863.         break;

  864.     case CODEC_ID_ADPCM_EA:

  865.     {

  866.         int32_t previous_left_sample, previous_right_sample;

  867.         int32_t current_left_sample, current_right_sample;

  868.         int32_t next_left_sample, next_right_sample;

  869.         int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  870.         uint8_t shift_left, shift_right;

  871. 

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

  873.            each coding 28 stereo samples. */

  874. 

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

  876. 

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

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

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

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

  881. 

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

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

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

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

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

  887.             src++;

  888. 

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

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

  891.             src++;

  892. 

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

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

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

  896.                 src++;

  897. 

  898.                 next_left_sample = (next_left_sample +

  899.                     (current_left_sample * coeff1l) +

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

  901.                 next_right_sample = (next_right_sample +

  902.                     (current_right_sample * coeff1r) +

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

  904. 

  905.                 previous_left_sample = current_left_sample;

  906.                 current_left_sample = av_clip_int16(next_left_sample);

  907.                 previous_right_sample = current_right_sample;

  908.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  911.             }

  912.         }

  913. 

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

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

  916. 

  917.         break;

  918.     }

  919.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

  920.     {

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

  922. 

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

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

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

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

  927.             src++;

  928.         }

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

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

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

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

  933.                     sample = (sample +

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

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

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

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

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

  939.                 }

  940.             }

  941.             src+=avctx->channels;

  942.         }

  943.         /* consume whole packet */

  944.         src = buf + buf_size;

  945.         break;

  946.     }

  947.     case CODEC_ID_ADPCM_EA_R1:

  948.     case CODEC_ID_ADPCM_EA_R2:

  949.     case CODEC_ID_ADPCM_EA_R3: {

  950.         /* channel numbering

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

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

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

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

  955.         int32_t previous_sample, current_sample, next_sample;

  956.         int32_t coeff1, coeff2;

  957.         uint8_t shift;

  958.         unsigned int channel;

  959.         uint16_t *samplesC;

  960.         const uint8_t *srcC;

  961.         const uint8_t *src_end = buf + buf_size;

  962.         int count = 0;

  963. 

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

  965. 

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

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

  968.                                          : bytestream_get_le32(&src))

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

  970. 

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

  972.             srcC  = src + offset;

  973.             samplesC = samples + channel;

  974. 

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

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

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

  978.             } else {

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

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

  981.             }

  982. 

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

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

  985.                     srcC++;

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

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

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

  989. 

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

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

  992.                         samplesC += avctx->channels;

  993.                     }

  994.                 } else {

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

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

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

  998. 

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

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

  1001.                         if (count2 & 1)

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

  1003.                         else

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

  1005. 

  1006.                         next_sample += (current_sample  * coeff1) +

  1007.                                        (previous_sample * coeff2);

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

  1009. 

  1010.                         previous_sample = current_sample;

  1011.                         current_sample  = next_sample;

  1012.                         *samplesC = current_sample;

  1013.                         samplesC += avctx->channels;

  1014.                     }

  1015.                 }

  1016.             }

  1017.             if (!count) {

  1018.                 count = count1;

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

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

  1021.                 count = FFMAX(count, count1);

  1022.             }

  1023. 

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

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

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

  1027.             }

  1028.         }

  1029. 

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

  1031.         src = src_end;

  1032.         break;

  1033.     }

  1034.     case CODEC_ID_ADPCM_EA_XAS:

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

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

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

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

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

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

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

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

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

  1044.             }

  1045. 

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

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

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

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

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

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

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

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

  1054.                     }

  1055.                 }

  1056.             }

  1057.         }

  1058.         break;

  1059.     case CODEC_ID_ADPCM_IMA_AMV:

  1060.     case CODEC_ID_ADPCM_IMA_SMJPEG:

  1061.         if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV) {

  1062.             c->status[0].predictor = sign_extend(bytestream_get_le16(&src), 16);

  1063.             c->status[0].step_index = av_clip(bytestream_get_le16(&src), 0, 88);

  1064.             src += 4;

  1065.         } else {

  1066.             c->status[0].predictor = sign_extend(bytestream_get_be16(&src), 16);

  1067.             c->status[0].step_index = av_clip(bytestream_get_byte(&src), 0, 88);

  1068.             src += 1;

  1069.         }

  1070. 

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

  1072.             char hi, lo;

  1073.             lo = *src & 0x0F;

  1074.             hi = *src >> 4;

  1075. 

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

  1077.                 FFSWAP(char, hi, lo);

  1078. 

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

  1080.                 lo, 3);

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

  1082.                 hi, 3);

  1083.         }

  1084.         break;

  1085.     case CODEC_ID_ADPCM_CT:

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

  1087.             uint8_t v = *src;

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

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

  1090.         }

  1091.         break;

  1092.     case CODEC_ID_ADPCM_SBPRO_4:

  1093.     case CODEC_ID_ADPCM_SBPRO_3:

  1094.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1098.             if (st)

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

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

  1101.             nb_samples--;

  1102.         }

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

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

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

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

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

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

  1109.             }

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

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

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

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

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

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

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

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

  1118.             }

  1119.         } else {

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

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

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

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

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

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

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

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

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

  1129.             }

  1130.         }

  1131.         break;

  1132.     case CODEC_ID_ADPCM_SWF:

  1133.     {

  1134.         GetBitContext gb;

  1135.         const int *table;

  1136.         int k0, signmask, nb_bits, count;

  1137.         int size = buf_size*8;

  1138. 

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

  1140. 

  1141.         //read bits & initial values

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

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

  1144.         table = swf_index_tables[nb_bits-2];

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

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

  1147. 

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

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

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

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

  1152.             }

  1153. 

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

  1155.                 int i;

  1156. 

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

  1158.                     // similar to IMA adpcm

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

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

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

  1162.                     int k = k0;

  1163. 

  1164.                     do {

  1165.                         if (delta & k)

  1166.                             vpdiff += step;

  1167.                         step >>= 1;

  1168.                         k >>= 1;

  1169.                     } while(k);

  1170.                     vpdiff += step;

  1171. 

  1172.                     if (delta & signmask)

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

  1174.                     else

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

  1176. 

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

  1178. 

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

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

  1181. 

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

  1183.                 }

  1184.             }

  1185.         }

  1186.         src += buf_size;

  1187.         break;

  1188.     }

  1189.     case CODEC_ID_ADPCM_YAMAHA:

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

  1191.             uint8_t v = *src;

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

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

  1194.         }

  1195.         break;

  1196.     case CODEC_ID_ADPCM_THP:

  1197.     {

  1198.         int table[2][16];

  1199.         int prev[2][2];

  1200.         int ch;

  1201. 

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

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

  1204. 

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

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

  1207. 

  1208.         /* Initialize the previous sample.  */

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

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

  1211. 

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

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

  1214. 

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

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

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

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

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

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

  1221. 

  1222.                 /* Decode 14 samples.  */

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

  1224.                     int32_t sampledat;

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

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

  1227. 

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

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

  1230.                     *samples = av_clip_int16(sampledat);

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

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

  1233. 

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

  1235.                        is for the other channel.  */

  1236.                     samples += st;

  1237.                 }

  1238.             }

  1239.         }

  1240.         break;

  1241.     }

  1242. 

  1243.     default:

  1244.         return -1;

  1245.     }

  1246. 

  1247.     *got_frame_ptr   = 1;

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

  1249. 

  1250.     return src == buf ? bytestream2_tell(&gb) : src - buf;

  1251. }

  1252. 

  1253. 

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

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

  1256.     .name           = #name_,                               \

  1257.     .type           = AVMEDIA_TYPE_AUDIO,                   \

  1258.     .id             = id_,                                  \

  1259.     .priv_data_size = sizeof(ADPCMDecodeContext),           \

  1260.     .init           = adpcm_decode_init,                    \

  1261.     .decode         = adpcm_decode_frame,                   \

  1262.     .capabilities   = CODEC_CAP_DR1,                        \

  1263.     .long_name      = NULL_IF_CONFIG_SMALL(long_name_),     \

  1264. }

  1265. 

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

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

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

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

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

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

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

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

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

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

  1276. ADPCM_DECODER(CODEC_ID_ADPCM_IMA_APC, adpcm_ima_apc, "ADPCM IMA CRYO APC");

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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