Statistics
| Branch: | Revision:

ffmpeg / libavcodec / adpcm.c @ e4a50e6d

History | View | Annotate | Download (51 KB)

1
/*
2
 * ADPCM codecs
3
 * Copyright (c) 2001-2003 The ffmpeg Project
4
 *
5
 * This file is part of FFmpeg.
6
 *
7
 * FFmpeg is free software; you can redistribute it and/or
8
 * modify it under the terms of the GNU Lesser General Public
9
 * License as published by the Free Software Foundation; either
10
 * version 2.1 of the License, or (at your option) any later version.
11
 *
12
 * FFmpeg is distributed in the hope that it will be useful,
13
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15
 * Lesser General Public License for more details.
16
 *
17
 * You should have received a copy of the GNU Lesser General Public
18
 * License along with FFmpeg; if not, write to the Free Software
19
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20
 */
21
#include "avcodec.h"
22
#include "bitstream.h"
23
#include "bytestream.h"
24

    
25
/**
26
 * @file adpcm.c
27
 * ADPCM codecs.
28
 * First version by Francois Revol (revol@free.fr)
29
 * Fringe ADPCM codecs (e.g., DK3, DK4, Westwood)
30
 *   by Mike Melanson (melanson@pcisys.net)
31
 * CD-ROM XA ADPCM codec by BERO
32
 * EA ADPCM decoder by Robin Kay (komadori@myrealbox.com)
33
 * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)
34
 *
35
 * Features and limitations:
36
 *
37
 * Reference documents:
38
 * http://www.pcisys.net/~melanson/codecs/simpleaudio.html
39
 * http://www.geocities.com/SiliconValley/8682/aud3.txt
40
 * http://openquicktime.sourceforge.net/plugins.htm
41
 * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html
42
 * http://www.cs.ucla.edu/~leec/mediabench/applications.html
43
 * SoX source code http://home.sprynet.com/~cbagwell/sox.html
44
 *
45
 * CD-ROM XA:
46
 * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html
47
 * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html
48
 * readstr http://www.geocities.co.jp/Playtown/2004/
49
 */
50

    
51
#define BLKSIZE 1024
52

    
53
/* step_table[] and index_table[] are from the ADPCM reference source */
54
/* This is the index table: */
55
static const int index_table[16] = {
56
    -1, -1, -1, -1, 2, 4, 6, 8,
57
    -1, -1, -1, -1, 2, 4, 6, 8,
58
};
59

    
60
/**
61
 * This is the step table. Note that many programs use slight deviations from
62
 * this table, but such deviations are negligible:
63
 */
64
static const int step_table[89] = {
65
    7, 8, 9, 10, 11, 12, 13, 14, 16, 17,
66
    19, 21, 23, 25, 28, 31, 34, 37, 41, 45,
67
    50, 55, 60, 66, 73, 80, 88, 97, 107, 118,
68
    130, 143, 157, 173, 190, 209, 230, 253, 279, 307,
69
    337, 371, 408, 449, 494, 544, 598, 658, 724, 796,
70
    876, 963, 1060, 1166, 1282, 1411, 1552, 1707, 1878, 2066,
71
    2272, 2499, 2749, 3024, 3327, 3660, 4026, 4428, 4871, 5358,
72
    5894, 6484, 7132, 7845, 8630, 9493, 10442, 11487, 12635, 13899,
73
    15289, 16818, 18500, 20350, 22385, 24623, 27086, 29794, 32767
74
};
75

    
76
/* These are for MS-ADPCM */
77
/* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */
78
static const int AdaptationTable[] = {
79
        230, 230, 230, 230, 307, 409, 512, 614,
80
        768, 614, 512, 409, 307, 230, 230, 230
81
};
82

    
83
static const int AdaptCoeff1[] = {
84
        256, 512, 0, 192, 240, 460, 392
85
};
86

    
87
static const int AdaptCoeff2[] = {
88
        0, -256, 0, 64, 0, -208, -232
89
};
90

    
91
/* These are for CD-ROM XA ADPCM */
92
static const int xa_adpcm_table[5][2] = {
93
   {   0,   0 },
94
   {  60,   0 },
95
   { 115, -52 },
96
   {  98, -55 },
97
   { 122, -60 }
98
};
99

    
100
static const int ea_adpcm_table[] = {
101
    0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
102
    3, 4, 7, 8, 10, 11, 0, -1, -3, -4
103
};
104

    
105
static const int ct_adpcm_table[8] = {
106
    0x00E6, 0x00E6, 0x00E6, 0x00E6,
107
    0x0133, 0x0199, 0x0200, 0x0266
108
};
109

    
110
// padded to zero where table size is less then 16
111
static const int swf_index_tables[4][16] = {
112
    /*2*/ { -1, 2 },
113
    /*3*/ { -1, -1, 2, 4 },
114
    /*4*/ { -1, -1, -1, -1, 2, 4, 6, 8 },
115
    /*5*/ { -1, -1, -1, -1, -1, -1, -1, -1, 1, 2, 4, 6, 8, 10, 13, 16 }
116
};
117

    
118
static const int yamaha_indexscale[] = {
119
    230, 230, 230, 230, 307, 409, 512, 614,
120
    230, 230, 230, 230, 307, 409, 512, 614
121
};
122

    
123
static const int yamaha_difflookup[] = {
124
    1, 3, 5, 7, 9, 11, 13, 15,
125
    -1, -3, -5, -7, -9, -11, -13, -15
126
};
127

    
128
/* end of tables */
129

    
130
typedef struct ADPCMChannelStatus {
131
    int predictor;
132
    short int step_index;
133
    int step;
134
    /* for encoding */
135
    int prev_sample;
136

    
137
    /* MS version */
138
    short sample1;
139
    short sample2;
140
    int coeff1;
141
    int coeff2;
142
    int idelta;
143
} ADPCMChannelStatus;
144

    
145
typedef struct ADPCMContext {
146
    int channel; /* for stereo MOVs, decode left, then decode right, then tell it's decoded */
147
    ADPCMChannelStatus status[2];
148
    short sample_buffer[32]; /* hold left samples while waiting for right samples */
149
} ADPCMContext;
150

    
151
/* XXX: implement encoding */
152

    
153
#ifdef CONFIG_ENCODERS
154
static int adpcm_encode_init(AVCodecContext *avctx)
155
{
156
    if (avctx->channels > 2)
157
        return -1; /* only stereo or mono =) */
158
    switch(avctx->codec->id) {
159
    case CODEC_ID_ADPCM_IMA_QT:
160
        av_log(avctx, AV_LOG_ERROR, "ADPCM: codec adpcm_ima_qt unsupported for encoding !\n");
161
        avctx->frame_size = 64; /* XXX: can multiple of avctx->channels * 64 (left and right blocks are interleaved) */
162
        return -1;
163
        break;
164
    case CODEC_ID_ADPCM_IMA_WAV:
165
        avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
166
                                                             /* and we have 4 bytes per channel overhead */
167
        avctx->block_align = BLKSIZE;
168
        /* seems frame_size isn't taken into account... have to buffer the samples :-( */
169
        break;
170
    case CODEC_ID_ADPCM_MS:
171
        avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
172
                                                             /* and we have 7 bytes per channel overhead */
173
        avctx->block_align = BLKSIZE;
174
        break;
175
    case CODEC_ID_ADPCM_YAMAHA:
176
        avctx->frame_size = BLKSIZE * avctx->channels;
177
        avctx->block_align = BLKSIZE;
178
        break;
179
    case CODEC_ID_ADPCM_SWF:
180
        if (avctx->sample_rate != 11025 &&
181
            avctx->sample_rate != 22050 &&
182
            avctx->sample_rate != 44100) {
183
            av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");
184
            return -1;
185
        }
186
        avctx->frame_size = 512 * (avctx->sample_rate / 11025);
187
        break;
188
    default:
189
        return -1;
190
        break;
191
    }
192

    
193
    avctx->coded_frame= avcodec_alloc_frame();
194
    avctx->coded_frame->key_frame= 1;
195

    
196
    return 0;
197
}
198

    
199
static int adpcm_encode_close(AVCodecContext *avctx)
200
{
201
    av_freep(&avctx->coded_frame);
202

    
203
    return 0;
204
}
205

    
206

    
207
static inline unsigned char adpcm_ima_compress_sample(ADPCMChannelStatus *c, short sample)
208
{
209
    int delta = sample - c->prev_sample;
210
    int nibble = FFMIN(7, abs(delta)*4/step_table[c->step_index]) + (delta<0)*8;
211
    c->prev_sample += ((step_table[c->step_index] * yamaha_difflookup[nibble]) / 8);
212
    c->prev_sample = av_clip_int16(c->prev_sample);
213
    c->step_index = av_clip(c->step_index + index_table[nibble], 0, 88);
214
    return nibble;
215
}
216

    
217
static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
218
{
219
    int predictor, nibble, bias;
220

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

    
223
    nibble= sample - predictor;
224
    if(nibble>=0) bias= c->idelta/2;
225
    else          bias=-c->idelta/2;
226

    
227
    nibble= (nibble + bias) / c->idelta;
228
    nibble= av_clip(nibble, -8, 7)&0x0F;
229

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

    
232
    c->sample2 = c->sample1;
233
    c->sample1 = av_clip_int16(predictor);
234

    
235
    c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
236
    if (c->idelta < 16) c->idelta = 16;
237

    
238
    return nibble;
239
}
240

    
241
static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
242
{
243
    int nibble, delta;
244

    
245
    if(!c->step) {
246
        c->predictor = 0;
247
        c->step = 127;
248
    }
249

    
250
    delta = sample - c->predictor;
251

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

    
254
    c->predictor += ((c->step * yamaha_difflookup[nibble]) / 8);
255
    c->predictor = av_clip_int16(c->predictor);
256
    c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
257
    c->step = av_clip(c->step, 127, 24567);
258

    
259
    return nibble;
260
}
261

    
262
typedef struct TrellisPath {
263
    int nibble;
264
    int prev;
265
} TrellisPath;
266

    
267
typedef struct TrellisNode {
268
    uint32_t ssd;
269
    int path;
270
    int sample1;
271
    int sample2;
272
    int step;
273
} TrellisNode;
274

    
275
static void adpcm_compress_trellis(AVCodecContext *avctx, const short *samples,
276
                                   uint8_t *dst, ADPCMChannelStatus *c, int n)
