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

1468 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. #define CLAMP_TO_SHORT(value) \

  54. if (value > 32767) \

  55.     value = 32767; \

  56. else if (value < -32768) \

  57.     value = -32768; \

  58. 

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

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

  61. static const int index_table[16] = {

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

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

  64. };

  65. 

  66. /**

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

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

  69.  */

  70. static const int step_table[89] = {

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

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

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

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

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

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

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

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

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

  80. };

  81. 

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

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

  84. static const int AdaptationTable[] = {

  85.         230, 230, 230, 230, 307, 409, 512, 614,

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

  87. };

  88. 

  89. static const int AdaptCoeff1[] = {

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

  91. };

  92. 

  93. static const int AdaptCoeff2[] = {

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

  95. };

  96. 

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

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

  99.    {   0,   0 },

  100.    {  60,   0 },

  101.    { 115, -52 },

  102.    {  98, -55 },

  103.    { 122, -60 }

  104. };

  105. 

  106. static const int ea_adpcm_table[] = {

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

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

  109. };

  110. 

  111. static const int ct_adpcm_table[8] = {

  112.     0x00E6, 0x00E6, 0x00E6, 0x00E6,

  113.     0x0133, 0x0199, 0x0200, 0x0266

  114. };

  115. 

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

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

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

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

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

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

  122. };

  123. 

  124. static const int yamaha_indexscale[] = {

  125.     230, 230, 230, 230, 307, 409, 512, 614,

  126.     230, 230, 230, 230, 307, 409, 512, 614

  127. };

  128. 

  129. static const int yamaha_difflookup[] = {

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

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

  132. };

  133. 

  134. /* end of tables */

  135. 

  136. typedef struct ADPCMChannelStatus {

  137.     int predictor;

  138.     short int step_index;

  139.     int step;

  140.     /* for encoding */

  141.     int prev_sample;

  142. 

  143.     /* MS version */

  144.     short sample1;

  145.     short sample2;

  146.     int coeff1;

  147.     int coeff2;

  148.     int idelta;

  149. } ADPCMChannelStatus;

  150. 

  151. typedef struct ADPCMContext {

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

  153.     ADPCMChannelStatus status[2];

  154.     short sample_buffer[32]; /* hold left samples while waiting for right samples */

  155. } ADPCMContext;

  156. 

  157. /* XXX: implement encoding */

  158. 

  159. #ifdef CONFIG_ENCODERS

  160. static int adpcm_encode_init(AVCodecContext *avctx)

  161. {

  162.     if (avctx->channels > 2)

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

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

  165.     case CODEC_ID_ADPCM_IMA_QT:

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

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

  168.         return -1;

  169.         break;

  170.     case CODEC_ID_ADPCM_IMA_WAV:

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

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

  173.         avctx->block_align = BLKSIZE;

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

  175.         break;

  176.     case CODEC_ID_ADPCM_MS:

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

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

  179.         avctx->block_align = BLKSIZE;

  180.         break;

  181.     case CODEC_ID_ADPCM_YAMAHA:

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

  183.         avctx->block_align = BLKSIZE;

  184.         break;

  185.     case CODEC_ID_ADPCM_SWF:

  186.         avctx->frame_size = 4*BLKSIZE * avctx->channels;

  187.         break;

  188.     default:

  189.         return -1;

  190.         break;

  191.     }

  192. 

  193.     avctx->coded_frame= avcodec_alloc_frame();

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

  195. 

  196.     return 0;

  197. }

  198. 

  199. static int adpcm_encode_close(AVCodecContext *avctx)

  200. {

  201.     av_freep(&avctx->coded_frame);

  202. 

  203.     return 0;

  204. }

  205. 

  206. 

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

  208. {

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

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

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

  212.     CLAMP_TO_SHORT(c->prev_sample);

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

  214.     return nibble;

  215. }

  216. 

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

  218. {

  219.     int predictor, nibble, bias;

  220. 

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

  222. 

  223.     nibble= sample - predictor;

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

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

  226. 

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

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

  229. 

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

  231.     CLAMP_TO_SHORT(predictor);

  232. 

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

  234.     c->sample1 = predictor;

  235. 

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

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

  238. 

  239.     return nibble;

  240. }

  241. 

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

  243. {

  244.     int nibble, delta;

  245. 

  246.     if(!c->step) {

  247.         c->predictor = 0;

  248.         c->step = 127;

  249.     }

  250. 

  251.     delta = sample - c->predictor;

  252. 

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

  254. 

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

  256.     CLAMP_TO_SHORT(c->predictor);

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

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

  259. 

  260.     return nibble;

  261. }

  262. 

  263. typedef struct TrellisPath {

  264.     int nibble;

  265.     int prev;

  266. } TrellisPath;

  267. 

  268. typedef struct TrellisNode {

  269.     uint32_t ssd;

  270.     int path;

  271.     int sample1;

  272.     int sample2;

  273.     int step;

  274. } TrellisNode;

  275. 

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

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

  278. {

  279. #define FREEZE_INTERVAL 128

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

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

  282.     const int stride = avctx->channels;

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

  284.     const int max_paths = frontier*FREEZE_INTERVAL;

  285.     TrellisPath paths[max_paths], *p;

  286.     TrellisNode node_buf[2][frontier];

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

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

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

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

  291. 

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

  293. 

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

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

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

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

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

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

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

  301.     if(version == CODEC_ID_ADPCM_IMA_WAV)

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

  303.     if(version == CODEC_ID_ADPCM_MS)

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

  305.     if(version == CODEC_ID_ADPCM_YAMAHA) {

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

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

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

  309.         } else {

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

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

  312.         }

  313.     }

  314. 

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

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

  317.         TrellisNode **u;

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

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

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

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

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

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

  324.             int nidx;

  325.             if(version == CODEC_ID_ADPCM_MS) {

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

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

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

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

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

  331.                     const int nibble = nidx & 0xf;

  332.                     int dec_sample = predictor + nidx * step;

  333. #define STORE_NODE(NAME, STEP_INDEX)\

  334.                     int d;\

  335.                     uint32_t ssd;\

  336.                     CLAMP_TO_SHORT(dec_sample);\

  337.                     d = sample - dec_sample;\

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

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

  340.                         continue;\

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

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

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

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

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

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

  347.                             goto next_##NAME;\

  348.                         }\

  349.                     }\

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

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

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

  353.                             if(!u) {\

  354.                                 assert(pathn < max_paths);\

  355.                                 u = t++;\

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

  357.                             }\

  358.                             u->ssd = ssd;\

  359.                             u->step = STEP_INDEX;\

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

  361.                             u->sample1 = dec_sample;\

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

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

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

  365.                             nodes_next[k] = u;\

  366.                             break;\

  367.                         }\

  368.                     }\

  369.                     next_##NAME:;

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

  371.                 }

  372.             } else if(version == CODEC_ID_ADPCM_IMA_WAV) {

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

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

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

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

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

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

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

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

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

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

  383.                     STORE_NODE(NAME, STEP_INDEX);\

  384.                 }

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

  386.             } else { //CODEC_ID_ADPCM_YAMAHA

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

  388. #undef LOOP_NODES

  389. #undef STORE_NODE

  390.             }

  391.         }

  392. 

  393.         u = nodes;

  394.         nodes = nodes_next;

  395.         nodes_next = u;

  396. 

  397.         // prevent overflow

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

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

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

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

  402.         }

  403. 

  404.         // merge old paths to save memory

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

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

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

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

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

  410.             }

  411.             froze = i;

  412.             pathn = 0;

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

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

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

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

  417.         }

  418.     }

  419. 

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

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

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

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

  424.     }

  425. 

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

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

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

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

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

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

  432. }

  433. 

  434. static int adpcm_encode_frame(AVCodecContext *avctx,

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

  436. {

  437.     int n, i, st;

  438.     short *samples;

  439.     unsigned char *dst;

  440.     ADPCMContext *c = avctx->priv_data;

  441. 

  442.     dst = frame;

  443.     samples = (short *)data;

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

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

  446. 

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

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

  449.         break;

  450.     case CODEC_ID_ADPCM_IMA_WAV:

  451.         n = avctx->frame_size / 8;

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

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

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

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

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

  457.             samples++;

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

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

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

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

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

  463.                 *dst++ = 0;

  464.                 samples++;

  465.             }

  466. 

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  483.                     }

  484.                 }

  485.             } else

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

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

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

  489.                 dst++;

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

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

  492.                 dst++;

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

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

  495.                 dst++;

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

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

  498.                 dst++;

  499.                 /* right channel */

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

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

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

  503.                     dst++;

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

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

  506.                     dst++;

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

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

  509.                     dst++;

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

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

  512.                     dst++;

  513.                 }

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

  515.             }

  516.         break;

  517.     case CODEC_ID_ADPCM_SWF:

  518.     {

  519.         int i;

  520.         PutBitContext pb;

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

  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.             put_bits(&pb, 16, samples[i] & 0xFFFF);

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

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

  531.         }

  532. 

  533.         for (i=0 ; i<4096 ; i++) {

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

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

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

  537.         }

  538. 

  539.         dst += (3 + 2048) * avctx->channels;

  540.         break;

  541.     }

  542.     case CODEC_ID_ADPCM_MS:

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

  544.             int predictor=0;

  545. 

  546.             *dst++ = predictor;

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

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

  549.         }

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

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

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

  553. 

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

  555.         }

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

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

  558. 

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

  560.         }

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

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

  563. 

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

  565.         }

  566. 

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

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

  569.             uint8_t buf[2][n];

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

  571.                 n *= 2;

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

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

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

  575.             } else {

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

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

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

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

  580.             }

  581.         } else

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

  583.             int nibble;

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

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

  586.             *dst++ = nibble;

  587.         }

  588.         break;

  589.     case CODEC_ID_ADPCM_YAMAHA:

  590.         n = avctx->frame_size / 2;

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

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

  593.             n *= 2;

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

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

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

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

  598.             } else {

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

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

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

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

  603.             }

  604.         } else

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

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

  607.                 int nibble;

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

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

  610.                 *dst++ = nibble;

  611.             }

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

  613.         }

  614.         break;

  615.     default:

  616.         return -1;

  617.     }

  618.     return dst - frame;

  619. }

  620. #endif //CONFIG_ENCODERS

  621. 

  622. static int adpcm_decode_init(AVCodecContext * avctx)

  623. {

  624.     ADPCMContext *c = avctx->priv_data;

  625. 

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

  627.         return -1;

  628.     }

  629. 

  630.     c->channel = 0;

  631.     c->status[0].predictor = c->status[1].predictor = 0;

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

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

  634. 

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

  636.     case CODEC_ID_ADPCM_CT:

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

  638.         break;

  639.     case CODEC_ID_ADPCM_IMA_WS:

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

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

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

  643.         }

  644.         break;

  645.     default:

  646.         break;

  647.     }

  648.     return 0;

  649. }

  650. 

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

  652. {

  653.     int step_index;

  654.     int predictor;

  655.     int sign, delta, diff, step;

  656. 

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

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

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

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

  661. 

  662.     sign = nibble & 8;

  663.     delta = nibble & 7;

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

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

  666.      * quickly enough */

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

  668.     predictor = c->predictor;

  669.     if (sign) predictor -= diff;

  670.     else predictor += diff;

  671. 

  672.     CLAMP_TO_SHORT(predictor);

  673.     c->predictor = predictor;

  674.     c->step_index = step_index;

  675. 

  676.     return (short)predictor;

  677. }

  678. 

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

  680. {

  681.     int predictor;

  682. 

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

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

  685.     CLAMP_TO_SHORT(predictor);

  686. 

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

  688.     c->sample1 = predictor;

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

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

  691. 

  692.     return (short)predictor;

  693. }

  694. 

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

  696. {

  697.     int predictor;

  698.     int sign, delta, diff;

  699.     int new_step;

  700. 

  701.     sign = nibble & 8;

  702.     delta = nibble & 7;

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

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

  705.      * quickly enough */

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

  707.     predictor = c->predictor;

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

  709.     if(sign)

  710.         predictor = ((predictor * 254) >> 8) - diff;

  711.     else

  712.             predictor = ((predictor * 254) >> 8) + diff;

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

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

  715.     c->step = new_step;

  716.     if(c->step < 511)

  717.         c->step = 511;

  718.     if(c->step > 32767)

  719.         c->step = 32767;

  720. 

  721.     CLAMP_TO_SHORT(predictor);

  722.     c->predictor = predictor;

  723.     return (short)predictor;

  724. }

  725. 

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

  727. {

  728.     int sign, delta, diff;

  729. 

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

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

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

  733. 

  734.     if (sign)

  735.         c->predictor -= diff;

  736.     else

  737.         c->predictor += diff;

  738. 

  739.     /* clamp result */

  740.     if (c->predictor > 16256)

  741.         c->predictor = 16256;

  742.     else if (c->predictor < -16384)

  743.         c->predictor = -16384;

  744. 

  745.     /* calculate new step */

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

  747.         c->step++;

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

  749.         c->step--;

  750. 

  751.     return (short) c->predictor;

  752. }

  753. 

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

  755. {

  756.     if(!c->step) {

  757.         c->predictor = 0;

  758.         c->step = 127;

  759.     }

  760. 

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

  762.     CLAMP_TO_SHORT(c->predictor);

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

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

  765.     return c->predictor;

  766. }

  767. 

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

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

  770. {

  771.     int i, j;

  772.     int shift,filter,f0,f1;

  773.     int s_1,s_2;

  774.     int d,s,t;

  775. 

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

  777. 

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

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

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

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

  782. 

  783.         s_1 = left->sample1;

  784.         s_2 = left->sample2;

  785. 

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

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

  788. 

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

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

  791.             CLAMP_TO_SHORT(s);

  792.             *out = s;

  793.             out += inc;

  794.             s_2 = s_1;

  795.             s_1 = s;

  796.         }

  797. 

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

  799.             left->sample1 = s_1;

  800.             left->sample2 = s_2;

  801.             s_1 = right->sample1;

  802.             s_2 = right->sample2;

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

  804.         }

  805. 

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

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

  808. 

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

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

  811. 

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

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

  814. 

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

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

  817.             CLAMP_TO_SHORT(s);

  818.             *out = s;

  819.             out += inc;

  820.             s_2 = s_1;

  821.             s_1 = s;

  822.         }

  823. 

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

  825.             right->sample1 = s_1;

  826.             right->sample2 = s_2;

  827.             out -= 1;

  828.         } else {

  829.             left->sample1 = s_1;

  830.             left->sample2 = s_2;

  831.         }

  832.     }

  833. }

  834. 

  835. 

  836. /* DK3 ADPCM support macro */

  837. #define DK3_GET_NEXT_NIBBLE() \

  838.     if (decode_top_nibble_next) \

  839.     { \

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

  841.         decode_top_nibble_next = 0; \

  842.     } \

  843.     else \

  844.     { \

  845.         last_byte = *src++; \

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

  847.         nibble = last_byte & 0x0F; \

  848.         decode_top_nibble_next = 1; \

  849.     }

  850. 

  851. static int adpcm_decode_frame(AVCodecContext *avctx,

  852.                             void *data, int *data_size,

  853.                             uint8_t *buf, int buf_size)

  854. {

  855.     ADPCMContext *c = avctx->priv_data;

  856.     ADPCMChannelStatus *cs;

  857.     int n, m, channel, i;

  858.     int block_predictor[2];

  859.     short *samples;

  860.     short *samples_end;

  861.     uint8_t *src;

  862.     int st; /* stereo */

  863. 

  864.     /* DK3 ADPCM accounting variables */

  865.     unsigned char last_byte = 0;

  866.     unsigned char nibble;

  867.     int decode_top_nibble_next = 0;

  868.     int diff_channel;

  869. 

  870.     /* EA ADPCM state variables */

  871.     uint32_t samples_in_chunk;

  872.     int32_t previous_left_sample, previous_right_sample;

  873.     int32_t current_left_sample, current_right_sample;

  874.     int32_t next_left_sample, next_right_sample;

  875.     int32_t coeff1l, coeff2l, coeff1r, coeff2r;

  876.     uint8_t shift_left, shift_right;

  877.     int count1, count2;

  878. 

  879.     if (!buf_size)

  880.         return 0;

  881. 

  882.     //should protect all 4bit ADPCM variants

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

  884.     //

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

  886.         return -1;

  887. 

  888.     samples = data;

  889.     samples_end= samples + *data_size/2;

  890.     *data_size= 0;

  891.     src = buf;

  892. 

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

  894. 

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

  896.     case CODEC_ID_ADPCM_IMA_QT:

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

  898.         channel = c->channel;

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

  900.         /* (pppppp) (piiiiiii) */

  901. 

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

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

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

  905.         cs->predictor &= 0xFF80;

  906. 

  907.         /* sign extension */

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

  909.             cs->predictor -= 0x10000;

  910. 

  911.         CLAMP_TO_SHORT(cs->predictor);

  912. 

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

  914. 

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

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

  917.             cs->step_index = 88;

  918.         }

  919. 

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

  921. 

  922.         if (st && channel)

  923.             samples++;

  924. 

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

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

  927.             samples += avctx->channels;

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

  929.             samples += avctx->channels;

  930.             src ++;

  931.         }

  932. 

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

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

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

  936.                 return src - buf;

  937.             }

  938.         }

  939.         break;

  940.     case CODEC_ID_ADPCM_IMA_WAV:

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

  942.             buf_size = avctx->block_align;

  943. 

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

  945. 

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

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

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

  949.             src+=2;

  950. 

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

  952. 

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

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

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

  956.                 cs->step_index = 88;

  957.             }

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

  959.         }

  960. 

  961.         while(src < buf + buf_size){

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

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

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

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

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

  967.                 src++;

  968.             }

  969.             src += 4*st;

  970.         }

  971.         break;

  972.     case CODEC_ID_ADPCM_4XM:

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

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

  975.         if(st){

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

  977.         }

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

  979.         if(st){

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

  981.         }

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

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

  984. 

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

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

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

  988.             if (st)

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

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

  991.             if (st)

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

  993.         }

  994. 

  995.         src += m<<st;

  996. 

  997.         break;

  998.     case CODEC_ID_ADPCM_MS:

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

  1000.             buf_size = avctx->block_align;

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

  1002.         if (n < 0)

  1003.             return -1;

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

  1005.         block_predictor[1] = 0;

  1006.         if (st)

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

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

  1009.         src+=2;

  1010.         if (st){

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

  1012.             src+=2;

  1013.         }

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

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

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

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

  1018. 

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

  1020.         src+=2;

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

  1022.         if (st) src+=2;

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

  1024.         src+=2;

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

  1026.         if (st) src+=2;

  1027. 

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

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

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

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

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

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

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

  1035.             src ++;

  1036.         }

  1037.         break;

  1038.     case CODEC_ID_ADPCM_IMA_DK4:

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

  1040.             buf_size = avctx->block_align;

  1041. 

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

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

  1044.         src += 4;

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

  1046.         if (st) {

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

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

  1049.             src += 4;

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

  1051.         }

  1052.         while (src < buf + buf_size) {

  1053. 

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

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

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

  1057. 

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

  1059.              * stereo, or another mono sample */

  1060.             if (st)

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

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

  1063.             else

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

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

  1066. 

  1067.             src++;

  1068.         }

  1069.         break;

  1070.     case CODEC_ID_ADPCM_IMA_DK3:

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

  1072.             buf_size = avctx->block_align;

  1073. 

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

  1075.             return -1;

  1076. 

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

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

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

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

  1081.         /* sign extend the predictors */

  1082.         src += 16;

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

  1084. 

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

  1086.          * the buffer is consumed */

  1087.         while (1) {

  1088. 

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

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

  1091. 

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

  1093.             DK3_GET_NEXT_NIBBLE();

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

  1095. 

  1096.             /* process the diff channel predictor */

  1097.             DK3_GET_NEXT_NIBBLE();

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

  1099. 

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

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

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

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

  1104. 

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

  1106.             DK3_GET_NEXT_NIBBLE();

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

  1108. 

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

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

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

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

  1113.         }

  1114.         break;

  1115.     case CODEC_ID_ADPCM_IMA_WS:

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

  1117.         while (src < buf + buf_size) {

  1118. 

  1119.             if (st) {

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

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

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

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

  1124.             } else {

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

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

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

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

  1129.             }

  1130. 

  1131.             src++;

  1132.         }

  1133.         break;

  1134.     case CODEC_ID_ADPCM_XA:

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

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

  1137.         while (buf_size >= 128) {

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

  1139.                 avctx->channels);

  1140.             src += 128;

  1141.             samples += 28 * 8;

  1142.             buf_size -= 128;

  1143.         }

  1144.         break;

  1145.     case CODEC_ID_ADPCM_EA:

  1146.         samples_in_chunk = AV_RL32(src);

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

  1148.             src += buf_size;

  1149.             break;

  1150.         }

  1151.         src += 4;

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

  1153.         src += 2;

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

  1155.         src += 2;

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

  1157.         src += 2;

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

  1159.         src += 2;

  1160. 

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

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

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

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

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

  1166.             src++;

  1167. 

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

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

  1170.             src++;

  1171. 

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

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

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

  1175.                 src++;

  1176. 

  1177.                 next_left_sample = (next_left_sample +

  1178.                     (current_left_sample * coeff1l) +

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

  1180.                 next_right_sample = (next_right_sample +

  1181.                     (current_right_sample * coeff1r) +

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

  1183.                 CLAMP_TO_SHORT(next_left_sample);

  1184.                 CLAMP_TO_SHORT(next_right_sample);

  1185. 

  1186.                 previous_left_sample = current_left_sample;

  1187.                 current_left_sample = next_left_sample;

  1188.                 previous_right_sample = current_right_sample;

  1189.                 current_right_sample = next_right_sample;

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

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

  1192.             }

  1193.         }

  1194.         break;

  1195.     case CODEC_ID_ADPCM_IMA_SMJPEG:

  1196.         c->status[0].predictor = *src;

  1197.         src += 2;

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

  1199.         src++;  /* skip another byte before getting to the meat */

  1200.         while (src < buf + buf_size) {

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

  1202.                 *src & 0x0F, 3);

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

  1204.                 (*src >> 4) & 0x0F, 3);

  1205.             src++;

  1206.         }

  1207.         break;

  1208.     case CODEC_ID_ADPCM_CT:

  1209.         while (src < buf + buf_size) {

  1210.             if (st) {

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

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

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

  1214.                     src[0] & 0x0F);

  1215.             } else {

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

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

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

  1219.                     src[0] & 0x0F);

  1220.             }

  1221.             src++;

  1222.         }

  1223.         break;

  1224.     case CODEC_ID_ADPCM_SBPRO_4:

  1225.     case CODEC_ID_ADPCM_SBPRO_3:

  1226.     case CODEC_ID_ADPCM_SBPRO_2:

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

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

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

  1230.             if (st)

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

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

  1233.         }

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

  1235.             while (src < buf + buf_size) {

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

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

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

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

  1240.                 src++;

  1241.             }

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

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

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

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

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

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

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

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

  1250.                 src++;

  1251.             }

  1252.         } else {

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

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

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

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

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

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

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

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

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

  1262.                 src++;

  1263.             }

  1264.         }

  1265.         break;

  1266.     case CODEC_ID_ADPCM_SWF:

  1267.     {

  1268.         GetBitContext gb;

  1269.         const int *table;

  1270.         int k0, signmask, nb_bits;

  1271.         int size = buf_size*8;

  1272. 

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

  1274. 

  1275.         //read bits & initial values

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

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

  1278.         table = swf_index_tables[nb_bits-2];

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

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

  1281. 

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

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

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

  1285.         }

  1286. 

  1287.         while (get_bits_count(&gb) < size)

  1288.         {

  1289.             int i;

  1290. 

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

  1292.                 // similar to IMA adpcm

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

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

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

  1296.                 int k = k0;

  1297. 

  1298.                 do {

  1299.                     if (delta & k)

  1300.                         vpdiff += step;

  1301.                     step >>= 1;

  1302.                     k >>= 1;

  1303.                 } while(k);

  1304.                 vpdiff += step;

  1305. 

  1306.                 if (delta & signmask)

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

  1308.                 else

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

  1310. 

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

  1312. 

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

  1314.                 c->status[i].predictor = av_clip(c->status[i].predictor, -32768, 32767);

  1315. 

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

  1317.                 if (samples >= samples_end) {

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

  1319.                     return -1;

  1320.                 }

  1321.             }

  1322.         }

  1323.         src += buf_size;

  1324.         break;

  1325.     }

  1326.     case CODEC_ID_ADPCM_YAMAHA:

  1327.         while (src < buf + buf_size) {

  1328.             if (st) {

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

  1330.                         src[0] & 0x0F);

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

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

  1333.             } else {

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

  1335.                         src[0] & 0x0F);

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

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

  1338.             }

  1339.             src++;

  1340.         }

  1341.         break;

  1342.     case CODEC_ID_ADPCM_THP:

  1343.     {

  1344.         int table[2][16];

  1345.         unsigned int samplecnt;

  1346.         int prev[2][2];

  1347.         int ch;

  1348. 

  1349.         if (buf_size < 80) {

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

  1351.             return -1;

  1352.         }

  1353. 

  1354.         src+=4;

  1355.         samplecnt = bytestream_get_be32(&src);

  1356. 

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

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

  1359. 

  1360.         /* Initialize the previous sample.  */

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

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

  1363. 

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

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

  1366.             return -1;

  1367.         }

  1368. 

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

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

  1371. 

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

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

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

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

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

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

  1378. 

  1379.                 /* Decode 14 samples.  */

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

  1381.                     int32_t sampledat;

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

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

  1384. 

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

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

  1387.                     CLAMP_TO_SHORT(sampledat);

  1388.                     *samples = sampledat;

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

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

  1391. 

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

  1393.                        is for the other channel.  */

  1394.                     samples += st;

  1395.                 }

  1396.             }

  1397.         }

  1398. 

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

  1400.            increased exactly one time too often.  */

  1401.         samples -= st;

  1402.         break;

  1403.     }

  1404. 

  1405.     default:

  1406.         return -1;

  1407.     }

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

  1409.     return src - buf;

  1410. }

  1411. 

  1412. 

  1413. 

  1414. #ifdef CONFIG_ENCODERS

  1415. #define ADPCM_ENCODER(id,name)                  \

  1416. AVCodec name ## _encoder = {                    \

  1417.     #name,                                      \

  1418.     CODEC_TYPE_AUDIO,                           \

  1419.     id,                                         \

  1420.     sizeof(ADPCMContext),                       \

  1421.     adpcm_encode_init,                          \

  1422.     adpcm_encode_frame,                         \

  1423.     adpcm_encode_close,                         \

  1424.     NULL,                                       \

  1425. };

  1426. #else

  1427. #define ADPCM_ENCODER(id,name)

  1428. #endif

  1429. 

  1430. #ifdef CONFIG_DECODERS

  1431. #define ADPCM_DECODER(id,name)                  \

  1432. AVCodec name ## _decoder = {                    \

  1433.     #name,                                      \

  1434.     CODEC_TYPE_AUDIO,                           \

  1435.     id,                                         \

  1436.     sizeof(ADPCMContext),                       \

  1437.     adpcm_decode_init,                          \

  1438.     NULL,                                       \

  1439.     NULL,                                       \

  1440.     adpcm_decode_frame,                         \

  1441. };

  1442. #else

  1443. #define ADPCM_DECODER(id,name)

  1444. #endif

  1445. 

  1446. #define ADPCM_CODEC(id, name)                   \

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

  1448. 

  1449. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);

  1450. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);

  1451. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);

  1452. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);

  1453. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);

  1454. ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);

  1455. ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);

  1456. ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);

  1457. ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);

  1458. ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);

  1459. ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);

  1460. ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);

  1461. ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);

  1462. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);

  1463. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);

  1464. ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);

  1465. ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);

  1466. 

  1467. #undef ADPCM_CODEC