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

1286 lines
46KB
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.     if (step_index < 0) step_index = 0;

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

  155. 

  156.     sign = nibble & 8;

  157.     delta = nibble & 7;

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

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

  160.      * quickly enough */

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

  162.     predictor = c->predictor;

  163.     if (sign) predictor -= diff;

  164.     else predictor += diff;

  165. 

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

  167.     c->step_index = step_index;

  168. 

  169.     return (short)c->predictor;

  170. }

  171. 

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

  173. {

  174.     int step_index;

  175.     int predictor;

  176.     int diff, step;

  177. 

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

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

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

  181. 

  182.     diff = step >> 3;

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

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

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

  186. 

  187.     if (nibble & 8)

  188.         predictor = c->predictor - diff;

  189.     else

  190.         predictor = c->predictor + diff;

  191. 

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

  193.     c->step_index = step_index;

  194. 

  195.     return c->predictor;

  196. }

  197. 

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

  199. {

  200.     int predictor;

  201. 

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

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

  204. 

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

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

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

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

  209. 

  210.     return c->sample1;

  211. }

  212. 

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

  214. {

  215.     int sign, delta, diff;

  216.     int new_step;

  217. 

  218.     sign = nibble & 8;

  219.     delta = nibble & 7;

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

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

  222.      * quickly enough */

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

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

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

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

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

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

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

  230. 

  231.     return (short)c->predictor;

  232. }

  233. 

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

  235. {

  236.     int sign, delta, diff;

  237. 

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

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

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

  241. 

  242.     /* clamp result */

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

  244. 

  245.     /* calculate new step */

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

  247.         c->step++;

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

  249.         c->step--;

  250. 

  251.     return (short) c->predictor;

  252. }

  253. 

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

  255. {

  256.     if(!c->step) {

  257.         c->predictor = 0;

  258.         c->step = 127;

  259.     }

  260. 

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

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

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

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

  265.     return c->predictor;

  266. }

  267. 

  268. static int xa_decode(AVCodecContext *avctx,

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

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

  271. {

  272.     int i, j;

  273.     int shift,filter,f0,f1;

  274.     int s_1,s_2;

  275.     int d,s,t;

  276. 

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

  278. 

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

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

  281.         if (filter > 4) {

  282.             av_log(avctx, AV_LOG_ERROR,

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

  284.                    filter);

  285.             return AVERROR_INVALIDDATA;

  286.         }

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

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

  289. 

  290.         s_1 = left->sample1;

  291.         s_2 = left->sample2;

  292. 

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

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

  295. 

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

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

  298.             s_2 = s_1;

  299.             s_1 = av_clip_int16(s);

  300.             *out = s_1;

  301.             out += inc;

  302.         }

  303. 

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

  305.             left->sample1 = s_1;

  306.             left->sample2 = s_2;

  307.             s_1 = right->sample1;

  308.             s_2 = right->sample2;

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

  310.         }

  311. 

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

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

  314.         if (filter > 4) {

  315.             av_log(avctx, AV_LOG_ERROR,

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

  317.                    filter);

  318.             return AVERROR_INVALIDDATA;

  319.         }

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

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

  322. 

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

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

  325. 

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

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

  328.             s_2 = s_1;

  329.             s_1 = av_clip_int16(s);

  330.             *out = s_1;

  331.             out += inc;

  332.         }

  333. 

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

  335.             right->sample1 = s_1;

  336.             right->sample2 = s_2;

  337.             out -= 1;

  338.         } else {

  339.             left->sample1 = s_1;

  340.             left->sample2 = s_2;

  341.         }

  342.     }

  343. 

  344.     return 0;

  345. }

  346. 

  347. /**

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

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

  350.  * decode with the given buf_size.

  351.  *

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

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

  354.  *                           number of samples in each frame.

  355.  */

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

  357.                           int buf_size, int *coded_samples)

  358. {

  359.     ADPCMDecodeContext *s = avctx->priv_data;

  360.     int nb_samples        = 0;

  361.     int ch                = avctx->channels;

  362.     int has_coded_samples = 0;

  363.     int header_size;

  364. 

  365.     *coded_samples = 0;

  366. 

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

  368.     /* constant, only check buf_size */

  369.     case CODEC_ID_ADPCM_EA_XAS:

  370.         if (buf_size < 76 * ch)

  371.             return 0;

  372.         nb_samples = 128;

  373.         break;

  374.     case CODEC_ID_ADPCM_IMA_QT:

  375.         if (buf_size < 34 * ch)

  376.             return 0;

  377.         nb_samples = 64;

  378.         break;

  379.     /* simple 4-bit adpcm */

  380.     case CODEC_ID_ADPCM_CT:

  381.     case CODEC_ID_ADPCM_IMA_APC:

  382.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

  383.     case CODEC_ID_ADPCM_IMA_WS:

  384.     case CODEC_ID_ADPCM_YAMAHA:

  385.         nb_samples = buf_size * 2 / ch;

  386.         break;

  387.     }

  388.     if (nb_samples)

  389.         return nb_samples;

  390. 

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

  392.     header_size = 0;

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

  394.         case CODEC_ID_ADPCM_4XM:

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

  396.         case CODEC_ID_ADPCM_IMA_AMV:     header_size = 8;           break;

  397.         case CODEC_ID_ADPCM_IMA_SMJPEG:  header_size = 4;           break;

  398.     }

  399.     if (header_size > 0)

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

  401. 

  402.     /* more complex formats */

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

  404.     case CODEC_ID_ADPCM_EA:

  405.         has_coded_samples = 1;

  406.         if (buf_size < 4)

  407.             return 0;

  408.         *coded_samples  = AV_RL32(buf);

  409.         *coded_samples -= *coded_samples % 28;

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

  411.         break;

  412.     case CODEC_ID_ADPCM_IMA_EA_EACS:

  413.         has_coded_samples = 1;

  414.         if (buf_size < 4)

  415.             return 0;

  416.         *coded_samples = AV_RL32(buf);

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

  418.         break;

  419.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

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

  421.         break;

  422.     case CODEC_ID_ADPCM_EA_R1:

  423.     case CODEC_ID_ADPCM_EA_R2:

  424.     case CODEC_ID_ADPCM_EA_R3:

  425.         /* maximum number of samples */

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

  427.         has_coded_samples = 1;

  428.         if (buf_size < 4)

  429.             return 0;

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

  431.         case CODEC_ID_ADPCM_EA_R1:

  432.             header_size    = 4 + 9 * ch;

  433.             *coded_samples = AV_RL32(buf);

  434.             break;

  435.         case CODEC_ID_ADPCM_EA_R2:

  436.             header_size    = 4 + 5 * ch;

  437.             *coded_samples = AV_RL32(buf);

  438.             break;

  439.         case CODEC_ID_ADPCM_EA_R3:

  440.             header_size    = 4 + 5 * ch;

  441.             *coded_samples = AV_RB32(buf);

  442.             break;

  443.         }

  444.         *coded_samples -= *coded_samples % 28;

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

  446.         nb_samples     -= nb_samples % 28;

  447.         break;

  448.     case CODEC_ID_ADPCM_IMA_DK3:

  449.         if (avctx->block_align > 0)

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

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

  452.         break;

  453.     case CODEC_ID_ADPCM_IMA_DK4:

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

  455.         break;

  456.     case CODEC_ID_ADPCM_IMA_WAV:

  457.         if (avctx->block_align > 0)

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

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

  460.         break;

  461.     case CODEC_ID_ADPCM_MS:

  462.         if (avctx->block_align > 0)

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

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

  465.         break;

  466.     case CODEC_ID_ADPCM_SBPRO_2:

  467.     case CODEC_ID_ADPCM_SBPRO_3:

  468.     case CODEC_ID_ADPCM_SBPRO_4:

  469.     {

  470.         int samples_per_byte;

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

  472.         case CODEC_ID_ADPCM_SBPRO_2: samples_per_byte = 4; break;

  473.         case CODEC_ID_ADPCM_SBPRO_3: samples_per_byte = 3; break;

  474.         case CODEC_ID_ADPCM_SBPRO_4: samples_per_byte = 2; break;

  475.         }

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

  477.             nb_samples++;

  478.             buf_size -= ch;

  479.         }

  480.         nb_samples += buf_size * samples_per_byte / ch;

  481.         break;

  482.     }

  483.     case CODEC_ID_ADPCM_SWF:

  484.     {

  485.         int buf_bits       = buf_size * 8 - 2;

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

  487.         int block_hdr_size = 22 * ch;

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

  489.         int nblocks        = buf_bits / block_size;

  490.         int bits_left      = buf_bits - nblocks * block_size;

  491.         nb_samples         = nblocks * 4096;

  492.         if (bits_left >= block_hdr_size)

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

  494.         break;

  495.     }

  496.     case CODEC_ID_ADPCM_THP:

  497.         has_coded_samples = 1;

  498.         if (buf_size < 8)

  499.             return 0;

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

  501.         *coded_samples -= *coded_samples % 14;

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

  503.         break;

  504.     case CODEC_ID_ADPCM_XA:

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

  506.         break;

  507.     }

  508. 

  509.     /* validate coded sample count */

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

  511.         return AVERROR_INVALIDDATA;

  512. 

  513.     return nb_samples;

  514. }

  515. 

  516. /* DK3 ADPCM support macro */

  517. #define DK3_GET_NEXT_NIBBLE() \

  518.     if (decode_top_nibble_next) \

  519.     { \

  520.         nibble = last_byte >> 4; \

  521.         decode_top_nibble_next = 0; \

  522.     } \

  523.     else \

  524.     { \

  525.         if (end_of_packet) \

  526.             break; \

  527.         last_byte = *src++; \

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

  529.             end_of_packet = 1; \

  530.         nibble = last_byte & 0x0F; \

  531.         decode_top_nibble_next = 1; \

  532.     }

  533. 

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

  535.                               int *got_frame_ptr, AVPacket *avpkt)

  536. {

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

  538.     int buf_size = avpkt->size;

  539.     ADPCMDecodeContext *c = avctx->priv_data;

  540.     ADPCMChannelStatus *cs;

  541.     int n, m, channel, i;

  542.     short *samples;

  543.     const uint8_t *src;

  544.     int st; /* stereo */

  545.     int count1, count2;

  546.     int nb_samples, coded_samples, ret;

  547. 

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

  549.     if (nb_samples <= 0) {

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

  551.         return AVERROR_INVALIDDATA;

  552.     }

  553. 

  554.     /* get output buffer */

  555.     c->frame.nb_samples = nb_samples;

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

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

  558.         return ret;

  559.     }

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

  561. 

  562.     /* use coded_samples when applicable */

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

  564.     if (coded_samples) {

  565.         if (coded_samples != nb_samples)

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

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

  568.     }

  569. 

  570.     src = buf;

  571. 

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

  573. 

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

  575.     case CODEC_ID_ADPCM_IMA_QT:

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

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

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

  579.             int16_t predictor;

  580.             int step_index;

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

  582.             /* (pppppp) (piiiiiii) */

  583. 

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

  585.             predictor = AV_RB16(src);

  586.             step_index = predictor & 0x7F;

  587.             predictor &= 0xFF80;

  588. 

  589.             src += 2;

  590. 

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

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

  593.                 if (diff < 0)

  594.                     diff = - diff;

  595.                 if (diff > 0x7f)

  596.                     goto update;

  597.             } else {

  598.             update:

  599.                 cs->step_index = step_index;

  600.                 cs->predictor = predictor;

  601.             }

  602. 

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

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

  605.                 cs->step_index = 88;

  606.             }

  607. 

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

  609. 

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

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

  612.                 samples += avctx->channels;

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

  614.                 samples += avctx->channels;

  615.                 src ++;

  616.             }

  617.         }

  618.         break;

  619.     case CODEC_ID_ADPCM_IMA_WAV:

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

  621.             buf_size = avctx->block_align;

  622. 

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

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

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

  626. 

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

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

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

  630.                 cs->step_index = 88;

  631.             }

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

  633.         }

  634. 

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

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

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

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

  639.                     uint8_t v = *src++;

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

  641.                     samples += avctx->channels;

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

  643.                     samples += avctx->channels;

  644.                 }

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

  646.             }

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

  648.         }

  649.         break;

  650.     case CODEC_ID_ADPCM_4XM:

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

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

  653. 

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

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

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

  657.         }

  658. 

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

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

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

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

  663.                 uint8_t v = *src;

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

  665.                 samples += avctx->channels;

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

  667.                 samples += avctx->channels;

  668.             }

  669.         }

  670.         break;

  671.     case CODEC_ID_ADPCM_MS:

  672.     {

  673.         int block_predictor;

  674. 

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

  676.             buf_size = avctx->block_align;

  677. 

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

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

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

  681.         if (st) {

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

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

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

  685.         }

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

  687.         if (st){

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

  689.         }

  690. 

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

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

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

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

  695. 

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

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

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

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

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

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

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

  703.         }

  704.         break;

  705.     }

  706.     case CODEC_ID_ADPCM_IMA_DK4:

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

  708.             buf_size = avctx->block_align;

  709. 

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

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

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

  713.             cs->step_index = av_clip(*src++, 0, 88);

  714.             src++;

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

  716.         }

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

  718.             uint8_t v = *src;

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

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

  721.         }

  722.         break;

  723.     case CODEC_ID_ADPCM_IMA_DK3:

  724.     {

  725.         unsigned char last_byte = 0;

  726.         unsigned char nibble;

  727.         int decode_top_nibble_next = 0;

  728.         int end_of_packet = 0;

  729.         int diff_channel;

  730. 

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

  732.             buf_size = avctx->block_align;

  733. 

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

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

  736.         c->status[0].step_index = av_clip(src[14], 0, 88);

  737.         c->status[1].step_index = av_clip(src[15], 0, 88);

  738.         /* sign extend the predictors */

  739.         src += 16;

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

  741. 

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

  743.          * the buffer is consumed */

  744.         while (1) {

  745. 

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

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

  748. 

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

  750.             DK3_GET_NEXT_NIBBLE();

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

  752. 

  753.             /* process the diff channel predictor */

  754.             DK3_GET_NEXT_NIBBLE();

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

  756. 

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

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

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

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

  761. 

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

  763.             DK3_GET_NEXT_NIBBLE();

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

  765. 

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

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

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

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

  770.         }

  771.         break;

  772.     }

  773.     case CODEC_ID_ADPCM_IMA_ISS:

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

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

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

  777.             cs->step_index = av_clip(*src++, 0, 88);

  778.             src++;

  779.         }

  780. 

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

  782.             uint8_t v1, v2;

  783.             uint8_t v = *src;

  784.             /* nibbles are swapped for mono */

  785.             if (st) {

  786.                 v1 = v >> 4;

  787.                 v2 = v & 0x0F;

  788.             } else {

  789.                 v2 = v >> 4;

  790.                 v1 = v & 0x0F;

  791.             }

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

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

  794.         }

  795.         break;

  796.     case CODEC_ID_ADPCM_IMA_APC:

  797.         while (src < buf + buf_size) {

  798.             uint8_t v = *src++;

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

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

  801.         }

  802.         break;

  803.     case CODEC_ID_ADPCM_IMA_WS:

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

  805.             const uint8_t *src0;

  806.             int src_stride;

  807.             int16_t *smp = samples + channel;

  808. 

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

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

  811.                 src_stride = 1;

  812.             } else {

  813.                 src0 = src + channel;

  814.                 src_stride = avctx->channels;

  815.             }

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

  817.                 uint8_t v = *src0;

  818.                 src0 += src_stride;

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

  820.                 smp += avctx->channels;

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

  822.                 smp += avctx->channels;

  823.             }

  824.         }

  825.         src = buf + buf_size;

  826.         break;

  827.     case CODEC_ID_ADPCM_XA:

  828.         while (buf_size >= 128) {

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

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

  831.                 return ret;

  832.             src += 128;

  833.             samples += 28 * 8;

  834.             buf_size -= 128;

  835.         }

  836.         break;

  837.     case CODEC_ID_ADPCM_IMA_EA_EACS:

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

  839. 

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

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

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

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

  844. 

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

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

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

  848.         }

  849.         break;

  850.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

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

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

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

  854.         }

  855.         break;

  856.     case CODEC_ID_ADPCM_EA:

  857.     {

  858.         int32_t previous_left_sample, previous_right_sample;

  859.         int32_t current_left_sample, current_right_sample;

  860.         int32_t next_left_sample, next_right_sample;

  861.         int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  862.         uint8_t shift_left, shift_right;

  863. 

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

  865.            each coding 28 stereo samples. */

  866. 

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

  868. 

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

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

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

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

  873. 

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

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

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

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

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

  879.             src++;

  880. 

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

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

  883.             src++;

  884. 

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

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

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

  888.                 src++;

  889. 

  890.                 next_left_sample = (next_left_sample +

  891.                     (current_left_sample * coeff1l) +

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

  893.                 next_right_sample = (next_right_sample +

  894.                     (current_right_sample * coeff1r) +

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

  896. 

  897.                 previous_left_sample = current_left_sample;

  898.                 current_left_sample = av_clip_int16(next_left_sample);

  899.                 previous_right_sample = current_right_sample;

  900.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  903.             }

  904.         }

  905. 

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

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

  908. 

  909.         break;

  910.     }

  911.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

  912.     {

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

  914. 

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

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

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

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

  919.             src++;

  920.         }

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

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

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

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

  925.                     sample = (sample +

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

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

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

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

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

  931.                 }

  932.             }

  933.             src+=avctx->channels;

  934.         }

  935.         /* consume whole packet */

  936.         src = buf + buf_size;

  937.         break;

  938.     }

  939.     case CODEC_ID_ADPCM_EA_R1:

  940.     case CODEC_ID_ADPCM_EA_R2:

  941.     case CODEC_ID_ADPCM_EA_R3: {

  942.         /* channel numbering

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

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

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

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

  947.         int32_t previous_sample, current_sample, next_sample;

  948.         int32_t coeff1, coeff2;

  949.         uint8_t shift;

  950.         unsigned int channel;

  951.         uint16_t *samplesC;

  952.         const uint8_t *srcC;

  953.         const uint8_t *src_end = buf + buf_size;

  954.         int count = 0;

  955. 

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

  957. 

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

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

  960.                                          : bytestream_get_le32(&src))

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

  962. 

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

  964.             srcC  = src + offset;

  965.             samplesC = samples + channel;

  966. 

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

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

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

  970.             } else {

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

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

  973.             }

  974. 

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

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

  977.                     srcC++;

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

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

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

  981. 

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

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

  984.                         samplesC += avctx->channels;

  985.                     }

  986.                 } else {

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

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

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

  990. 

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

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

  993.                         if (count2 & 1)

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

  995.                         else

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

  997. 

  998.                         next_sample += (current_sample  * coeff1) +

  999.                                        (previous_sample * coeff2);

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

  1001. 

  1002.                         previous_sample = current_sample;

  1003.                         current_sample  = next_sample;

  1004.                         *samplesC = current_sample;

  1005.                         samplesC += avctx->channels;

  1006.                     }

  1007.                 }

  1008.             }

  1009.             if (!count) {

  1010.                 count = count1;

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

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

  1013.                 count = FFMAX(count, count1);

  1014.             }

  1015. 

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

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

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

  1019.             }

  1020.         }

  1021. 

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

  1023.         src = src_end;

  1024.         break;

  1025.     }

  1026.     case CODEC_ID_ADPCM_EA_XAS:

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

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

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

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

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

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

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

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

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

  1036.             }

  1037. 

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

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

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

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

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

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

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

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

  1046.                     }

  1047.                 }

  1048.             }

  1049.         }

  1050.         break;

  1051.     case CODEC_ID_ADPCM_IMA_AMV:

  1052.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

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

  1056.             src += 4;

  1057.         } else {

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

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

  1060.             src += 1;

  1061.         }

  1062. 

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

  1064.             char hi, lo;

  1065.             lo = *src & 0x0F;

  1066.             hi = *src >> 4;

  1067. 

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

  1069.                 FFSWAP(char, hi, lo);

  1070. 

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

  1072.                 lo, 3);

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

  1074.                 hi, 3);

  1075.         }

  1076.         break;

  1077.     case CODEC_ID_ADPCM_CT:

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

  1079.             uint8_t v = *src;

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

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

  1082.         }

  1083.         break;

  1084.     case CODEC_ID_ADPCM_SBPRO_4:

  1085.     case CODEC_ID_ADPCM_SBPRO_3:

  1086.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1090.             if (st)

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

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

  1093.             nb_samples--;

  1094.         }

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

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

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

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

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

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

  1101.             }

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

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

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

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

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

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

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

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

  1110.             }

  1111.         } else {

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

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

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

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

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

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

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

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

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

  1121.             }

  1122.         }

  1123.         break;

  1124.     case CODEC_ID_ADPCM_SWF:

  1125.     {

  1126.         GetBitContext gb;

  1127.         const int *table;

  1128.         int k0, signmask, nb_bits, count;

  1129.         int size = buf_size*8;

  1130. 

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

  1132. 

  1133.         //read bits & initial values

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

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

  1136.         table = swf_index_tables[nb_bits-2];

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

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

  1139. 

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

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

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

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

  1144.             }

  1145. 

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

  1147.                 int i;

  1148. 

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

  1150.                     // similar to IMA adpcm

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

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

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

  1154.                     int k = k0;

  1155. 

  1156.                     do {

  1157.                         if (delta & k)

  1158.                             vpdiff += step;

  1159.                         step >>= 1;

  1160.                         k >>= 1;

  1161.                     } while(k);

  1162.                     vpdiff += step;

  1163. 

  1164.                     if (delta & signmask)

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

  1166.                     else

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

  1168. 

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

  1170. 

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

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

  1173. 

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

  1175.                 }

  1176.             }

  1177.         }

  1178.         src += buf_size;

  1179.         break;

  1180.     }

  1181.     case CODEC_ID_ADPCM_YAMAHA:

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

  1183.             uint8_t v = *src;

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

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

  1186.         }

  1187.         break;

  1188.     case CODEC_ID_ADPCM_THP:

  1189.     {

  1190.         int table[2][16];

  1191.         int prev[2][2];

  1192.         int ch;

  1193. 

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

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

  1196. 

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

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

  1199. 

  1200.         /* Initialize the previous sample.  */

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

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

  1203. 

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

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

  1206. 

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

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

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

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

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

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

  1213. 

  1214.                 /* Decode 14 samples.  */

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

  1216.                     int32_t sampledat;

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

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

  1219. 

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

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

  1222.                     *samples = av_clip_int16(sampledat);

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

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

  1225. 

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

  1227.                        is for the other channel.  */

  1228.                     samples += st;

  1229.                 }

  1230.             }

  1231.         }

  1232.         break;

  1233.     }

  1234. 

  1235.     default:

  1236.         return -1;

  1237.     }

  1238. 

  1239.     *got_frame_ptr   = 1;

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

  1241. 

  1242.     return src - buf;

  1243. }

  1244. 

  1245. 

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

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

  1248.     .name           = #name_,                               \

  1249.     .type           = AVMEDIA_TYPE_AUDIO,                   \

  1250.     .id             = id_,                                  \

  1251.     .priv_data_size = sizeof(ADPCMDecodeContext),           \

  1252.     .init           = adpcm_decode_init,                    \

  1253.     .decode         = adpcm_decode_frame,                   \

  1254.     .capabilities   = CODEC_CAP_DR1,                        \

  1255.     .long_name      = NULL_IF_CONFIG_SMALL(long_name_),     \

  1256. }

  1257. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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