277
{
278
#define FREEZE_INTERVAL 128
279
    //FIXME 6% faster if frontier is a compile-time constant
280
    const int frontier = 1 << avctx->trellis;
281
    const int stride = avctx->channels;
282
    const int version = avctx->codec->id;
283
    const int max_paths = frontier*FREEZE_INTERVAL;
284
    TrellisPath paths[max_paths], *p;
285
    TrellisNode node_buf[2][frontier];
286
    TrellisNode *nodep_buf[2][frontier];
287
    TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
288
    TrellisNode **nodes_next = nodep_buf[1];
289
    int pathn = 0, froze = -1, i, j, k;
290

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

    
293
    memset(nodep_buf, 0, sizeof(nodep_buf));
294
    nodes[0] = &node_buf[1][0];
295
    nodes[0]->ssd = 0;
296
    nodes[0]->path = 0;
297
    nodes[0]->step = c->step_index;
298
    nodes[0]->sample1 = c->sample1;
299
    nodes[0]->sample2 = c->sample2;
300
    if(version == CODEC_ID_ADPCM_IMA_WAV)
301
        nodes[0]->sample1 = c->prev_sample;
302
    if(version == CODEC_ID_ADPCM_MS)
303
        nodes[0]->step = c->idelta;
304
    if(version == CODEC_ID_ADPCM_YAMAHA) {
305
        if(c->step == 0) {
306
            nodes[0]->step = 127;
307
            nodes[0]->sample1 = 0;
308
        } else {
309
            nodes[0]->step = c->step;
310
            nodes[0]->sample1 = c->predictor;
311
        }
312
    }
313

    
314
    for(i=0; i<n; i++) {
315
        TrellisNode *t = node_buf[i&1];
316
        TrellisNode **u;
317
        int sample = samples[i*stride];
318
        memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
319
        for(j=0; j<frontier && nodes[j]; j++) {
320
            // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
321
            const int range = (j < frontier/2) ? 1 : 0;
322
            const int step = nodes[j]->step;
323
            int nidx;
324
            if(version == CODEC_ID_ADPCM_MS) {
325
                const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 256;
326
                const int div = (sample - predictor) / step;
327
                const int nmin = av_clip(div-range, -8, 6);
328
                const int nmax = av_clip(div+range, -7, 7);
329
                for(nidx=nmin; nidx<=nmax; nidx++) {
330
                    const int nibble = nidx & 0xf;
331
                    int dec_sample = predictor + nidx * step;
332
#define STORE_NODE(NAME, STEP_INDEX)\
333
                    int d;\
334
                    uint32_t ssd;\
335
                    dec_sample = av_clip_int16(dec_sample);\
336
                    d = sample - dec_sample;\
337
                    ssd = nodes[j]->ssd + d*d;\
338
                    if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
339
                        continue;\
340
                    /* Collapse any two states with the same previous sample value. \
341
                     * One could also distinguish states by step and by 2nd to last
342
                     * sample, but the effects of that are negligible. */\
343
                    for(k=0; k<frontier && nodes_next[k]; k++) {\
344
                        if(dec_sample == nodes_next[k]->sample1) {\
345
                            assert(ssd >= nodes_next[k]->ssd);\
346
                            goto next_##NAME;\
347
                        }\
348
                    }\
349
                    for(k=0; k<frontier; k++) {\
350
                        if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
351
                            TrellisNode *u = nodes_next[frontier-1];\
352
                            if(!u) {\
353
                                assert(pathn < max_paths);\
354
                                u = t++;\
355
                                u->path = pathn++;\
356
                            }\
357
                            u->ssd = ssd;\
358
                            u->step = STEP_INDEX;\
359
                            u->sample2 = nodes[j]->sample1;\
360
                            u->sample1 = dec_sample;\
361
                            paths[u->path].nibble = nibble;\
362
                            paths[u->path].prev = nodes[j]->path;\
363
                            memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
364
                            nodes_next[k] = u;\
365
                            break;\
366
                        }\
367
                    }\
368
                    next_##NAME:;
369
                    STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
370
                }
371
            } else if(version == CODEC_ID_ADPCM_IMA_WAV) {
372
#define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
373
                const int predictor = nodes[j]->sample1;\
374
                const int div = (sample - predictor) * 4 / STEP_TABLE;\
375
                int nmin = av_clip(div-range, -7, 6);\
376
                int nmax = av_clip(div+range, -6, 7);\
377
                if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
378
                if(nmax<0) nmax--;\
379
                for(nidx=nmin; nidx<=nmax; nidx++) {\
380
                    const int nibble = nidx<0 ? 7-nidx : nidx;\
381
                    int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
382
                    STORE_NODE(NAME, STEP_INDEX);\
383
                }
384
                LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
385
            } else { //CODEC_ID_ADPCM_YAMAHA
386
                LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
387
#undef LOOP_NODES
388
#undef STORE_NODE
389
            }
390
        }
391

    
392
        u = nodes;
393
        nodes = nodes_next;
394
        nodes_next = u;
395

    
396
        // prevent overflow
397
        if(nodes[0]->ssd > (1<<28)) {
398
            for(j=1; j<frontier && nodes[j]; j++)
399
                nodes[j]->ssd -= nodes[0]->ssd;
400
            nodes[0]->ssd = 0;
401
        }
402

    
403
        // merge old paths to save memory
404
        if(i == froze + FREEZE_INTERVAL) {
405
            p = &paths[nodes[0]->path];
406
            for(k=i; k>froze; k--) {
407
                dst[k] = p->nibble;
408
                p = &paths[p->prev];
409
            }
410
            froze = i;
411
            pathn = 0;
412
            // other nodes might use paths that don't coincide with the frozen one.
413
            // checking which nodes do so is too slow, so just kill them all.
414
            // this also slightly improves quality, but I don't know why.
415
            memset(nodes+1, 0, (frontier-1)*sizeof(TrellisNode*));
416
        }
417
    }
