FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavcodec/adpcmenc.c
Date: 2026-04-10 22:11:37
Exec Total Coverage
Lines: 243 257 94.6%
Functions: 11 11 100.0%
Branches: 270 323 83.6%
Line Branch Exec Source
1 /*
2 * Copyright (c) 2001-2003 The FFmpeg project
3 *
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)
7 *
8 * This file is part of FFmpeg.
9 *
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.
14 *
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.
19 *
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
23 */
24
25 #include "config_components.h"
26
27 #include "libavutil/mem.h"
28 #include "libavutil/opt.h"
29
30 #include "avcodec.h"
31 #include "put_bits.h"
32 #include "bytestream.h"
33 #include "adpcm.h"
34 #include "adpcm_data.h"
35 #include "codec_internal.h"
36 #include "encode.h"
37
38 /**
39 * @file
40 * ADPCM encoders
41 * See ADPCM decoder reference documents for codec information.
42 */
43
44 #define CASE_0(codec_id, ...)
45 #define CASE_1(codec_id, ...) \
46 case codec_id: \
47 { __VA_ARGS__ } \
48 break;
49 #define CASE_2(enabled, codec_id, ...) \
50 CASE_ ## enabled(codec_id, __VA_ARGS__)
51 #define CASE_3(config, codec_id, ...) \
52 CASE_2(config, codec_id, __VA_ARGS__)
53 #define CASE(codec, ...) \
54 CASE_3(CONFIG_ ## codec ## _ENCODER, AV_CODEC_ID_ ## codec, __VA_ARGS__)
55
56 typedef struct TrellisPath {
57 int nibble;
58 int prev;
59 } TrellisPath;
60
61 typedef struct TrellisNode {
62 uint32_t ssd;
63 int path;
64 int sample1;
65 int sample2;
66 int step;
67 } TrellisNode;
68
69 typedef struct ADPCMEncodeContext {
70 AVClass *class;
71 int block_size;
72
73 ADPCMChannelStatus status[6];
74 TrellisPath *paths;
75 TrellisNode *node_buf;
76 TrellisNode **nodep_buf;
77 uint8_t *trellis_hash;
78 } ADPCMEncodeContext;
79
80 #define FREEZE_INTERVAL 128
81
82 17 static av_cold int adpcm_encode_init(AVCodecContext *avctx)
83 {
84 17 ADPCMEncodeContext *s = avctx->priv_data;
85 17 int channels = avctx->ch_layout.nb_channels;
86
87 /*
88 * AMV's block size has to match that of the corresponding video
89 * stream. Relax the POT requirement.
90 */
91
1/2
✓ Branch 0 taken 17 times.
✗ Branch 1 not taken.
 17 if (avctx->codec->id != AV_CODEC_ID_ADPCM_IMA_AMV &&
92
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 17 times.
 17 (s->block_size & (s->block_size - 1))) {
93 ✗ av_log(avctx, AV_LOG_ERROR, "block size must be power of 2\n");
94 ✗ return AVERROR(EINVAL);
95 }
96
97
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 12 times.
 17 if (avctx->trellis) {
98 int frontier, max_paths;
99
100
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
 5 if ((unsigned)avctx->trellis > 16U) {
101 ✗ av_log(avctx, AV_LOG_ERROR, "invalid trellis size\n");
102 ✗ return AVERROR(EINVAL);
103 }
104
105
1/2
✓ Branch 0 taken 5 times.
✗ Branch 1 not taken.
 5 if (avctx->codec->id == AV_CODEC_ID_ADPCM_IMA_SSI ||
106
1/2
✓ Branch 0 taken 5 times.
✗ Branch 1 not taken.
 5 avctx->codec->id == AV_CODEC_ID_ADPCM_IMA_APM ||
107
1/2
✓ Branch 0 taken 5 times.
✗ Branch 1 not taken.
 5 avctx->codec->id == AV_CODEC_ID_ADPCM_ARGO ||
108
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5 times.
 5 avctx->codec->id == AV_CODEC_ID_ADPCM_IMA_WS) {
109 /*
110 * The current trellis implementation doesn't work for extended
111 * runs of samples without periodic resets. Disallow it.
112 */
113 ✗ av_log(avctx, AV_LOG_ERROR, "trellis not supported\n");
114 ✗ return AVERROR_PATCHWELCOME;
115 }
116
117 5 frontier = 1 << avctx->trellis;
118 5 max_paths = frontier * FREEZE_INTERVAL;
119
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 if (!FF_ALLOC_TYPED_ARRAY(s->paths, max_paths) ||
120
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 !FF_ALLOC_TYPED_ARRAY(s->node_buf, 2 * frontier) ||
121
1/2
✓ Branch 1 taken 5 times.
✗ Branch 2 not taken.
 5 !FF_ALLOC_TYPED_ARRAY(s->nodep_buf, 2 * frontier) ||
122
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 5 times.
 5 !FF_ALLOC_TYPED_ARRAY(s->trellis_hash, 65536))
123 ✗ return AVERROR(ENOMEM);
124 }
125
126 17 avctx->bits_per_coded_sample = av_get_bits_per_sample(avctx->codec->id);
127
128
9/11
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 2 times.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 3 times.
✓ Branch 4 taken 3 times.
✓ Branch 5 taken 2 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 1 times.
✓ Branch 8 taken 1 times.
✓ Branch 9 taken 1 times.
✗ Branch 10 not taken.
 17 switch (avctx->codec->id) {
129 2 CASE(ADPCM_IMA_WAV,
130 /* each 16 bits sample gives one nibble
131 and we have 4 bytes per channel overhead */
132 avctx->frame_size = (s->block_size - 4 * channels) * 8 /
133 (4 * channels) + 1;
134 /* seems frame_size isn't taken into account...
135 have to buffer the samples :-( */
136 avctx->block_align = s->block_size;
137 avctx->bits_per_coded_sample = 4;
138 ) /* End of CASE */
139 2 CASE(ADPCM_IMA_QT,
140 avctx->frame_size = 64;
141 avctx->block_align = 34 * channels;
142 ) /* End of CASE */
143
3/4
✗ Branch 1 not taken.
✓ Branch 2 taken 2 times.
✓ Branch 7 taken 14 times.
✓ Branch 8 taken 2 times.
 16 CASE(ADPCM_MS,
144 uint8_t *extradata;
145 /* each 16 bits sample gives one nibble
146 and we have 7 bytes per channel overhead */
147 avctx->frame_size = (s->block_size - 7 * channels) * 2 / channels + 2;
148 avctx->bits_per_coded_sample = 4;
149 avctx->block_align = s->block_size;
150 if (!(avctx->extradata = av_malloc(32 + AV_INPUT_BUFFER_PADDING_SIZE)))
151 return AVERROR(ENOMEM);
152 avctx->extradata_size = 32;
153 extradata = avctx->extradata;
154 bytestream_put_le16(&extradata, avctx->frame_size);
155 bytestream_put_le16(&extradata, 7); /* wNumCoef */
156 for (int i = 0; i < 7; i++) {
157 bytestream_put_le16(&extradata, ff_adpcm_AdaptCoeff1[i] * 4);
158 bytestream_put_le16(&extradata, ff_adpcm_AdaptCoeff2[i] * 4);
159 }
160 ) /* End of CASE */
161 3 CASE(ADPCM_YAMAHA,
162 avctx->frame_size = s->block_size * 2 / channels;
163 avctx->block_align = s->block_size;
164 ) /* End of CASE */
165 3 CASE(ADPCM_SWF,
166 avctx->frame_size = 4096; /* Hardcoded according to the SWF spec. */
167 avctx->block_align = (2 + channels * (22 + 4 * (avctx->frame_size - 1)) + 7) / 8;
168 ) /* End of CASE */
169 2 case AV_CODEC_ID_ADPCM_IMA_SSI:
170 case AV_CODEC_ID_ADPCM_IMA_ALP:
171 2 avctx->frame_size = s->block_size * 2 / channels;
172 2 avctx->block_align = s->block_size;
173 2 break;
174 ✗ CASE(ADPCM_IMA_AMV,
175 avctx->frame_size = s->block_size;
176 avctx->block_align = 8 + (FFALIGN(avctx->frame_size, 2) / 2);
177 ) /* End of CASE */
178
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 1 times.
 1 CASE(ADPCM_IMA_APM,
179 avctx->frame_size = s->block_size * 2 / channels;
180 avctx->block_align = s->block_size;
181
182 if (!(avctx->extradata = av_mallocz(28 + AV_INPUT_BUFFER_PADDING_SIZE)))
183 return AVERROR(ENOMEM);
184 avctx->extradata_size = 28;
185 ) /* End of CASE */
186 1 CASE(ADPCM_ARGO,
187 avctx->frame_size = 32;
188 avctx->block_align = 17 * channels;
189 ) /* End of CASE */
190 1 CASE(ADPCM_IMA_WS,
191 /* each 16 bits sample gives one nibble */
192 avctx->frame_size = s->block_size * 2 / channels;
193 avctx->block_align = s->block_size;
194 ) /* End of CASE */
195 ✗ default:
196 ✗ av_unreachable("there is a case for every codec using adpcm_encode_init()");
197 }
198
199 17 return 0;
200 }
201
202 17 static av_cold int adpcm_encode_close(AVCodecContext *avctx)
203 {
204 17 ADPCMEncodeContext *s = avctx->priv_data;
205 17 av_freep(&s->paths);
206 17 av_freep(&s->node_buf);
207 17 av_freep(&s->nodep_buf);
208 17 av_freep(&s->trellis_hash);
209
210 17 return 0;
211 }
212
213
214 2124252 static inline uint8_t adpcm_ima_compress_sample(ADPCMChannelStatus *c,
215 int16_t sample)
216 {
217 2124252 int delta = sample - c->prev_sample;
218 2124252 int nibble = FFMIN(7, abs(delta) * 4 /
219 2124252 ff_adpcm_step_table[c->step_index]) + (delta < 0) * 8;
220 2124252 c->prev_sample += ((ff_adpcm_step_table[c->step_index] *
221 2124252 ff_adpcm_yamaha_difflookup[nibble]) / 8);
222 2124252 c->prev_sample = av_clip_int16(c->prev_sample);
223 2124252 c->step_index = av_clip(c->step_index + ff_adpcm_index_table[nibble], 0, 88);
224 2124252 return nibble;
225 }
226
227 529200 static inline uint8_t adpcm_ima_alp_compress_sample(ADPCMChannelStatus *c, int16_t sample)
228 {
229 529200 const int delta = sample - c->prev_sample;
230 529200 const int step = ff_adpcm_step_table[c->step_index];
231 529200 const int sign = (delta < 0) * 8;
232
233 529200 int nibble = FFMIN(abs(delta) * 4 / step, 7);
234 529200 int diff = (step * nibble) >> 2;
235
2/2
✓ Branch 0 taken 263832 times.
✓ Branch 1 taken 265368 times.
 529200 if (sign)
236 263832 diff = -diff;
237
238 529200 nibble = sign | nibble;
239
240 529200 c->prev_sample += diff;
241 529200 c->prev_sample = av_clip_int16(c->prev_sample);
242 529200 c->step_index = av_clip(c->step_index + ff_adpcm_index_table[nibble], 0, 88);
243 529200 return nibble;
244 }
245
246 1587680 static inline uint8_t adpcm_ima_qt_compress_sample(ADPCMChannelStatus *c,
247 int16_t sample)
248 {
249 1587680 int delta = sample - c->prev_sample;
250 1587680 int diff, step = ff_adpcm_step_table[c->step_index];
251 1587680 int nibble = 8*(delta < 0);
252
253 1587680 delta= abs(delta);
254 1587680 diff = delta + (step >> 3);
255
256
2/2
✓ Branch 0 taken 435880 times.
✓ Branch 1 taken 1151800 times.
 1587680 if (delta >= step) {
257 435880 nibble |= 4;
258 435880 delta -= step;
259 }
260 1587680 step >>= 1;
261
2/2
✓ Branch 0 taken 760258 times.
✓ Branch 1 taken 827422 times.
 1587680 if (delta >= step) {
262 760258 nibble |= 2;
263 760258 delta -= step;
264 }
265 1587680 step >>= 1;
266
2/2
✓ Branch 0 taken 770157 times.
✓ Branch 1 taken 817523 times.
 1587680 if (delta >= step) {
267 770157 nibble |= 1;
268 770157 delta -= step;
269 }
270 1587680 diff -= delta;
271
272
2/2
✓ Branch 0 taken 789018 times.
✓ Branch 1 taken 798662 times.
 1587680 if (nibble & 8)
273 789018 c->prev_sample -= diff;
274 else
275 798662 c->prev_sample += diff;
276
277 1587680 c->prev_sample = av_clip_int16(c->prev_sample);
278 1587680 c->step_index = av_clip(c->step_index + ff_adpcm_index_table[nibble], 0, 88);
279
280 1587680 return nibble;
281 }
282
283 529240 static inline uint8_t adpcm_ms_compress_sample(ADPCMChannelStatus *c,
284 int16_t sample)
285 {
286 int predictor, nibble, bias;
287
288 529240 predictor = (((c->sample1) * (c->coeff1)) +
289 529240 (( c->sample2) * (c->coeff2))) / 64;
290
291 529240 nibble = sample - predictor;
292
2/2
✓ Branch 0 taken 265224 times.
✓ Branch 1 taken 264016 times.
 529240 if (nibble >= 0)
293 265224 bias = c->idelta / 2;
294 else
295 264016 bias = -c->idelta / 2;
296
297 529240 nibble = (nibble + bias) / c->idelta;
298 529240 nibble = av_clip_intp2(nibble, 3) & 0x0F;
299
300
2/2
✓ Branch 0 taken 240081 times.
✓ Branch 1 taken 289159 times.
 529240 predictor += ((nibble & 0x08) ? (nibble - 0x10) : nibble) * c->idelta;
301
302 529240 c->sample2 = c->sample1;
303 529240 c->sample1 = av_clip_int16(predictor);
304
305 529240 c->idelta = (ff_adpcm_AdaptationTable[nibble] * c->idelta) >> 8;
306
2/2
✓ Branch 0 taken 28193 times.
✓ Branch 1 taken 501047 times.
 529240 if (c->idelta < 16)
307 28193 c->idelta = 16;
308
309 529240 return nibble;
310 }
311
312 575488 static inline uint8_t adpcm_yamaha_compress_sample(ADPCMChannelStatus *c,
313 int16_t sample)
314 {
315 int nibble, delta;
316
317
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 575485 times.
 575488 if (!c->step) {
318 3 c->predictor = 0;
319 3 c->step = 127;
320 }
321
322 575488 delta = sample - c->predictor;
323
324 575488 nibble = FFMIN(7, abs(delta) * 4 / c->step) + (delta < 0) * 8;
325
326 575488 c->predictor += ((c->step * ff_adpcm_yamaha_difflookup[nibble]) / 8);
327 575488 c->predictor = av_clip_int16(c->predictor);
328 575488 c->step = (c->step * ff_adpcm_yamaha_indexscale[nibble]) >> 8;
329 575488 c->step = av_clip(c->step, 127, 24576);
330
331 575488 return nibble;
332 }
333
334 9964 static void adpcm_compress_trellis(AVCodecContext *avctx,
335 const int16_t *samples, uint8_t *dst,
336 ADPCMChannelStatus *c, int n, int stride)
337 {
338 //FIXME 6% faster if frontier is a compile-time constant
339 9964 ADPCMEncodeContext *s = avctx->priv_data;
340 9964 const int frontier = 1 << avctx->trellis;
341 9964 const int version = avctx->codec->id;
342 9964 TrellisPath *paths = s->paths, *p;
343 9964 TrellisNode *node_buf = s->node_buf;
344 9964 TrellisNode **nodep_buf = s->nodep_buf;
345 9964 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd
346 9964 TrellisNode **nodes_next = nodep_buf + frontier;
347 9964 int pathn = 0, froze = -1, i, j, k, generation = 0;
348 9964 uint8_t *hash = s->trellis_hash;
349 9964 memset(hash, 0xff, 65536 * sizeof(*hash));
350
351 9964 memset(nodep_buf, 0, 2 * frontier * sizeof(*nodep_buf));
352 9964 nodes[0] = node_buf + frontier;
353 9964 nodes[0]->ssd = 0;
354 9964 nodes[0]->path = 0;
355 9964 nodes[0]->step = c->step_index;
356 9964 nodes[0]->sample1 = c->sample1;
357 9964 nodes[0]->sample2 = c->sample2;
358
4/4
✓ Branch 0 taken 9442 times.
✓ Branch 1 taken 522 times.
✓ Branch 2 taken 1172 times.
✓ Branch 3 taken 8270 times.
 9964 if (version == AV_CODEC_ID_ADPCM_IMA_WAV ||
359
1/2
✓ Branch 0 taken 1172 times.
✗ Branch 1 not taken.
 1172 version == AV_CODEC_ID_ADPCM_IMA_QT ||
360
2/2
✓ Branch 0 taken 130 times.
✓ Branch 1 taken 1042 times.
 1172 version == AV_CODEC_ID_ADPCM_IMA_AMV ||
361 version == AV_CODEC_ID_ADPCM_SWF)
362 8922 nodes[0]->sample1 = c->prev_sample;
363
2/2
✓ Branch 0 taken 524 times.
✓ Branch 1 taken 9440 times.
 9964 if (version == AV_CODEC_ID_ADPCM_MS)
364 524 nodes[0]->step = c->idelta;
365
2/2
✓ Branch 0 taken 518 times.
✓ Branch 1 taken 9446 times.
 9964 if (version == AV_CODEC_ID_ADPCM_YAMAHA) {
366
2/2
✓ Branch 0 taken 2 times.
✓ Branch 1 taken 516 times.
 518 if (c->step == 0) {
367 2 nodes[0]->step = 127;
368 2 nodes[0]->sample1 = 0;
369 } else {
370 516 nodes[0]->step = c->step;
371 516 nodes[0]->sample1 = c->predictor;
372 }
373 }
374
375
2/2
✓ Branch 0 taken 2651654 times.
✓ Branch 1 taken 9964 times.
 2661618 for (i = 0; i < n; i++) {
376 2651654 TrellisNode *t = node_buf + frontier*(i&1);
377 TrellisNode **u;
378 2651654 int sample = samples[i * stride];
379 2651654 int heap_pos = 0;
380 2651654 memset(nodes_next, 0, frontier * sizeof(TrellisNode*));
381
4/4
✓ Branch 0 taken 81092362 times.
✓ Branch 1 taken 2465218 times.
✓ Branch 2 taken 80905926 times.
✓ Branch 3 taken 186436 times.
 83557580 for (j = 0; j < frontier && nodes[j]; j++) {
382 // higher j have higher ssd already, so they're likely
383 // to yield a suboptimal next sample too
384 80905926 const int range = (j < frontier / 2) ? 1 : 0;
385 80905926 const int step = nodes[j]->step;
386 int nidx;
387
2/2
✓ Branch 0 taken 15997120 times.
✓ Branch 1 taken 64908806 times.
 80905926 if (version == AV_CODEC_ID_ADPCM_MS) {
388 15997120 const int predictor = ((nodes[j]->sample1 * c->coeff1) +
389 15997120 (nodes[j]->sample2 * c->coeff2)) / 64;
390 15997120 const int div = (sample - predictor) / step;
391 15997120 const int nmin = av_clip(div-range, -8, 6);
392 15997120 const int nmax = av_clip(div+range, -7, 7);
393
2/2
✓ Branch 0 taken 32248194 times.
✓ Branch 1 taken 15997120 times.
 48245314 for (nidx = nmin; nidx <= nmax; nidx++) {
394 32248194 const int nibble = nidx & 0xf;
395 32248194 int dec_sample = predictor + nidx * step;
396 #define STORE_NODE(NAME, STEP_INDEX)\
397 int d;\
398 uint32_t ssd;\
399 int pos;\
400 TrellisNode *u;\
401 uint8_t *h;\
402 dec_sample = av_clip_int16(dec_sample);\
403 d = sample - dec_sample;\
404 ssd = nodes[j]->ssd + d*(unsigned)d;\
405 /* Check for wraparound, skip such samples completely. \
406 * Note, changing ssd to a 64 bit variable would be \
407 * simpler, avoiding this check, but it's slower on \
408 * x86 32 bit at the moment. */\
409 if (ssd < nodes[j]->ssd)\
410 goto next_##NAME;\
411 /* Collapse any two states with the same previous sample value. \
412 * One could also distinguish states by step and by 2nd to last
413 * sample, but the effects of that are negligible.
414 * Since nodes in the previous generation are iterated
415 * through a heap, they're roughly ordered from better to
416 * worse, but not strictly ordered. Therefore, an earlier
417 * node with the same sample value is better in most cases
418 * (and thus the current is skipped), but not strictly
419 * in all cases. Only skipping samples where ssd >=
420 * ssd of the earlier node with the same sample gives
421 * slightly worse quality, though, for some reason. */ \
422 h = &hash[(uint16_t) dec_sample];\
423 if (*h == generation)\
424 goto next_##NAME;\
425 if (heap_pos < frontier) {\
426 pos = heap_pos++;\
427 } else {\
428 /* Try to replace one of the leaf nodes with the new \
429 * one, but try a different slot each time. */\
430 pos = (frontier >> 1) +\
431 (heap_pos & ((frontier >> 1) - 1));\
432 if (ssd > nodes_next[pos]->ssd)\
433 goto next_##NAME;\
434 heap_pos++;\
435 }\
436 *h = generation;\
437 u = nodes_next[pos];\
438 if (!u) {\
439 av_assert1(pathn < FREEZE_INTERVAL << avctx->trellis);\
440 u = t++;\
441 nodes_next[pos] = u;\
442 u->path = pathn++;\
443 }\
444 u->ssd = ssd;\
445 u->step = STEP_INDEX;\
446 u->sample2 = nodes[j]->sample1;\
447 u->sample1 = dec_sample;\
448 paths[u->path].nibble = nibble;\
449 paths[u->path].prev = nodes[j]->path;\
450 /* Sift the newly inserted node up in the heap to \
451 * restore the heap property. */\
452 while (pos > 0) {\
453 int parent = (pos - 1) >> 1;\
454 if (nodes_next[parent]->ssd <= ssd)\
455 break;\
456 FFSWAP(TrellisNode*, nodes_next[parent], nodes_next[pos]);\
457 pos = parent;\
458 }\
459 next_##NAME:;
460
13/14
✗ Branch 0 not taken.
✓ Branch 1 taken 32248194 times.
✓ Branch 2 taken 1521733 times.
✓ Branch 3 taken 30726461 times.
✓ Branch 4 taken 16122660 times.
✓ Branch 5 taken 14603801 times.
✓ Branch 6 taken 9554500 times.
✓ Branch 7 taken 5049301 times.
✓ Branch 8 taken 16122660 times.
✓ Branch 9 taken 5049301 times.
✓ Branch 10 taken 19960642 times.
✓ Branch 11 taken 12223297 times.
✓ Branch 12 taken 32183939 times.
✓ Branch 13 taken 1211319 times.
 44471491 STORE_NODE(ms, FFMAX(16,
461 (ff_adpcm_AdaptationTable[nibble] * step) >> 8));
462 }
463
4/4
✓ Branch 0 taken 48704033 times.
✓ Branch 1 taken 16204773 times.
✓ Branch 2 taken 32826778 times.
✓ Branch 3 taken 15877255 times.
 64908806 } else if (version == AV_CODEC_ID_ADPCM_IMA_WAV ||
464
1/2
✓ Branch 0 taken 32826778 times.
✗ Branch 1 not taken.
 32826778 version == AV_CODEC_ID_ADPCM_IMA_QT ||
465
2/2
✓ Branch 0 taken 16225575 times.
✓ Branch 1 taken 16601203 times.
 32826778 version == AV_CODEC_ID_ADPCM_IMA_AMV ||
466 48307603 version == AV_CODEC_ID_ADPCM_SWF) {
467 #define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
468 const int predictor = nodes[j]->sample1;\
469 const int div = (sample - predictor) * 4 / STEP_TABLE;\
470 int nmin = av_clip(div - range, -7, 6);\
471 int nmax = av_clip(div + range, -6, 7);\
472 if (nmin <= 0)\
473 nmin--; /* distinguish -0 from +0 */\
474 if (nmax < 0)\
475 nmax--;\
476 for (nidx = nmin; nidx <= nmax; nidx++) {\
477 const int nibble = nidx < 0 ? 7 - nidx : nidx;\
478 int dec_sample = predictor +\
479 (STEP_TABLE *\
480 ff_adpcm_yamaha_difflookup[nibble]) / 8;\
481 STORE_NODE(NAME, STEP_INDEX);\
482 }
483
21/22
✓ Branch 0 taken 29107208 times.
✓ Branch 1 taken 19200395 times.
✓ Branch 2 taken 19427637 times.
✓ Branch 3 taken 28879966 times.
✓ Branch 4 taken 53824245 times.
✓ Branch 5 taken 53484536 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 107308781 times.
✓ Branch 8 taken 6917242 times.
✓ Branch 9 taken 100391539 times.
✓ Branch 10 taken 48809614 times.
✓ Branch 11 taken 51581925 times.
✓ Branch 12 taken 30220374 times.
✓ Branch 13 taken 21361551 times.
✓ Branch 14 taken 48809614 times.
✓ Branch 15 taken 21361551 times.
✓ Branch 16 taken 66310011 times.
✓ Branch 17 taken 40820211 times.
✓ Branch 18 taken 107130222 times.
✓ Branch 19 taken 3861154 times.
✓ Branch 20 taken 107308781 times.
✓ Branch 21 taken 48307603 times.
 196436595 LOOP_NODES(ima, ff_adpcm_step_table[step],
484 av_clip(step + ff_adpcm_index_table[nibble], 0, 88));
485 } else { //AV_CODEC_ID_ADPCM_YAMAHA
486
21/22
✓ Branch 0 taken 10120353 times.
✓ Branch 1 taken 6480850 times.
✓ Branch 2 taken 6548369 times.
✓ Branch 3 taken 10052834 times.
✓ Branch 4 taken 18520397 times.
✓ Branch 5 taken 18416007 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 36936404 times.
✓ Branch 8 taken 3104173 times.
✓ Branch 9 taken 33832231 times.
✓ Branch 10 taken 16729641 times.
✓ Branch 11 taken 17102590 times.
✓ Branch 12 taken 10186988 times.
✓ Branch 13 taken 6915602 times.
✓ Branch 14 taken 16729641 times.
✓ Branch 15 taken 6915602 times.
✓ Branch 16 taken 22352974 times.
✓ Branch 17 taken 13542165 times.
✓ Branch 18 taken 35895139 times.
✓ Branch 19 taken 1292269 times.
✓ Branch 20 taken 36936404 times.
✓ Branch 21 taken 16601203 times.
 67079772 LOOP_NODES(yamaha, step,
487 av_clip((step * ff_adpcm_yamaha_indexscale[nibble]) >> 8,
488 127, 24576));
489 #undef LOOP_NODES
490 #undef STORE_NODE
491 }
492 }
493
494 2651654 u = nodes;
495 2651654 nodes = nodes_next;
496 2651654 nodes_next = u;
497
498 2651654 generation++;
499
2/2
✓ Branch 0 taken 7290 times.
✓ Branch 1 taken 2644364 times.
 2651654 if (generation == 255) {
500 7290 memset(hash, 0xff, 65536 * sizeof(*hash));
501 7290 generation = 0;
502 }
503
504 // prevent overflow
505
2/2
✓ Branch 0 taken 4857 times.
✓ Branch 1 taken 2646797 times.
 2651654 if (nodes[0]->ssd > (1 << 28)) {
506
4/4
✓ Branch 0 taken 147699 times.
✓ Branch 1 taken 4713 times.
✓ Branch 2 taken 147555 times.
✓ Branch 3 taken 144 times.
 152412 for (j = 1; j < frontier && nodes[j]; j++)
507 147555 nodes[j]->ssd -= nodes[0]->ssd;
508 4857 nodes[0]->ssd = 0;
509 }
510
511 // merge old paths to save memory
512
2/2
✓ Branch 0 taken 15496 times.
✓ Branch 1 taken 2636158 times.
 2651654 if (i == froze + FREEZE_INTERVAL) {
513 15496 p = &paths[nodes[0]->path];
514
2/2
✓ Branch 0 taken 1983488 times.
✓ Branch 1 taken 15496 times.
 1998984 for (k = i; k > froze; k--) {
515 1983488 dst[k] = p->nibble;
516 1983488 p = &paths[p->prev];
517 }
518 15496 froze = i;
519 15496 pathn = 0;
520 // other nodes might use paths that don't coincide with the frozen one.
521 // checking which nodes do so is too slow, so just kill them all.
522 // this also slightly improves quality, but I don't know why.
523 15496 memset(nodes + 1, 0, (frontier - 1) * sizeof(TrellisNode*));
524 }
525 }
526
527 9964 p = &paths[nodes[0]->path];
528
2/2
✓ Branch 0 taken 668166 times.
✓ Branch 1 taken 9964 times.
 678130 for (i = n - 1; i > froze; i--) {
529 668166 dst[i] = p->nibble;
530 668166 p = &paths[p->prev];
531 }
532
533 9964 c->predictor = nodes[0]->sample1;
534 9964 c->sample1 = nodes[0]->sample1;
535 9964 c->sample2 = nodes[0]->sample2;
536 9964 c->step_index = nodes[0]->step;
537 9964 c->step = nodes[0]->step;
538 9964 c->idelta = nodes[0]->step;
539 9964 }
540
541 #if CONFIG_ADPCM_ARGO_ENCODER
542 16840928 static inline int adpcm_argo_compress_nibble(const ADPCMChannelStatus *cs, int16_t s,
543 int shift, int flag)
544 {
545 int nibble;
546
547
2/2
✓ Branch 0 taken 8538976 times.
✓ Branch 1 taken 8301952 times.
 16840928 if (flag)
548 8538976 nibble = 4 * s - 8 * cs->sample1 + 4 * cs->sample2;
549 else
550 8301952 nibble = 4 * s - 4 * cs->sample1;
551
552 16840928 return (nibble >> shift) & 0x0F;
553 }
554
555 526279 static int64_t adpcm_argo_compress_block(ADPCMChannelStatus *cs, PutBitContext *pb,
556 const int16_t *samples, int nsamples,
557 int shift, int flag)
558 {
559 526279 int64_t error = 0;
560
561
2/2
✓ Branch 0 taken 16538 times.
✓ Branch 1 taken 509741 times.
 526279 if (pb) {
562 16538 put_bits(pb, 4, shift - 2);
563 16538 put_bits(pb, 1, 0);
564 16538 put_bits(pb, 1, !!flag);
565 16538 put_bits(pb, 2, 0);
566 }
567
568
2/2
✓ Branch 0 taken 16840928 times.
✓ Branch 1 taken 526279 times.
 17367207 for (int n = 0; n < nsamples; n++) {
569 /* Compress the nibble, then expand it to see how much precision we've lost. */
570 16840928 int nibble = adpcm_argo_compress_nibble(cs, samples[n], shift, flag);
571 16840928 int16_t sample = ff_adpcm_argo_expand_nibble(cs, nibble, shift, flag);
572
573 16840928 error += abs(samples[n] - sample);
574
575
2/2
✓ Branch 0 taken 529216 times.
✓ Branch 1 taken 16311712 times.
 16840928 if (pb)
576 529216 put_bits(pb, 4, nibble);
577 }
578
579 526279 return error;
580 }
581 #endif
582
583 19356 static int adpcm_encode_frame(AVCodecContext *avctx, AVPacket *avpkt,
584 const AVFrame *frame, int *got_packet_ptr)
585 {
586 int st, pkt_size, ret;
587 const int16_t *samples;
588 const int16_t *const *samples_p;
589 uint8_t *dst;
590 19356 ADPCMEncodeContext *c = avctx->priv_data;
591 19356 int channels = avctx->ch_layout.nb_channels;
592
593 19356 samples = (const int16_t *)frame->data[0];
594 19356 samples_p = (const int16_t *const *)frame->extended_data;
595 19356 st = channels == 2;
596
597
2/2
✓ Branch 0 taken 19097 times.
✓ Branch 1 taken 259 times.
 19356 if (avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_SSI ||
598
2/2
✓ Branch 0 taken 18838 times.
✓ Branch 1 taken 259 times.
 19097 avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_ALP ||
599
2/2
✓ Branch 0 taken 18579 times.
✓ Branch 1 taken 259 times.
 18838 avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_APM ||
600
2/2
✓ Branch 0 taken 259 times.
✓ Branch 1 taken 18320 times.
 18579 avctx->codec_id == AV_CODEC_ID_ADPCM_IMA_WS)
601 1036 pkt_size = (frame->nb_samples * channels + 1) / 2;
602 else
603 18320 pkt_size = avctx->block_align;
604
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 19356 times.
 19356 if ((ret = ff_get_encode_buffer(avctx, avpkt, pkt_size, 0)) < 0)
605 ✗ return ret;
606 19356 dst = avpkt->data;
607
608
10/12
✓ Branch 0 taken 522 times.
✓ Branch 1 taken 8270 times.
✓ Branch 2 taken 259 times.
✓ Branch 3 taken 259 times.
✓ Branch 4 taken 195 times.
✓ Branch 5 taken 524 times.
✓ Branch 6 taken 540 times.
✓ Branch 7 taken 259 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 8269 times.
✓ Branch 10 taken 259 times.
✗ Branch 11 not taken.
 19356 switch(avctx->codec->id) {
609
19/20
✓ Branch 1 taken 1044 times.
✓ Branch 2 taken 522 times.
✓ Branch 3 taken 261 times.
✓ Branch 4 taken 261 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 261 times.
✓ Branch 9 taken 522 times.
✓ Branch 10 taken 261 times.
✓ Branch 11 taken 265176 times.
✓ Branch 12 taken 66294 times.
✓ Branch 13 taken 66294 times.
✓ Branch 14 taken 33147 times.
✓ Branch 15 taken 33147 times.
✓ Branch 16 taken 261 times.
✓ Branch 20 taken 265176 times.
✓ Branch 21 taken 66294 times.
✓ Branch 22 taken 66294 times.
✓ Branch 23 taken 33147 times.
✓ Branch 24 taken 33147 times.
✓ Branch 25 taken 261 times.
 731322 CASE(ADPCM_IMA_WAV,
610 int blocks = (frame->nb_samples - 1) / 8;
611
612 for (int ch = 0; ch < channels; ch++) {
613 ADPCMChannelStatus *status = &c->status[ch];
614 status->prev_sample = samples_p[ch][0];
615 /* status->step_index = 0;
616 XXX: not sure how to init the state machine */
617 bytestream_put_le16(&dst, status->prev_sample);
618 *dst++ = status->step_index;
619 *dst++ = 0; /* unknown */
620 }
621
622 /* stereo: 4 bytes (8 samples) for left, 4 bytes for right */
623 if (avctx->trellis > 0) {
624 uint8_t *buf;
625 if (!FF_ALLOC_TYPED_ARRAY(buf, channels * blocks * 8))
626 return AVERROR(ENOMEM);
627 for (int ch = 0; ch < channels; ch++) {
628 adpcm_compress_trellis(avctx, &samples_p[ch][1],
629 buf + ch * blocks * 8, &c->status[ch],
630 blocks * 8, 1);
631 }
632 for (int i = 0; i < blocks; i++) {
633 for (int ch = 0; ch < channels; ch++) {
634 uint8_t *buf1 = buf + ch * blocks * 8 + i * 8;
635 for (int j = 0; j < 8; j += 2)
636 *dst++ = buf1[j] | (buf1[j + 1] << 4);
637 }
638 }
639 av_free(buf);
640 } else {
641 for (int i = 0; i < blocks; i++) {
642 for (int ch = 0; ch < channels; ch++) {
643 ADPCMChannelStatus *status = &c->status[ch];
644 const int16_t *smp = &samples_p[ch][1 + i * 8];
645 for (int j = 0; j < 8; j += 2) {
646 uint8_t v = adpcm_ima_compress_sample(status, smp[j ]);
647 v |= adpcm_ima_compress_sample(status, smp[j + 1]) << 4;
648 *dst++ = v;
649 }
650 }
651 }
652 }
653 ) /* End of CASE */
654
8/8
✓ Branch 3 taken 8270 times.
✓ Branch 4 taken 8270 times.
✓ Branch 7 taken 529280 times.
✓ Branch 8 taken 8270 times.
✓ Branch 13 taken 264640 times.
✓ Branch 14 taken 8270 times.
✓ Branch 15 taken 16540 times.
✓ Branch 16 taken 8270 times.
 818730 CASE(ADPCM_IMA_QT,
655 PutBitContext pb;
656 init_put_bits(&pb, dst, pkt_size);
657
658 for (int ch = 0; ch < channels; ch++) {
659 ADPCMChannelStatus *status = &c->status[ch];
660 put_bits(&pb, 9, (status->prev_sample & 0xFFFF) >> 7);
661 put_bits(&pb, 7, status->step_index);
662 if (avctx->trellis > 0) {
663 uint8_t buf[64];
664 adpcm_compress_trellis(avctx, &samples_p[ch][0], buf, status,
665 64, 1);
666 for (int i = 0; i < 64; i++)
667 put_bits(&pb, 4, buf[i ^ 1]);
668 status->prev_sample = status->predictor;
669 } else {
670 for (int i = 0; i < 64; i += 2) {
671 int t1, t2;
672 t1 = adpcm_ima_qt_compress_sample(status, samples_p[ch][i ]);
673 t2 = adpcm_ima_qt_compress_sample(status, samples_p[ch][i + 1]);
674 put_bits(&pb, 4, t2);
675 put_bits(&pb, 4, t1);
676 }
677 }
678 }
679
680 flush_put_bits(&pb);
681 ) /* End of CASE */
682
5/6
✗ Branch 1 not taken.
✓ Branch 2 taken 259 times.
✓ Branch 7 taken 529200 times.
✓ Branch 8 taken 264600 times.
✓ Branch 9 taken 264600 times.
✓ Branch 10 taken 259 times.
 794059 CASE(ADPCM_IMA_SSI,
683 PutBitContext pb;
684 init_put_bits(&pb, dst, pkt_size);
685
686 av_assert0(avctx->trellis == 0);
687
688 for (int i = 0; i < frame->nb_samples; i++) {
689 for (int ch = 0; ch < channels; ch++) {
690 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, *samples++));
691 }
692 }
693
694 flush_put_bits(&pb);
695 ) /* End of CASE */
696
5/6
✗ Branch 1 not taken.
✓ Branch 2 taken 259 times.
✓ Branch 9 taken 264600 times.
✓ Branch 10 taken 132300 times.
✓ Branch 11 taken 132300 times.
✓ Branch 12 taken 259 times.
 397159 CASE(ADPCM_IMA_ALP,
697 PutBitContext pb;
698 init_put_bits(&pb, dst, pkt_size);
699
700 av_assert0(avctx->trellis == 0);
701
702 for (int n = frame->nb_samples / 2; n > 0; n--) {
703 for (int ch = 0; ch < channels; ch++) {
704 put_bits(&pb, 4, adpcm_ima_alp_compress_sample(c->status + ch, *samples++));
705 put_bits(&pb, 4, adpcm_ima_alp_compress_sample(c->status + ch, samples[st]));
706 }
707 samples += channels;
708 }
709
710 flush_put_bits(&pb);
711 ) /* End of CASE */
712
12/16
✗ Branch 1 not taken.
✓ Branch 2 taken 195 times.
✓ Branch 8 taken 390 times.
✓ Branch 9 taken 195 times.
✓ Branch 10 taken 65 times.
✓ Branch 11 taken 130 times.
✓ Branch 13 taken 65 times.
✗ Branch 14 not taken.
✓ Branch 17 taken 266175 times.
✗ Branch 18 not taken.
✓ Branch 20 taken 266175 times.
✓ Branch 21 taken 65 times.
✓ Branch 24 taken 532350 times.
✗ Branch 25 not taken.
✓ Branch 28 taken 532350 times.
✓ Branch 29 taken 130 times.
 799175 CASE(ADPCM_SWF,
713 const int n = frame->nb_samples - 1;
714 PutBitContext pb;
715 init_put_bits(&pb, dst, pkt_size);
716
717 /* NB: This is safe as we don't have AV_CODEC_CAP_SMALL_LAST_FRAME. */
718 av_assert0(n == 4095);
719
720 // store AdpcmCodeSize
721 put_bits(&pb, 2, 2); // set 4-bit flash adpcm format
722
723 // init the encoder state
724 for (int i = 0; i < channels; i++) {
725 // clip step so it fits 6 bits
726 c->status[i].step_index = av_clip_uintp2(c->status[i].step_index, 6);
727 put_sbits(&pb, 16, samples[i]);
728 put_bits(&pb, 6, c->status[i].step_index);
729 c->status[i].prev_sample = samples[i];
730 }
731
732 if (avctx->trellis > 0) {
733 uint8_t buf[8190 /* = 2 * n */];
734 adpcm_compress_trellis(avctx, samples + channels, buf,
735 &c->status[0], n, channels);
736 if (channels == 2)
737 adpcm_compress_trellis(avctx, samples + channels + 1,
738 buf + n, &c->status[1], n,
739 channels);
740 for (int i = 0; i < n; i++) {
741 put_bits(&pb, 4, buf[i]);
742 if (channels == 2)
743 put_bits(&pb, 4, buf[n + i]);
744 }
745 } else {
746 for (int i = 1; i < frame->nb_samples; i++) {
747 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0],
748 samples[channels * i]));
749 if (channels == 2)
750 put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1],
751 samples[2 * i + 1]));
752 }
753 }
754 flush_put_bits(&pb);
755 ) /* End of CASE */
756
20/24
✓ Branch 0 taken 1048 times.
✓ Branch 1 taken 524 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 1044 times.
✓ Branch 5 taken 1048 times.
✓ Branch 6 taken 524 times.
✓ Branch 7 taken 1048 times.
✓ Branch 8 taken 524 times.
✓ Branch 10 taken 1048 times.
✓ Branch 11 taken 524 times.
✓ Branch 13 taken 1048 times.
✓ Branch 14 taken 524 times.
✓ Branch 15 taken 262 times.
✓ Branch 16 taken 262 times.
✗ Branch 18 not taken.
✓ Branch 19 taken 262 times.
✗ Branch 20 not taken.
✓ Branch 21 taken 262 times.
✗ Branch 23 not taken.
✗ Branch 24 not taken.
✓ Branch 27 taken 264620 times.
✓ Branch 28 taken 262 times.
✓ Branch 32 taken 264620 times.
✓ Branch 33 taken 262 times.
 535004 CASE(ADPCM_MS,
757 for (int i = 0; i < channels; i++) {
758 int predictor = 0;
759 *dst++ = predictor;
760 c->status[i].coeff1 = ff_adpcm_AdaptCoeff1[predictor];
761 c->status[i].coeff2 = ff_adpcm_AdaptCoeff2[predictor];
762 }
763 for (int i = 0; i < channels; i++) {
764 if (c->status[i].idelta < 16)
765 c->status[i].idelta = 16;
766 bytestream_put_le16(&dst, c->status[i].idelta);
767 }
768 for (int i = 0; i < channels; i++)
769 c->status[i].sample2= *samples++;
770 for (int i = 0; i < channels; i++) {
771 c->status[i].sample1 = *samples++;
772 bytestream_put_le16(&dst, c->status[i].sample1);
773 }
774 for (int i = 0; i < channels; i++)
775 bytestream_put_le16(&dst, c->status[i].sample2);
776
777 if (avctx->trellis > 0) {
778 const int n = avctx->block_align - 7 * channels;
779 uint8_t *buf = av_malloc(2 * n);
780 if (!buf)
781 return AVERROR(ENOMEM);
782 if (channels == 1) {
783 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n,
784 channels);
785 for (int i = 0; i < n; i += 2)
786 *dst++ = (buf[i] << 4) | buf[i + 1];
787 } else {
788 adpcm_compress_trellis(avctx, samples, buf,
789 &c->status[0], n, channels);
790 adpcm_compress_trellis(avctx, samples + 1, buf + n,
791 &c->status[1], n, channels);
792 for (int i = 0; i < n; i++)
793 *dst++ = (buf[i] << 4) | buf[n + i];
794 }
795 av_free(buf);
796 } else {
797 for (int i = 7 * channels; i < avctx->block_align; i++) {
798 int nibble;
799 nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++) << 4;
800 nibble |= adpcm_ms_compress_sample(&c->status[st], *samples++);
801 *dst++ = nibble;
802 }
803 }
804 ) /* End of CASE */
805
8/12
✓ Branch 0 taken 259 times.
✓ Branch 1 taken 281 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 259 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 259 times.
✗ Branch 8 not taken.
✗ Branch 9 not taken.
✓ Branch 12 taken 265216 times.
✓ Branch 13 taken 259 times.
✓ Branch 17 taken 287744 times.
✓ Branch 18 taken 281 times.
 553500 CASE(ADPCM_YAMAHA,
806 int n = frame->nb_samples / 2;
807 if (avctx->trellis > 0) {
808 uint8_t *buf = av_malloc(2 * n * 2);
809 if (!buf)
810 return AVERROR(ENOMEM);
811 n *= 2;
812 if (channels == 1) {
813 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], n,
814 channels);
815 for (int i = 0; i < n; i += 2)
816 *dst++ = buf[i] | (buf[i + 1] << 4);
817 } else {
818 adpcm_compress_trellis(avctx, samples, buf,
819 &c->status[0], n, channels);
820 adpcm_compress_trellis(avctx, samples + 1, buf + n,
821 &c->status[1], n, channels);
822 for (int i = 0; i < n; i++)
823 *dst++ = buf[i] | (buf[n + i] << 4);
824 }
825 av_free(buf);
826 } else
827 for (n *= channels; n > 0; n--) {
828 int nibble;
829 nibble = adpcm_yamaha_compress_sample(&c->status[ 0], *samples++);
830 nibble |= adpcm_yamaha_compress_sample(&c->status[st], *samples++) << 4;
831 *dst++ = nibble;
832 }
833 ) /* End of CASE */
834
5/6
✗ Branch 1 not taken.
✓ Branch 2 taken 259 times.
✓ Branch 9 taken 264600 times.
✓ Branch 10 taken 132300 times.
✓ Branch 11 taken 132300 times.
✓ Branch 12 taken 259 times.
 397159 CASE(ADPCM_IMA_APM,
835 PutBitContext pb;
836 init_put_bits(&pb, dst, pkt_size);
837
838 av_assert0(avctx->trellis == 0);
839
840 for (int n = frame->nb_samples / 2; n > 0; n--) {
841 for (int ch = 0; ch < channels; ch++) {
842 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, *samples++));
843 put_bits(&pb, 4, adpcm_ima_qt_compress_sample(c->status + ch, samples[st]));
844 }
845 samples += channels;
846 }
847
848 flush_put_bits(&pb);
849 ) /* End of CASE */
850 ✗ CASE(ADPCM_IMA_AMV,
851 av_assert0(channels == 1);
852
853 c->status[0].prev_sample = *samples;
854 bytestream_put_le16(&dst, c->status[0].prev_sample);
855 bytestream_put_byte(&dst, c->status[0].step_index);
856 bytestream_put_byte(&dst, 0);
857 bytestream_put_le32(&dst, avctx->frame_size);
858
859 if (avctx->trellis > 0) {
860 const int n = frame->nb_samples >> 1;
861 uint8_t *buf = av_malloc(2 * n);
862
863 if (!buf)
864 return AVERROR(ENOMEM);
865
866 adpcm_compress_trellis(avctx, samples, buf, &c->status[0], 2 * n, channels);
867 for (int i = 0; i < n; i++)
868 bytestream_put_byte(&dst, (buf[2 * i] << 4) | buf[2 * i + 1]);
869
870 samples += 2 * n;
871 av_free(buf);
872 } else for (int n = frame->nb_samples >> 1; n > 0; n--) {
873 int nibble;
874 nibble = adpcm_ima_compress_sample(&c->status[0], *samples++) << 4;
875 nibble |= adpcm_ima_compress_sample(&c->status[0], *samples++) & 0x0F;
876 bytestream_put_byte(&dst, nibble);
877 }
878
879 if (avctx->frame_size & 1) {
880 int nibble = adpcm_ima_compress_sample(&c->status[0], *samples++) << 4;
881 bytestream_put_byte(&dst, nibble);
882 }
883 ) /* End of CASE */
884
13/14
✗ Branch 1 not taken.
✓ Branch 2 taken 8269 times.
✓ Branch 6 taken 75397 times.
✓ Branch 7 taken 434344 times.
✓ Branch 8 taken 509986 times.
✓ Branch 9 taken 254748 times.
✓ Branch 10 taken 509741 times.
✓ Branch 11 taken 245 times.
✓ Branch 12 taken 255634 times.
✓ Branch 13 taken 15897 times.
✓ Branch 14 taken 254993 times.
✓ Branch 15 taken 641 times.
✓ Branch 17 taken 16538 times.
✓ Branch 18 taken 8269 times.
 789541 CASE(ADPCM_ARGO,
885 PutBitContext pb;
886 init_put_bits(&pb, dst, pkt_size);
887
888 av_assert0(frame->nb_samples == 32);
889
890 for (int ch = 0; ch < channels; ch++) {
891 int64_t error = INT64_MAX, tmperr = INT64_MAX;
892 int shift = 2, flag = 0;
893 int saved1 = c->status[ch].sample1;
894 int saved2 = c->status[ch].sample2;
895
896 /* Find the optimal coefficients, bail early if we find a perfect result. */
897 for (int s = 2; s < 18 && tmperr != 0; s++) {
898 for (int f = 0; f < 2 && tmperr != 0; f++) {
899 c->status[ch].sample1 = saved1;
900 c->status[ch].sample2 = saved2;
901 tmperr = adpcm_argo_compress_block(c->status + ch, NULL, samples_p[ch],
902 frame->nb_samples, s, f);
903 if (tmperr < error) {
904 shift = s;
905 flag = f;
906 error = tmperr;
907 }
908 }
909 }
910
911 /* Now actually do the encode. */
912 c->status[ch].sample1 = saved1;
913 c->status[ch].sample2 = saved2;
914 adpcm_argo_compress_block(c->status + ch, &pb, samples_p[ch],
915 frame->nb_samples, shift, flag);
916 }
917
918 flush_put_bits(&pb);
919 ) /* End of CASE */
920
5/6
✗ Branch 1 not taken.
✓ Branch 2 taken 259 times.
✓ Branch 9 taken 264600 times.
✓ Branch 10 taken 132300 times.
✓ Branch 11 taken 132300 times.
✓ Branch 12 taken 259 times.
 397159 CASE(ADPCM_IMA_WS,
921 PutBitContext pb;
922 init_put_bits(&pb, dst, pkt_size);
923
924 av_assert0(avctx->trellis == 0);
925 for (int n = frame->nb_samples / 2; n > 0; n--) {
926 /* stereo: 1 byte (2 samples) for left, 1 byte for right */
927 for (int ch = 0; ch < channels; ch++) {
928 int t1, t2;
929 t1 = adpcm_ima_compress_sample(&c->status[ch], *samples++);
930 t2 = adpcm_ima_compress_sample(&c->status[ch], samples[st]);
931 put_bits(&pb, 4, t2);
932 put_bits(&pb, 4, t1);
933 }
934 samples += channels;
935 }
936 flush_put_bits(&pb);
937 ) /* End of CASE */
938 ✗ default:
939 ✗ return AVERROR(EINVAL);
940 }
941
942 19356 *got_packet_ptr = 1;
943 19356 return 0;
944 }
945
946 static const enum AVSampleFormat sample_fmts[] = {
947 AV_SAMPLE_FMT_S16, AV_SAMPLE_FMT_NONE
948 };
949
950 static const enum AVSampleFormat sample_fmts_p[] = {
951 AV_SAMPLE_FMT_S16P, AV_SAMPLE_FMT_NONE
952 };
953
954 static const AVChannelLayout ch_layouts_mono_stereo[] = {
955 AV_CHANNEL_LAYOUT_MONO,
956 AV_CHANNEL_LAYOUT_STEREO,
957 { 0 },
958 };
959
960 static const AVOption options[] = {
961 {
962 .name = "block_size",
963 .help = "set the block size",
964 .offset = offsetof(ADPCMEncodeContext, block_size),
965 .type = AV_OPT_TYPE_INT,
966 .default_val = {.i64 = 1024},
967 .min = 32,
968 .max = 8192, /* Is this a reasonable upper limit? */
969 .flags = AV_OPT_FLAG_ENCODING_PARAM | AV_OPT_FLAG_AUDIO_PARAM
970 },
971 { NULL }
972 };
973
974 static const AVClass adpcm_encoder_class = {
975 .class_name = "ADPCM encoder",
976 .item_name = av_default_item_name,
977 .option = options,
978 .version = LIBAVUTIL_VERSION_INT,
979 };
980
981 #define ADPCM_ENCODER_0(id_, name_, sample_fmts_, capabilities_, long_name_, ...)
982 #define ADPCM_ENCODER_1(id_, name_, sample_fmts_, capabilities_, long_name_, ...) \
983 const FFCodec ff_ ## name_ ## _encoder = { \
984 .p.name = #name_, \
985 CODEC_LONG_NAME(long_name_), \
986 .p.type = AVMEDIA_TYPE_AUDIO, \
987 .p.id = id_, \
988 .p.capabilities = capabilities_ | AV_CODEC_CAP_DR1 | \
989 AV_CODEC_CAP_ENCODER_REORDERED_OPAQUE, \
990 CODEC_SAMPLEFMTS_ARRAY(sample_fmts_), \
991 .priv_data_size = sizeof(ADPCMEncodeContext), \
992 .init = adpcm_encode_init, \
993 FF_CODEC_ENCODE_CB(adpcm_encode_frame), \
994 .close = adpcm_encode_close, \
995 .caps_internal = FF_CODEC_CAP_INIT_CLEANUP, \
996 __VA_ARGS__, \
997 };
998 #define ADPCM_ENCODER_2(enabled, codec_id, name, sample_fmts, capabilities, long_name, ...) \
999 ADPCM_ENCODER_ ## enabled(codec_id, name, sample_fmts, capabilities, long_name, __VA_ARGS__)
1000 #define ADPCM_ENCODER_3(config, codec_id, name, sample_fmts, capabilities, long_name, ...) \
1001 ADPCM_ENCODER_2(config, codec_id, name, sample_fmts, capabilities, long_name, __VA_ARGS__)
1002 #define ADPCM_ENCODER(codec, name, sample_fmts, capabilities, long_name, ...) \
1003 ADPCM_ENCODER_3(CONFIG_ ## codec ## _ENCODER, AV_CODEC_ID_ ## codec, \
1004 name, sample_fmts, capabilities, long_name, __VA_ARGS__)
1005
1006 #define MONO_STEREO CODEC_CH_LAYOUTS_ARRAY(ch_layouts_mono_stereo)
1007 #define AVCLASS .p.priv_class = &adpcm_encoder_class
1008
1009 ADPCM_ENCODER(ADPCM_ARGO, adpcm_argo, sample_fmts_p, 0, "ADPCM Argonaut Games", MONO_STEREO)
1010 ADPCM_ENCODER(ADPCM_IMA_AMV, adpcm_ima_amv, sample_fmts, 0, "ADPCM IMA AMV", CODEC_CH_LAYOUTS(AV_CHANNEL_LAYOUT_MONO), CODEC_SAMPLERATES(22050), AVCLASS)
1011 ADPCM_ENCODER(ADPCM_IMA_APM, adpcm_ima_apm, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA Ubisoft APM", MONO_STEREO, AVCLASS)
1012 ADPCM_ENCODER(ADPCM_IMA_ALP, adpcm_ima_alp, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA High Voltage Software ALP", MONO_STEREO, AVCLASS)
1013 ADPCM_ENCODER(ADPCM_IMA_QT, adpcm_ima_qt, sample_fmts_p, 0, "ADPCM IMA QuickTime", MONO_STEREO)
1014 ADPCM_ENCODER(ADPCM_IMA_SSI, adpcm_ima_ssi, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA Simon & Schuster Interactive", MONO_STEREO, AVCLASS)
1015 ADPCM_ENCODER(ADPCM_IMA_WAV, adpcm_ima_wav, sample_fmts_p, 0, "ADPCM IMA WAV", MONO_STEREO, AVCLASS)
1016 ADPCM_ENCODER(ADPCM_IMA_WS, adpcm_ima_ws, sample_fmts, AV_CODEC_CAP_SMALL_LAST_FRAME, "ADPCM IMA Westwood", MONO_STEREO, AVCLASS)
1017 ADPCM_ENCODER(ADPCM_MS, adpcm_ms, sample_fmts, 0, "ADPCM Microsoft", MONO_STEREO, AVCLASS)
1018 ADPCM_ENCODER(ADPCM_SWF, adpcm_swf, sample_fmts, 0, "ADPCM Shockwave Flash", MONO_STEREO, CODEC_SAMPLERATES(11025, 22050, 44100))
1019 ADPCM_ENCODER(ADPCM_YAMAHA, adpcm_yamaha, sample_fmts, 0, "ADPCM Yamaha", MONO_STEREO, AVCLASS)
1020