3 * Copyright (c) 2001-2003 The ffmpeg Project
5 * This file is part of FFmpeg.
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.
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.
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
24 #include "bytestream.h"
29 * First version by Francois Revol (revol@free.fr)
30 * Fringe ADPCM codecs (e.g., DK3, DK4, Westwood)
31 * by Mike Melanson (melanson@pcisys.net)
32 * CD-ROM XA ADPCM codec by BERO
33 * EA ADPCM decoder by Robin Kay (komadori@myrealbox.com)
34 * EA ADPCM R1/R2/R3 decoder by Peter Ross (pross@xvid.org)
35 * EA IMA EACS decoder by Peter Ross (pross@xvid.org)
36 * EA IMA SEAD decoder by Peter Ross (pross@xvid.org)
37 * EA ADPCM XAS decoder by Peter Ross (pross@xvid.org)
38 * MAXIS EA ADPCM decoder by Robert Marston (rmarston@gmail.com)
39 * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)
41 * Features and limitations:
43 * Reference documents:
44 * http://www.pcisys.net/~melanson/codecs/simpleaudio.html
45 * http://www.geocities.com/SiliconValley/8682/aud3.txt
46 * http://openquicktime.sourceforge.net/plugins.htm
47 * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html
48 * http://www.cs.ucla.edu/~leec/mediabench/applications.html
49 * SoX source code http://home.sprynet.com/~cbagwell/sox.html
52 * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html
53 * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html
54 * readstr http://www.geocities.co.jp/Playtown/2004/
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,
67 * This is the step table. Note that many programs use slight deviations from
68 * this table, but such deviations are negligible:
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
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
89 /** Divided by 4 to fit in 8-bit integers */
90 static const uint8_t AdaptCoeff1[] = {
91 64, 128, 0, 48, 60, 115, 98
94 /** Divided by 4 to fit in 8-bit integers */
95 static const int8_t AdaptCoeff2[] = {
96 0, -64, 0, 16, 0, -52, -58
99 /* These are for CD-ROM XA ADPCM */
100 static const int xa_adpcm_table[5][2] = {
108 static const int ea_adpcm_table[] = {
109 0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
110 3, 4, 7, 8, 10, 11, 0, -1, -3, -4
113 // padded to zero where table size is less then 16
114 static const int swf_index_tables[4][16] = {
116 /*3*/ { -1, -1, 2, 4 },
117 /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },
118 /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }
121 static const int yamaha_indexscale[] = {
122 230, 230, 230, 230, 307, 409, 512, 614,
123 230, 230, 230, 230, 307, 409, 512, 614
126 static const int yamaha_difflookup[] = {
127 1, 3, 5, 7, 9, 11, 13, 15,
128 -1, -3, -5, -7, -9, -11, -13, -15
133 typedef struct ADPCMChannelStatus {
135 short int step_index;
146 } ADPCMChannelStatus;
148 typedef struct TrellisPath {
153 typedef struct TrellisNode {
161 typedef struct ADPCMContext {
162 ADPCMChannelStatus status[6];
164 TrellisNode *node_buf;
165 TrellisNode **nodep_buf;
166 uint8_t *trellis_hash;
169 #define FREEZE_INTERVAL 128
171 /* XXX: implement encoding */
174 static av_cold int adpcm_encode_init(AVCodecContext *avctx)
176 ADPCMContext *s = avctx->priv_data;
179 if (avctx->channels > 2)
180 return -1; /* only stereo or mono =) */
182 if(avctx->trellis && (unsigned)avctx->trellis > 16U){
183 av_log(avctx, AV_LOG_ERROR, "invalid trellis size\n");
187 if (avctx->trellis) {
188 int frontier = 1 << avctx->trellis;
189 int max_paths = frontier * FREEZE_INTERVAL;
190 FF_ALLOC_OR_GOTO(avctx, s->paths, max_paths * sizeof(*s->paths), error);
191 FF_ALLOC_OR_GOTO(avctx, s->node_buf, 2 * frontier * sizeof(*s->node_buf), error);
192 FF_ALLOC_OR_GOTO(avctx, s->nodep_buf, 2 * frontier * sizeof(*s->nodep_buf), error);
193 FF_ALLOC_OR_GOTO(avctx, s->trellis_hash, 65536 * sizeof(*s->trellis_hash), error);
196 switch(avctx->codec->id) {
197 case CODEC_ID_ADPCM_IMA_WAV:
198 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
199 /* and we have 4 bytes per channel overhead */
200 avctx->block_align = BLKSIZE;
201 avctx->bits_per_coded_sample = 4;
202 /* seems frame_size isn't taken into account... have to buffer the samples :-( */
204 case CODEC_ID_ADPCM_IMA_QT:
205 avctx->frame_size = 64;
206 avctx->block_align = 34 * avctx->channels;
208 case CODEC_ID_ADPCM_MS:
209 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
210 /* and we have 7 bytes per channel overhead */
211 avctx->block_align = BLKSIZE;
212 avctx->bits_per_coded_sample = 4;
213 avctx->extradata_size = 32;
214 extradata = avctx->extradata = av_malloc(avctx->extradata_size);
216 return AVERROR(ENOMEM);
217 bytestream_put_le16(&extradata, avctx->frame_size);
218 bytestream_put_le16(&extradata, 7); /* wNumCoef */
219 for (i = 0; i < 7; i++) {
220 bytestream_put_le16(&extradata, AdaptCoeff1[i] * 4);
221 bytestream_put_le16(&extradata, AdaptCoeff2[i] * 4);
224 case CODEC_ID_ADPCM_YAMAHA:
225 avctx->frame_size = BLKSIZE * avctx->channels;
226 avctx->block_align = BLKSIZE;
228 case CODEC_ID_ADPCM_SWF:
229 if (avctx->sample_rate != 11025 &&
230 avctx->sample_rate != 22050 &&
231 avctx->sample_rate != 44100) {
232 av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");
235 avctx->frame_size = 512 * (avctx->sample_rate / 11025);
241 avctx->coded_frame= avcodec_alloc_frame();
242 avctx->coded_frame->key_frame= 1;
247 av_freep(&s->node_buf);
248 av_freep(&s->nodep_buf);
249 av_freep(&s->trellis_hash);
253 static av_cold int adpcm_encode_close(AVCodecContext *avctx)
255 ADPCMContext *s = avctx->priv_data;
256 av_freep(&avctx->coded_frame);
258 av_freep(&s->node_buf);
259 av_freep(&s->nodep_buf);
260 av_freep(&s->trellis_hash);
266 static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
268 int delta = sample - c->prev_sample;
269 int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
270 c->prev_sample += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
271 c->prev_sample = av_clip_int16(c->prev_sample);
272 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
276 static inline unsigned char adpcm_ima_qt_compress_sample(ADPCMChannelStatus *c, short sample)
278 int delta = sample - c->prev_sample;
279 int diff, step = step_table[c->step_index];
280 int nibble = 8*(delta < 0);
283 diff = delta + (step >> 3);
302 c->prev_sample -= diff;
304 c->prev_sample += diff;
306 c->prev_sample = av_clip_int16(c->prev_sample);
307 c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
312 static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
314 int predictor, nibble, bias;
316 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 64;
318 nibble= sample - predictor;
319 if(nibble>=0) bias= c->idelta/2;
320 else bias=-c->idelta/2;
322 nibble= (nibble + bias) / c->idelta;
323 nibble= av_clip(nibble, -8, 7)&0x0F;
325 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
327 c->sample2 = c->sample1;
328 c->sample1 = av_clip_int16(predictor);
330 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
331 if (c->idelta < 16) c->idelta = 16;
336 static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
345 delta = sample - c->predictor;
347 nibble = FFMIN(7, abs(delta)*4/c->step) + (delta<0)*8;
349 c->predictor += ((c->step * yamaha_difflookup[nibble]) / 8);
350 c->predictor = av_clip_int16(c->predictor);
351 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
352 c->step = av_clip(c->step, 127, 24567);
357 static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
358 uint8_t *dst, ADPCMChannelStatus *c, int n)
360 //FIXME 6% faster if frontier is a compile-time constant
361 ADPCMContext *s = avctx->priv_data;
362 const int frontier = 1 << avctx->trellis;
363 const int stride = avctx->channels;
364 const int version = avctx->codec->id;
365 TrellisPath *paths = s->paths, *p;
366 TrellisNode *node_buf = s->node_buf;
367 TrellisNode **nodep_buf = s->nodep_buf;
368 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
369 TrellisNode **nodes_next = nodep_buf + frontier;
370 int pathn = 0, froze = -1, i, j, k, generation = 0;
371 uint8_t *hash = s->trellis_hash;
372 memset(hash, 0xff, 65536 * sizeof(*hash));
374 memset(nodep_buf, 0, 2 * frontier * sizeof(*nodep_buf));
375 nodes[0] = node_buf + frontier;
378 nodes[0]->step = c->step_index;
379 nodes[0]->sample1 = c->sample1;
380 nodes[0]->sample2 = c->sample2;
381 if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_IMA_QT) || (version == CODEC_ID_ADPCM_SWF))
382 nodes[0]->sample1 = c->prev_sample;
383 if(version == CODEC_ID_ADPCM_MS)
384 nodes[0]->step = c->idelta;
385 if(version == CODEC_ID_ADPCM_YAMAHA) {
387 nodes[0]->step = 127;
388 nodes[0]->sample1 = 0;
390 nodes[0]->step = c->step;
391 nodes[0]->sample1 = c->predictor;
396 TrellisNode *t = node_buf + frontier*(i&1);
398 int sample = samples[i*stride];
400 memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
401 for(j=0; j<frontier && nodes[j]; j++) {
402 // higher j have higher ssd already, so they're likely to yield a suboptimal next sample too
403 const int range = (j < frontier/2) ? 1 : 0;
404 const int step = nodes[j]->step;
406 if(version == CODEC_ID_ADPCM_MS) {
407 const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 64;
408 const int div = (sample - predictor) / step;
409 const int nmin = av_clip(div-range, -8, 6);
410 const int nmax = av_clip(div+range, -7, 7);
411 for(nidx=nmin; nidx<=nmax; nidx++) {
412 const int nibble = nidx & 0xf;
413 int dec_sample = predictor + nidx * step;
414 #define STORE_NODE(NAME, STEP_INDEX)\
420 dec_sample = av_clip_int16(dec_sample);\
421 d = sample - dec_sample;\
422 ssd = nodes[j]->ssd + d*d;\
423 /* Check for wraparound, skip such samples completely. \
424 * Note, changing ssd to a 64 bit variable would be \
425 * simpler, avoiding this check, but it's slower on \
426 * x86 32 bit at the moment. */\
427 if (ssd < nodes[j]->ssd)\
429 /* Collapse any two states with the same previous sample value. \
430 * One could also distinguish states by step and by 2nd to last
431 * sample, but the effects of that are negligible.
432 * Since nodes in the previous generation are iterated
433 * through a heap, they're roughly ordered from better to
434 * worse, but not strictly ordered. Therefore, an earlier
435 * node with the same sample value is better in most cases
436 * (and thus the current is skipped), but not strictly
437 * in all cases. Only skipping samples where ssd >=
438 * ssd of the earlier node with the same sample gives
439 * slightly worse quality, though, for some reason. */ \
440 h = &hash[(uint16_t) dec_sample];\
441 if (*h == generation)\
443 if (heap_pos < frontier) {\
446 /* Try to replace one of the leaf nodes with the new \
447 * one, but try a different slot each time. */\
448 pos = (frontier >> 1) + (heap_pos & ((frontier >> 1) - 1));\
449 if (ssd > nodes_next[pos]->ssd)\
454 u = nodes_next[pos];\
456 assert(pathn < FREEZE_INTERVAL<<avctx->trellis);\
458 nodes_next[pos] = u;\
462 u->step = STEP_INDEX;\
463 u->sample2 = nodes[j]->sample1;\
464 u->sample1 = dec_sample;\
465 paths[u->path].nibble = nibble;\
466 paths[u->path].prev = nodes[j]->path;\
467 /* Sift the newly inserted node up in the heap to \
468 * restore the heap property. */\
470 int parent = (pos - 1) >> 1;\
471 if (nodes_next[parent]->ssd <= ssd)\
473 FFSWAP(TrellisNode*, nodes_next[parent], nodes_next[pos]);\
477 STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
479 } else if((version == CODEC_ID_ADPCM_IMA_WAV)|| (version == CODEC_ID_ADPCM_IMA_QT)|| (version == CODEC_ID_ADPCM_SWF)) {
480 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
481 const int predictor = nodes[j]->sample1;\
482 const int div = (sample - predictor) * 4 / STEP_TABLE;\
483 int nmin = av_clip(div-range, -7, 6);\
484 int nmax = av_clip(div+range, -6, 7);\
485 if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
487 for(nidx=nmin; nidx<=nmax; nidx++) {\
488 const int nibble = nidx<0 ? 7-nidx : nidx;\
489 int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
490 STORE_NODE(NAME, STEP_INDEX);\
492 LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
493 } else { //CODEC_ID_ADPCM_YAMAHA
494 LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
505 if (generation == 255) {
506 memset(hash, 0xff, 65536 * sizeof(*hash));
511 if(nodes[0]->ssd > (1<<28)) {
512 for(j=1; j<frontier && nodes[j]; j++)
513 nodes[j]->ssd -= nodes[0]->ssd;
517 // merge old paths to save memory
518 if(i == froze + FREEZE_INTERVAL) {
519 p = &paths[nodes[0]->path];
520 for(k=i; k>froze; k--) {
526 // other nodes might use paths that don't coincide with the frozen one.
527 // checking which nodes do so is too slow, so just kill them all.
528 // this also slightly improves quality, but I don't know why.
529 memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
533 p = &paths[nodes[0]->path];
534 for(i=n-1; i>froze; i--) {
539 c->predictor = nodes[0]->sample1;
540 c->sample1 = nodes[0]->sample1;
541 c->sample2 = nodes[0]->sample2;
542 c->step_index = nodes[0]->step;
543 c->step = nodes[0]->step;
544 c->idelta = nodes[0]->step;
547 static int adpcm_encode_frame(AVCodecContext *avctx,
548 unsigned char *frame, int buf_size, void *data)
553 ADPCMContext *c = avctx->priv_data;
557 samples = (short *)data;
558 st= avctx->channels == 2;
559 /* n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
561 switch(avctx->codec->id) {
562 case CODEC_ID_ADPCM_IMA_WAV:
563 n = avctx->frame_size / 8;
564 c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
565 /* c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
566 bytestream_put_le16(&dst, c->status[0].prev_sample);
567 *dst++ = (unsigned char)c->status[0].step_index;
568 *dst++ = 0; /* unknown */
570 if (avctx->channels == 2) {
571 c->status[1].prev_sample = (signed short)samples[0];
572 /* c->status[1].step_index = 0; */
573 bytestream_put_le16(&dst, c->status[1].prev_sample);
574 *dst++ = (unsigned char)c->status[1].step_index;
579 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
580 if(avctx->trellis > 0) {
581 FF_ALLOC_OR_GOTO(avctx, buf, 2*n*8, error);
582 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n*8);
583 if(avctx->channels == 2)
584 adpcm_compress_trellis(avctx, samples+1, buf + n*8, &c->status[1], n*8);
586 *dst++ = buf[8*i+0] | (buf[8*i+1] << 4);
587 *dst++ = buf[8*i+2] | (buf[8*i+3] << 4);
588 *dst++ = buf[8*i+4] | (buf[8*i+5] << 4);
589 *dst++ = buf[8*i+6] | (buf[8*i+7] << 4);
590 if (avctx->channels == 2) {
591 uint8_t *buf1 = buf + n*8;
592 *dst++ = buf1[8*i+0] | (buf1[8*i+1] << 4);
593 *dst++ = buf1[8*i+2] | (buf1[8*i+3] << 4);
594 *dst++ = buf1[8*i+4] | (buf1[8*i+5] << 4);
595 *dst++ = buf1[8*i+6] | (buf1[8*i+7] << 4);
601 *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]);
602 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4;
604 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]);
605 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4;
607 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]);
608 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4;
610 *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]);
611 *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4;
614 if (avctx->channels == 2) {
615 *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
616 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
618 *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
619 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
621 *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
622 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
624 *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
625 *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
628 samples += 8 * avctx->channels;
631 case CODEC_ID_ADPCM_IMA_QT:
635 init_put_bits(&pb, dst, buf_size*8);
637 for(ch=0; ch<avctx->channels; ch++){
638 put_bits(&pb, 9, (c->status[ch].prev_sample + 0x10000) >> 7);
639 put_bits(&pb, 7, c->status[ch].step_index);
640 if(avctx->trellis > 0) {
642 adpcm_compress_trellis(avctx, samples+ch, buf, &c->status[ch], 64);
644 put_bits(&pb, 4, buf[i^1]);
646 for (i=0; i<64; i+=2){
648 t1 = adpcm_ima_qt_compress_sample(&c->status[ch], samples[avctx->channels*(i+0)+ch]);
649 t2 = adpcm_ima_qt_compress_sample(&c->status[ch], samples[avctx->channels*(i+1)+ch]);
650 put_bits(&pb, 4, t2);
651 put_bits(&pb, 4, t1);
657 dst += put_bits_count(&pb)>>3;
660 case CODEC_ID_ADPCM_SWF:
664 init_put_bits(&pb, dst, buf_size*8);
666 n = avctx->frame_size-1;
668 //Store AdpcmCodeSize
669 put_bits(&pb, 2, 2); //Set 4bits flash adpcm format
671 //Init the encoder state
672 for(i=0; i<avctx->channels; i++){
673 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits
674 put_sbits(&pb, 16, samples[i]);
675 put_bits(&pb, 6, c->status[i].step_index);
676 c->status[i].prev_sample = (signed short)samples[i];
679 if(avctx->trellis > 0) {
680 FF_ALLOC_OR_GOTO(avctx, buf, 2*n, error);
681 adpcm_compress_trellis(avctx, samples+2, buf, &c->status[0], n);
682 if (avctx->channels == 2)
683 adpcm_compress_trellis(avctx, samples+3, buf+n, &c->status[1], n);
685 put_bits(&pb, 4, buf[i]);
686 if (avctx->channels == 2)
687 put_bits(&pb, 4, buf[n+i]);
691 for (i=1; i<avctx->frame_size; i++) {
692 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]));
693 if (avctx->channels == 2)
694 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]));
698 dst += put_bits_count(&pb)>>3;
701 case CODEC_ID_ADPCM_MS:
702 for(i=0; i<avctx->channels; i++){
706 c->status[i].coeff1 = AdaptCoeff1[predictor];
707 c->status[i].coeff2 = AdaptCoeff2[predictor];
709 for(i=0; i<avctx->channels; i++){
710 if (c->status[i].idelta < 16)
711 c->status[i].idelta = 16;
713 bytestream_put_le16(&dst, c->status[i].idelta);
715 for(i=0; i<avctx->channels; i++){
716 c->status[i].sample2= *samples++;
718 for(i=0; i<avctx->channels; i++){
719 c->status[i].sample1= *samples++;
721 bytestream_put_le16(&dst, c->status[i].sample1);
723 for(i=0; i<avctx->channels; i++)
724 bytestream_put_le16(&dst, c->status[i].sample2);
726 if(avctx->trellis > 0) {
727 int n = avctx->block_align - 7*avctx->channels;
728 FF_ALLOC_OR_GOTO(avctx, buf, 2*n, error);
729 if(avctx->channels == 1) {
730 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n);
732 *dst++ = (buf[i] << 4) | buf[i+1];
734 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n);
735 adpcm_compress_trellis(avctx, samples+1, buf+n, &c->status[1], n);
737 *dst++ = (buf[i] << 4) | buf[n+i];
741 for(i=7*avctx->channels; i<avctx->block_align; i++) {
743 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
744 nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
748 case CODEC_ID_ADPCM_YAMAHA:
749 n = avctx->frame_size / 2;
750 if(avctx->trellis > 0) {
751 FF_ALLOC_OR_GOTO(avctx, buf, 2*n*2, error);
753 if(avctx->channels == 1) {
754 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n);
756 *dst++ = buf[i] | (buf[i+1] << 4);
758 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n);
759 adpcm_compress_trellis(avctx, samples+1, buf+n, &c->status[1], n);
761 *dst++ = buf[i] | (buf[n+i] << 4);
765 for (n *= avctx->channels; n>0; n--) {
767 nibble = adpcm_yamaha_compress_sample(&c->status[ 0], *samples++);
768 nibble |= adpcm_yamaha_compress_sample(&c->status[st], *samples++) << 4;
778 #endif //CONFIG_ENCODERS
780 static av_cold int adpcm_decode_init(AVCodecContext * avctx)
782 ADPCMContext *c = avctx->priv_data;
783 unsigned int max_channels = 2;
785 switch(avctx->codec->id) {
786 case CODEC_ID_ADPCM_EA_R1:
787 case CODEC_ID_ADPCM_EA_R2:
788 case CODEC_ID_ADPCM_EA_R3:
789 case CODEC_ID_ADPCM_EA_XAS:
793 if(avctx->channels > max_channels){
797 switch(avctx->codec->id) {
798 case CODEC_ID_ADPCM_CT:
799 c->status[0].step = c->status[1].step = 511;
801 case CODEC_ID_ADPCM_IMA_WAV:
802 if (avctx->bits_per_coded_sample != 4) {
803 av_log(avctx, AV_LOG_ERROR, "Only 4-bit ADPCM IMA WAV files are supported\n");
807 case CODEC_ID_ADPCM_IMA_WS:
808 if (avctx->extradata && avctx->extradata_size == 2 * 4) {
809 c->status[0].predictor = AV_RL32(avctx->extradata);
810 c->status[1].predictor = AV_RL32(avctx->extradata + 4);
816 avctx->sample_fmt = AV_SAMPLE_FMT_S16;
820 static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
824 int sign, delta, diff, step;
826 step = step_table[c->step_index];
827 step_index = c->step_index + index_table[(unsigned)nibble];
828 if (step_index < 0) step_index = 0;
829 else if (step_index > 88) step_index = 88;
833 /* perform direct multiplication instead of series of jumps proposed by
834 * the reference ADPCM implementation since modern CPUs can do the mults
836 diff = ((2 * delta + 1) * step) >> shift;
837 predictor = c->predictor;
838 if (sign) predictor -= diff;
839 else predictor += diff;
841 c->predictor = av_clip_int16(predictor);
842 c->step_index = step_index;
844 return (short)c->predictor;
847 static inline int adpcm_ima_qt_expand_nibble(ADPCMChannelStatus *c, int nibble, int shift)
853 step = step_table[c->step_index];
854 step_index = c->step_index + index_table[nibble];
855 step_index = av_clip(step_index, 0, 88);
858 if (nibble & 4) diff += step;
859 if (nibble & 2) diff += step >> 1;
860 if (nibble & 1) diff += step >> 2;
863 predictor = c->predictor - diff;
865 predictor = c->predictor + diff;
867 c->predictor = av_clip_int16(predictor);
868 c->step_index = step_index;
873 static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
877 predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 64;
878 predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
880 c->sample2 = c->sample1;
881 c->sample1 = av_clip_int16(predictor);
882 c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
883 if (c->idelta < 16) c->idelta = 16;
888 static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
890 int sign, delta, diff;
895 /* perform direct multiplication instead of series of jumps proposed by
896 * the reference ADPCM implementation since modern CPUs can do the mults
898 diff = ((2 * delta + 1) * c->step) >> 3;
899 /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
900 c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);
901 c->predictor = av_clip_int16(c->predictor);
902 /* calculate new step and clamp it to range 511..32767 */
903 new_step = (AdaptationTable[nibble & 7] * c->step) >> 8;
904 c->step = av_clip(new_step, 511, 32767);
906 return (short)c->predictor;
909 static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
911 int sign, delta, diff;
913 sign = nibble & (1<<(size-1));
914 delta = nibble & ((1<<(size-1))-1);
915 diff = delta << (7 + c->step + shift);
918 c->predictor = av_clip(c->predictor + (sign ? -diff : diff), -16384,16256);
920 /* calculate new step */
921 if (delta >= (2*size - 3) && c->step < 3)
923 else if (delta == 0 && c->step > 0)
926 return (short) c->predictor;
929 static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
936 c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
937 c->predictor = av_clip_int16(c->predictor);
938 c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
939 c->step = av_clip(c->step, 127, 24567);
943 static void xa_decode(short *out, const unsigned char *in,
944 ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
947 int shift,filter,f0,f1;
953 shift = 12 - (in[4+i*2] & 15);
954 filter = in[4+i*2] >> 4;
955 f0 = xa_adpcm_table[filter][0];
956 f1 = xa_adpcm_table[filter][1];
964 t = (signed char)(d<<4)>>4;
965 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
967 s_1 = av_clip_int16(s);
972 if (inc==2) { /* stereo */
975 s_1 = right->sample1;
976 s_2 = right->sample2;
977 out = out + 1 - 28*2;
980 shift = 12 - (in[5+i*2] & 15);
981 filter = in[5+i*2] >> 4;
983 f0 = xa_adpcm_table[filter][0];
984 f1 = xa_adpcm_table[filter][1];
989 t = (signed char)d >> 4;
990 s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
992 s_1 = av_clip_int16(s);
997 if (inc==2) { /* stereo */
998 right->sample1 = s_1;
999 right->sample2 = s_2;
1002 left->sample1 = s_1;
1003 left->sample2 = s_2;
1009 /* DK3 ADPCM support macro */
1010 #define DK3_GET_NEXT_NIBBLE() \
1011 if (decode_top_nibble_next) \
1013 nibble = last_byte >> 4; \
1014 decode_top_nibble_next = 0; \
1018 last_byte = *src++; \
1019 if (src >= buf + buf_size) break; \
1020 nibble = last_byte & 0x0F; \
1021 decode_top_nibble_next = 1; \
1024 static int adpcm_decode_frame(AVCodecContext *avctx,
1025 void *data, int *data_size,
1028 const uint8_t *buf = avpkt->data;
1029 int buf_size = avpkt->size;
1030 ADPCMContext *c = avctx->priv_data;
1031 ADPCMChannelStatus *cs;
1032 int n, m, channel, i;
1033 int block_predictor[2];
1037 int st; /* stereo */
1039 /* DK3 ADPCM accounting variables */
1040 unsigned char last_byte = 0;
1041 unsigned char nibble;
1042 int decode_top_nibble_next = 0;
1045 /* EA ADPCM state variables */
1046 uint32_t samples_in_chunk;
1047 int32_t previous_left_sample, previous_right_sample;
1048 int32_t current_left_sample, current_right_sample;
1049 int32_t next_left_sample, next_right_sample;
1050 int32_t coeff1l, coeff2l, coeff1r, coeff2r;
1051 uint8_t shift_left, shift_right;
1053 int coeff[2][2], shift[2];//used in EA MAXIS ADPCM
1058 //should protect all 4bit ADPCM variants
1059 //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
1061 if(*data_size/4 < buf_size + 8)
1065 samples_end= samples + *data_size/2;
1069 st = avctx->channels == 2 ? 1 : 0;
1071 switch(avctx->codec->id) {
1072 case CODEC_ID_ADPCM_IMA_QT:
1073 n = buf_size - 2*avctx->channels;
1074 for (channel = 0; channel < avctx->channels; channel++) {
1077 cs = &(c->status[channel]);
1078 /* (pppppp) (piiiiiii) */
1080 /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
1081 predictor = AV_RB16(src);
1082 step_index = predictor & 0x7F;
1083 predictor &= 0xFF80;
1087 if (cs->step_index == step_index) {
1088 int diff = (int)predictor - cs->predictor;
1095 cs->step_index = step_index;
1096 cs->predictor = predictor;
1099 if (cs->step_index > 88){
1100 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
1101 cs->step_index = 88;
1104 samples = (short*)data + channel;
1106 for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
1107 *samples = adpcm_ima_qt_expand_nibble(cs, src[0] & 0x0F, 3);
1108 samples += avctx->channels;
1109 *samples = adpcm_ima_qt_expand_nibble(cs, src[0] >> 4 , 3);
1110 samples += avctx->channels;
1117 case CODEC_ID_ADPCM_IMA_WAV:
1118 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1119 buf_size = avctx->block_align;
1121 // samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
1123 for(i=0; i<avctx->channels; i++){
1124 cs = &(c->status[i]);
1125 cs->predictor = *samples++ = (int16_t)bytestream_get_le16(&src);
1127 cs->step_index = *src++;
1128 if (cs->step_index > 88){
1129 av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
1130 cs->step_index = 88;
1132 if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
1135 while(src < buf + buf_size){
1137 for(i=0; i<=st; i++)
1138 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
1139 for(i=0; i<=st; i++)
1140 *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4 , 3);
1146 case CODEC_ID_ADPCM_4XM:
1147 cs = &(c->status[0]);
1148 c->status[0].predictor= (int16_t)bytestream_get_le16(&src);
1150 c->status[1].predictor= (int16_t)bytestream_get_le16(&src);
1152 c->status[0].step_index= (int16_t)bytestream_get_le16(&src);
1154 c->status[1].step_index= (int16_t)bytestream_get_le16(&src);
1156 if (cs->step_index < 0) cs->step_index = 0;
1157 if (cs->step_index > 88) cs->step_index = 88;
1159 m= (buf_size - (src - buf))>>st;
1160 for(i=0; i<m; i++) {
1161 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
1163 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
1164 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
1166 *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
1172 case CODEC_ID_ADPCM_MS:
1173 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1174 buf_size = avctx->block_align;
1175 n = buf_size - 7 * avctx->channels;
1178 block_predictor[0] = av_clip(*src++, 0, 6);
1179 block_predictor[1] = 0;
1181 block_predictor[1] = av_clip(*src++, 0, 6);
1182 c->status[0].idelta = (int16_t)bytestream_get_le16(&src);
1184 c->status[1].idelta = (int16_t)bytestream_get_le16(&src);
1186 c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
1187 c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
1188 c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
1189 c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
1191 c->status[0].sample1 = bytestream_get_le16(&src);
1192 if (st) c->status[1].sample1 = bytestream_get_le16(&src);
1193 c->status[0].sample2 = bytestream_get_le16(&src);
1194 if (st) c->status[1].sample2 = bytestream_get_le16(&src);
1196 *samples++ = c->status[0].sample2;
1197 if (st) *samples++ = c->status[1].sample2;
1198 *samples++ = c->status[0].sample1;
1199 if (st) *samples++ = c->status[1].sample1;
1201 *samples++ = adpcm_ms_expand_nibble(&c->status[0 ], src[0] >> 4 );
1202 *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1206 case CODEC_ID_ADPCM_IMA_DK4:
1207 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1208 buf_size = avctx->block_align;
1210 c->status[0].predictor = (int16_t)bytestream_get_le16(&src);
1211 c->status[0].step_index = *src++;
1213 *samples++ = c->status[0].predictor;
1215 c->status[1].predictor = (int16_t)bytestream_get_le16(&src);
1216 c->status[1].step_index = *src++;
1218 *samples++ = c->status[1].predictor;
1220 while (src < buf + buf_size) {
1222 /* take care of the top nibble (always left or mono channel) */
1223 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1226 /* take care of the bottom nibble, which is right sample for
1227 * stereo, or another mono sample */
1229 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1232 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1238 case CODEC_ID_ADPCM_IMA_DK3:
1239 if (avctx->block_align != 0 && buf_size > avctx->block_align)
1240 buf_size = avctx->block_align;
1242 if(buf_size + 16 > (samples_end - samples)*3/8)
1245 c->status[0].predictor = (int16_t)AV_RL16(src + 10);
1246 c->status[1].predictor = (int16_t)AV_RL16(src + 12);
1247 c->status[0].step_index = src[14];
1248 c->status[1].step_index = src[15];
1249 /* sign extend the predictors */
1251 diff_channel = c->status[1].predictor;
1253 /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1254 * the buffer is consumed */
1257 /* for this algorithm, c->status[0] is the sum channel and
1258 * c->status[1] is the diff channel */
1260 /* process the first predictor of the sum channel */
1261 DK3_GET_NEXT_NIBBLE();
1262 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1264 /* process the diff channel predictor */
1265 DK3_GET_NEXT_NIBBLE();
1266 adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1268 /* process the first pair of stereo PCM samples */
1269 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1270 *samples++ = c->status[0].predictor + c->status[1].predictor;
1271 *samples++ = c->status[0].predictor - c->status[1].predictor;
1273 /* process the second predictor of the sum channel */
1274 DK3_GET_NEXT_NIBBLE();
1275 adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1277 /* process the second pair of stereo PCM samples */
1278 diff_channel = (diff_channel + c->status[1].predictor) / 2;
1279 *samples++ = c->status[0].predictor + c->status[1].predictor;
1280 *samples++ = c->status[0].predictor - c->status[1].predictor;
1283 case CODEC_ID_ADPCM_IMA_ISS:
1284 c->status[0].predictor = (int16_t)AV_RL16(src + 0);
1285 c->status[0].step_index = src[2];
1288 c->status[1].predictor = (int16_t)AV_RL16(src + 0);
1289 c->status[1].step_index = src[2];
1293 while (src < buf + buf_size) {
1296 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1298 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1301 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1303 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1310 case CODEC_ID_ADPCM_IMA_WS:
1311 /* no per-block initialization; just start decoding the data */
1312 while (src < buf + buf_size) {
1315 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1317 *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1320 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1322 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1329 case CODEC_ID_ADPCM_XA:
1330 while (buf_size >= 128) {
1331 xa_decode(samples, src, &c->status[0], &c->status[1],
1338 case CODEC_ID_ADPCM_IMA_EA_EACS:
1339 samples_in_chunk = bytestream_get_le32(&src) >> (1-st);
1341 if (samples_in_chunk > buf_size-4-(8<<st)) {
1342 src += buf_size - 4;
1346 for (i=0; i<=st; i++)
1347 c->status[i].step_index = bytestream_get_le32(&src);
1348 for (i=0; i<=st; i++)
1349 c->status[i].predictor = bytestream_get_le32(&src);
1351 for (; samples_in_chunk; samples_in_chunk--, src++) {
1352 *samples++ = adpcm_ima_expand_nibble(&c->status[0], *src>>4, 3);
1353 *samples++ = adpcm_ima_expand_nibble(&c->status[st], *src&0x0F, 3);
1356 case CODEC_ID_ADPCM_IMA_EA_SEAD:
1357 for (; src < buf+buf_size; src++) {
1358 *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[0] >> 4, 6);
1359 *samples++ = adpcm_ima_expand_nibble(&c->status[st],src[0]&0x0F, 6);
1362 case CODEC_ID_ADPCM_EA:
1363 if (buf_size < 12 || AV_RL32(src) > (buf_size - 12)/30*28) {
1367 samples_in_chunk = AV_RL32(src);
1369 current_left_sample = (int16_t)bytestream_get_le16(&src);
1370 previous_left_sample = (int16_t)bytestream_get_le16(&src);
1371 current_right_sample = (int16_t)bytestream_get_le16(&src);
1372 previous_right_sample = (int16_t)bytestream_get_le16(&src);
1374 for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1375 coeff1l = ea_adpcm_table[ *src >> 4 ];
1376 coeff2l = ea_adpcm_table[(*src >> 4 ) + 4];
1377 coeff1r = ea_adpcm_table[*src & 0x0F];
1378 coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1381 shift_left = (*src >> 4 ) + 8;
1382 shift_right = (*src & 0x0F) + 8;
1385 for (count2 = 0; count2 < 28; count2++) {
1386 next_left_sample = (int32_t)((*src & 0xF0) << 24) >> shift_left;
1387 next_right_sample = (int32_t)((*src & 0x0F) << 28) >> shift_right;
1390 next_left_sample = (next_left_sample +
1391 (current_left_sample * coeff1l) +
1392 (previous_left_sample * coeff2l) + 0x80) >> 8;
1393 next_right_sample = (next_right_sample +
1394 (current_right_sample * coeff1r) +
1395 (previous_right_sample * coeff2r) + 0x80) >> 8;
1397 previous_left_sample = current_left_sample;
1398 current_left_sample = av_clip_int16(next_left_sample);
1399 previous_right_sample = current_right_sample;
1400 current_right_sample = av_clip_int16(next_right_sample);
1401 *samples++ = (unsigned short)current_left_sample;
1402 *samples++ = (unsigned short)current_right_sample;
1406 if (src - buf == buf_size - 2)
1407 src += 2; // Skip terminating 0x0000
1410 case CODEC_ID_ADPCM_EA_MAXIS_XA:
1411 for(channel = 0; channel < avctx->channels; channel++) {
1413 coeff[channel][i] = ea_adpcm_table[(*src >> 4) + 4*i];
1414 shift[channel] = (*src & 0x0F) + 8;
1417 for (count1 = 0; count1 < (buf_size - avctx->channels) / avctx->channels; count1++) {
1418 for(i = 4; i >= 0; i-=4) { /* Pairwise samples LL RR (st) or LL LL (mono) */
1419 for(channel = 0; channel < avctx->channels; channel++) {
1420 int32_t sample = (int32_t)(((*(src+channel) >> i) & 0x0F) << 0x1C) >> shift[channel];
1422 c->status[channel].sample1 * coeff[channel][0] +
1423 c->status[channel].sample2 * coeff[channel][1] + 0x80) >> 8;
1424 c->status[channel].sample2 = c->status[channel].sample1;
1425 c->status[channel].sample1 = av_clip_int16(sample);
1426 *samples++ = c->status[channel].sample1;
1429 src+=avctx->channels;
1432 case CODEC_ID_ADPCM_EA_R1:
1433 case CODEC_ID_ADPCM_EA_R2:
1434 case CODEC_ID_ADPCM_EA_R3: {
1435 /* channel numbering
1437 4chan: 0=fl, 1=rl, 2=fr, 3=rr
1438 6chan: 0=fl, 1=c, 2=fr, 3=rl, 4=rr, 5=sub */
1439 const int big_endian = avctx->codec->id == CODEC_ID_ADPCM_EA_R3;
1440 int32_t previous_sample, current_sample, next_sample;
1441 int32_t coeff1, coeff2;
1443 unsigned int channel;
1445 const uint8_t *srcC;
1446 const uint8_t *src_end = buf + buf_size;
1448 samples_in_chunk = (big_endian ? bytestream_get_be32(&src)
1449 : bytestream_get_le32(&src)) / 28;
1450 if (samples_in_chunk > UINT32_MAX/(28*avctx->channels) ||
1451 28*samples_in_chunk*avctx->channels > samples_end-samples) {
1452 src += buf_size - 4;
1456 for (channel=0; channel<avctx->channels; channel++) {
1457 int32_t offset = (big_endian ? bytestream_get_be32(&src)
1458 : bytestream_get_le32(&src))
1459 + (avctx->channels-channel-1) * 4;
1461 if ((offset < 0) || (offset >= src_end - src - 4)) break;
1462 srcC = src + offset;
1463 samplesC = samples + channel;
1465 if (avctx->codec->id == CODEC_ID_ADPCM_EA_R1) {
1466 current_sample = (int16_t)bytestream_get_le16(&srcC);
1467 previous_sample = (int16_t)bytestream_get_le16(&srcC);
1469 current_sample = c->status[channel].predictor;
1470 previous_sample = c->status[channel].prev_sample;
1473 for (count1=0; count1<samples_in_chunk; count1++) {
1474 if (*srcC == 0xEE) { /* only seen in R2 and R3 */
1476 if (srcC > src_end - 30*2) break;
1477 current_sample = (int16_t)bytestream_get_be16(&srcC);
1478 previous_sample = (int16_t)bytestream_get_be16(&srcC);
1480 for (count2=0; count2<28; count2++) {
1481 *samplesC = (int16_t)bytestream_get_be16(&srcC);
1482 samplesC += avctx->channels;
1485 coeff1 = ea_adpcm_table[ *srcC>>4 ];
1486 coeff2 = ea_adpcm_table[(*srcC>>4) + 4];
1487 shift = (*srcC++ & 0x0F) + 8;
1489 if (srcC > src_end - 14) break;
1490 for (count2=0; count2<28; count2++) {
1492 next_sample = (int32_t)((*srcC++ & 0x0F) << 28) >> shift;
1494 next_sample = (int32_t)((*srcC & 0xF0) << 24) >> shift;
1496 next_sample += (current_sample * coeff1) +
1497 (previous_sample * coeff2);
1498 next_sample = av_clip_int16(next_sample >> 8);
1500 previous_sample = current_sample;
1501 current_sample = next_sample;
1502 *samplesC = current_sample;
1503 samplesC += avctx->channels;
1508 if (avctx->codec->id != CODEC_ID_ADPCM_EA_R1) {
1509 c->status[channel].predictor = current_sample;
1510 c->status[channel].prev_sample = previous_sample;
1514 src = src + buf_size - (4 + 4*avctx->channels);
1515 samples += 28 * samples_in_chunk * avctx->channels;
1518 case CODEC_ID_ADPCM_EA_XAS:
1519 if (samples_end-samples < 32*4*avctx->channels
1520 || buf_size < (4+15)*4*avctx->channels) {
1524 for (channel=0; channel<avctx->channels; channel++) {
1525 int coeff[2][4], shift[4];
1526 short *s2, *s = &samples[channel];
1527 for (n=0; n<4; n++, s+=32*avctx->channels) {
1529 coeff[i][n] = ea_adpcm_table[(src[0]&0x0F)+4*i];
1530 shift[n] = (src[2]&0x0F) + 8;
1531 for (s2=s, i=0; i<2; i++, src+=2, s2+=avctx->channels)
1532 s2[0] = (src[0]&0xF0) + (src[1]<<8);
1535 for (m=2; m<32; m+=2) {
1536 s = &samples[m*avctx->channels + channel];
1537 for (n=0; n<4; n++, src++, s+=32*avctx->channels) {
1538 for (s2=s, i=0; i<8; i+=4, s2+=avctx->channels) {
1539 int level = (int32_t)((*src & (0xF0>>i)) << (24+i)) >> shift[n];
1540 int pred = s2[-1*avctx->channels] * coeff[0][n]
1541 + s2[-2*avctx->channels] * coeff[1][n];
1542 s2[0] = av_clip_int16((level + pred + 0x80) >> 8);
1547 samples += 32*4*avctx->channels;
1549 case CODEC_ID_ADPCM_IMA_AMV:
1550 case CODEC_ID_ADPCM_IMA_SMJPEG:
1551 c->status[0].predictor = (int16_t)bytestream_get_le16(&src);
1552 c->status[0].step_index = bytestream_get_le16(&src);
1554 if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)
1557 while (src < buf + buf_size) {
1562 if (avctx->codec->id == CODEC_ID_ADPCM_IMA_AMV)
1563 FFSWAP(char, hi, lo);
1565 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1567 *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1572 case CODEC_ID_ADPCM_CT:
1573 while (src < buf + buf_size) {
1575 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1577 *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1580 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1582 *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1588 case CODEC_ID_ADPCM_SBPRO_4:
1589 case CODEC_ID_ADPCM_SBPRO_3:
1590 case CODEC_ID_ADPCM_SBPRO_2:
1591 if (!c->status[0].step_index) {
1592 /* the first byte is a raw sample */
1593 *samples++ = 128 * (*src++ - 0x80);
1595 *samples++ = 128 * (*src++ - 0x80);
1596 c->status[0].step_index = 1;
1598 if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1599 while (src < buf + buf_size) {
1600 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1602 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1603 src[0] & 0x0F, 4, 0);
1606 } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1607 while (src < buf + buf_size && samples + 2 < samples_end) {
1608 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1609 src[0] >> 5 , 3, 0);
1610 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1611 (src[0] >> 2) & 0x07, 3, 0);
1612 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1613 src[0] & 0x03, 2, 0);
1617 while (src < buf + buf_size && samples + 3 < samples_end) {
1618 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1619 src[0] >> 6 , 2, 2);
1620 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1621 (src[0] >> 4) & 0x03, 2, 2);
1622 *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1623 (src[0] >> 2) & 0x03, 2, 2);
1624 *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1625 src[0] & 0x03, 2, 2);
1630 case CODEC_ID_ADPCM_SWF:
1634 int k0, signmask, nb_bits, count;
1635 int size = buf_size*8;
1637 init_get_bits(&gb, buf, size);
1639 //read bits & initial values
1640 nb_bits = get_bits(&gb, 2)+2;
1641 //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1642 table = swf_index_tables[nb_bits-2];
1643 k0 = 1 << (nb_bits-2);
1644 signmask = 1 << (nb_bits-1);
1646 while (get_bits_count(&gb) <= size - 22*avctx->channels) {
1647 for (i = 0; i < avctx->channels; i++) {
1648 *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1649 c->status[i].step_index = get_bits(&gb, 6);
1652 for (count = 0; get_bits_count(&gb) <= size - nb_bits*avctx->channels && count < 4095; count++) {
1655 for (i = 0; i < avctx->channels; i++) {
1656 // similar to IMA adpcm
1657 int delta = get_bits(&gb, nb_bits);
1658 int step = step_table[c->status[i].step_index];
1659 long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1670 if (delta & signmask)
1671 c->status[i].predictor -= vpdiff;
1673 c->status[i].predictor += vpdiff;
1675 c->status[i].step_index += table[delta & (~signmask)];
1677 c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1678 c->status[i].predictor = av_clip_int16(c->status[i].predictor);
1680 *samples++ = c->status[i].predictor;
1681 if (samples >= samples_end) {
1682 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1691 case CODEC_ID_ADPCM_YAMAHA:
1692 while (src < buf + buf_size) {
1694 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1696 *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1699 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1701 *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1707 case CODEC_ID_ADPCM_THP:
1710 unsigned int samplecnt;
1714 if (buf_size < 80) {
1715 av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1720 samplecnt = bytestream_get_be32(&src);
1722 for (i = 0; i < 32; i++)
1723 table[0][i] = (int16_t)bytestream_get_be16(&src);
1725 /* Initialize the previous sample. */
1726 for (i = 0; i < 4; i++)
1727 prev[0][i] = (int16_t)bytestream_get_be16(&src);
1729 if (samplecnt >= (samples_end - samples) / (st + 1)) {
1730 av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1734 for (ch = 0; ch <= st; ch++) {
1735 samples = (unsigned short *) data + ch;
1737 /* Read in every sample for this channel. */
1738 for (i = 0; i < samplecnt / 14; i++) {
1739 int index = (*src >> 4) & 7;
1740 unsigned int exp = 28 - (*src++ & 15);
1741 int factor1 = table[ch][index * 2];
1742 int factor2 = table[ch][index * 2 + 1];
1744 /* Decode 14 samples. */
1745 for (n = 0; n < 14; n++) {
1747 if(n&1) sampledat= *src++ <<28;
1748 else sampledat= (*src&0xF0)<<24;
1750 sampledat = ((prev[ch][0]*factor1
1751 + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1752 *samples = av_clip_int16(sampledat);
1753 prev[ch][1] = prev[ch][0];
1754 prev[ch][0] = *samples++;
1756 /* In case of stereo, skip one sample, this sample
1757 is for the other channel. */
1763 /* In the previous loop, in case stereo is used, samples is
1764 increased exactly one time too often. */
1772 *data_size = (uint8_t *)samples - (uint8_t *)data;
1779 #define ADPCM_ENCODER(id,name,long_name_) \
1780 AVCodec ff_ ## name ## _encoder = { \
1782 AVMEDIA_TYPE_AUDIO, \
1784 sizeof(ADPCMContext), \
1785 adpcm_encode_init, \
1786 adpcm_encode_frame, \
1787 adpcm_encode_close, \
1789 .sample_fmts = (const enum AVSampleFormat[]){AV_SAMPLE_FMT_S16,AV_SAMPLE_FMT_NONE}, \
1790 .long_name = NULL_IF_CONFIG_SMALL(long_name_), \
1793 #define ADPCM_ENCODER(id,name,long_name_)
1797 #define ADPCM_DECODER(id,name,long_name_) \
1798 AVCodec ff_ ## name ## _decoder = { \
1800 AVMEDIA_TYPE_AUDIO, \
1802 sizeof(ADPCMContext), \
1803 adpcm_decode_init, \
1806 adpcm_decode_frame, \
1807 .long_name = NULL_IF_CONFIG_SMALL(long_name_), \
1810 #define ADPCM_DECODER(id,name,long_name_)
1813 #define ADPCM_CODEC(id,name,long_name_) \
1814 ADPCM_ENCODER(id,name,long_name_); ADPCM_DECODER(id,name,long_name_)
1816 /* Note: Do not forget to add new entries to the Makefile as well. */
1817 ADPCM_DECODER(CODEC_ID_ADPCM_4XM, adpcm_4xm, "ADPCM 4X Movie");
1818 ADPCM_DECODER(CODEC_ID_ADPCM_CT, adpcm_ct, "ADPCM Creative Technology");
1819 ADPCM_DECODER(CODEC_ID_ADPCM_EA, adpcm_ea, "ADPCM Electronic Arts");
1820 ADPCM_DECODER(CODEC_ID_ADPCM_EA_MAXIS_XA, adpcm_ea_maxis_xa, "ADPCM Electronic Arts Maxis CDROM XA");
1821 ADPCM_DECODER(CODEC_ID_ADPCM_EA_R1, adpcm_ea_r1, "ADPCM Electronic Arts R1");
1822 ADPCM_DECODER(CODEC_ID_ADPCM_EA_R2, adpcm_ea_r2, "ADPCM Electronic Arts R2");
1823 ADPCM_DECODER(CODEC_ID_ADPCM_EA_R3, adpcm_ea_r3, "ADPCM Electronic Arts R3");
1824 ADPCM_DECODER(CODEC_ID_ADPCM_EA_XAS, adpcm_ea_xas, "ADPCM Electronic Arts XAS");
1825 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_AMV, adpcm_ima_amv, "ADPCM IMA AMV");
1826 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3, "ADPCM IMA Duck DK3");
1827 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4, "ADPCM IMA Duck DK4");
1828 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_EACS, adpcm_ima_ea_eacs, "ADPCM IMA Electronic Arts EACS");
1829 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_EA_SEAD, adpcm_ima_ea_sead, "ADPCM IMA Electronic Arts SEAD");
1830 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_ISS, adpcm_ima_iss, "ADPCM IMA Funcom ISS");
1831 ADPCM_CODEC (CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt, "ADPCM IMA QuickTime");
1832 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg, "ADPCM IMA Loki SDL MJPEG");
1833 ADPCM_CODEC (CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav, "ADPCM IMA WAV");
1834 ADPCM_DECODER(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws, "ADPCM IMA Westwood");
1835 ADPCM_CODEC (CODEC_ID_ADPCM_MS, adpcm_ms, "ADPCM Microsoft");
1836 ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2, "ADPCM Sound Blaster Pro 2-bit");
1837 ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3, "ADPCM Sound Blaster Pro 2.6-bit");
1838 ADPCM_DECODER(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4, "ADPCM Sound Blaster Pro 4-bit");
1839 ADPCM_CODEC (CODEC_ID_ADPCM_SWF, adpcm_swf, "ADPCM Shockwave Flash");
1840 ADPCM_DECODER(CODEC_ID_ADPCM_THP, adpcm_thp, "ADPCM Nintendo Gamecube THP");
1841 ADPCM_DECODER(CODEC_ID_ADPCM_XA, adpcm_xa, "ADPCM CDROM XA");
1842 ADPCM_CODEC (CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha, "ADPCM Yamaha");