418

    
419
    p = &paths[nodes[0]->path];
420
    for(i=n-1; i>froze; i--) {
421
        dst[i] = p->nibble;
422
        p = &paths[p->prev];
423
    }
424

    
425
    c->predictor = nodes[0]->sample1;
426
    c->sample1 = nodes[0]->sample1;
427
    c->sample2 = nodes[0]->sample2;
428
    c->step_index = nodes[0]->step;
429
    c->step = nodes[0]->step;
430
    c->idelta = nodes[0]->step;
431
}
432

    
433
static int adpcm_encode_frame(AVCodecContext *avctx,
434
                            unsigned char *frame, int buf_size, void *data)
435
{
436
    int n, i, st;
437
    short *samples;
438
    unsigned char *dst;
439
    ADPCMContext *c = avctx->priv_data;
440

    
441
    dst = frame;
442
    samples = (short *)data;
443
    st= avctx->channels == 2;
444
/*    n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
445

    
446
    switch(avctx->codec->id) {
447
    case CODEC_ID_ADPCM_IMA_QT: /* XXX: can't test until we get .mov writer */
448
        break;
449
    case CODEC_ID_ADPCM_IMA_WAV:
450
        n = avctx->frame_size / 8;
451
            c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
452
/*            c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
453
            bytestream_put_le16(&dst, c->status[0].prev_sample);
454
            *dst++ = (unsigned char)c->status[0].step_index;
455
            *dst++ = 0; /* unknown */
456
            samples++;
457
            if (avctx->channels == 2) {
458
                c->status[1].prev_sample = (signed short)samples[1];
459
/*                c->status[1].step_index = 0; */
460
                bytestream_put_le16(&dst, c->status[1].prev_sample);
461
                *dst++ = (unsigned char)c->status[1].step_index;
462
                *dst++ = 0;
463
                samples++;
464
            }
465

    
466
            /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
467
            if(avctx->trellis > 0) {
468
                uint8_t buf[2][n*8];
469
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);
470
                if(avctx->channels == 2)
471
                    adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);
472
                for(i=0; i<n; i++) {
473
                    *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);
474
                    *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);
475
                    *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);
476
                    *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);
477
                    if (avctx->channels == 2) {
478
                        *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);
479
                        *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);
480
                        *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);
481
                        *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);
482
                    }
483
                }
484
            } else
485
            for (; n>0; n--) {
486
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]) & 0x0F;
487
                *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4) & 0xF0;
488
                dst++;
489
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]) & 0x0F;
490
                *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4) & 0xF0;
491
                dst++;
492
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]) & 0x0F;
493
                *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4) & 0xF0;
494
                dst++;
495
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]) & 0x0F;
496
                *dst |= (adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4) & 0xF0;
497
                dst++;
498
                /* right channel */
499
                if (avctx->channels == 2) {
500
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
501
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
502
                    dst++;
503
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
504
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
505
                    dst++;
506
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
507
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
508
                    dst++;
509
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
510
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
511
                    dst++;
512
                }
513
                samples += 8 * avctx->channels;
514
            }
515
        break;
516
    case CODEC_ID_ADPCM_SWF:
517
    {
518
        int i;
519
        PutBitContext pb;
520
        init_put_bits(&pb, dst, buf_size*8);
521

    
522
        //Store AdpcmCodeSize
523
        put_bits(&pb, 2, 2);                //Set 4bits flash adpcm format
524

    
525
        //Init the encoder state
526
        for(i=0; i<avctx->channels; i++){
527
            c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits
528
            put_bits(&pb, 16, samples[i] & 0xFFFF);
529
            put_bits(&pb, 6, c->status[i].step_index);
530
            c->status[i].prev_sample = (signed short)samples[i];
531
        }
532

    
533
        for (i=1; i<avctx->frame_size; i++) {
534
            put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]) & 0xF);
535
            if (avctx->channels == 2)
536
                put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]) & 0xF);
537
        }
538
        flush_put_bits(&pb);
539
        dst += put_bits_count(&pb)>>3;
540
        break;
541
    }
542
    case CODEC_ID_ADPCM_MS:
