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

1096 lines
40KB
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://www.pcisys.net/~melanson/codecs/simpleaudio.html

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

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

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

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

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

  51.  *

  52.  * CD-ROM XA:

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

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

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

  56.  */

  57. 

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

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

  60.    {   0,   0 },

  61.    {  60,   0 },

  62.    { 115, -52 },

  63.    {  98, -55 },

  64.    { 122, -60 }

  65. };

  66. 

  67. static const int ea_adpcm_table[] = {

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

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

  70. };

  71. 

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

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

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

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

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

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

  78. };

  79. 

  80. /* end of tables */

  81. 

  82. typedef struct ADPCMDecodeContext {

  83.     ADPCMChannelStatus status[6];

  84. } ADPCMDecodeContext;

  85. 

  86. static av_cold int adpcm_decode_init(AVCodecContext * avctx)

  87. {

  88.     ADPCMDecodeContext *c = avctx->priv_data;

  89.     unsigned int max_channels = 2;

  90. 

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

  92.     case CODEC_ID_ADPCM_EA_R1:

  93.     case CODEC_ID_ADPCM_EA_R2:

  94.     case CODEC_ID_ADPCM_EA_R3:

  95.         max_channels = 6;

  96.         break;

  97.     }

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

  99.         return -1;

  100.     }

  101. 

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

  103.     case CODEC_ID_ADPCM_CT:

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

  105.         break;

  106.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  109.             return -1;

  110.         }

  111.         break;

  112.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  116.         }

  117.         break;

  118.     default:

  119.         break;

  120.     }

  121.     avctx->sample_fmt = AV_SAMPLE_FMT_S16;

  122.     return 0;

  123. }

  124. 

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

  126. {

  127.     int step_index;

  128.     int predictor;

  129.     int sign, delta, diff, step;

  130. 

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

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

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

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

  135. 

  136.     sign = nibble & 8;

  137.     delta = nibble & 7;

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

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

  140.      * quickly enough */

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

  142.     predictor = c->predictor;

  143.     if (sign) predictor -= diff;

  144.     else predictor += diff;

  145. 

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

  147.     c->step_index = step_index;

  148. 

  149.     return (short)c->predictor;

  150. }

  151. 

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

  153. {

  154.     int predictor;

  155. 

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

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

  158. 

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

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

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

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

  163. 

  164.     return c->sample1;

  165. }

  166. 

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

  168. {

  169.     int sign, delta, diff;

  170.     int new_step;

  171. 

  172.     sign = nibble & 8;

  173.     delta = nibble & 7;

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

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

  176.      * quickly enough */

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

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

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

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

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

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

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

  184. 

  185.     return (short)c->predictor;

  186. }

  187. 

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

  189. {

  190.     int sign, delta, diff;

  191. 

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

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

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

  195. 

  196.     /* clamp result */

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

  198. 

  199.     /* calculate new step */

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

  201.         c->step++;

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

  203.         c->step--;

  204. 

  205.     return (short) c->predictor;

  206. }

  207. 

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

  209. {

  210.     if(!c->step) {

  211.         c->predictor = 0;

  212.         c->step = 127;

  213.     }

  214. 

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

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

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

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

  219.     return c->predictor;

  220. }

  221. 

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

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

  224. {

  225.     int i, j;

  226.     int shift,filter,f0,f1;

  227.     int s_1,s_2;

  228.     int d,s,t;

  229. 

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

  231. 

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

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

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

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

  236. 

  237.         s_1 = left->sample1;

  238.         s_2 = left->sample2;

  239. 

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

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

  242. 

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

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

  245.             s_2 = s_1;

  246.             s_1 = av_clip_int16(s);

  247.             *out = s_1;

  248.             out += inc;

  249.         }

  250. 

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

  252.             left->sample1 = s_1;

  253.             left->sample2 = s_2;

  254.             s_1 = right->sample1;

  255.             s_2 = right->sample2;

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

  257.         }

  258. 

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

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

  261. 

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

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

  264. 

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

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

  267. 

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

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

  270.             s_2 = s_1;

  271.             s_1 = av_clip_int16(s);

  272.             *out = s_1;

  273.             out += inc;

  274.         }

  275. 

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

  277.             right->sample1 = s_1;

  278.             right->sample2 = s_2;

  279.             out -= 1;

  280.         } else {

  281.             left->sample1 = s_1;

  282.             left->sample2 = s_2;

  283.         }

  284.     }

  285. }

  286. 

  287. 

  288. /* DK3 ADPCM support macro */

  289. #define DK3_GET_NEXT_NIBBLE() \

  290.     if (decode_top_nibble_next) \

  291.     { \

  292.         nibble = last_byte >> 4; \

  293.         decode_top_nibble_next = 0; \

  294.     } \

  295.     else \

  296.     { \

  297.         last_byte = *src++; \

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

  299.         nibble = last_byte & 0x0F; \

  300.         decode_top_nibble_next = 1; \

  301.     }

  302. 

  303. static int adpcm_decode_frame(AVCodecContext *avctx,

  304.                             void *data, int *data_size,

  305.                             AVPacket *avpkt)

  306. {

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

  308.     int buf_size = avpkt->size;

  309.     ADPCMDecodeContext *c = avctx->priv_data;

  310.     ADPCMChannelStatus *cs;

  311.     int n, m, channel, i;

  312.     int block_predictor[2];

  313.     short *samples;

  314.     short *samples_end;

  315.     const uint8_t *src;

  316.     int st; /* stereo */

  317. 

  318.     /* DK3 ADPCM accounting variables */

  319.     unsigned char last_byte = 0;

  320.     unsigned char nibble;

  321.     int decode_top_nibble_next = 0;

  322.     int diff_channel;

  323. 

  324.     /* EA ADPCM state variables */

  325.     uint32_t samples_in_chunk;

  326.     int32_t previous_left_sample, previous_right_sample;

  327.     int32_t current_left_sample, current_right_sample;

  328.     int32_t next_left_sample, next_right_sample;

  329.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  330.     uint8_t shift_left, shift_right;

  331.     int count1, count2;

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

  333. 

  334.     if (!buf_size)

  335.         return 0;

  336. 

  337.     //should protect all 4bit ADPCM variants

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

  339.     //

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

  341.         return -1;

  342. 

  343.     samples = data;

  344.     samples_end= samples + *data_size/2;

  345.     *data_size= 0;

  346.     src = buf;

  347. 

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

  349. 

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

  351.     case CODEC_ID_ADPCM_IMA_QT:

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

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

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

  355.             /* (pppppp) (piiiiiii) */

  356. 

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

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

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

  360.             cs->predictor &= 0xFF80;

  361. 

  362.             /* sign extension */

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

  364.                 cs->predictor -= 0x10000;

  365. 

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

  367. 

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

  369. 

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

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

  372.                 cs->step_index = 88;

  373.             }

  374. 

  375.             cs->step = ff_adpcm_step_table[cs->step_index];

  376. 

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

  378. 

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

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

  381.                 samples += avctx->channels;

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

  383.                 samples += avctx->channels;

  384.                 src ++;

  385.             }

  386.         }

  387.         if (st)

  388.             samples--;

  389.         break;

  390.     case CODEC_ID_ADPCM_IMA_WAV:

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

  392.             buf_size = avctx->block_align;

  393. 

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

  395. 

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

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

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

  399. 

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

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

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

  403.                 cs->step_index = 88;

  404.             }

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

  406.         }

  407. 

  408.         while(src < buf + buf_size){

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

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

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

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

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

  414.                 src++;

  415.             }

  416.             src += 4*st;

  417.         }

  418.         break;

  419.     case CODEC_ID_ADPCM_4XM:

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

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

  422.         if(st){

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

  424.         }

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

  426.         if(st){

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

  428.         }

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

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

  431. 

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

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

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

  435.             if (st)

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

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

  438.             if (st)

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

  440.         }

  441. 

  442.         src += m<<st;

  443. 

  444.         break;

  445.     case CODEC_ID_ADPCM_MS:

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

  447.             buf_size = avctx->block_align;

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

  449.         if (n < 0)

  450.             return -1;

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

  452.         block_predictor[1] = 0;

  453.         if (st)

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

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

  456.         if (st){

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

  458.         }

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

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

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

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

  463. 

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

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

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

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

  468. 

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

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

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

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

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

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

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

  476.             src ++;

  477.         }

  478.         break;

  479.     case CODEC_ID_ADPCM_IMA_DK4:

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

  481.             buf_size = avctx->block_align;

  482. 

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

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

  485.         src++;

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

  487.         if (st) {

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

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

  490.             src++;

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

  492.         }

  493.         while (src < buf + buf_size) {

  494. 

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

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

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

  498. 

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

  500.              * stereo, or another mono sample */

  501.             if (st)

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

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

  504.             else

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

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

  507. 

  508.             src++;

  509.         }

  510.         break;

  511.     case CODEC_ID_ADPCM_IMA_DK3:

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

  513.             buf_size = avctx->block_align;

  514. 

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

  516.             return -1;

  517. 

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

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

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

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

  522.         /* sign extend the predictors */

  523.         src += 16;

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

  525. 

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

  527.          * the buffer is consumed */

  528.         while (1) {

  529. 

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

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

  532. 

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

  534.             DK3_GET_NEXT_NIBBLE();

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

  536. 

  537.             /* process the diff channel predictor */

  538.             DK3_GET_NEXT_NIBBLE();

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

  540. 

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

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

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

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

  545. 

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

  547.             DK3_GET_NEXT_NIBBLE();

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

  549. 

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

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

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

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

  554.         }

  555.         break;

  556.     case CODEC_ID_ADPCM_IMA_ISS:

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

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

  559.         src += 4;

  560.         if(st) {

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

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

  563.             src += 4;

  564.         }

  565. 

  566.         while (src < buf + buf_size) {

  567. 

  568.             if (st) {

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

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

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

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

  573.             } else {

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

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

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

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

  578.             }

  579. 

  580.             src++;

  581.         }

  582.         break;

  583.     case CODEC_ID_ADPCM_IMA_WS:

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

  585.         while (src < buf + buf_size) {

  586. 

  587.             if (st) {

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

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

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

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

  592.             } else {

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

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

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

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

  597.             }

  598. 

  599.             src++;

  600.         }

  601.         break;

  602.     case CODEC_ID_ADPCM_XA:

  603.         while (buf_size >= 128) {

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

  605.                 avctx->channels);

  606.             src += 128;

  607.             samples += 28 * 8;

  608.             buf_size -= 128;

  609.         }

  610.         break;

  611.     case CODEC_ID_ADPCM_IMA_EA_EACS:

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

  613. 

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

  615.             src += buf_size - 4;

  616.             break;

  617.         }

  618. 

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

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

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

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

  623. 

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

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

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

  627.         }

  628.         break;

  629.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

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

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

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

  633.         }

  634.         break;

  635.     case CODEC_ID_ADPCM_EA:

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

  637.            each coding 28 stereo samples. */

  638.         if (buf_size < 12) {

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

  640.             return AVERROR(EINVAL);

  641.         }

  642.         samples_in_chunk = AV_RL32(src);

  643.         if (samples_in_chunk / 28 > (buf_size - 12) / 30) {

  644.             av_log(avctx, AV_LOG_ERROR, "invalid frame\n");

  645.             return AVERROR(EINVAL);

  646.         }

  647.         src += 4;

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

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

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

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

  652. 

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

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

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

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

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

  658.             src++;

  659. 

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

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

  662.             src++;

  663. 

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

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

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

  667.                 src++;

  668. 

  669.                 next_left_sample = (next_left_sample +

  670.                     (current_left_sample * coeff1l) +

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

  672.                 next_right_sample = (next_right_sample +

  673.                     (current_right_sample * coeff1r) +

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

  675. 

  676.                 previous_left_sample = current_left_sample;

  677.                 current_left_sample = av_clip_int16(next_left_sample);

  678.                 previous_right_sample = current_right_sample;

  679.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  682.             }

  683.         }

  684. 

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

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

  687. 

  688.         break;

  689.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

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

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

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

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

  694.             src++;

  695.         }

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

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

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

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

  700.                     sample = (sample +

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

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

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

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

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

  706.                 }

  707.             }

  708.             src+=avctx->channels;

  709.         }

  710.         break;

  711.     case CODEC_ID_ADPCM_EA_R1:

  712.     case CODEC_ID_ADPCM_EA_R2:

  713.     case CODEC_ID_ADPCM_EA_R3: {

  714.         /* channel numbering

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

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

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

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

  719.         int32_t previous_sample, current_sample, next_sample;

  720.         int32_t coeff1, coeff2;

  721.         uint8_t shift;

  722.         unsigned int channel;

  723.         uint16_t *samplesC;

  724.         const uint8_t *srcC;

  725.         const uint8_t *src_end = buf + buf_size;

  726. 

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

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

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

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

  731.             src += buf_size - 4;

  732.             break;

  733.         }

  734. 

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

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

  737.                                          : bytestream_get_le32(&src))

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

  739. 

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

  741.             srcC  = src + offset;

  742.             samplesC = samples + channel;

  743. 

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

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

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

  747.             } else {

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

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

  750.             }

  751. 

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

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

  754.                     srcC++;

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

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

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

  758. 

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

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

  761.                         samplesC += avctx->channels;

  762.                     }

  763.                 } else {

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

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

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

  767. 

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

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

  770.                         if (count2 & 1)

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

  772.                         else

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

  774. 

  775.                         next_sample += (current_sample  * coeff1) +

  776.                                        (previous_sample * coeff2);

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

  778. 

  779.                         previous_sample = current_sample;

  780.                         current_sample  = next_sample;

  781.                         *samplesC = current_sample;

  782.                         samplesC += avctx->channels;

  783.                     }

  784.                 }

  785.             }

  786. 

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

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

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

  790.             }

  791.         }

  792. 

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

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

  795.         break;

  796.     }

  797.     case CODEC_ID_ADPCM_EA_XAS:

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

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

  800.             src += buf_size;

  801.             break;

  802.         }

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

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

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

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

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

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

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

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

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

  812.             }

  813. 

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

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

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

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

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

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

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

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

  822.                     }

  823.                 }

  824.             }

  825.         }

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

  827.         break;

  828.     case CODEC_ID_ADPCM_IMA_AMV:

  829.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  832. 

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

  834.             src+=4;

  835. 

  836.         while (src < buf + buf_size) {

  837.             char hi, lo;

  838.             lo = *src & 0x0F;

  839.             hi = *src >> 4;

  840. 

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

  842.                 FFSWAP(char, hi, lo);

  843. 

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

  845.                 lo, 3);

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

  847.                 hi, 3);

  848.             src++;

  849.         }

  850.         break;

  851.     case CODEC_ID_ADPCM_CT:

  852.         while (src < buf + buf_size) {

  853.             if (st) {

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

  855.                     src[0] >> 4);

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

  857.                     src[0] & 0x0F);

  858.             } else {

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

  860.                     src[0] >> 4);

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

  862.                     src[0] & 0x0F);

  863.             }

  864.             src++;

  865.         }

  866.         break;

  867.     case CODEC_ID_ADPCM_SBPRO_4:

  868.     case CODEC_ID_ADPCM_SBPRO_3:

  869.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  873.             if (st)

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

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

  876.         }

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

  878.             while (src < buf + buf_size) {

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

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

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

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

  883.                 src++;

  884.             }

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

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

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

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

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

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

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

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

  893.                 src++;

  894.             }

  895.         } else {

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

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

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

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

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

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

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

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

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

  905.                 src++;

  906.             }

  907.         }

  908.         break;

  909.     case CODEC_ID_ADPCM_SWF:

  910.     {

  911.         GetBitContext gb;

  912.         const int *table;

  913.         int k0, signmask, nb_bits, count;

  914.         int size = buf_size*8;

  915. 

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

  917. 

  918.         //read bits & initial values

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

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

  921.         table = swf_index_tables[nb_bits-2];

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

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

  924. 

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

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

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

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

  929.             }

  930. 

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

  932.                 int i;

  933. 

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

  935.                     // similar to IMA adpcm

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

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

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

  939.                     int k = k0;

  940. 

  941.                     do {

  942.                         if (delta & k)

  943.                             vpdiff += step;

  944.                         step >>= 1;

  945.                         k >>= 1;

  946.                     } while(k);

  947.                     vpdiff += step;

  948. 

  949.                     if (delta & signmask)

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

  951.                     else

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

  953. 

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

  955. 

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

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

  958. 

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

  960.                     if (samples >= samples_end) {

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

  962.                         return -1;

  963.                     }

  964.                 }

  965.             }

  966.         }

  967.         src += buf_size;

  968.         break;

  969.     }

  970.     case CODEC_ID_ADPCM_YAMAHA:

  971.         while (src < buf + buf_size) {

  972.             if (st) {

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

  974.                         src[0] & 0x0F);

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

  976.                         src[0] >> 4  );

  977.             } else {

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

  979.                         src[0] & 0x0F);

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

  981.                         src[0] >> 4  );

  982.             }

  983.             src++;

  984.         }

  985.         break;

  986.     case CODEC_ID_ADPCM_THP:

  987.     {

  988.         int table[2][16];

  989.         unsigned int samplecnt;

  990.         int prev[2][2];

  991.         int ch;

  992. 

  993.         if (buf_size < 80) {

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

  995.             return -1;

  996.         }

  997. 

  998.         src+=4;

  999.         samplecnt = bytestream_get_be32(&src);

  1000. 

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

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

  1003. 

  1004.         /* Initialize the previous sample.  */

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

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

  1007. 

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

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

  1010.             return -1;

  1011.         }

  1012. 

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

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

  1015. 

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

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

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

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

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

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

  1022. 

  1023.                 /* Decode 14 samples.  */

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

  1025.                     int32_t sampledat;

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

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

  1028. 

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

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

  1031.                     *samples = av_clip_int16(sampledat);

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

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

  1034. 

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

  1036.                        is for the other channel.  */

  1037.                     samples += st;

  1038.                 }

  1039.             }

  1040.         }

  1041. 

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

  1043.            increased exactly one time too often.  */

  1044.         samples -= st;

  1045.         break;

  1046.     }

  1047. 

  1048.     default:

  1049.         return -1;

  1050.     }

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

  1052.     return src - buf;

  1053. }

  1054. 

  1055. 

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

  1057. AVCodec ff_ ## name ## _decoder = {             \

  1058.     #name,                                      \

  1059.     AVMEDIA_TYPE_AUDIO,                         \

  1060.     id,                                         \

  1061.     sizeof(ADPCMDecodeContext),                 \

  1062.     adpcm_decode_init,                          \

  1063.     NULL,                                       \

  1064.     NULL,                                       \

  1065.     adpcm_decode_frame,                         \

  1066.     .long_name = NULL_IF_CONFIG_SMALL(long_name_), \

  1067. }

  1068. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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