2 * Copyright (c) 2001-2003 The FFmpeg project
4 * first version by Francois Revol (revol@free.fr)
5 * fringe ADPCM codecs (e.g., DK3, DK4, Westwood)
6 * by Mike Melanson (melanson@pcisys.net)
8 * This file is part of FFmpeg.
10 * FFmpeg is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
15 * FFmpeg is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * Lesser General Public License for more details.
20 * You should have received a copy of the GNU Lesser General Public
21 * License along with FFmpeg; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
27 #include "bytestream.h"
29 #include "adpcm_data.h"
35 * See ADPCM decoder reference documents for codec information.
38 typedef struct TrellisPath {
43 typedef struct TrellisNode {
51 typedef struct ADPCMEncodeContext {
52 ADPCMChannelStatus status[6];
54 TrellisNode *node_buf;
55 TrellisNode **nodep_buf;
56 uint8_t *trellis_hash;
59 #define FREEZE_INTERVAL 128
61 static av_cold int adpcm_encode_init(AVCodecContext *avctx)
63 ADPCMEncodeContext *s = avctx->priv_data;
67 if (avctx->channels > 2) {
68 av_log(avctx, AV_LOG_ERROR, "only stereo or mono is supported\n");
69 return AVERROR(EINVAL);
72 if (avctx->trellis && (unsigned)avctx->trellis > 16U) {
73 av_log(avctx, AV_LOG_ERROR, "invalid trellis size\n");
74 return AVERROR(EINVAL);
78 (avctx->codec->id == AV_CODEC_ID_ADPCM_IMA_SSI ||
79 avctx->codec->id == AV_CODEC_ID_ADPCM_IMA_APM)) {
81 * The current trellis implementation doesn't work for extended
82 * runs of samples without periodic resets. Disallow it.
84 av_log(avctx, AV_LOG_ERROR, "trellis not supported\n");
85 return AVERROR_PATCHWELCOME;
89 int frontier = 1 << avctx->trellis;
90 int max_paths = frontier * FREEZE_INTERVAL;
91 if (!FF_ALLOC_TYPED_ARRAY(s->paths, max_paths) ||
92 !FF_ALLOC_TYPED_ARRAY(s->node_buf, 2 * frontier) ||
93 !FF_ALLOC_TYPED_ARRAY(s->nodep_buf, 2 * frontier) ||
94 !FF_ALLOC_TYPED_ARRAY(s->trellis_hash, 65536))
95 return AVERROR(ENOMEM);
98 avctx->bits_per_coded_sample = av_get_bits_per_sample(avctx->codec->id);
100 switch (avctx->codec->id) {
101 case AV_CODEC_ID_ADPCM_IMA_WAV:
102 /* each 16 bits sample gives one nibble
103 and we have 4 bytes per channel overhead */
104 avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 /
105 (4 * avctx->channels) + 1;
106 /* seems frame_size isn't taken into account...
107 have to buffer the samples :-( */
108 avctx->block_align = BLKSIZE;
109 avctx->bits_per_coded_sample = 4;
111 case AV_CODEC_ID_ADPCM_IMA_QT:
112 avctx->frame_size = 64;
113 avctx->block_align = 34 * avctx->channels;
115 case AV_CODEC_ID_ADPCM_MS:
116 /* each 16 bits sample gives one nibble
117 and we have 7 bytes per channel overhead */
118 avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2;
119 avctx->bits_per_coded_sample = 4;
120 avctx->block_align = BLKSIZE;
121 if (!(avctx->extradata = av_malloc(32 + AV_INPUT_BUFFER_PADDING_SIZE)))
122 return AVERROR(ENOMEM);
123 avctx->extradata_size = 32;
124 extradata = avctx->extradata;
125 bytestream_put_le16(&extradata, avctx->frame_size);
126 bytestream_put_le16(&extradata, 7); /* wNumCoef */
127 for (i = 0; i < 7; i++) {
128 bytestream_put_le16(&extradata, ff_adpcm_AdaptCoeff1[i] * 4);
129 bytestream_put_le16(&extradata, ff_adpcm_AdaptCoeff2[i] * 4);
132 case AV_CODEC_ID_ADPCM_YAMAHA:
133 avctx->frame_size = BLKSIZE * 2 / avctx->channels;
134 avctx->block_align = BLKSIZE;
136 case AV_CODEC_ID_ADPCM_SWF:
137 if (avctx->sample_rate != 11025 &&
138 avctx->sample_rate != 22050 &&
139 avctx->sample_rate != 44100) {
140 av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, "
142 return AVERROR(EINVAL);
144 avctx->frame_size = 512 * (avctx->sample_rate / 11025);
146 case AV_CODEC_ID_ADPCM_IMA_SSI:
147 avctx->frame_size = BLKSIZE * 2 / avctx->channels;
148 avctx->block_align = BLKSIZE;
150 case AV_CODEC_ID_ADPCM_IMA_APM:
151 avctx->frame_size = BLKSIZE * 2 / avctx->channels;
152 avctx->block_align = BLKSIZE;
154 if (!(avctx->extradata = av_mallocz(28 + AV_INPUT_BUFFER_PADDING_SIZE)))
155 return AVERROR(ENOMEM);
156 avctx->extradata_size = 28;
159 return AVERROR(EINVAL);
165 static av_cold int adpcm_encode_close(AVCodecContext *avctx)
167 ADPCMEncodeContext *s = avctx->priv_data;
169 av_freep(&s->node_buf);
170 av_freep(&s->nodep_buf);
171 av_freep(&s->trellis_hash);
177 static inline uint8_t adpcm_ima_compress_sample(ADPCMChannelStatus *c,
180 int delta = sample - c->prev_sample;
181 int nibble = FFMIN(7, abs(delta) * 4 /
182 ff_adpcm_step_table[c->step_index]) + (delta < 0) * 8;
183 c->prev_sample += ((ff_adpcm_step_table[c->step_index] *
184 ff_adpcm_yamaha_difflookup[nibble]) / 8);
185 c->prev_sample = av_clip_int16(c->prev_sample);
186 c->step_index = av_clip(c->step_index + ff_adpcm_index_table[nibble], 0, 88);
190 static inline uint8_t adpcm_ima_qt_compress_sample(ADPCMChannelStatus *c,
193 int delta = sample - c->prev_sample;
194 int diff, step = ff_adpcm_step_table[c->step_index];
195 int nibble = 8*(delta < 0);
198 diff = delta + (step >> 3);
217 c->prev_sample -= diff;
219 c->prev_sample += diff;
221 c->prev_sample = av_clip_int16(c->prev_sample);
222 c->step_index = av_clip(c->step_index + ff_adpcm_index_table[nibble], 0, 88);
227 static inline uint8_t adpcm_ms_compress_sample(ADPCMChannelStatus *c,
230 int predictor, nibble, bias;
232 predictor = (((c->sample1) * (c->coeff1)) +
233 (( c->sample2) * (c->coeff2))) / 64;
235 nibble = sample - predictor;
237 bias = c->idelta / 2;
239 bias = -c->idelta / 2;
241 nibble = (nibble + bias) / c->idelta;
242 nibble = av_clip_intp2(nibble, 3) & 0x0F;
244 predictor += ((nibble & 0x08) ? (nibble - 0x10) : nibble) * c->idelta;
246 c->sample2 = c->sample1;
247 c->sample1 = av_clip_int16(predictor);
249 c->idelta = (ff_adpcm_AdaptationTable[nibble] * c->idelta) >> 8;
256 static inline uint8_t adpcm_yamaha_compress_sample(ADPCMChannelStatus *c,
266 delta = sample - c->predictor;
268 nibble = FFMIN(7, abs(delta) * 4 / c->step) + (delta < 0) * 8;
270 c->predictor += ((c->step * ff_adpcm_yamaha_difflookup[nibble]) / 8);
271 c->predictor = av_clip_int16(c->predictor);
272 c->step = (c->step * ff_adpcm_yamaha_indexscale[nibble]) >> 8;
273 c->step = av_clip(c->step, 127, 24576);
278 static void adpcm_compress_trellis(AVCodecContext *avctx,
279 const int16_t *samples, uint8_t *dst,
280 ADPCMChannelStatus *c, int n, int stride)
282 //FIXME 6% faster if frontier is a compile-time constant
283 ADPCMEncodeContext *s = avctx->priv_data;
284 const int frontier = 1 << avctx->trellis;
285 const int version = avctx->codec->id;
286 TrellisPath *paths = s->paths, *p;
287 TrellisNode *node_buf = s->node_buf;
288 TrellisNode **nodep_buf = s->nodep_buf;
289 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
290 TrellisNode **nodes_next = nodep_buf + frontier;
291 int pathn = 0, froze = -1, i, j, k, generation = 0;
292 uint8_t *hash = s->trellis_hash;
293 memset(hash, 0xff, 65536 * sizeof(*hash));
295 memset(nodep_buf, 0, 2 * frontier * sizeof(*nodep_buf));
296 nodes[0] = node_buf + frontier;
299 nodes[0]->step = c->step_index;
300 nodes[0]->sample1 = c->sample1;
301 nodes[0]->sample2 = c->sample2;
302 if (version == AV_CODEC_ID_ADPCM_IMA_WAV ||
303 version == AV_CODEC_ID_ADPCM_IMA_QT ||
304 version == AV_CODEC_ID_ADPCM_SWF)
305 nodes[0]->sample1 = c->prev_sample;
306 if (version == AV_CODEC_ID_ADPCM_MS)
307 nodes[0]->step = c->idelta;
308 if (version == AV_CODEC_ID_ADPCM_YAMAHA) {
310 nodes[0]->step = 127;
311 nodes[0]->sample1 = 0;
313 nodes[0]->step = c->step;
314 nodes[0]->sample1 = c->predictor;
318 for (i = 0; i < n; i++) {
319 TrellisNode *t = node_buf + frontier*(i&1);
321 int sample = samples[i * stride];
323 memset(nodes_next, 0, frontier * sizeof(TrellisNode*));
324 for (j = 0; j < frontier && nodes[j]; j++) {
325 // higher j have higher ssd already, so they're likely
326 // to yield a suboptimal next sample too
327 const int range = (j < frontier / 2) ? 1 : 0;
328 const int step = nodes[j]->step;
330 if (version == AV_CODEC_ID_ADPCM_MS) {
331 const int predictor = ((nodes[j]->sample1 * c->coeff1) +
332 (nodes[j]->sample2 * c->coeff2)) / 64;
333 const int div = (sample - predictor) / step;
334 const int nmin = av_clip(div-range, -8, 6);
335 const int nmax = av_clip(div+range, -7, 7);
336 for (nidx = nmin; nidx <= nmax; nidx++) {
337 const int nibble = nidx & 0xf;
338 int dec_sample = predictor + nidx * step;
339 #define STORE_NODE(NAME, STEP_INDEX)\
345 dec_sample = av_clip_int16(dec_sample);\
346 d = sample - dec_sample;\
347 ssd = nodes[j]->ssd + d*(unsigned)d;\
348 /* Check for wraparound, skip such samples completely. \
349 * Note, changing ssd to a 64 bit variable would be \
350 * simpler, avoiding this check, but it's slower on \
351 * x86 32 bit at the moment. */\
352 if (ssd < nodes[j]->ssd)\
354 /* Collapse any two states with the same previous sample value. \
355 * One could also distinguish states by step and by 2nd to last
356 * sample, but the effects of that are negligible.
357 * Since nodes in the previous generation are iterated
358 * through a heap, they're roughly ordered from better to
359 * worse, but not strictly ordered. Therefore, an earlier
360 * node with the same sample value is better in most cases
361 * (and thus the current is skipped), but not strictly
362 * in all cases. Only skipping samples where ssd >=
363 * ssd of the earlier node with the same sample gives
364 * slightly worse quality, though, for some reason. */ \
365 h = &hash[(uint16_t) dec_sample];\
366 if (*h == generation)\
368 if (heap_pos < frontier) {\
371 /* Try to replace one of the leaf nodes with the new \
372 * one, but try a different slot each time. */\
373 pos = (frontier >> 1) +\
374 (heap_pos & ((frontier >> 1) - 1));\
375 if (ssd > nodes_next[pos]->ssd)\
380 u = nodes_next[pos];\
382 av_assert1(pathn < FREEZE_INTERVAL << avctx->trellis);\
384 nodes_next[pos] = u;\
388 u->step = STEP_INDEX;\
389 u->sample2 = nodes[j]->sample1;\
390 u->sample1 = dec_sample;\
391 paths[u->path].nibble = nibble;\
392 paths[u->path].prev = nodes[j]->path;\
393 /* Sift the newly inserted node up in the heap to \
394 * restore the heap property. */\
396 int parent = (pos - 1) >> 1;\
397 if (nodes_next[parent]->ssd <= ssd)\
399 FFSWAP(TrellisNode*, nodes_next[parent], nodes_next[pos]);\
403 STORE_NODE(ms, FFMAX(16,
404 (ff_adpcm_AdaptationTable[nibble] * step) >> 8));
406 } else if (version == AV_CODEC_ID_ADPCM_IMA_WAV ||
407 version == AV_CODEC_ID_ADPCM_IMA_QT ||
408 version == AV_CODEC_ID_ADPCM_SWF) {
409 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
410 const int predictor = nodes[j]->sample1;\
411 const int div = (sample - predictor) * 4 / STEP_TABLE;\
412 int nmin = av_clip(div - range, -7, 6);\
413 int nmax = av_clip(div + range, -6, 7);\
415 nmin--; /* distinguish -0 from +0 */\
418 for (nidx = nmin; nidx <= nmax; nidx++) {\
419 const int nibble = nidx < 0 ? 7 - nidx : nidx;\
420 int dec_sample = predictor +\
422 ff_adpcm_yamaha_difflookup[nibble]) / 8;\
423 STORE_NODE(NAME, STEP_INDEX);\
425 LOOP_NODES(ima, ff_adpcm_step_table[step],
426 av_clip(step + ff_adpcm_index_table[nibble], 0, 88));
427 } else { //AV_CODEC_ID_ADPCM_YAMAHA
428 LOOP_NODES(yamaha, step,
429 av_clip((step * ff_adpcm_yamaha_indexscale[nibble]) >> 8,
441 if (generation == 255) {
442 memset(hash, 0xff, 65536 * sizeof(*hash));
447 if (nodes[0]->ssd > (1 << 28)) {
448 for (j = 1; j < frontier && nodes[j]; j++)
449 nodes[j]->ssd -= nodes[0]->ssd;
453 // merge old paths to save memory
454 if (i == froze + FREEZE_INTERVAL) {
455 p = &paths[nodes[0]->path];
456 for (k = i; k > froze; k--) {
462 // other nodes might use paths that don't coincide with the frozen one.
463 // checking which nodes do so is too slow, so just kill them all.
464 // this also slightly improves quality, but I don't know why.
465 memset(nodes + 1, 0, (frontier - 1) * sizeof(TrellisNode*));
469 p = &paths[nodes[0]->path];
470 for (i = n - 1; i > froze; i--) {
475 c->predictor = nodes[0]->sample1;
476 c->sample1 = nodes[0]->sample1;
477 c->sample2 = nodes[0]->sample2;
478 c->step_index = nodes[0]->step;
479 c->step = nodes[0]->step;
480 c->idelta = nodes[0]->step;
483 static int adpcm_encode_frame(AVCodecContext *avctx, AVPacket *avpkt,
484 const AVFrame *frame, int *got_packet_ptr)
486 int n, i, ch, st, pkt_size, ret;
487 const int16_t *samples;
490 ADPCMEncodeContext *c = avctx->priv_data;
493 samples = (const int16_t *)frame->data[0];
494 samples_p = (int16_t **)frame->extended_data;
495 st = avctx->channels == 2;
497 if (avctx->codec_id == AV_CODEC_ID_ADPCM_SWF)
498 pkt_size = (2 + avctx->channels * (22 + 4 * (frame->nb_samples - 1)) + 7) / 8;
499 else if (avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_SSI ||
500 avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_APM)
501 pkt_size = (frame->nb_samples * avctx->channels) / 2;
503 pkt_size = avctx->block_align;
504 if ((ret = ff_alloc_packet2(avctx, avpkt, pkt_size, 0)) < 0)
508 switch(avctx->codec->id) {
509 case AV_CODEC_ID_ADPCM_IMA_WAV:
513 blocks = (frame->nb_samples - 1) / 8;
515 for (ch = 0; ch < avctx->channels; ch++) {
516 ADPCMChannelStatus *status = &c->status[ch];
517 status->prev_sample = samples_p[ch][0];
518 /* status->step_index = 0;
519 XXX: not sure how to init the state machine */
520 bytestream_put_le16(&dst, status->prev_sample);
521 *dst++ = status->step_index;
522 *dst++ = 0; /* unknown */
525 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right */
526 if (avctx->trellis > 0) {
527 if (!FF_ALLOC_TYPED_ARRAY(buf, avctx->channels * blocks * 8))
528 return AVERROR(ENOMEM);
529 for (ch = 0; ch < avctx->channels; ch++) {
530 adpcm_compress_trellis(avctx, &samples_p[ch][1],
531 buf + ch * blocks * 8, &c->status[ch],
534 for (i = 0; i < blocks; i++) {
535 for (ch = 0; ch < avctx->channels; ch++) {
536 uint8_t *buf1 = buf + ch * blocks * 8 + i * 8;
537 for (j = 0; j < 8; j += 2)
538 *dst++ = buf1[j] | (buf1[j + 1] << 4);
543 for (i = 0; i < blocks; i++) {
544 for (ch = 0; ch < avctx->channels; ch++) {
545 ADPCMChannelStatus *status = &c->status[ch];
546 const int16_t *smp = &samples_p[ch][1 + i * 8];
547 for (j = 0; j < 8; j += 2) {
548 uint8_t v = adpcm_ima_compress_sample(status, smp[j ]);
549 v |= adpcm_ima_compress_sample(status, smp[j + 1]) << 4;
557 case AV_CODEC_ID_ADPCM_IMA_QT:
560 init_put_bits(&pb, dst, pkt_size);
562 for (ch = 0; ch < avctx->channels; ch++) {
563 ADPCMChannelStatus *status = &c->status[ch];
564 put_bits(&pb, 9, (status->prev_sample & 0xFFFF) >> 7);
565 put_bits(&pb, 7, status->step_index);
566 if (avctx->trellis > 0) {
568 adpcm_compress_trellis(avctx, &samples_p[ch][0], buf, status,
570 for (i = 0; i < 64; i++)
571 put_bits(&pb, 4, buf[i ^ 1]);
572 status->prev_sample = status->predictor;
574 for (i = 0; i < 64; i += 2) {
576 t1 = adpcm_ima_qt_compress_sample(status, samples_p[ch][i ]);
577 t2 = adpcm_ima_qt_compress_sample(status, samples_p[ch][i + 1]);
578 put_bits(&pb, 4, t2);
579 put_bits(&pb, 4, t1);
587 case AV_CODEC_ID_ADPCM_IMA_SSI:
590 init_put_bits(&pb, dst, pkt_size);
592 av_assert0(avctx->trellis == 0);
594 for (i = 0; i < frame->nb_samples; i++) {
595 for (ch = 0; ch < avctx->channels; ch++) {
596 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, *samples++));
603 case AV_CODEC_ID_ADPCM_SWF:
606 init_put_bits(&pb, dst, pkt_size);
608 n = frame->nb_samples - 1;
610 // store AdpcmCodeSize
611 put_bits(&pb, 2, 2); // set 4-bit flash adpcm format
613 // init the encoder state
614 for (i = 0; i < avctx->channels; i++) {
615 // clip step so it fits 6 bits
616 c->status[i].step_index = av_clip_uintp2(c->status[i].step_index, 6);
617 put_sbits(&pb, 16, samples[i]);
618 put_bits(&pb, 6, c->status[i].step_index);
619 c->status[i].prev_sample = samples[i];
622 if (avctx->trellis > 0) {
623 if (!(buf = av_malloc(2 * n)))
624 return AVERROR(ENOMEM);
625 adpcm_compress_trellis(avctx, samples + avctx->channels, buf,
626 &c->status[0], n, avctx->channels);
627 if (avctx->channels == 2)
628 adpcm_compress_trellis(avctx, samples + avctx->channels + 1,
629 buf + n, &c->status[1], n,
631 for (i = 0; i < n; i++) {
632 put_bits(&pb, 4, buf[i]);
633 if (avctx->channels == 2)
634 put_bits(&pb, 4, buf[n + i]);
638 for (i = 1; i < frame->nb_samples; i++) {
639 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0],
640 samples[avctx->channels * i]));
641 if (avctx->channels == 2)
642 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1],
643 samples[2 * i + 1]));
649 case AV_CODEC_ID_ADPCM_MS:
650 for (i = 0; i < avctx->channels; i++) {
653 c->status[i].coeff1 = ff_adpcm_AdaptCoeff1[predictor];
654 c->status[i].coeff2 = ff_adpcm_AdaptCoeff2[predictor];
656 for (i = 0; i < avctx->channels; i++) {
657 if (c->status[i].idelta < 16)
658 c->status[i].idelta = 16;
659 bytestream_put_le16(&dst, c->status[i].idelta);
661 for (i = 0; i < avctx->channels; i++)
662 c->status[i].sample2= *samples++;
663 for (i = 0; i < avctx->channels; i++) {
664 c->status[i].sample1 = *samples++;
665 bytestream_put_le16(&dst, c->status[i].sample1);
667 for (i = 0; i < avctx->channels; i++)
668 bytestream_put_le16(&dst, c->status[i].sample2);
670 if (avctx->trellis > 0) {
671 n = avctx->block_align - 7 * avctx->channels;
672 if (!(buf = av_malloc(2 * n)))
673 return AVERROR(ENOMEM);
674 if (avctx->channels == 1) {
675 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n,
677 for (i = 0; i < n; i += 2)
678 *dst++ = (buf[i] << 4) | buf[i + 1];
680 adpcm_compress_trellis(avctx, samples, buf,
681 &c->status[0], n, avctx->channels);
682 adpcm_compress_trellis(avctx, samples + 1, buf + n,
683 &c->status[1], n, avctx->channels);
684 for (i = 0; i < n; i++)
685 *dst++ = (buf[i] << 4) | buf[n + i];
689 for (i = 7 * avctx->channels; i < avctx->block_align; i++) {
691 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++) << 4;
692 nibble |= adpcm_ms_compress_sample(&c->status[st], *samples++);
697 case AV_CODEC_ID_ADPCM_YAMAHA:
698 n = frame->nb_samples / 2;
699 if (avctx->trellis > 0) {
700 if (!(buf = av_malloc(2 * n * 2)))
701 return AVERROR(ENOMEM);
703 if (avctx->channels == 1) {
704 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n,
706 for (i = 0; i < n; i += 2)
707 *dst++ = buf[i] | (buf[i + 1] << 4);
709 adpcm_compress_trellis(avctx, samples, buf,
710 &c->status[0], n, avctx->channels);
711 adpcm_compress_trellis(avctx, samples + 1, buf + n,
712 &c->status[1], n, avctx->channels);
713 for (i = 0; i < n; i++)
714 *dst++ = buf[i] | (buf[n + i] << 4);
718 for (n *= avctx->channels; n > 0; n--) {
720 nibble = adpcm_yamaha_compress_sample(&c->status[ 0], *samples++);
721 nibble |= adpcm_yamaha_compress_sample(&c->status[st], *samples++) << 4;
725 case AV_CODEC_ID_ADPCM_IMA_APM:
728 init_put_bits(&pb, dst, pkt_size);
730 av_assert0(avctx->trellis == 0);
732 for (n = frame->nb_samples / 2; n > 0; n--) {
733 for (ch = 0; ch < avctx->channels; ch++) {
734 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, *samples++));
735 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, samples[st]));
737 samples += avctx->channels;
744 return AVERROR(EINVAL);
747 avpkt->size = pkt_size;
752 static const enum AVSampleFormat sample_fmts[] = {
753 AV_SAMPLE_FMT_S16, AV_SAMPLE_FMT_NONE
756 static const enum AVSampleFormat sample_fmts_p[] = {
757 AV_SAMPLE_FMT_S16P, AV_SAMPLE_FMT_NONE
760 #define ADPCM_ENCODER(id_, name_, sample_fmts_, capabilities_, long_name_) \
761 AVCodec ff_ ## name_ ## _encoder = { \
763 .long_name = NULL_IF_CONFIG_SMALL(long_name_), \
764 .type = AVMEDIA_TYPE_AUDIO, \
766 .priv_data_size = sizeof(ADPCMEncodeContext), \
767 .init = adpcm_encode_init, \
768 .encode2 = adpcm_encode_frame, \
769 .close = adpcm_encode_close, \
770 .sample_fmts = sample_fmts_, \
771 .capabilities = capabilities_, \
772 .caps_internal = FF_CODEC_CAP_INIT_CLEANUP, \
775 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_IMA_APM, adpcm_ima_apm, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA Ubisoft APM");
776 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt, sample_fmts_p, 0, "ADPCM IMA QuickTime");
777 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_IMA_SSI, adpcm_ima_ssi, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA Simon & Schuster Interactive");
778 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav, sample_fmts_p, 0, "ADPCM IMA WAV");
779 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_MS, adpcm_ms, sample_fmts, 0, "ADPCM Microsoft");
780 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_SWF, adpcm_swf, sample_fmts, 0, "ADPCM Shockwave Flash");
781 ADPCM_ENCODER(AV_CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha, sample_fmts, 0, "ADPCM Yamaha");