543
        for(i=0; i<avctx->channels; i++){
544
            int predictor=0;
545

    
546
            *dst++ = predictor;
547
            c->status[i].coeff1 = AdaptCoeff1[predictor];
548
            c->status[i].coeff2 = AdaptCoeff2[predictor];
549
        }
550
        for(i=0; i<avctx->channels; i++){
551
            if (c->status[i].idelta < 16)
552
                c->status[i].idelta = 16;
553

    
554
            bytestream_put_le16(&dst, c->status[i].idelta);
555
        }
556
        for(i=0; i<avctx->channels; i++){
557
            c->status[i].sample1= *samples++;
558

    
559
            bytestream_put_le16(&dst, c->status[i].sample1);
560
        }
561
        for(i=0; i<avctx->channels; i++){
562
            c->status[i].sample2= *samples++;
563

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

    
567
        if(avctx->trellis > 0) {
568
            int n = avctx->block_align - 7*avctx->channels;
569
            uint8_t buf[2][n];
570
            if(avctx->channels == 1) {
571
                n *= 2;
572
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
573
                for(i=0; i<n; i+=2)
574
                    *dst++ = (buf[0][i] << 4) | buf[0][i+1];
575
            } else {
576
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
577
                adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
578
                for(i=0; i<n; i++)
579
                    *dst++ = (buf[0][i] << 4) | buf[1][i];
580
            }
581
        } else
582
        for(i=7*avctx->channels; i<avctx->block_align; i++) {
583
            int nibble;
584
            nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
585
            nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
586
            *dst++ = nibble;
587
        }
588
        break;
589
    case CODEC_ID_ADPCM_YAMAHA:
590
        n = avctx->frame_size / 2;
591
        if(avctx->trellis > 0) {
592
            uint8_t buf[2][n*2];
593
            n *= 2;
594
            if(avctx->channels == 1) {
595
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
596
                for(i=0; i<n; i+=2)
597
                    *dst++ = buf[0][i] | (buf[0][i+1] << 4);
598
            } else {
599
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
600
                adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
601
                for(i=0; i<n; i++)
602
                    *dst++ = buf[0][i] | (buf[1][i] << 4);
603
            }
604
        } else
605
        for (; n>0; n--) {
606
            for(i = 0; i < avctx->channels; i++) {
607
                int nibble;
608
                nibble  = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
609
                nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
610
                *dst++ = nibble;
611
            }
612
            samples += 2 * avctx->channels;
613
        }
614
        break;
615
    default:
616
        return -1;
617
    }
618
    return dst - frame;
619
}
620
#endif //CONFIG_ENCODERS
621

    
622
static int adpcm_decode_init(AVCodecContext * avctx)
623
{
624
    ADPCMContext *c = avctx->priv_data;
625

    
626
    if(avctx->channels > 2U){
627
        return -1;
628
    }
629

    
630
    c->channel = 0;
631
    c->status[0].predictor = c->status[1].predictor = 0;
632
    c->status[0].step_index = c->status[1].step_index = 0;
633
    c->status[0].step = c->status[1].step = 0;
634

    
635
    switch(avctx->codec->id) {
636
    case CODEC_ID_ADPCM_CT:
637
        c->status[0].step = c->status[1].step = 511;
638
        break;
639
    case CODEC_ID_ADPCM_IMA_WS:
640
        if (avctx->extradata && avctx->extradata_size == 2 * 4) {
641
            c->status[0].predictor = AV_RL32(avctx->extradata);
642
            c->status[1].predictor = AV_RL32(avctx->extradata + 4);
643
        }
644
        break;
645
    default:
646
        break;
647
    }
648
    return 0;
649
}
650

    
651
static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
652
{
653
    int step_index;
654
    int predictor;
655
    int sign, delta, diff, step;
656

    
657
    step = step_table[c->step_index];
658
    step_index = c->step_index + index_table[(unsigned)nibble];
659
    if (step_index < 0) step_index = 0;
660
    else if (step_index > 88) step_index = 88;
661

    
662
    sign = nibble & 8;
663
    delta = nibble & 7;
664
    /* perform direct multiplication instead of series of jumps proposed by
665
     * the reference ADPCM implementation since modern CPUs can do the mults
666
     * quickly enough */
667
    diff = ((2 * delta + 1) * step) >> shift;
668
    predictor = c->predictor;
669
    if (sign) predictor -= diff;
670
    else predictor += diff;
671

    
672
    c->predictor = av_clip_int16(predictor);
673
    c->step_index = step_index;
674

    
675
    return (short)c->predictor;
676
}
677

    
678
static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
679
{
680
    int predictor;
681

    
682
    predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 256;
683
    predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;
684

    
685
    c->sample2 = c->sample1;
686
    c->sample1 = av_clip_int16(predictor);
687
    c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
688
    if (c->idelta < 16) c->idelta = 16;
689

    
690
    return c->sample1;
691
}
692

    
693
static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
694
{
695
    int sign, delta, diff;
696
    int new_step;
697

    
698
    sign = nibble & 8;
699
    delta = nibble & 7;
700
    /* perform direct multiplication instead of series of jumps proposed by
701
     * the reference ADPCM implementation since modern CPUs can do the mults
702
     * quickly enough */
703
    diff = ((2 * delta + 1) * c->step) >> 3;
704
    /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
705
    c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);
706
    c->predictor = av_clip_int16(c->predictor);
707
    /* calculate new step and clamp it to range 511..32767 */
708
    new_step = (ct_adpcm_table[nibble & 7] * c->step) >> 8;
709
    c->step = new_step;
710
    if(c->step < 511)
711
        c->step = 511;
712
    if(c->step > 32767)
713
        c->step = 32767;
714

    
715
    return (short)c->predictor;
