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

1463 lines
51KB
Raw Blame History 

  1. /*

  2.  * ADPCM codecs

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

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

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

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

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

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

  11.  *

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

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

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

  15.  * Lesser General Public License for more details.

  16.  *

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

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

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

  20.  */

  21. #include "avcodec.h"

  22. #include "bitstream.h"

  23. #include "bytestream.h"

  24. 

  25. /**

  26.  * @file adpcm.c

  27.  * ADPCM codecs.

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

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

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

  31.  * CD-ROM XA ADPCM codec by BERO

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

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

  34.  *

  35.  * Features and limitations:

  36.  *

  37.  * Reference documents:

  38.  * http://www.pcisys.net/~melanson/codecs/simpleaudio.html

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

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

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

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

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

  44.  *

  45.  * CD-ROM XA:

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

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

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

  49.  */

  50. 

  51. #define BLKSIZE 1024

  52. 

  53. /* step_table[] and index_table[] are from the ADPCM reference source */

  54. /* This is the index table: */

  55. static const int index_table[16] = {

  56.     -1, -1, -1, -1, 2, 4, 6, 8,

  57.     -1, -1, -1, -1, 2, 4, 6, 8,

  58. };

  59. 

  60. /**

  61.  * This is the step table. Note that many programs use slight deviations from

  62.  * this table, but such deviations are negligible:

  63.  */

  64. static const int step_table[89] = {

  65.     7, 8, 9, 10, 11, 12, 13, 14, 16, 17,

  66.     19, 21, 23, 25, 28, 31, 34, 37, 41, 45,

  67.     50, 55, 60, 66, 73, 80, 88, 97, 107, 118,

  68.     130, 143, 157, 173, 190, 209, 230, 253, 279, 307,

  69.     337, 371, 408, 449, 494, 544, 598, 658, 724, 796,

  70.     876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,

  71.     2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,

  72.     5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,

  73.     15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767

  74. };

  75. 

  76. /* These are for MS-ADPCM */

  77. /* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */

  78. static const int AdaptationTable[] = {

  79.         230, 230, 230, 230, 307, 409, 512, 614,

  80.         768, 614, 512, 409, 307, 230, 230, 230

  81. };

  82. 

  83. static const int AdaptCoeff1[] = {

  84.         256, 512, 0, 192, 240, 460, 392

  85. };

  86. 

  87. static const int AdaptCoeff2[] = {

  88.         0, -256, 0, 64, 0, -208, -232

  89. };

  90. 

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

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

  93.    {   0,   0 },

  94.    {  60,   0 },

  95.    { 115, -52 },

  96.    {  98, -55 },

  97.    { 122, -60 }

  98. };

  99. 

  100. static const int ea_adpcm_table[] = {

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

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

  103. };

  104. 

  105. static const int ct_adpcm_table[8] = {

  106.     0x00E6, 0x00E6, 0x00E6, 0x00E6,

  107.     0x0133, 0x0199, 0x0200, 0x0266

  108. };

  109. 

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

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

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

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

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

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

  116. };

  117. 

  118. static const int yamaha_indexscale[] = {

  119.     230, 230, 230, 230, 307, 409, 512, 614,

  120.     230, 230, 230, 230, 307, 409, 512, 614

  121. };

  122. 

  123. static const int yamaha_difflookup[] = {

  124.     1, 3, 5, 7, 9, 11, 13, 15,

  125.     -1, -3, -5, -7, -9, -11, -13, -15

  126. };

  127. 

  128. /* end of tables */

  129. 

  130. typedef struct ADPCMChannelStatus {

  131.     int predictor;

  132.     short int step_index;

  133.     int step;

  134.     /* for encoding */

  135.     int prev_sample;

  136. 

  137.     /* MS version */

  138.     short sample1;

  139.     short sample2;

  140.     int coeff1;

  141.     int coeff2;

  142.     int idelta;

  143. } ADPCMChannelStatus;

  144. 

  145. typedef struct ADPCMContext {

  146.     int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */

  147.     ADPCMChannelStatus status[2];

  148. } ADPCMContext;

  149. 

  150. /* XXX: implement encoding */

  151. 

  152. #ifdef CONFIG_ENCODERS

  153. static int adpcm_encode_init(AVCodecContext *avctx)

  154. {

  155.     if (avctx->channels > 2)

  156.         return -1; /* only stereo or mono =) */

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

  158.     case CODEC_ID_ADPCM_IMA_QT:

  159.         av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");

  160.         avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */

  161.         return -1;

  162.         break;

  163.     case CODEC_ID_ADPCM_IMA_WAV:

  164.         avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */

  165.                                                              /* and we have 4 bytes per channel overhead */

  166.         avctx->block_align = BLKSIZE;

  167.         /* seems frame_size isn't taken into account... have to buffer the samples :-( */

  168.         break;

  169.     case CODEC_ID_ADPCM_MS:

  170.         avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */

  171.                                                              /* and we have 7 bytes per channel overhead */

  172.         avctx->block_align = BLKSIZE;

  173.         break;

  174.     case CODEC_ID_ADPCM_YAMAHA:

  175.         avctx->frame_size = BLKSIZE * avctx->channels;

  176.         avctx->block_align = BLKSIZE;

  177.         break;

  178.     case CODEC_ID_ADPCM_SWF:

  179.         if (avctx->sample_rate != 11025 &&

  180.             avctx->sample_rate != 22050 &&

  181.             avctx->sample_rate != 44100) {

  182.             av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");

  183.             return -1;

  184.         }

  185.         avctx->frame_size = 512 * (avctx->sample_rate / 11025);

  186.         break;

  187.     default:

  188.         return -1;

  189.         break;

  190.     }

  191. 

  192.     avctx->coded_frame= avcodec_alloc_frame();

  193.     avctx->coded_frame->key_frame= 1;

  194. 

  195.     return 0;

  196. }

  197. 

  198. static int adpcm_encode_close(AVCodecContext *avctx)

  199. {

  200.     av_freep(&avctx->coded_frame);

  201. 

  202.     return 0;

  203. }

  204. 

  205. 

  206. static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)

  207. {

  208.     int delta = sample - c->prev_sample;

  209.     int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;

  210.     c->prev_sample += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);

  211.     c->prev_sample = av_clip_int16(c->prev_sample);

  212.     c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);

  213.     return nibble;

  214. }

  215. 

  216. static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)

  217. {

  218.     int predictor, nibble, bias;

  219. 

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

  221. 

  222.     nibble= sample - predictor;

  223.     if(nibble>=0) bias= c->idelta/2;

  224.     else          bias=-c->idelta/2;

  225. 

  226.     nibble= (nibble + bias) / c->idelta;

  227.     nibble= av_clip(nibble, -8, 7)&0x0F;

  228. 

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

  230. 

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

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

  233. 

  234.     c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;

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

  236. 

  237.     return nibble;

  238. }

  239. 

  240. static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)

  241. {

  242.     int nibble, delta;

  243. 

  244.     if(!c->step) {

  245.         c->predictor = 0;

  246.         c->step = 127;

  247.     }

  248. 

  249.     delta = sample - c->predictor;

  250. 

  251.     nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;

  252. 

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

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

  255.     c->step = (c->step * yamaha_indexscale[nibble]) >> 8;

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

  257. 

  258.     return nibble;

  259. }

  260. 

  261. typedef struct TrellisPath {

  262.     int nibble;

  263.     int prev;

  264. } TrellisPath;

  265. 

  266. typedef struct TrellisNode {

  267.     uint32_t ssd;

  268.     int path;

  269.     int sample1;

  270.     int sample2;

  271.     int step;

  272. } TrellisNode;

  273. 

  274. static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,

  275.                                    uint8_t *dst, ADPCMChannelStatus *c, int n)

  276. {

  277. #define FREEZE_INTERVAL 128

  278.     //FIXME 6% faster if frontier is a compile-time constant

  279.     const int frontier = 1 << avctx->trellis;

  280.     const int stride = avctx->channels;

  281.     const int version = avctx->codec->id;

  282.     const int max_paths = frontier*FREEZE_INTERVAL;

  283.     TrellisPath paths[max_paths], *p;

  284.     TrellisNode node_buf[2][frontier];

  285.     TrellisNode *nodep_buf[2][frontier];

  286.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd

  287.     TrellisNode **nodes_next = nodep_buf[1];

  288.     int pathn = 0, froze = -1, i, j, k;

  289. 

  290.     assert(!(max_paths&(max_paths-1)));

  291. 

  292.     memset(nodep_buf, 0, sizeof(nodep_buf));

  293.     nodes[0] = &node_buf[1][0];

  294.     nodes[0]->ssd = 0;

  295.     nodes[0]->path = 0;

  296.     nodes[0]->step = c->step_index;

  297.     nodes[0]->sample1 = c->sample1;

  298.     nodes[0]->sample2 = c->sample2;

  299.     if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_SWF))

  300.         nodes[0]->sample1 = c->prev_sample;

  301.     if(version == CODEC_ID_ADPCM_MS)

  302.         nodes[0]->step = c->idelta;

  303.     if(version == CODEC_ID_ADPCM_YAMAHA) {

  304.         if(c->step == 0) {

  305.             nodes[0]->step = 127;

  306.             nodes[0]->sample1 = 0;

  307.         } else {

  308.             nodes[0]->step = c->step;

  309.             nodes[0]->sample1 = c->predictor;

  310.         }

  311.     }

  312. 

  313.     for(i=0; i<n; i++) {

  314.         TrellisNode *t = node_buf[i&1];

  315.         TrellisNode **u;

  316.         int sample = samples[i*stride];

  317.         memset(nodes_next, 0, frontier*sizeof(TrellisNode*));

  318.         for(j=0; j<frontier && nodes[j]; j++) {

  319.             // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too

  320.             const int range = (j < frontier/2) ? 1 : 0;

  321.             const int step = nodes[j]->step;

  322.             int nidx;

  323.             if(version == CODEC_ID_ADPCM_MS) {

  324.                 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;

  325.                 const int div = (sample - predictor) / step;

  326.                 const int nmin = av_clip(div-range, -8, 6);

  327.                 const int nmax = av_clip(div+range, -7, 7);

  328.                 for(nidx=nmin; nidx<=nmax; nidx++) {

  329.                     const int nibble = nidx & 0xf;

  330.                     int dec_sample = predictor + nidx * step;

  331. #define STORE_NODE(NAME, STEP_INDEX)\

  332.                     int d;\

  333.                     uint32_t ssd;\

  334.                     dec_sample = av_clip_int16(dec_sample);\

  335.                     d = sample - dec_sample;\

  336.                     ssd = nodes[j]->ssd + d*d;\

  337.                     if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\

  338.                         continue;\

  339.                     /* Collapse any two states with the same previous sample value. \

  340.                      * One could also distinguish states by step and by 2nd to last

  341.                      * sample, but the effects of that are negligible. */\

  342.                     for(k=0; k<frontier && nodes_next[k]; k++) {\

  343.                         if(dec_sample == nodes_next[k]->sample1) {\

  344.                             assert(ssd >= nodes_next[k]->ssd);\

  345.                             goto next_##NAME;\

  346.                         }\

  347.                     }\

  348.                     for(k=0; k<frontier; k++) {\

  349.                         if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\

  350.                             TrellisNode *u = nodes_next[frontier-1];\

  351.                             if(!u) {\

  352.                                 assert(pathn < max_paths);\

  353.                                 u = t++;\

  354.                                 u->path = pathn++;\

  355.                             }\

  356.                             u->ssd = ssd;\

  357.                             u->step = STEP_INDEX;\

  358.                             u->sample2 = nodes[j]->sample1;\

  359.                             u->sample1 = dec_sample;\

  360.                             paths[u->path].nibble = nibble;\

  361.                             paths[u->path].prev = nodes[j]->path;\

  362.                             memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\

  363.                             nodes_next[k] = u;\

  364.                             break;\

  365.                         }\

  366.                     }\

  367.                     next_##NAME:;

  368.                     STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));

  369.                 }

  370.             } else if((version == CODEC_ID_ADPCM_IMA_WAV)|| (version == CODEC_ID_ADPCM_SWF)) {

  371. #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\

  372.                 const int predictor = nodes[j]->sample1;\

  373.                 const int div = (sample - predictor) * 4 / STEP_TABLE;\

  374.                 int nmin = av_clip(div-range, -7, 6);\

  375.                 int nmax = av_clip(div+range, -6, 7);\

  376.                 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\

  377.                 if(nmax<0) nmax--;\

  378.                 for(nidx=nmin; nidx<=nmax; nidx++) {\

  379.                     const int nibble = nidx<0 ? 7-nidx : nidx;\

  380.                     int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\

  381.                     STORE_NODE(NAME, STEP_INDEX);\

  382.                 }

  383.                 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));

  384.             } else { //CODEC_ID_ADPCM_YAMAHA

  385.                 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));

  386. #undef LOOP_NODES

  387. #undef STORE_NODE

  388.             }

  389.         }

  390. 

  391.         u = nodes;

  392.         nodes = nodes_next;

  393.         nodes_next = u;

  394. 

  395.         // prevent overflow

  396.         if(nodes[0]->ssd > (1<<28)) {

  397.             for(j=1; j<frontier && nodes[j]; j++)

  398.                 nodes[j]->ssd -= nodes[0]->ssd;

  399.             nodes[0]->ssd = 0;

  400.         }

  401. 

  402.         // merge old paths to save memory

  403.         if(i == froze + FREEZE_INTERVAL) {

  404.             p = &paths[nodes[0]->path];

  405.             for(k=i; k>froze; k--) {

  406.                 dst[k] = p->nibble;

  407.                 p = &paths[p->prev];

  408.             }

  409.             froze = i;

  410.             pathn = 0;

  411.             // other nodes might use paths that don't coincide with the frozen one.

  412.             // checking which nodes do so is too slow, so just kill them all.

  413.             // this also slightly improves quality, but I don't know why.

  414.             memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));

  415.         }

  416.     }

  417. 

  418.     p = &paths[nodes[0]->path];

  419.     for(i=n-1; i>froze; i--) {

  420.         dst[i] = p->nibble;

  421.         p = &paths[p->prev];

  422.     }

  423. 

  424.     c->predictor = nodes[0]->sample1;

  425.     c->sample1 = nodes[0]->sample1;

  426.     c->sample2 = nodes[0]->sample2;

  427.     c->step_index = nodes[0]->step;

  428.     c->step = nodes[0]->step;

  429.     c->idelta = nodes[0]->step;

  430. }

  431. 

  432. static int adpcm_encode_frame(AVCodecContext *avctx,

  433.                             unsigned char *frame, int buf_size, void *data)

  434. {

  435.     int n, i, st;

  436.     short *samples;

  437.     unsigned char *dst;

  438.     ADPCMContext *c = avctx->priv_data;

  439. 

  440.     dst = frame;

  441.     samples = (short *)data;

  442.     st= avctx->channels == 2;

  443. /*    n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */

  444. 

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

  446.     case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */

  447.         break;

  448.     case CODEC_ID_ADPCM_IMA_WAV:

  449.         n = avctx->frame_size / 8;

  450.             c->status[0].prev_sample = (signed short)samples[0]; /* XXX */

  451. /*            c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */

  452.             bytestream_put_le16(&dst, c->status[0].prev_sample);

  453.             *dst++ = (unsigned char)c->status[0].step_index;

  454.             *dst++ = 0; /* unknown */

  455.             samples++;

  456.             if (avctx->channels == 2) {

  457.                 c->status[1].prev_sample = (signed short)samples[1];

  458. /*                c->status[1].step_index = 0; */

  459.                 bytestream_put_le16(&dst, c->status[1].prev_sample);

  460.                 *dst++ = (unsigned char)c->status[1].step_index;

  461.                 *dst++ = 0;

  462.                 samples++;

  463.             }

  464. 

  465.             /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */

  466.             if(avctx->trellis > 0) {

  467.                 uint8_t buf[2][n*8];

  468.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);

  469.                 if(avctx->channels == 2)

  470.                     adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);

  471.                 for(i=0; i<n; i++) {

  472.                     *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);

  473.                     *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);

  474.                     *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);

  475.                     *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);

  476.                     if (avctx->channels == 2) {

  477.                         *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);

  478.                         *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);

  479.                         *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);

  480.                         *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);

  481.                     }

  482.                 }

  483.             } else

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

  485.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]);

  486.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4;

  487.                 dst++;

  488.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]);

  489.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4;

  490.                 dst++;

  491.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]);

  492.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4;

  493.                 dst++;

  494.                 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]);

  495.                 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4;

  496.                 dst++;

  497.                 /* right channel */

  498.                 if (avctx->channels == 2) {

  499.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);

  500.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;

  501.                     dst++;

  502.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);

  503.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;

  504.                     dst++;

  505.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);

  506.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;

  507.                     dst++;

  508.                     *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);

  509.                     *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;

  510.                     dst++;

  511.                 }

  512.                 samples += 8 * avctx->channels;

  513.             }

  514.         break;

  515.     case CODEC_ID_ADPCM_SWF:

  516.     {

  517.         int i;

  518.         PutBitContext pb;

  519.         init_put_bits(&pb, dst, buf_size*8);

  520. 

  521.         n = avctx->frame_size-1;

  522. 

  523.         //Store AdpcmCodeSize

  524.         put_bits(&pb, 2, 2);                //Set 4bits flash adpcm format

  525. 

  526.         //Init the encoder state

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

  528.             c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits

  529.             put_bits(&pb, 16, samples[i] & 0xFFFF);

  530.             put_bits(&pb, 6, c->status[i].step_index);

  531.             c->status[i].prev_sample = (signed short)samples[i];

  532.         }

  533. 

  534.         if(avctx->trellis > 0) {

  535.             uint8_t buf[2][n];

  536.             adpcm_compress_trellis(avctx, samples+2, buf[0], &c->status[0], n);

  537.             if (avctx->channels == 2)

  538.                 adpcm_compress_trellis(avctx, samples+3, buf[1], &c->status[1], n);

  539.             for(i=0; i<n; i++) {

  540.                 put_bits(&pb, 4, buf[0][i]);

  541.                 if (avctx->channels == 2)

  542.                     put_bits(&pb, 4, buf[1][i]);

  543.             }

  544.         } else {

  545.             for (i=1; i<avctx->frame_size; i++) {

  546.                 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]));

  547.                 if (avctx->channels == 2)

  548.                     put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]));

  549.             }

  550.         }

  551.         flush_put_bits(&pb);

  552.         dst += put_bits_count(&pb)>>3;

  553.         break;

  554.     }

  555.     case CODEC_ID_ADPCM_MS:

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

  557.             int predictor=0;

  558. 

  559.             *dst++ = predictor;

  560.             c->status[i].coeff1 = AdaptCoeff1[predictor];

  561.             c->status[i].coeff2 = AdaptCoeff2[predictor];

  562.         }

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

  564.             if (c->status[i].idelta < 16)

  565.                 c->status[i].idelta = 16;

  566. 

  567.             bytestream_put_le16(&dst, c->status[i].idelta);

  568.         }

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

  570.             c->status[i].sample1= *samples++;

  571. 

  572.             bytestream_put_le16(&dst, c->status[i].sample1);

  573.         }

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

  575.             c->status[i].sample2= *samples++;

  576. 

  577.             bytestream_put_le16(&dst, c->status[i].sample2);

  578.         }

  579. 

  580.         if(avctx->trellis > 0) {

  581.             int n = avctx->block_align - 7*avctx->channels;

  582.             uint8_t buf[2][n];

  583.             if(avctx->channels == 1) {

  584.                 n *= 2;

  585.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  586.                 for(i=0; i<n; i+=2)

  587.                     *dst++ = (buf[0][i] << 4) | buf[0][i+1];

  588.             } else {

  589.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  590.                 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);

  591.                 for(i=0; i<n; i++)

  592.                     *dst++ = (buf[0][i] << 4) | buf[1][i];

  593.             }

  594.         } else

  595.         for(i=7*avctx->channels; i<avctx->block_align; i++) {

  596.             int nibble;

  597.             nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;

  598.             nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);

  599.             *dst++ = nibble;

  600.         }

  601.         break;

  602.     case CODEC_ID_ADPCM_YAMAHA:

  603.         n = avctx->frame_size / 2;

  604.         if(avctx->trellis > 0) {

  605.             uint8_t buf[2][n*2];

  606.             n *= 2;

  607.             if(avctx->channels == 1) {

  608.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  609.                 for(i=0; i<n; i+=2)

  610.                     *dst++ = buf[0][i] | (buf[0][i+1] << 4);

  611.             } else {

  612.                 adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);

  613.                 adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);

  614.                 for(i=0; i<n; i++)

  615.                     *dst++ = buf[0][i] | (buf[1][i] << 4);

  616.             }

  617.         } else

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

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

  620.                 int nibble;

  621.                 nibble  = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);

  622.                 nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;

  623.                 *dst++ = nibble;

  624.             }

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

  626.         }

  627.         break;

  628.     default:

  629.         return -1;

  630.     }

  631.     return dst - frame;

  632. }

  633. #endif //CONFIG_ENCODERS

  634. 

  635. static int adpcm_decode_init(AVCodecContext * avctx)

  636. {

  637.     ADPCMContext *c = avctx->priv_data;

  638. 

  639.     if(avctx->channels > 2U){

  640.         return -1;

  641.     }

  642. 

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

  644.     case CODEC_ID_ADPCM_CT:

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

  646.         break;

  647.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  651.         }

  652.         break;

  653.     default:

  654.         break;

  655.     }

  656.     return 0;

  657. }

  658. 

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

  660. {

  661.     int step_index;

  662.     int predictor;

  663.     int sign, delta, diff, step;

  664. 

  665.     step = step_table[c->step_index];

  666.     step_index = c->step_index + index_table[(unsigned)nibble];

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

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

  669. 

  670.     sign = nibble & 8;

  671.     delta = nibble & 7;

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

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

  674.      * quickly enough */

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

  676.     predictor = c->predictor;

  677.     if (sign) predictor -= diff;

  678.     else predictor += diff;

  679. 

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

  681.     c->step_index = step_index;

  682. 

  683.     return (short)c->predictor;

  684. }

  685. 

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

  687. {

  688.     int predictor;

  689. 

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

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

  692. 

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

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

  695.     c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;

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

  697. 

  698.     return c->sample1;

  699. }

  700. 

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

  702. {

  703.     int sign, delta, diff;

  704.     int new_step;

  705. 

  706.     sign = nibble & 8;

  707.     delta = nibble & 7;

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

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

  710.      * quickly enough */

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

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

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

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

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

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

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

  718. 

  719.     return (short)c->predictor;

  720. }

  721. 

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

  723. {

  724.     int sign, delta, diff;

  725. 

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

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

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

  729. 

  730.     /* clamp result */

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

  732. 

  733.     /* calculate new step */

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

  735.         c->step++;

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

  737.         c->step--;

  738. 

  739.     return (short) c->predictor;

  740. }

  741. 

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

  743. {

  744.     if(!c->step) {

  745.         c->predictor = 0;

  746.         c->step = 127;

  747.     }

  748. 

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

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

  751.     c->step = (c->step * yamaha_indexscale[nibble]) >> 8;

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

  753.     return c->predictor;

  754. }

  755. 

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

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

  758. {

  759.     int i, j;

  760.     int shift,filter,f0,f1;

  761.     int s_1,s_2;

  762.     int d,s,t;

  763. 

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

  765. 

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

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

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

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

  770. 

  771.         s_1 = left->sample1;

  772.         s_2 = left->sample2;

  773. 

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

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

  776. 

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

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

  779.             s_2 = s_1;

  780.             s_1 = av_clip_int16(s);

  781.             *out = s_1;

  782.             out += inc;

  783.         }

  784. 

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

  786.             left->sample1 = s_1;

  787.             left->sample2 = s_2;

  788.             s_1 = right->sample1;

  789.             s_2 = right->sample2;

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

  791.         }

  792. 

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

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

  795. 

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

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

  798. 

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

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

  801. 

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

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

  804.             s_2 = s_1;

  805.             s_1 = av_clip_int16(s);

  806.             *out = s_1;

  807.             out += inc;

  808.         }

  809. 

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

  811.             right->sample1 = s_1;

  812.             right->sample2 = s_2;

  813.             out -= 1;

  814.         } else {

  815.             left->sample1 = s_1;

  816.             left->sample2 = s_2;

  817.         }

  818.     }

  819. }

  820. 

  821. 

  822. /* DK3 ADPCM support macro */

  823. #define DK3_GET_NEXT_NIBBLE() \

  824.     if (decode_top_nibble_next) \

  825.     { \

  826.         nibble = (last_byte >> 4) & 0x0F; \

  827.         decode_top_nibble_next = 0; \

  828.     } \

  829.     else \

  830.     { \

  831.         last_byte = *src++; \

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

  833.         nibble = last_byte & 0x0F; \

  834.         decode_top_nibble_next = 1; \

  835.     }

  836. 

  837. static int adpcm_decode_frame(AVCodecContext *avctx,

  838.                             void *data, int *data_size,

  839.                             uint8_t *buf, int buf_size)

  840. {

  841.     ADPCMContext *c = avctx->priv_data;

  842.     ADPCMChannelStatus *cs;

  843.     int n, m, channel, i;

  844.     int block_predictor[2];

  845.     short *samples;

  846.     short *samples_end;

  847.     uint8_t *src;

  848.     int st; /* stereo */

  849. 

  850.     /* DK3 ADPCM accounting variables */

  851.     unsigned char last_byte = 0;

  852.     unsigned char nibble;

  853.     int decode_top_nibble_next = 0;

  854.     int diff_channel;

  855. 

  856.     /* EA ADPCM state variables */

  857.     uint32_t samples_in_chunk;

  858.     int32_t previous_left_sample, previous_right_sample;

  859.     int32_t current_left_sample, current_right_sample;

  860.     int32_t next_left_sample, next_right_sample;

  861.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  862.     uint8_t shift_left, shift_right;

  863.     int count1, count2;

  864. 

  865.     if (!buf_size)

  866.         return 0;

  867. 

  868.     //should protect all 4bit ADPCM variants

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

  870.     //

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

  872.         return -1;

  873. 

  874.     samples = data;

  875.     samples_end= samples + *data_size/2;

  876.     *data_size= 0;

  877.     src = buf;

  878. 

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

  880. 

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

  882.     case CODEC_ID_ADPCM_IMA_QT:

  883.         n = (buf_size - 2);/* >> 2*avctx->channels;*/

  884.         channel = c->channel;

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

  886.         /* (pppppp) (piiiiiii) */

  887. 

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

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

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

  891.         cs->predictor &= 0xFF80;

  892. 

  893.         /* sign extension */

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

  895.             cs->predictor -= 0x10000;

  896. 

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

  898. 

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

  900. 

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

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

  903.             cs->step_index = 88;

  904.         }

  905. 

  906.         cs->step = step_table[cs->step_index];

  907. 

  908.         if (st && channel)

  909.             samples++;

  910. 

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

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

  913.             samples += avctx->channels;

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

  915.             samples += avctx->channels;

  916.             src ++;

  917.         }

  918. 

  919.         if(st) { /* handle stereo interlacing */

  920.             c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */

  921.             if(channel == 1) { /* wait for the other packet before outputing anything */

  922.                 return src - buf;

  923.             }

  924.         }

  925.         break;

  926.     case CODEC_ID_ADPCM_IMA_WAV:

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

  928.             buf_size = avctx->block_align;

  929. 

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

  931. 

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

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

  934.             cs->predictor = (int16_t)(src[0] + (src[1]<<8));

  935.             src+=2;

  936. 

  937.         // XXX: is this correct ??: *samples++ = cs->predictor;

  938. 

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

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

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

  942.                 cs->step_index = 88;

  943.             }

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

  945.         }

  946. 

  947.         while(src < buf + buf_size){

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

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

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

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

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

  953.                 src++;

  954.             }

  955.             src += 4*st;

  956.         }

  957.         break;

  958.     case CODEC_ID_ADPCM_4XM:

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

  960.         c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  961.         if(st){

  962.             c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  963.         }

  964.         c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  965.         if(st){

  966.             c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;

  967.         }

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

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

  970. 

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

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

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

  974.             if (st)

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

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

  977.             if (st)

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

  979.         }

  980. 

  981.         src += m<<st;

  982. 

  983.         break;

  984.     case CODEC_ID_ADPCM_MS:

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

  986.             buf_size = avctx->block_align;

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

  988.         if (n < 0)

  989.             return -1;

  990.         block_predictor[0] = av_clip(*src++, 0, 7);

  991.         block_predictor[1] = 0;

  992.         if (st)

  993.             block_predictor[1] = av_clip(*src++, 0, 7);

  994.         c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  995.         src+=2;

  996.         if (st){

  997.             c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  998.             src+=2;

  999.         }

  1000.         c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];

  1001.         c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];

  1002.         c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];

  1003.         c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];

  1004. 

  1005.         c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1006.         src+=2;

  1007.         if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1008.         if (st) src+=2;

  1009.         c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1010.         src+=2;

  1011.         if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));

  1012.         if (st) src+=2;

  1013. 

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

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

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

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

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

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

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

  1021.             src ++;

  1022.         }

  1023.         break;

  1024.     case CODEC_ID_ADPCM_IMA_DK4:

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

  1026.             buf_size = avctx->block_align;

  1027. 

  1028.         c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));

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

  1030.         src += 4;

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

  1032.         if (st) {

  1033.             c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));

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

  1035.             src += 4;

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

  1037.         }

  1038.         while (src < buf + buf_size) {

  1039. 

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

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

  1042.                 (src[0] >> 4) & 0x0F, 3);

  1043. 

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

  1045.              * stereo, or another mono sample */

  1046.             if (st)

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

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

  1049.             else

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

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

  1052. 

  1053.             src++;

  1054.         }

  1055.         break;

  1056.     case CODEC_ID_ADPCM_IMA_DK3:

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

  1058.             buf_size = avctx->block_align;

  1059. 

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

  1061.             return -1;

  1062. 

  1063.         c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));

  1064.         c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));

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

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

  1067.         /* sign extend the predictors */

  1068.         src += 16;

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

  1070. 

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

  1072.          * the buffer is consumed */

  1073.         while (1) {

  1074. 

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

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

  1077. 

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

  1079.             DK3_GET_NEXT_NIBBLE();

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

  1081. 

  1082.             /* process the diff channel predictor */

  1083.             DK3_GET_NEXT_NIBBLE();

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

  1085. 

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

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

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

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

  1090. 

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

  1092.             DK3_GET_NEXT_NIBBLE();

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

  1094. 

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

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

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

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

  1099.         }

  1100.         break;

  1101.     case CODEC_ID_ADPCM_IMA_WS:

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

  1103.         while (src < buf + buf_size) {

  1104. 

  1105.             if (st) {

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

  1107.                     (src[0] >> 4) & 0x0F, 3);

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

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

  1110.             } else {

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

  1112.                     (src[0] >> 4) & 0x0F, 3);

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

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

  1115.             }

  1116. 

  1117.             src++;

  1118.         }

  1119.         break;

  1120.     case CODEC_ID_ADPCM_XA:

  1121.         c->status[0].sample1 = c->status[0].sample2 =

  1122.         c->status[1].sample1 = c->status[1].sample2 = 0;

  1123.         while (buf_size >= 128) {

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

  1125.                 avctx->channels);

  1126.             src += 128;

  1127.             samples += 28 * 8;

  1128.             buf_size -= 128;

  1129.         }

  1130.         break;

  1131.     case CODEC_ID_ADPCM_EA:

  1132.         samples_in_chunk = AV_RL32(src);

  1133.         if (samples_in_chunk >= ((buf_size - 12) * 2)) {

  1134.             src += buf_size;

  1135.             break;

  1136.         }

  1137.         src += 4;

  1138.         current_left_sample = (int16_t)AV_RL16(src);

  1139.         src += 2;

  1140.         previous_left_sample = (int16_t)AV_RL16(src);

  1141.         src += 2;

  1142.         current_right_sample = (int16_t)AV_RL16(src);

  1143.         src += 2;

  1144.         previous_right_sample = (int16_t)AV_RL16(src);

  1145.         src += 2;

  1146. 

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

  1148.             coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];

  1149.             coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];

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

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

  1152.             src++;

  1153. 

  1154.             shift_left = ((*src >> 4) & 0x0F) + 8;

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

  1156.             src++;

  1157. 

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

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

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

  1161.                 src++;

  1162. 

  1163.                 next_left_sample = (next_left_sample +

  1164.                     (current_left_sample * coeff1l) +

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

  1166.                 next_right_sample = (next_right_sample +

  1167.                     (current_right_sample * coeff1r) +

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

  1169. 

  1170.                 previous_left_sample = current_left_sample;

  1171.                 current_left_sample = av_clip_int16(next_left_sample);

  1172.                 previous_right_sample = current_right_sample;

  1173.                 current_right_sample = av_clip_int16(next_right_sample);

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

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

  1176.             }

  1177.         }

  1178.         break;

  1179.     case CODEC_ID_ADPCM_IMA_AMV:

  1180.     case CODEC_ID_ADPCM_IMA_SMJPEG:

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

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

  1183. 

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

  1185.             src+=4;

  1186. 

  1187.         while (src < buf + buf_size) {

  1188.             char hi, lo;

  1189.             lo = *src & 0x0F;

  1190.             hi = (*src >> 4) & 0x0F;

  1191. 

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

  1193.                 FFSWAP(char, hi, lo);

  1194. 

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

  1196.                 lo, 3);

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

  1198.                 hi, 3);

  1199.             src++;

  1200.         }

  1201.         break;

  1202.     case CODEC_ID_ADPCM_CT:

  1203.         while (src < buf + buf_size) {

  1204.             if (st) {

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

  1206.                     (src[0] >> 4) & 0x0F);

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

  1208.                     src[0] & 0x0F);

  1209.             } else {

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

  1211.                     (src[0] >> 4) & 0x0F);

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

  1213.                     src[0] & 0x0F);

  1214.             }

  1215.             src++;

  1216.         }

  1217.         break;

  1218.     case CODEC_ID_ADPCM_SBPRO_4:

  1219.     case CODEC_ID_ADPCM_SBPRO_3:

  1220.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1224.             if (st)

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

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

  1227.         }

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

  1229.             while (src < buf + buf_size) {

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

  1231.                     (src[0] >> 4) & 0x0F, 4, 0);

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

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

  1234.                 src++;

  1235.             }

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

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

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

  1239.                     (src[0] >> 5) & 0x07, 3, 0);

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

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

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

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

  1244.                 src++;

  1245.             }

  1246.         } else {

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

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

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

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

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

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

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

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

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

  1256.                 src++;

  1257.             }

  1258.         }

  1259.         break;

  1260.     case CODEC_ID_ADPCM_SWF:

  1261.     {

  1262.         GetBitContext gb;

  1263.         const int *table;

  1264.         int k0, signmask, nb_bits, count;

  1265.         int size = buf_size*8;

  1266. 

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

  1268. 

  1269.         //read bits & initial values

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

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

  1272.         table = swf_index_tables[nb_bits-2];

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

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

  1275. 

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

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

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

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

  1280.             }

  1281. 

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

  1283.                 int i;

  1284. 

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

  1286.                     // similar to IMA adpcm

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

  1288.                     int step = step_table[c->status[i].step_index];

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

  1290.                     int k = k0;

  1291. 

  1292.                     do {

  1293.                         if (delta & k)

  1294.                             vpdiff += step;

  1295.                         step >>= 1;

  1296.                         k >>= 1;

  1297.                     } while(k);

  1298.                     vpdiff += step;

  1299. 

  1300.                     if (delta & signmask)

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

  1302.                     else

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

  1304. 

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

  1306. 

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

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

  1309. 

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

  1311.                     if (samples >= samples_end) {

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

  1313.                         return -1;

  1314.                     }

  1315.                 }

  1316.             }

  1317.         }

  1318.         src += buf_size;

  1319.         break;

  1320.     }

  1321.     case CODEC_ID_ADPCM_YAMAHA:

  1322.         while (src < buf + buf_size) {

  1323.             if (st) {

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

  1325.                         src[0] & 0x0F);

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

  1327.                         (src[0] >> 4) & 0x0F);

  1328.             } else {

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

  1330.                         src[0] & 0x0F);

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

  1332.                         (src[0] >> 4) & 0x0F);

  1333.             }

  1334.             src++;

  1335.         }

  1336.         break;

  1337.     case CODEC_ID_ADPCM_THP:

  1338.     {

  1339.         int table[2][16];

  1340.         unsigned int samplecnt;

  1341.         int prev[2][2];

  1342.         int ch;

  1343. 

  1344.         if (buf_size < 80) {

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

  1346.             return -1;

  1347.         }

  1348. 

  1349.         src+=4;

  1350.         samplecnt = bytestream_get_be32(&src);

  1351. 

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

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

  1354. 

  1355.         /* Initialize the previous sample.  */

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

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

  1358. 

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

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

  1361.             return -1;

  1362.         }

  1363. 

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

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

  1366. 

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

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

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

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

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

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

  1373. 

  1374.                 /* Decode 14 samples.  */

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

  1376.                     int32_t sampledat;

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

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

  1379. 

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

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

  1382.                     *samples = av_clip_int16(sampledat);

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

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

  1385. 

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

  1387.                        is for the other channel.  */

  1388.                     samples += st;

  1389.                 }

  1390.             }

  1391.         }

  1392. 

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

  1394.            increased exactly one time too often.  */

  1395.         samples -= st;

  1396.         break;

  1397.     }

  1398. 

  1399.     default:

  1400.         return -1;

  1401.     }

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

  1403.     return src - buf;

  1404. }

  1405. 

  1406. 

  1407. 

  1408. #ifdef CONFIG_ENCODERS

  1409. #define ADPCM_ENCODER(id,name)                  \

  1410. AVCodec name ## _encoder = {                    \

  1411.     #name,                                      \

  1412.     CODEC_TYPE_AUDIO,                           \

  1413.     id,                                         \

  1414.     sizeof(ADPCMContext),                       \

  1415.     adpcm_encode_init,                          \

  1416.     adpcm_encode_frame,                         \

  1417.     adpcm_encode_close,                         \

  1418.     NULL,                                       \

  1419. };

  1420. #else

  1421. #define ADPCM_ENCODER(id,name)

  1422. #endif

  1423. 

  1424. #ifdef CONFIG_DECODERS

  1425. #define ADPCM_DECODER(id,name)                  \

  1426. AVCodec name ## _decoder = {                    \

  1427.     #name,                                      \

  1428.     CODEC_TYPE_AUDIO,                           \

  1429.     id,                                         \

  1430.     sizeof(ADPCMContext),                       \

  1431.     adpcm_decode_init,                          \

  1432.     NULL,                                       \

  1433.     NULL,                                       \

  1434.     adpcm_decode_frame,                         \

  1435. };

  1436. #else

  1437. #define ADPCM_DECODER(id,name)

  1438. #endif

  1439. 

  1440. #define ADPCM_CODEC(id, name)                   \

  1441. ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)

  1442. 

  1443. ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);

  1444. ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);

  1445. ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);

  1446. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv);

  1447. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);

  1448. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);

  1449. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);

  1450. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);

  1451. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);

  1452. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);

  1453. ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);

  1454. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);

  1455. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);

  1456. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);

  1457. ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);

  1458. ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);

  1459. ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);

  1460. ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);

  1461. 

  1462. #undef ADPCM_CODEC