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

1091 lines
39KB
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,

  69.     0,    0, -208, -220,

  70.     0,    1,    3,    4,

  71.     7,    8,   10,   11,

  72.     0,   -1,   -3,   -4

  73. };

  74. 

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

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

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

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

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

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

  81. };

  82. 

  83. /* end of tables */

  84. 

  85. typedef struct ADPCMDecodeContext {

  86.     ADPCMChannelStatus status[6];

  87. } ADPCMDecodeContext;

  88. 

  89. static av_cold int adpcm_decode_init(AVCodecContext * avctx)

  90. {

  91.     ADPCMDecodeContext *c = avctx->priv_data;

  92.     unsigned int max_channels = 2;

  93. 

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

  95.     case CODEC_ID_ADPCM_EA_R1:

  96.     case CODEC_ID_ADPCM_EA_R2:

  97.     case CODEC_ID_ADPCM_EA_R3:

  98.     case CODEC_ID_ADPCM_EA_XAS:

  99.         max_channels = 6;

  100.         break;

  101.     }

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

  103.         return -1;

  104.     }

  105. 

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

  107.     case CODEC_ID_ADPCM_CT:

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

  109.         break;

  110.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  113.             return -1;

  114.         }

  115.         break;

  116.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  120.         }

  121.         break;

  122.     default:

  123.         break;

  124.     }

  125.     avctx->sample_fmt = AV_SAMPLE_FMT_S16;

  126.     return 0;

  127. }

  128. 

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

  130. {

  131.     int step_index;

  132.     int predictor;

  133.     int sign, delta, diff, step;

  134. 

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

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

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

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

  139. 

  140.     sign = nibble & 8;

  141.     delta = nibble & 7;

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

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

  144.      * quickly enough */

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

  146.     predictor = c->predictor;

  147.     if (sign) predictor -= diff;

  148.     else predictor += diff;

  149. 

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

  151.     c->step_index = step_index;

  152. 

  153.     return (short)c->predictor;

  154. }

  155. 

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

  157. {

  158.     int step_index;

  159.     int predictor;

  160.     int diff, step;

  161. 

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

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

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

  165. 

  166.     diff = step >> 3;

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

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

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

  170. 

  171.     if (nibble & 8)

  172.         predictor = c->predictor - diff;

  173.     else

  174.         predictor = c->predictor + diff;

  175. 

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

  177.     c->step_index = step_index;

  178. 

  179.     return c->predictor;

  180. }

  181. 

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

  183. {

  184.     int predictor;

  185. 

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

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

  188. 

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

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

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

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

  193. 

  194.     return c->sample1;

  195. }

  196. 

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

  198. {

  199.     int sign, delta, diff;

  200.     int new_step;

  201. 

  202.     sign = nibble & 8;

  203.     delta = nibble & 7;

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

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

  206.      * quickly enough */

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

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

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

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

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

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

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

  214. 

  215.     return (short)c->predictor;

  216. }

  217. 

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

  219. {

  220.     int sign, delta, diff;

  221. 

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

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

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

  225. 

  226.     /* clamp result */

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

  228. 

  229.     /* calculate new step */

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

  231.         c->step++;

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

  233.         c->step--;

  234. 

  235.     return (short) c->predictor;

  236. }

  237. 

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

  239. {

  240.     if(!c->step) {

  241.         c->predictor = 0;

  242.         c->step = 127;

  243.     }

  244. 

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

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

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

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

  249.     return c->predictor;

  250. }

  251. 

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

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

  254. {

  255.     int i, j;

  256.     int shift,filter,f0,f1;

  257.     int s_1,s_2;

  258.     int d,s,t;

  259. 

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

  261. 

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

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

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

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

  266. 

  267.         s_1 = left->sample1;

  268.         s_2 = left->sample2;

  269. 

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

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

  272. 

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

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

  275.             s_2 = s_1;

  276.             s_1 = av_clip_int16(s);

  277.             *out = s_1;

  278.             out += inc;

  279.         }

  280. 

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

  282.             left->sample1 = s_1;

  283.             left->sample2 = s_2;

  284.             s_1 = right->sample1;

  285.             s_2 = right->sample2;

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

  287.         }

  288. 

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

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

  291. 

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

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

  294. 

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

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

  297. 

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

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

  300.             s_2 = s_1;

  301.             s_1 = av_clip_int16(s);

  302.             *out = s_1;

  303.             out += inc;

  304.         }

  305. 

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

  307.             right->sample1 = s_1;

  308.             right->sample2 = s_2;

  309.             out -= 1;

  310.         } else {

  311.             left->sample1 = s_1;

  312.             left->sample2 = s_2;

  313.         }

  314.     }

  315. }

  316. 

  317. 

  318. /* DK3 ADPCM support macro */

  319. #define DK3_GET_NEXT_NIBBLE() \

  320.     if (decode_top_nibble_next) \

  321.     { \

  322.         nibble = last_byte >> 4; \

  323.         decode_top_nibble_next = 0; \

  324.     } \

  325.     else \

  326.     { \

  327.         last_byte = *src++; \

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

  329.         nibble = last_byte & 0x0F; \

  330.         decode_top_nibble_next = 1; \

  331.     }

  332. 

  333. static int adpcm_decode_frame(AVCodecContext *avctx,

  334.                             void *data, int *data_size,

  335.                             AVPacket *avpkt)

  336. {

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

  338.     int buf_size = avpkt->size;

  339.     ADPCMDecodeContext *c = avctx->priv_data;

  340.     ADPCMChannelStatus *cs;

  341.     int n, m, channel, i;

  342.     int block_predictor[2];

  343.     short *samples;

  344.     short *samples_end;

  345.     const uint8_t *src;

  346.     int st; /* stereo */

  347. 

  348.     /* DK3 ADPCM accounting variables */

  349.     unsigned char last_byte = 0;

  350.     unsigned char nibble;

  351.     int decode_top_nibble_next = 0;

  352.     int diff_channel;

  353. 

  354.     /* EA ADPCM state variables */

  355.     uint32_t samples_in_chunk;

  356.     int32_t previous_left_sample, previous_right_sample;

  357.     int32_t current_left_sample, current_right_sample;

  358.     int32_t next_left_sample, next_right_sample;

  359.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  360.     uint8_t shift_left, shift_right;

  361.     int count1, count2;

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

  363. 

  364.     if (!buf_size)

  365.         return 0;

  366. 

  367.     //should protect all 4bit ADPCM variants

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

  369.     //

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

  371.         return -1;

  372. 

  373.     samples = data;

  374.     samples_end= samples + *data_size/2;

  375.     *data_size= 0;

  376.     src = buf;

  377. 

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

  379. 

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

  381.     case CODEC_ID_ADPCM_IMA_QT:

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

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

  384.         if (buf_size / 34 < avctx->channels) {

  385.             av_log(avctx, AV_LOG_ERROR, "packet is too small\n");

  386.             return AVERROR(EINVAL);

  387.         }

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

  389.             int16_t predictor;

  390.             int step_index;

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

  392.             /* (pppppp) (piiiiiii) */

  393. 

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

  395.             predictor = AV_RB16(src);

  396.             step_index = predictor & 0x7F;

  397.             predictor &= 0xFF80;

  398. 

  399.             src += 2;

  400. 

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

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

  403.                 if (diff < 0)

  404.                     diff = - diff;

  405.                 if (diff > 0x7f)

  406.                     goto update;

  407.             } else {

  408.             update:

  409.                 cs->step_index = step_index;

  410.                 cs->predictor = predictor;

  411.             }

  412. 

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

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

  415.                 cs->step_index = 88;

  416.             }

  417. 

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

  419. 

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

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

  422.                 samples += avctx->channels;

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

  424.                 samples += avctx->channels;

  425.                 src ++;

  426.             }

  427.         }

  428.         if (st)

  429.             samples--;

  430.         break;

  431.     case CODEC_ID_ADPCM_IMA_WAV:

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

  433.             buf_size = avctx->block_align;

  434. 

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

  436. 

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

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

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

  440. 

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

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

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

  444.                 cs->step_index = 88;

  445.             }

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

  447.         }

  448. 

  449.         while(src < buf + buf_size){

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

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

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

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

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

  455.                 src++;

  456.             }

  457.             src += 4*st;

  458.         }

  459.         break;

  460.     case CODEC_ID_ADPCM_4XM:

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

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

  463.         if(st){

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

  465.         }

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

  467.         if(st){

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

  469.         }

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

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

  472. 

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

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

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

  476.             if (st)

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

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

  479.             if (st)

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

  481.         }

  482. 

  483.         src += m<<st;

  484. 

  485.         break;

  486.     case CODEC_ID_ADPCM_MS:

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

  488.             buf_size = avctx->block_align;

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

  490.         if (n < 0)

  491.             return -1;

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

  493.         block_predictor[1] = 0;

  494.         if (st)

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

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

  497.         if (st){

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

  499.         }

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

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

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

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

  504. 

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

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

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

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

  509. 

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

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

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

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

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

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

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

  517.             src ++;

  518.         }

  519.         break;

  520.     case CODEC_ID_ADPCM_IMA_DK4:

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

  522.             buf_size = avctx->block_align;

  523. 

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

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

  526.         src++;

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

  528.         if (st) {

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

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

  531.             src++;

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

  533.         }

  534.         while (src < buf + buf_size) {

  535.             uint8_t v = *src++;

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

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

  538.         }

  539.         break;

  540.     case CODEC_ID_ADPCM_IMA_DK3:

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

  542.             buf_size = avctx->block_align;

  543. 

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

  545.             return -1;

  546. 

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

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

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

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

  551.         /* sign extend the predictors */

  552.         src += 16;

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

  554. 

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

  556.          * the buffer is consumed */

  557.         while (1) {

  558. 

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

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

  561. 

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

  563.             DK3_GET_NEXT_NIBBLE();

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

  565. 

  566.             /* process the diff channel predictor */

  567.             DK3_GET_NEXT_NIBBLE();

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

  569. 

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

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

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

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

  574. 

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

  576.             DK3_GET_NEXT_NIBBLE();

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

  578. 

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

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

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

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

  583.         }

  584.         break;

  585.     case CODEC_ID_ADPCM_IMA_ISS:

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

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

  588.         src += 4;

  589.         if(st) {

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

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

  592.             src += 4;

  593.         }

  594. 

  595.         while (src < buf + buf_size) {

  596.             uint8_t v1, v2;

  597.             uint8_t v = *src++;

  598.             /* nibbles are swapped for mono */

  599.             if (st) {

  600.                 v1 = v >> 4;

  601.                 v2 = v & 0x0F;

  602.             } else {

  603.                 v2 = v >> 4;

  604.                 v1 = v & 0x0F;

  605.             }

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

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

  608.         }

  609.         break;

  610.     case CODEC_ID_ADPCM_IMA_WS:

  611.         while (src < buf + buf_size) {

  612.             uint8_t v = *src++;

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

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

  615.         }

  616.         break;

  617.     case CODEC_ID_ADPCM_XA:

  618.         while (buf_size >= 128) {

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

  620.                 avctx->channels);

  621.             src += 128;

  622.             samples += 28 * 8;

  623.             buf_size -= 128;

  624.         }

  625.         break;

  626.     case CODEC_ID_ADPCM_IMA_EA_EACS:

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

  628. 

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

  630.             src += buf_size - 4;

  631.             break;

  632.         }

  633. 

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

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

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

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

  638. 

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

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

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

  642.         }

  643.         break;

  644.     case CODEC_ID_ADPCM_IMA_EA_SEAD:

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

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

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

  648.         }

  649.         break;

  650.     case CODEC_ID_ADPCM_EA:

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

  652.            each coding 28 stereo samples. */

  653.         if (buf_size < 12) {

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

  655.             return AVERROR(EINVAL);

  656.         }

  657.         samples_in_chunk = AV_RL32(src);

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

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

  660.             return AVERROR(EINVAL);

  661.         }

  662.         src += 4;

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

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

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

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

  667. 

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

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

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

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

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

  673.             src++;

  674. 

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

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

  677.             src++;

  678. 

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

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

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

  682.                 src++;

  683. 

  684.                 next_left_sample = (next_left_sample +

  685.                     (current_left_sample * coeff1l) +

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

  687.                 next_right_sample = (next_right_sample +

  688.                     (current_right_sample * coeff1r) +

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

  690. 

  691.                 previous_left_sample = current_left_sample;

  692.                 current_left_sample = av_clip_int16(next_left_sample);

  693.                 previous_right_sample = current_right_sample;

  694.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  697.             }

  698.         }

  699. 

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

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

  702. 

  703.         break;

  704.     case CODEC_ID_ADPCM_EA_MAXIS_XA:

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

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

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

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

  709.             src++;

  710.         }

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

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

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

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

  715.                     sample = (sample +

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

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

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

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

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

  721.                 }

  722.             }

  723.             src+=avctx->channels;

  724.         }

  725.         break;

  726.     case CODEC_ID_ADPCM_EA_R1:

  727.     case CODEC_ID_ADPCM_EA_R2:

  728.     case CODEC_ID_ADPCM_EA_R3: {

  729.         /* channel numbering

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

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

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

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

  734.         int32_t previous_sample, current_sample, next_sample;

  735.         int32_t coeff1, coeff2;

  736.         uint8_t shift;

  737.         unsigned int channel;

  738.         uint16_t *samplesC;

  739.         const uint8_t *srcC;

  740.         const uint8_t *src_end = buf + buf_size;

  741. 

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

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

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

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

  746.             src += buf_size - 4;

  747.             break;

  748.         }

  749. 

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

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

  752.                                          : bytestream_get_le32(&src))

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

  754. 

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

  756.             srcC  = src + offset;

  757.             samplesC = samples + channel;

  758. 

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

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

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

  762.             } else {

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

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

  765.             }

  766. 

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

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

  769.                     srcC++;

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

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

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

  773. 

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

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

  776.                         samplesC += avctx->channels;

  777.                     }

  778.                 } else {

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

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

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

  782. 

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

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

  785.                         if (count2 & 1)

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

  787.                         else

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

  789. 

  790.                         next_sample += (current_sample  * coeff1) +

  791.                                        (previous_sample * coeff2);

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

  793. 

  794.                         previous_sample = current_sample;

  795.                         current_sample  = next_sample;

  796.                         *samplesC = current_sample;

  797.                         samplesC += avctx->channels;

  798.                     }

  799.                 }

  800.             }

  801. 

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

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

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

  805.             }

  806.         }

  807. 

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

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

  810.         break;

  811.     }

  812.     case CODEC_ID_ADPCM_EA_XAS:

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

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

  815.             src += buf_size;

  816.             break;

  817.         }

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

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

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

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

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

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

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

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

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

  827.             }

  828. 

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

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

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

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

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

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

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

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

  837.                     }

  838.                 }

  839.             }

  840.         }

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

  842.         break;

  843.     case CODEC_ID_ADPCM_IMA_AMV:

  844.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  847. 

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

  849.             src+=4;

  850. 

  851.         while (src < buf + buf_size) {

  852.             char hi, lo;

  853.             lo = *src & 0x0F;

  854.             hi = *src >> 4;

  855. 

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

  857.                 FFSWAP(char, hi, lo);

  858. 

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

  860.                 lo, 3);

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

  862.                 hi, 3);

  863.             src++;

  864.         }

  865.         break;

  866.     case CODEC_ID_ADPCM_CT:

  867.         while (src < buf + buf_size) {

  868.             uint8_t v = *src++;

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

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

  871.         }

  872.         break;

  873.     case CODEC_ID_ADPCM_SBPRO_4:

  874.     case CODEC_ID_ADPCM_SBPRO_3:

  875.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  879.             if (st)

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

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

  882.         }

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

  884.             while (src < buf + buf_size) {

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

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

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

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

  889.                 src++;

  890.             }

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

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

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

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

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

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

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

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

  899.                 src++;

  900.             }

  901.         } else {

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

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

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

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

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

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

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

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

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

  911.                 src++;

  912.             }

  913.         }

  914.         break;

  915.     case CODEC_ID_ADPCM_SWF:

  916.     {

  917.         GetBitContext gb;

  918.         const int *table;

  919.         int k0, signmask, nb_bits, count;

  920.         int size = buf_size*8;

  921. 

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

  923. 

  924.         //read bits & initial values

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

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

  927.         table = swf_index_tables[nb_bits-2];

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

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

  930. 

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

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

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

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

  935.             }

  936. 

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

  938.                 int i;

  939. 

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

  941.                     // similar to IMA adpcm

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

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

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

  945.                     int k = k0;

  946. 

  947.                     do {

  948.                         if (delta & k)

  949.                             vpdiff += step;

  950.                         step >>= 1;

  951.                         k >>= 1;

  952.                     } while(k);

  953.                     vpdiff += step;

  954. 

  955.                     if (delta & signmask)

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

  957.                     else

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

  959. 

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

  961. 

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

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

  964. 

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

  966.                     if (samples >= samples_end) {

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

  968.                         return -1;

  969.                     }

  970.                 }

  971.             }

  972.         }

  973.         src += buf_size;

  974.         break;

  975.     }

  976.     case CODEC_ID_ADPCM_YAMAHA:

  977.         while (src < buf + buf_size) {

  978.             uint8_t v = *src++;

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

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

  981.         }

  982.         break;

  983.     case CODEC_ID_ADPCM_THP:

  984.     {

  985.         int table[2][16];

  986.         unsigned int samplecnt;

  987.         int prev[2][2];

  988.         int ch;

  989. 

  990.         if (buf_size < 80) {

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

  992.             return -1;

  993.         }

  994. 

  995.         src+=4;

  996.         samplecnt = bytestream_get_be32(&src);

  997. 

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

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

  1000. 

  1001.         /* Initialize the previous sample.  */

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

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

  1004. 

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

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

  1007.             return -1;

  1008.         }

  1009. 

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

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

  1012. 

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

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

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

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

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

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

  1019. 

  1020.                 /* Decode 14 samples.  */

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

  1022.                     int32_t sampledat;

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

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

  1025. 

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

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

  1028.                     *samples = av_clip_int16(sampledat);

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

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

  1031. 

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

  1033.                        is for the other channel.  */

  1034.                     samples += st;

  1035.                 }

  1036.             }

  1037.         }

  1038. 

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

  1040.            increased exactly one time too often.  */

  1041.         samples -= st;

  1042.         break;

  1043.     }

  1044. 

  1045.     default:

  1046.         return -1;

  1047.     }

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

  1049.     return src - buf;

  1050. }

  1051. 

  1052. 

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

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

  1055.     .name           = #name_,                               \

  1056.     .type           = AVMEDIA_TYPE_AUDIO,                   \

  1057.     .id             = id_,                                  \

  1058.     .priv_data_size = sizeof(ADPCMDecodeContext),           \

  1059.     .init           = adpcm_decode_init,                    \

  1060.     .decode         = adpcm_decode_frame,                   \

  1061.     .long_name      = NULL_IF_CONFIG_SMALL(long_name_),     \

  1062. }

  1063. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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