716
}
717

    
718
static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
719
{
720
    int sign, delta, diff;
721

    
722
    sign = nibble & (1<<(size-1));
723
    delta = nibble & ((1<<(size-1))-1);
724
    diff = delta << (7 + c->step + shift);
725

    
726
    if (sign)
727
        c->predictor -= diff;
728
    else
729
        c->predictor += diff;
730

    
731
    /* clamp result */
732
    if (c->predictor > 16256)
733
        c->predictor = 16256;
734
    else if (c->predictor < -16384)
735
        c->predictor = -16384;
736

    
737
    /* calculate new step */
738
    if (delta >= (2*size - 3) && c->step < 3)
739
        c->step++;
740
    else if (delta == 0 && c->step > 0)
741
        c->step--;
742

    
743
    return (short) c->predictor;
744
}
745

    
746
static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
747
{
748
    if(!c->step) {
749
        c->predictor = 0;
750
        c->step = 127;
751
    }
752

    
753
    c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
754
    c->predictor = av_clip_int16(c->predictor);
755
    c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
756
    c->step = av_clip(c->step, 127, 24567);
757
    return c->predictor;
758
}
759

    
760
static void xa_decode(short *out, const unsigned char *in,
761
    ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
762
{
763
    int i, j;
764
    int shift,filter,f0,f1;
765
    int s_1,s_2;
766
    int d,s,t;
767

    
768
    for(i=0;i<4;i++) {
769

    
770
        shift  = 12 - (in[4+i*2] & 15);
771
        filter = in[4+i*2] >> 4;
772
        f0 = xa_adpcm_table[filter][0];
773
        f1 = xa_adpcm_table[filter][1];
774

    
775
        s_1 = left->sample1;
776
        s_2 = left->sample2;
777

    
778
        for(j=0;j<28;j++) {
779
            d = in[16+i+j*4];
780

    
781
            t = (signed char)(d<<4)>>4;
782
            s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
783
            s_2 = s_1;
784
            s_1 = av_clip_int16(s);
785
            *out = s_1;
786
            out += inc;
787
        }
788

    
789
        if (inc==2) { /* stereo */
790
            left->sample1 = s_1;
791
            left->sample2 = s_2;
792
            s_1 = right->sample1;
793
            s_2 = right->sample2;
794
            out = out + 1 - 28*2;
795
        }
796

    
797
        shift  = 12 - (in[5+i*2] & 15);
798
        filter = in[5+i*2] >> 4;
799

    
800
        f0 = xa_adpcm_table[filter][0];
801
        f1 = xa_adpcm_table[filter][1];
802

    
803
        for(j=0;j<28;j++) {
804
            d = in[16+i+j*4];
805

    
806
            t = (signed char)d >> 4;
807
            s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
808
            s_2 = s_1;
809
            s_1 = av_clip_int16(s);
810
            *out = s_1;
811
            out += inc;
812
        }
813

    
814
        if (inc==2) { /* stereo */
815
            right->sample1 = s_1;
816
            right->sample2 = s_2;
817
            out -= 1;
818
        } else {
819
            left->sample1 = s_1;
820
            left->sample2 = s_2;
821
        }
822
    }
823
}
824

    
825

    
826
/* DK3 ADPCM support macro */
827
#define DK3_GET_NEXT_NIBBLE() \
828
    if (decode_top_nibble_next) \
829
    { \
830
        nibble = (last_byte >> 4) & 0x0F; \
831
        decode_top_nibble_next = 0; \
832
    } \
833
    else \
834
    { \
835
        last_byte = *src++; \
836
        if (src >= buf + buf_size) break; \
837
        nibble = last_byte & 0x0F; \
838
        decode_top_nibble_next = 1; \
839
    }
840

    
841
static int adpcm_decode_frame(AVCodecContext *avctx,
842
                            void *data, int *data_size,
843
                            uint8_t *buf, int buf_size)
844
{
845
    ADPCMContext *c = avctx->priv_data;
846
    ADPCMChannelStatus *cs;
847
    int n, m, channel, i;
848
    int block_predictor[2];
849
    short *samples;
850
    short *samples_end;
851
    uint8_t *src;
852
    int st; /* stereo */
853

    
854
    /* DK3 ADPCM accounting variables */
855
    unsigned char last_byte = 0;
856
    unsigned char nibble;
857
    int decode_top_nibble_next = 0;
858
    int diff_channel;
859

    
860
    /* EA ADPCM state variables */
861
    uint32_t samples_in_chunk;
862
    int32_t previous_left_sample, previous_right_sample;
863
    int32_t current_left_sample, current_right_sample;
864
    int32_t next_left_sample, next_right_sample;
865
    int32_t coeff1l, coeff2l, coeff1r, coeff2r;
866
    uint8_t shift_left, shift_right;
867
    int count1, count2;
868

    
869
    if (!buf_size)
870
        return 0;
871

    
872
    //should protect all 4bit ADPCM variants
873
    //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
874
    //
875
    if(*data_size/4 < buf_size + 8)
876
        return -1;
877

    
878
    samples = data;
879
    samples_end= samples + *data_size/2;
880
    *data_size= 0;
881
    src = buf;
882

    
883
    st = avctx->channels == 2 ? 1 : 0;
884

    
885
    switch(avctx->codec->id) {
886
    case CODEC_ID_ADPCM_IMA_QT:
887
        n = (buf_size - 2);/* >> 2*avctx->channels;*/
888
        channel = c->channel;
889
        cs = &(c->status[channel]);
890
        /* (pppppp) (piiiiiii) */
891

    
892
        /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
893
        cs->predictor = (*src++) << 8;
894
        cs->predictor |= (*src & 0x80);
895
        cs->predictor &= 0xFF80;
896

    
897
        /* sign extension */
898
        if(cs->predictor & 0x8000)
899
            cs->predictor -= 0x10000;
900

    
901
        cs->predictor = av_clip_int16(cs->predictor);
902

    
903
        cs->step_index = (*src++) & 0x7F;
904

    
905
        if (cs->step_index > 88){
906
            av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
907
            cs->step_index = 88;
908
        }
909

    
910
        cs->step = step_table[cs->step_index];
911

    
912
        if (st && channel)
913
            samples++;
914

    
915
        for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
916
            *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
917
            samples += avctx->channels;
918
            *samples = adpcm_ima_expand_nibble(cs, (src[0] >> 4) & 0x0F, 3);
919
            samples += avctx->channels;
920
            src ++;
921
        }
922

    
923
        if(st) { /* handle stereo interlacing */
924
            c->channel = (channel + 1) % 2; /* we get one packet for left, then one for right data */
925
            if(channel == 1) { /* wait for the other packet before outputing anything */
926
                return src - buf;
927
            }
928
        }
929
        break;
930
    case CODEC_ID_ADPCM_IMA_WAV:
931
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
932
            buf_size = avctx->block_align;
933

    
934
//        samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;
935

    
936
        for(i=0; i<avctx->channels; i++){
937
            cs = &(c->status[i]);
938
            cs->predictor = (int16_t)(src[0] + (src[1]<<8));
939
            src+=2;
940

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

    
943
            cs->step_index = *src++;
944
            if (cs->step_index > 88){
945
                av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
946
                cs->step_index = 88;
947
            }
948
            if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
949
        }
950

    
951
        while(src < buf + buf_size){
952
            for(m=0; m<4; m++){
953
                for(i=0; i<=st; i++)
954
                    *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
955
                for(i=0; i<=st; i++)
956
                    *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4  , 3);
957
                src++;
958
            }
959
            src += 4*st;
960
        }
961
        break;
962
    case CODEC_ID_ADPCM_4XM:
963
        cs = &(c->status[0]);
964
        c->status[0].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
965
        if(st){
966
            c->status[1].predictor= (int16_t)(src[0] + (src[1]<<8)); src+=2;
967
        }
968
        c->status[0].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
969
        if(st){
970
            c->status[1].step_index= (int16_t)(src[0] + (src[1]<<8)); src+=2;
971
        }
972
        if (cs->step_index < 0) cs->step_index = 0;
973
        if (cs->step_index > 88) cs->step_index = 88;
974

    
975
        m= (buf_size - (src - buf))>>st;
976
        for(i=0; i<m; i++) {
977
            *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
978
            if (st)
979
                *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
980
            *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
981
            if (st)
982
                *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
983
        }
984

    
985
        src += m<<st;
986

    
987
        break;
988
    case CODEC_ID_ADPCM_MS:
989
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
990
            buf_size = avctx->block_align;
991
        n = buf_size - 7 * avctx->channels;
992
        if (n < 0)
993
            return -1;
994
        block_predictor[0] = av_clip(*src++, 0, 7);
995
        block_predictor[1] = 0;
996
        if (st)
997
            block_predictor[1] = av_clip(*src++, 0, 7);
998
        c->status[0].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
999
        src+=2;
1000
        if (st){
1001
            c->status[1].idelta = (int16_t)((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1002
            src+=2;
1003
        }
1004
        c->status[0].coeff1 = AdaptCoeff1[block_predictor[0]];
1005
        c->status[0].coeff2 = AdaptCoeff2[block_predictor[0]];
1006
        c->status[1].coeff1 = AdaptCoeff1[block_predictor[1]];
1007
        c->status[1].coeff2 = AdaptCoeff2[block_predictor[1]];
1008

    
1009
        c->status[0].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1010
        src+=2;
1011
        if (st) c->status[1].sample1 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1012
        if (st) src+=2;
1013
        c->status[0].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1014
        src+=2;
1015
        if (st) c->status[1].sample2 = ((*src & 0xFF) | ((src[1] << 8) & 0xFF00));
1016
        if (st) src+=2;
1017

    
1018
        *samples++ = c->status[0].sample1;
1019
        if (st) *samples++ = c->status[1].sample1;
1020
        *samples++ = c->status[0].sample2;
1021
        if (st) *samples++ = c->status[1].sample2;
1022
        for(;n>0;n--) {
1023
            *samples++ = adpcm_ms_expand_nibble(&c->status[0], (src[0] >> 4) & 0x0F);
1024
            *samples++ = adpcm_ms_expand_nibble(&c->status[st], src[0] & 0x0F);
1025
            src ++;
1026
        }
1027
        break;
1028
    case CODEC_ID_ADPCM_IMA_DK4:
1029
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
1030
            buf_size = avctx->block_align;
1031

    
1032
        c->status[0].predictor = (int16_t)(src[0] | (src[1] << 8));
1033
        c->status[0].step_index = src[2];
1034
        src += 4;
1035
        *samples++ = c->status[0].predictor;
1036
        if (st) {
1037
            c->status[1].predictor = (int16_t)(src[0] | (src[1] << 8));
1038
            c->status[1].step_index = src[2];
1039
            src += 4;
1040
            *samples++ = c->status[1].predictor;
1041
        }
1042
        while (src < buf + buf_size) {
1043

    
1044
            /* take care of the top nibble (always left or mono channel) */
1045
            *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1046
                (src[0] >> 4) & 0x0F, 3);
1047

    
1048
            /* take care of the bottom nibble, which is right sample for
1049
             * stereo, or another mono sample */
1050
            if (st)
1051
                *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1052
                    src[0] & 0x0F, 3);
1053
            else
1054
                *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1055
                    src[0] & 0x0F, 3);
1056

    
1057
            src++;
1058
        }
1059
        break;
1060
    case CODEC_ID_ADPCM_IMA_DK3:
1061
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
1062
            buf_size = avctx->block_align;
1063

    
1064
        if(buf_size + 16 > (samples_end - samples)*3/8)
1065
            return -1;
1066

    
1067
        c->status[0].predictor = (int16_t)(src[10] | (src[11] << 8));
1068
        c->status[1].predictor = (int16_t)(src[12] | (src[13] << 8));
1069
        c->status[0].step_index = src[14];
1070
        c->status[1].step_index = src[15];
1071
        /* sign extend the predictors */
1072
        src += 16;
1073
        diff_channel = c->status[1].predictor;
1074

    
1075
        /* the DK3_GET_NEXT_NIBBLE macro issues the break statement when
1076
         * the buffer is consumed */
1077
        while (1) {
1078

    
1079
            /* for this algorithm, c->status[0] is the sum channel and
1080
             * c->status[1] is the diff channel */
1081

    
1082
            /* process the first predictor of the sum channel */
1083
            DK3_GET_NEXT_NIBBLE();
1084
            adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1085

    
1086
            /* process the diff channel predictor */
1087
            DK3_GET_NEXT_NIBBLE();
1088
            adpcm_ima_expand_nibble(&c->status[1], nibble, 3);
1089

    
1090
            /* process the first pair of stereo PCM samples */
1091
            diff_channel = (diff_channel + c->status[1].predictor) / 2;
1092
            *samples++ = c->status[0].predictor + c->status[1].predictor;
1093
            *samples++ = c->status[0].predictor - c->status[1].predictor;
1094

    
1095
            /* process the second predictor of the sum channel */
1096
            DK3_GET_NEXT_NIBBLE();
1097
            adpcm_ima_expand_nibble(&c->status[0], nibble, 3);
1098

    
1099
            /* process the second pair of stereo PCM samples */
1100
            diff_channel = (diff_channel + c->status[1].predictor) / 2;
1101
            *samples++ = c->status[0].predictor + c->status[1].predictor;
1102
            *samples++ = c->status[0].predictor - c->status[1].predictor;
1103
        }
1104
        break;
1105
    case CODEC_ID_ADPCM_IMA_WS:
1106
        /* no per-block initialization; just start decoding the data */
1107
        while (src < buf + buf_size) {
1108

    
1109
            if (st) {
1110
                *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1111
                    (src[0] >> 4) & 0x0F, 3);
1112
                *samples++ = adpcm_ima_expand_nibble(&c->status[1],
1113
                    src[0] & 0x0F, 3);
1114
            } else {
1115
                *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1116
                    (src[0] >> 4) & 0x0F, 3);
1117
                *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1118
                    src[0] & 0x0F, 3);
1119
            }
1120

    
1121
            src++;
1122
        }
1123
        break;
1124
    case CODEC_ID_ADPCM_XA:
1125
        c->status[0].sample1 = c->status[0].sample2 =
1126
        c->status[1].sample1 = c->status[1].sample2 = 0;
1127
        while (buf_size >= 128) {
1128
            xa_decode(samples, src, &c->status[0], &c->status[1],
1129
                avctx->channels);
1130
            src += 128;
1131
            samples += 28 * 8;
1132
            buf_size -= 128;
1133
        }
1134
        break;
1135
    case CODEC_ID_ADPCM_EA:
1136
        samples_in_chunk = AV_RL32(src);
1137
        if (samples_in_chunk >= ((buf_size - 12) * 2)) {
1138
            src += buf_size;
1139
            break;
1140
        }
1141
        src += 4;
1142
        current_left_sample = (int16_t)AV_RL16(src);
1143
        src += 2;
1144
        previous_left_sample = (int16_t)AV_RL16(src);
1145
        src += 2;
1146
        current_right_sample = (int16_t)AV_RL16(src);
1147
        src += 2;
1148
        previous_right_sample = (int16_t)AV_RL16(src);
1149
        src += 2;
1150

    
1151
        for (count1 = 0; count1 < samples_in_chunk/28;count1++) {
1152
            coeff1l = ea_adpcm_table[(*src >> 4) & 0x0F];
1153
            coeff2l = ea_adpcm_table[((*src >> 4) & 0x0F) + 4];
1154
            coeff1r = ea_adpcm_table[*src & 0x0F];
1155
            coeff2r = ea_adpcm_table[(*src & 0x0F) + 4];
1156
            src++;
1157

    
1158
            shift_left = ((*src >> 4) & 0x0F) + 8;
1159
            shift_right = (*src & 0x0F) + 8;
1160
            src++;
1161

    
1162
            for (count2 = 0; count2 < 28; count2++) {
1163
                next_left_sample = (((*src & 0xF0) << 24) >> shift_left);
1164
                next_right_sample = (((*src & 0x0F) << 28) >> shift_right);
1165
                src++;
1166

    
1167
                next_left_sample = (next_left_sample +
1168
                    (current_left_sample * coeff1l) +
1169
                    (previous_left_sample * coeff2l) + 0x80) >> 8;
1170
                next_right_sample = (next_right_sample +
1171
                    (current_right_sample * coeff1r) +
1172
                    (previous_right_sample * coeff2r) + 0x80) >> 8;
1173

    
1174
                previous_left_sample = current_left_sample;
1175
                current_left_sample = av_clip_int16(next_left_sample);
1176
                previous_right_sample = current_right_sample;
1177
                current_right_sample = av_clip_int16(next_right_sample);
1178
                *samples++ = (unsigned short)current_left_sample;
1179
                *samples++ = (unsigned short)current_right_sample;
1180
            }
1181
        }
1182
        break;
1183
    case CODEC_ID_ADPCM_IMA_SMJPEG:
1184
        c->status[0].predictor = *src;
1185
        src += 2;
1186
        c->status[0].step_index = *src++;
1187
        src++;  /* skip another byte before getting to the meat */
1188
        while (src < buf + buf_size) {
1189
            *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1190
                *src & 0x0F, 3);
1191
            *samples++ = adpcm_ima_expand_nibble(&c->status[0],
1192
                (*src >> 4) & 0x0F, 3);
1193
            src++;
1194
        }
1195
        break;
1196
    case CODEC_ID_ADPCM_CT:
1197
        while (src < buf + buf_size) {
1198
            if (st) {
1199
                *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1200
                    (src[0] >> 4) & 0x0F);
1201
                *samples++ = adpcm_ct_expand_nibble(&c->status[1],
1202
                    src[0] & 0x0F);
1203
            } else {
1204
                *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1205
                    (src[0] >> 4) & 0x0F);
1206
                *samples++ = adpcm_ct_expand_nibble(&c->status[0],
1207
                    src[0] & 0x0F);
1208
            }
1209
            src++;
1210
        }
1211
        break;
1212
    case CODEC_ID_ADPCM_SBPRO_4:
1213
    case CODEC_ID_ADPCM_SBPRO_3:
1214
    case CODEC_ID_ADPCM_SBPRO_2:
1215
        if (!c->status[0].step_index) {
1216
            /* the first byte is a raw sample */
1217
            *samples++ = 128 * (*src++ - 0x80);
1218
            if (st)
1219
              *samples++ = 128 * (*src++ - 0x80);
1220
            c->status[0].step_index = 1;
1221
        }
1222
        if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_4) {
1223
            while (src < buf + buf_size) {
1224
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1225
                    (src[0] >> 4) & 0x0F, 4, 0);
1226
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1227
                    src[0] & 0x0F, 4, 0);
1228
                src++;
1229
            }
1230
        } else if (avctx->codec->id == CODEC_ID_ADPCM_SBPRO_3) {
1231
            while (src < buf + buf_size && samples + 2 < samples_end) {
1232
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1233
                    (src[0] >> 5) & 0x07, 3, 0);
1234
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1235
                    (src[0] >> 2) & 0x07, 3, 0);
1236
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1237
                    src[0] & 0x03, 2, 0);
1238
                src++;
1239
            }
1240
        } else {
1241
            while (src < buf + buf_size && samples + 3 < samples_end) {
1242
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1243
                    (src[0] >> 6) & 0x03, 2, 2);
1244
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1245
                    (src[0] >> 4) & 0x03, 2, 2);
1246
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[0],
1247
                    (src[0] >> 2) & 0x03, 2, 2);
1248
                *samples++ = adpcm_sbpro_expand_nibble(&c->status[st],
1249
                    src[0] & 0x03, 2, 2);
1250
                src++;
1251
            }
1252
        }
1253
        break;
1254
    case CODEC_ID_ADPCM_SWF:
1255
    {
1256
        GetBitContext gb;
1257
        const int *table;
1258
        int k0, signmask, nb_bits, count;
1259
        int size = buf_size*8;
1260

    
1261
        init_get_bits(&gb, buf, size);
1262

    
1263
        //read bits & initial values
1264
        nb_bits = get_bits(&gb, 2)+2;
1265
        //av_log(NULL,AV_LOG_INFO,"nb_bits: %d\n", nb_bits);
1266
        table = swf_index_tables[nb_bits-2];
1267
        k0 = 1 << (nb_bits-2);
1268
        signmask = 1 << (nb_bits-1);
1269

    
1270
        while (get_bits_count(&gb) <= size - 22*avctx->channels) {
1271
            for (i = 0; i < avctx->channels; i++) {
1272
                *samples++ = c->status[i].predictor = get_sbits(&gb, 16);
1273
                c->status[i].step_index = get_bits(&gb, 6);
1274
            }
1275

    
1276
            for (count = 0; get_bits_count(&gb) <= size - nb_bits*avctx->channels && count < 4095; count++) {
1277
                int i;
1278

    
1279
                for (i = 0; i < avctx->channels; i++) {
1280
                    // similar to IMA adpcm
1281
                    int delta = get_bits(&gb, nb_bits);
1282
                    int step = step_table[c->status[i].step_index];
1283
                    long vpdiff = 0; // vpdiff = (delta+0.5)*step/4
1284
                    int k = k0;
1285

    
1286
                    do {
1287
                        if (delta & k)
1288
                            vpdiff += step;
1289
                        step >>= 1;
1290
                        k >>= 1;
1291
                    } while(k);
1292
                    vpdiff += step;
1293

    
1294
                    if (delta & signmask)
1295
                        c->status[i].predictor -= vpdiff;
1296
                    else
1297
                        c->status[i].predictor += vpdiff;
1298

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

    
1301
                    c->status[i].step_index = av_clip(c->status[i].step_index, 0, 88);
1302
                    c->status[i].predictor = av_clip_int16(c->status[i].predictor);
1303

    
1304
                    *samples++ = c->status[i].predictor;
1305
                    if (samples >= samples_end) {
1306
                        av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1307
                        return -1;
1308
                    }
1309
                }
1310
            }
1311
        }
1312
        src += buf_size;
1313
        break;
1314
    }
1315
    case CODEC_ID_ADPCM_YAMAHA:
1316
        while (src < buf + buf_size) {
1317
            if (st) {
1318
                *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1319
                        src[0] & 0x0F);
1320
                *samples++ = adpcm_yamaha_expand_nibble(&c->status[1],
1321
                        (src[0] >> 4) & 0x0F);
1322
            } else {
1323
                *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1324
                        src[0] & 0x0F);
1325
                *samples++ = adpcm_yamaha_expand_nibble(&c->status[0],
1326
                        (src[0] >> 4) & 0x0F);
1327
            }
1328
            src++;
1329
        }
1330
        break;
1331
    case CODEC_ID_ADPCM_THP:
1332
    {
1333
        int table[2][16];
1334
        unsigned int samplecnt;
1335
        int prev[2][2];
1336
        int ch;
1337

    
1338
        if (buf_size < 80) {
1339
            av_log(avctx, AV_LOG_ERROR, "frame too small\n");
1340
            return -1;
1341
        }
1342

    
1343
        src+=4;
1344
        samplecnt = bytestream_get_be32(&src);
1345

    
1346
        for (i = 0; i < 32; i++)
1347
            table[0][i] = (int16_t)bytestream_get_be16(&src);
1348

    
1349
        /* Initialize the previous sample.  */
1350
        for (i = 0; i < 4; i++)
1351
            prev[0][i] = (int16_t)bytestream_get_be16(&src);
1352

    
1353
        if (samplecnt >= (samples_end - samples) /  (st + 1)) {
1354
            av_log(avctx, AV_LOG_ERROR, "allocated output buffer is too small\n");
1355
            return -1;
1356
        }
1357

    
1358
        for (ch = 0; ch <= st; ch++) {
1359
            samples = (unsigned short *) data + ch;
1360

    
1361
            /* Read in every sample for this channel.  */
1362
            for (i = 0; i < samplecnt / 14; i++) {
1363
                int index = (*src >> 4) & 7;
1364
                unsigned int exp = 28 - (*src++ & 15);
1365
                int factor1 = table[ch][index * 2];
1366
                int factor2 = table[ch][index * 2 + 1];
1367

    
1368
                /* Decode 14 samples.  */
1369
                for (n = 0; n < 14; n++) {
1370
                    int32_t sampledat;
1371
                    if(n&1) sampledat=  *src++    <<28;
1372
                    else    sampledat= (*src&0xF0)<<24;
1373

    
1374
                    sampledat = ((prev[ch][0]*factor1
1375
                                + prev[ch][1]*factor2) >> 11) + (sampledat>>exp);
1376
                    *samples = av_clip_int16(sampledat);
1377
                    prev[ch][1] = prev[ch][0];
1378
                    prev[ch][0] = *samples++;
1379

    
1380
                    /* In case of stereo, skip one sample, this sample
1381
                       is for the other channel.  */
1382
                    samples += st;
1383
                }
1384
            }
1385
        }
1386

    
1387
        /* In the previous loop, in case stereo is used, samples is
1388
           increased exactly one time too often.  */
1389
        samples -= st;
1390
        break;
1391
    }
1392

    
1393
    default:
1394
        return -1;
1395
    }
1396
    *data_size = (uint8_t *)samples - (uint8_t *)data;
1397
    return src - buf;
1398
}
1399

    
1400

    
1401

    
1402
#ifdef CONFIG_ENCODERS
1403
#define ADPCM_ENCODER(id,name)                  \
1404
AVCodec name ## _encoder = {                    \
1405
    #name,                                      \
1406
    CODEC_TYPE_AUDIO,                           \
1407
    id,                                         \
1408
    sizeof(ADPCMContext),                       \
1409
    adpcm_encode_init,                          \
1410
    adpcm_encode_frame,                         \
1411
    adpcm_encode_close,                         \
1412
    NULL,                                       \
1413
};
1414
#else
1415
#define ADPCM_ENCODER(id,name)
1416
#endif
1417

    
1418
#ifdef CONFIG_DECODERS
1419
#define ADPCM_DECODER(id,name)                  \
1420
AVCodec name ## _decoder = {                    \
1421
    #name,                                      \
1422
    CODEC_TYPE_AUDIO,                           \
1423
    id,                                         \
1424
    sizeof(ADPCMContext),                       \
1425
    adpcm_decode_init,                          \
1426
    NULL,                                       \
1427
    NULL,                                       \
1428
    adpcm_decode_frame,                         \
1429
};
1430
#else
1431
#define ADPCM_DECODER(id,name)
1432
#endif
1433

    
1434
#define ADPCM_CODEC(id, name)                   \
1435
ADPCM_ENCODER(id,name) ADPCM_DECODER(id,name)
1436

    
1437
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_QT, adpcm_ima_qt);
1438
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WAV, adpcm_ima_wav);
1439
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK3, adpcm_ima_dk3);
1440
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_DK4, adpcm_ima_dk4);
1441
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_WS, adpcm_ima_ws);
1442
ADPCM_CODEC(CODEC_ID_ADPCM_IMA_SMJPEG, adpcm_ima_smjpeg);
1443
ADPCM_CODEC(CODEC_ID_ADPCM_MS, adpcm_ms);
1444
ADPCM_CODEC(CODEC_ID_ADPCM_4XM, adpcm_4xm);
1445
ADPCM_CODEC(CODEC_ID_ADPCM_XA, adpcm_xa);
1446
ADPCM_CODEC(CODEC_ID_ADPCM_EA, adpcm_ea);
1447
ADPCM_CODEC(CODEC_ID_ADPCM_CT, adpcm_ct);
1448
ADPCM_CODEC(CODEC_ID_ADPCM_SWF, adpcm_swf);
1449
ADPCM_CODEC(CODEC_ID_ADPCM_YAMAHA, adpcm_yamaha);
1450
ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_4, adpcm_sbpro_4);
1451
ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_3, adpcm_sbpro_3);
1452
ADPCM_CODEC(CODEC_ID_ADPCM_SBPRO_2, adpcm_sbpro_2);
1453
ADPCM_CODEC(CODEC_ID_ADPCM_THP, adpcm_thp);
1454

    
1455
#undef ADPCM_CODEC