adpcm.c 61.1 KB
Newer Older
1 2
/*
 * ADPCM codecs
3
 * Copyright (c) 2001-2003 The ffmpeg Project
4
 *
5 6 7
 * This file is part of FFmpeg.
 *
 * FFmpeg is free software; you can redistribute it and/or
8 9
 * modify it under the terms of the GNU Lesser General Public
 * 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 14 15 16 17
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * 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

Michael Niedermayer's avatar
Michael Niedermayer committed
25
/**
26
 * @file libavcodec/adpcm.c
Michael Niedermayer's avatar
Michael Niedermayer committed
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)
Peter Ross's avatar
Peter Ross committed
33
 * EA ADPCM R1/R2/R3 decoder by Peter Ross (pross@xvid.org)
Peter Ross's avatar
Peter Ross committed
34
 * EA IMA EACS decoder by Peter Ross (pross@xvid.org)
Peter Ross's avatar
Peter Ross committed
35
 * EA IMA SEAD decoder by Peter Ross (pross@xvid.org)
36
 * EA ADPCM XAS decoder by Peter Ross (pross@xvid.org)
Robert Marston's avatar
Robert Marston committed
37
 * MAXIS EA ADPCM decoder by Robert Marston (rmarston@gmail.com)
38
 * THP ADPCM decoder by Marco Gerards (mgerards@xs4all.nl)
39 40 41 42
 *
 * Features and limitations:
 *
 * Reference documents:
43
 * http://www.pcisys.net/~melanson/codecs/simpleaudio.html
44 45 46
 * http://www.geocities.com/SiliconValley/8682/aud3.txt
 * http://openquicktime.sourceforge.net/plugins.htm
 * XAnim sources (xa_codec.c) http://www.rasnaimaging.com/people/lapus/download.html
47 48
 * http://www.cs.ucla.edu/~leec/mediabench/applications.html
 * SoX source code http://home.sprynet.com/~cbagwell/sox.html
49 50 51 52 53
 *
 * CD-ROM XA:
 * http://ku-www.ss.titech.ac.jp/~yatsushi/xaadpcm.html
 * vagpack & depack http://homepages.compuserve.de/bITmASTER32/psx-index.html
 * readstr http://www.geocities.co.jp/Playtown/2004/
54 55 56 57 58 59
 */

#define BLKSIZE 1024

/* step_table[] and index_table[] are from the ADPCM reference source */
/* This is the index table: */
60
static const int index_table[16] = {
61 62 63 64
    -1, -1, -1, -1, 2, 4, 6, 8,
    -1, -1, -1, -1, 2, 4, 6, 8,
};

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

81
/* These are for MS-ADPCM */
82
/* AdaptationTable[], AdaptCoeff1[], and AdaptCoeff2[] are from libsndfile */
83
static const int AdaptationTable[] = {
84 85 86 87
        230, 230, 230, 230, 307, 409, 512, 614,
        768, 614, 512, 409, 307, 230, 230, 230
};

88
static const uint8_t AdaptCoeff1[] = {
89
        64, 128, 0, 48, 60, 115, 98
90 91
};

92 93
static const int8_t AdaptCoeff2[] = {
        0, -64, 0, 16, 0, -52, -58
94 95
};

96
/* These are for CD-ROM XA ADPCM */
Alex Beregszaszi's avatar
100l  
Alex Beregszaszi committed
97
static const int xa_adpcm_table[5][2] = {
98 99 100 101 102 103 104
   {   0,   0 },
   {  60,   0 },
   { 115, -52 },
   {  98, -55 },
   { 122, -60 }
};

Michael Niedermayer's avatar
Michael Niedermayer committed
105
static const int ea_adpcm_table[] = {
106 107 108 109
    0, 240, 460, 392, 0, 0, -208, -220, 0, 1,
    3, 4, 7, 8, 10, 11, 0, -1, -3, -4
};

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

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

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

128 129 130 131 132 133
/* end of tables */

typedef struct ADPCMChannelStatus {
    int predictor;
    short int step_index;
    int step;
134 135
    /* for encoding */
    int prev_sample;
136 137 138 139 140 141 142 143 144 145

    /* MS version */
    short sample1;
    short sample2;
    int coeff1;
    int coeff2;
    int idelta;
} ADPCMChannelStatus;

typedef struct ADPCMContext {
Peter Ross's avatar
Peter Ross committed
146
    ADPCMChannelStatus status[6];
147 148 149 150
} ADPCMContext;

/* XXX: implement encoding */

151
#if CONFIG_ENCODERS
152 153
static int adpcm_encode_init(AVCodecContext *avctx)
{
154 155
    if (avctx->channels > 2)
        return -1; /* only stereo or mono =) */
156 157 158 159 160 161

    if(avctx->trellis && (unsigned)avctx->trellis > 16U){
        av_log(avctx, AV_LOG_ERROR, "invalid trellis size\n");
        return -1;
    }

162 163
    switch(avctx->codec->id) {
    case CODEC_ID_ADPCM_IMA_WAV:
164 165 166 167 168
        avctx->frame_size = (BLKSIZE - 4 * avctx->channels) * 8 / (4 * avctx->channels) + 1; /* each 16 bits sample gives one nibble */
                                                             /* and we have 4 bytes per channel overhead */
        avctx->block_align = BLKSIZE;
        /* seems frame_size isn't taken into account... have to buffer the samples :-( */
        break;
169 170 171 172
    case CODEC_ID_ADPCM_IMA_QT:
        avctx->frame_size = 64;
        avctx->block_align = 34 * avctx->channels;
        break;
173
    case CODEC_ID_ADPCM_MS:
174 175 176
        avctx->frame_size = (BLKSIZE - 7 * avctx->channels) * 2 / avctx->channels + 2; /* each 16 bits sample gives one nibble */
                                                             /* and we have 7 bytes per channel overhead */
        avctx->block_align = BLKSIZE;
177
        break;
178 179 180 181
    case CODEC_ID_ADPCM_YAMAHA:
        avctx->frame_size = BLKSIZE * avctx->channels;
        avctx->block_align = BLKSIZE;
        break;
182
    case CODEC_ID_ADPCM_SWF:
183 184 185 186 187 188 189
        if (avctx->sample_rate != 11025 &&
            avctx->sample_rate != 22050 &&
            avctx->sample_rate != 44100) {
            av_log(avctx, AV_LOG_ERROR, "Sample rate must be 11025, 22050 or 44100\n");
            return -1;
        }
        avctx->frame_size = 512 * (avctx->sample_rate / 11025);
190
        break;
191
    default:
192
        return -1;
193 194
        break;
    }
Michael Niedermayer's avatar
Michael Niedermayer committed
195 196 197 198

    avctx->coded_frame= avcodec_alloc_frame();
    avctx->coded_frame->key_frame= 1;

199 200 201 202 203
    return 0;
}

static int adpcm_encode_close(AVCodecContext *avctx)
{
Michael Niedermayer's avatar
Michael Niedermayer committed
204 205
    av_freep(&avctx->coded_frame);

206 207 208
    return 0;
}

209 210 211

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

220 221 222 223
static inline unsigned char adpcm_ms_compress_sample(ADPCMChannelStatus *c, short sample)
{
    int predictor, nibble, bias;

224
    predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 64;
225

226 227 228
    nibble= sample - predictor;
    if(nibble>=0) bias= c->idelta/2;
    else          bias=-c->idelta/2;
229

230
    nibble= (nibble + bias) / c->idelta;
231
    nibble= av_clip(nibble, -8, 7)&0x0F;
232

233 234 235
    predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;

    c->sample2 = c->sample1;
236
    c->sample1 = av_clip_int16(predictor);
237 238 239 240 241 242 243

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

    return nibble;
}

244 245
static inline unsigned char adpcm_yamaha_compress_sample(ADPCMChannelStatus *c, short sample)
{
246
    int nibble, delta;
247 248 249 250 251 252

    if(!c->step) {
        c->predictor = 0;
        c->step = 127;
    }

253
    delta = sample - c->predictor;
254

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

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

262
    return nibble;
263 264
}

Loren Merritt's avatar
Loren Merritt committed
265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
typedef struct TrellisPath {
    int nibble;
    int prev;
} TrellisPath;

typedef struct TrellisNode {
    uint32_t ssd;
    int path;
    int sample1;
    int sample2;
    int step;
} TrellisNode;

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

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

    memset(nodep_buf, 0, sizeof(nodep_buf));
    nodes[0] = &node_buf[1][0];
    nodes[0]->ssd = 0;
    nodes[0]->path = 0;
    nodes[0]->step = c->step_index;
    nodes[0]->sample1 = c->sample1;
    nodes[0]->sample2 = c->sample2;
303
    if((version == CODEC_ID_ADPCM_IMA_WAV) || (version == CODEC_ID_ADPCM_IMA_QT) || (version == CODEC_ID_ADPCM_SWF))
Loren Merritt's avatar
Loren Merritt committed
304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327
        nodes[0]->sample1 = c->prev_sample;
    if(version == CODEC_ID_ADPCM_MS)
        nodes[0]->step = c->idelta;
    if(version == CODEC_ID_ADPCM_YAMAHA) {
        if(c->step == 0) {
            nodes[0]->step = 127;
            nodes[0]->sample1 = 0;
        } else {
            nodes[0]->step = c->step;
            nodes[0]->sample1 = c->predictor;
        }
    }

    for(i=0; i<n; i++) {
        TrellisNode *t = node_buf[i&1];
        TrellisNode **u;
        int sample = samples[i*stride];
        memset(nodes_next, 0, frontier*sizeof(TrellisNode*));
        for(j=0; j<frontier && nodes[j]; j++) {
            // higher j have higher ssd already, so they're unlikely to use a suboptimal next sample too
            const int range = (j < frontier/2) ? 1 : 0;
            const int step = nodes[j]->step;
            int nidx;
            if(version == CODEC_ID_ADPCM_MS) {
328
                const int predictor = ((nodes[j]->sample1 * c->coeff1) + (nodes[j]->sample2 * c->coeff2)) / 64;
Loren Merritt's avatar
Loren Merritt committed
329
                const int div = (sample - predictor) / step;
330 331
                const int nmin = av_clip(div-range, -8, 6);
                const int nmax = av_clip(div+range, -7, 7);
Loren Merritt's avatar
Loren Merritt committed
332 333 334 335 336 337
                for(nidx=nmin; nidx<=nmax; nidx++) {
                    const int nibble = nidx & 0xf;
                    int dec_sample = predictor + nidx * step;
#define STORE_NODE(NAME, STEP_INDEX)\
                    int d;\
                    uint32_t ssd;\
338
                    dec_sample = av_clip_int16(dec_sample);\
Loren Merritt's avatar
Loren Merritt committed
339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
                    d = sample - dec_sample;\
                    ssd = nodes[j]->ssd + d*d;\
                    if(nodes_next[frontier-1] && ssd >= nodes_next[frontier-1]->ssd)\
                        continue;\
                    /* Collapse any two states with the same previous sample value. \
                     * One could also distinguish states by step and by 2nd to last
                     * sample, but the effects of that are negligible. */\
                    for(k=0; k<frontier && nodes_next[k]; k++) {\
                        if(dec_sample == nodes_next[k]->sample1) {\
                            assert(ssd >= nodes_next[k]->ssd);\
                            goto next_##NAME;\
                        }\
                    }\
                    for(k=0; k<frontier; k++) {\
                        if(!nodes_next[k] || ssd < nodes_next[k]->ssd) {\
                            TrellisNode *u = nodes_next[frontier-1];\
                            if(!u) {\
                                assert(pathn < max_paths);\
                                u = t++;\
                                u->path = pathn++;\
                            }\
                            u->ssd = ssd;\
                            u->step = STEP_INDEX;\
                            u->sample2 = nodes[j]->sample1;\
                            u->sample1 = dec_sample;\
                            paths[u->path].nibble = nibble;\
                            paths[u->path].prev = nodes[j]->path;\
                            memmove(&nodes_next[k+1], &nodes_next[k], (frontier-k-1)*sizeof(TrellisNode*));\
                            nodes_next[k] = u;\
                            break;\
                        }\
                    }\
                    next_##NAME:;
                    STORE_NODE(ms, FFMAX(16, (AdaptationTable[nibble] * step) >> 8));
                }
374
            } else if((version == CODEC_ID_ADPCM_IMA_WAV)|| (version == CODEC_ID_ADPCM_IMA_QT)|| (version == CODEC_ID_ADPCM_SWF)) {
Loren Merritt's avatar
Loren Merritt committed
375 376 377
#define LOOP_NODES(NAME, STEP_TABLE, STEP_INDEX)\
                const int predictor = nodes[j]->sample1;\
                const int div = (sample - predictor) * 4 / STEP_TABLE;\
378 379
                int nmin = av_clip(div-range, -7, 6);\
                int nmax = av_clip(div+range, -6, 7);\
Loren Merritt's avatar
Loren Merritt committed
380 381 382 383 384 385 386
                if(nmin<=0) nmin--; /* distinguish -0 from +0 */\
                if(nmax<0) nmax--;\
                for(nidx=nmin; nidx<=nmax; nidx++) {\
                    const int nibble = nidx<0 ? 7-nidx : nidx;\
                    int dec_sample = predictor + (STEP_TABLE * yamaha_difflookup[nibble]) / 8;\
                    STORE_NODE(NAME, STEP_INDEX);\
                }
387
                LOOP_NODES(ima, step_table[step], av_clip(step + index_table[nibble], 0, 88));
Loren Merritt's avatar
Loren Merritt committed
388
            } else { //CODEC_ID_ADPCM_YAMAHA
389
                LOOP_NODES(yamaha, step, av_clip((step * yamaha_indexscale[nibble]) >> 8, 127, 24567));
Loren Merritt's avatar
Loren Merritt committed
390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435
#undef LOOP_NODES
#undef STORE_NODE
            }
        }

        u = nodes;
        nodes = nodes_next;
        nodes_next = u;

        // prevent overflow
        if(nodes[0]->ssd > (1<<28)) {
            for(j=1; j<frontier && nodes[j]; j++)
                nodes[j]->ssd -= nodes[0]->ssd;
            nodes[0]->ssd = 0;
        }

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

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

    c->predictor = nodes[0]->sample1;
    c->sample1 = nodes[0]->sample1;
    c->sample2 = nodes[0]->sample2;
    c->step_index = nodes[0]->step;
    c->step = nodes[0]->step;
    c->idelta = nodes[0]->step;
}

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

    dst = frame;
    samples = (short *)data;
446
    st= avctx->channels == 2;
447
/*    n = (BLKSIZE - 4 * avctx->channels) / (2 * 8 * avctx->channels); */
448 449

    switch(avctx->codec->id) {
450 451 452 453
    case CODEC_ID_ADPCM_IMA_WAV:
        n = avctx->frame_size / 8;
            c->status[0].prev_sample = (signed short)samples[0]; /* XXX */
/*            c->status[0].step_index = 0; *//* XXX: not sure how to init the state machine */
Ramiro Polla's avatar
Ramiro Polla committed
454
            bytestream_put_le16(&dst, c->status[0].prev_sample);
455 456 457 458
            *dst++ = (unsigned char)c->status[0].step_index;
            *dst++ = 0; /* unknown */
            samples++;
            if (avctx->channels == 2) {
459
                c->status[1].prev_sample = (signed short)samples[0];
460
/*                c->status[1].step_index = 0; */
Ramiro Polla's avatar
Ramiro Polla committed
461
                bytestream_put_le16(&dst, c->status[1].prev_sample);
462 463 464 465
                *dst++ = (unsigned char)c->status[1].step_index;
                *dst++ = 0;
                samples++;
            }
466

467
            /* stereo: 4 bytes (8 samples) for left, 4 bytes for right, 4 bytes left, ... */
Loren Merritt's avatar
Loren Merritt committed
468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485
            if(avctx->trellis > 0) {
                uint8_t buf[2][n*8];
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n*8);
                if(avctx->channels == 2)
                    adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n*8);
                for(i=0; i<n; i++) {
                    *dst++ = buf[0][8*i+0] | (buf[0][8*i+1] << 4);
                    *dst++ = buf[0][8*i+2] | (buf[0][8*i+3] << 4);
                    *dst++ = buf[0][8*i+4] | (buf[0][8*i+5] << 4);
                    *dst++ = buf[0][8*i+6] | (buf[0][8*i+7] << 4);
                    if (avctx->channels == 2) {
                        *dst++ = buf[1][8*i+0] | (buf[1][8*i+1] << 4);
                        *dst++ = buf[1][8*i+2] | (buf[1][8*i+3] << 4);
                        *dst++ = buf[1][8*i+4] | (buf[1][8*i+5] << 4);
                        *dst++ = buf[1][8*i+6] | (buf[1][8*i+7] << 4);
                    }
                }
            } else
486
            for (; n>0; n--) {
487 488
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[0]);
                *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels]) << 4;
489
                dst++;
490 491
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 2]);
                *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 3]) << 4;
492
                dst++;
493 494
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 4]);
                *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 5]) << 4;
495
                dst++;
496 497
                *dst = adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 6]);
                *dst |= adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels * 7]) << 4;
498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
                dst++;
                /* right channel */
                if (avctx->channels == 2) {
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[1]);
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[3]) << 4;
                    dst++;
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[5]);
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[7]) << 4;
                    dst++;
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[9]);
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[11]) << 4;
                    dst++;
                    *dst = adpcm_ima_compress_sample(&c->status[1], samples[13]);
                    *dst |= adpcm_ima_compress_sample(&c->status[1], samples[15]) << 4;
                    dst++;
                }
                samples += 8 * avctx->channels;
            }
        break;
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546
    case CODEC_ID_ADPCM_IMA_QT:
    {
        int ch, i;
        PutBitContext pb;
        init_put_bits(&pb, dst, buf_size*8);

        for(ch=0; ch<avctx->channels; ch++){
            put_bits(&pb, 9, (c->status[ch].prev_sample + 0x10000) >> 7);
            put_bits(&pb, 7, c->status[ch].step_index);
            if(avctx->trellis > 0) {
                uint8_t buf[64];
                adpcm_compress_trellis(avctx, samples+ch, buf, &c->status[ch], 64);
                for(i=0; i<64; i++)
                    put_bits(&pb, 4, buf[i^1]);
                c->status[ch].prev_sample = c->status[ch].predictor & ~0x7F;
            } else {
                for (i=0; i<64; i+=2){
                    int t1, t2;
                    t1 = adpcm_ima_compress_sample(&c->status[ch], samples[avctx->channels*(i+0)+ch]);
                    t2 = adpcm_ima_compress_sample(&c->status[ch], samples[avctx->channels*(i+1)+ch]);
                    put_bits(&pb, 4, t2);
                    put_bits(&pb, 4, t1);
                }
                c->status[ch].prev_sample &= ~0x7F;
            }
        }

        dst += put_bits_count(&pb)>>3;
        break;
    }
547 548 549 550 551 552
    case CODEC_ID_ADPCM_SWF:
    {
        int i;
        PutBitContext pb;
        init_put_bits(&pb, dst, buf_size*8);

553 554
        n = avctx->frame_size-1;

555 556 557 558 559
        //Store AdpcmCodeSize
        put_bits(&pb, 2, 2);                //Set 4bits flash adpcm format

        //Init the encoder state
        for(i=0; i<avctx->channels; i++){
560
            c->status[i].step_index = av_clip(c->status[i].step_index, 0, 63); // clip step so it fits 6 bits
561
            put_sbits(&pb, 16, samples[i]);
562
            put_bits(&pb, 6, c->status[i].step_index);
563 564 565
            c->status[i].prev_sample = (signed short)samples[i];
        }

566 567 568 569 570 571 572 573 574 575 576
        if(avctx->trellis > 0) {
            uint8_t buf[2][n];
            adpcm_compress_trellis(avctx, samples+2, buf[0], &c->status[0], n);
            if (avctx->channels == 2)
                adpcm_compress_trellis(avctx, samples+3, buf[1], &c->status[1], n);
            for(i=0; i<n; i++) {
                put_bits(&pb, 4, buf[0][i]);
                if (avctx->channels == 2)
                    put_bits(&pb, 4, buf[1][i]);
            }
        } else {
Benjamin Larsson's avatar
Benjamin Larsson committed
577
            for (i=1; i<avctx->frame_size; i++) {
578
                put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[0], samples[avctx->channels*i]));
Benjamin Larsson's avatar
Benjamin Larsson committed
579
                if (avctx->channels == 2)
580
                    put_bits(&pb, 4, adpcm_ima_compress_sample(&c->status[1], samples[2*i+1]));
581
            }
582
        }
583 584
        flush_put_bits(&pb);
        dst += put_bits_count(&pb)>>3;
585 586
        break;
    }
587 588 589 590 591 592 593 594 595
    case CODEC_ID_ADPCM_MS:
        for(i=0; i<avctx->channels; i++){
            int predictor=0;

            *dst++ = predictor;
            c->status[i].coeff1 = AdaptCoeff1[predictor];
            c->status[i].coeff2 = AdaptCoeff2[predictor];
        }
        for(i=0; i<avctx->channels; i++){
596
            if (c->status[i].idelta < 16)
597
                c->status[i].idelta = 16;
598

Ramiro Polla's avatar
Ramiro Polla committed
599
            bytestream_put_le16(&dst, c->status[i].idelta);
600
        }
601 602 603
        for(i=0; i<avctx->channels; i++){
            c->status[i].sample2= *samples++;
        }
604 605 606
        for(i=0; i<avctx->channels; i++){
            c->status[i].sample1= *samples++;

Ramiro Polla's avatar
Ramiro Polla committed
607
            bytestream_put_le16(&dst, c->status[i].sample1);
608
        }
609
        for(i=0; i<avctx->channels; i++)
Ramiro Polla's avatar
Ramiro Polla committed
610
            bytestream_put_le16(&dst, c->status[i].sample2);
611

Loren Merritt's avatar
Loren Merritt committed
612 613 614 615 616 617 618 619 620 621 622 623 624 625 626
        if(avctx->trellis > 0) {
            int n = avctx->block_align - 7*avctx->channels;
            uint8_t buf[2][n];
            if(avctx->channels == 1) {
                n *= 2;
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
                for(i=0; i<n; i+=2)
                    *dst++ = (buf[0][i] << 4) | buf[0][i+1];
            } else {
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
                adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
                for(i=0; i<n; i++)
                    *dst++ = (buf[0][i] << 4) | buf[1][i];
            }
        } else
627 628 629 630 631 632 633
        for(i=7*avctx->channels; i<avctx->block_align; i++) {
            int nibble;
            nibble = adpcm_ms_compress_sample(&c->status[ 0], *samples++)<<4;
            nibble|= adpcm_ms_compress_sample(&c->status[st], *samples++);
            *dst++ = nibble;
        }
        break;
634 635
    case CODEC_ID_ADPCM_YAMAHA:
        n = avctx->frame_size / 2;
Loren Merritt's avatar
Loren Merritt committed
636 637 638 639 640 641 642 643 644 645 646 647 648 649
        if(avctx->trellis > 0) {
            uint8_t buf[2][n*2];
            n *= 2;
            if(avctx->channels == 1) {
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
                for(i=0; i<n; i+=2)
                    *dst++ = buf[0][i] | (buf[0][i+1] << 4);
            } else {
                adpcm_compress_trellis(avctx, samples, buf[0], &c->status[0], n);
                adpcm_compress_trellis(avctx, samples+1, buf[1], &c->status[1], n);
                for(i=0; i<n; i++)
                    *dst++ = buf[0][i] | (buf[1][i] << 4);
            }
        } else
650 651 652
        for (; n>0; n--) {
            for(i = 0; i < avctx->channels; i++) {
                int nibble;
653 654
                nibble  = adpcm_yamaha_compress_sample(&c->status[i], samples[i]);
                nibble |= adpcm_yamaha_compress_sample(&c->status[i], samples[i+avctx->channels]) << 4;
655 656 657 658 659
                *dst++ = nibble;
            }
            samples += 2 * avctx->channels;
        }
        break;
660 661 662 663 664
    default:
        return -1;
    }
    return dst - frame;
}
665
#endif //CONFIG_ENCODERS
666

667
static av_cold int adpcm_decode_init(AVCodecContext * avctx)
668 669
{
    ADPCMContext *c = avctx->priv_data;
Baptiste Coudurier's avatar
Baptiste Coudurier committed
670
    unsigned int max_channels = 2;
671

Peter Ross's avatar
Peter Ross committed
672 673 674 675 676 677 678 679
    switch(avctx->codec->id) {
    case CODEC_ID_ADPCM_EA_R1:
    case CODEC_ID_ADPCM_EA_R2:
    case CODEC_ID_ADPCM_EA_R3:
        max_channels = 6;
        break;
    }
    if(avctx->channels > max_channels){
680 681 682
        return -1;
    }

683
    switch(avctx->codec->id) {
684
    case CODEC_ID_ADPCM_CT:
685 686
        c->status[0].step = c->status[1].step = 511;
        break;
Anssi Hannula's avatar
Anssi Hannula committed
687 688 689 690 691 692
    case CODEC_ID_ADPCM_IMA_WS:
        if (avctx->extradata && avctx->extradata_size == 2 * 4) {
            c->status[0].predictor = AV_RL32(avctx->extradata);
            c->status[1].predictor = AV_RL32(avctx->extradata + 4);
        }
        break;
693 694 695
    default:
        break;
    }
696
    avctx->sample_fmt = SAMPLE_FMT_S16;
697 698 699
    return 0;
}

Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
700
static inline short adpcm_ima_expand_nibble(ADPCMChannelStatus *c, char nibble, int shift)
701 702 703 704 705
{
    int step_index;
    int predictor;
    int sign, delta, diff, step;

706
    step = step_table[c->step_index];
707 708
    step_index = c->step_index + index_table[(unsigned)nibble];
    if (step_index < 0) step_index = 0;
709
    else if (step_index > 88) step_index = 88;
710 711 712

    sign = nibble & 8;
    delta = nibble & 7;
713 714 715
    /* perform direct multiplication instead of series of jumps proposed by
     * the reference ADPCM implementation since modern CPUs can do the mults
     * quickly enough */
Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
716
    diff = ((2 * delta + 1) * step) >> shift;
Michael Niedermayer's avatar
Michael Niedermayer committed
717 718 719 720
    predictor = c->predictor;
    if (sign) predictor -= diff;
    else predictor += diff;

721
    c->predictor = av_clip_int16(predictor);
Michael Niedermayer's avatar
Michael Niedermayer committed
722 723
    c->step_index = step_index;

724
    return (short)c->predictor;
Michael Niedermayer's avatar
Michael Niedermayer committed
725 726
}

727 728 729 730
static inline short adpcm_ms_expand_nibble(ADPCMChannelStatus *c, char nibble)
{
    int predictor;

731
    predictor = (((c->sample1) * (c->coeff1)) + ((c->sample2) * (c->coeff2))) / 64;
732 733 734
    predictor += (signed)((nibble & 0x08)?(nibble - 0x10):(nibble)) * c->idelta;

    c->sample2 = c->sample1;
735
    c->sample1 = av_clip_int16(predictor);
736
    c->idelta = (AdaptationTable[(int)nibble] * c->idelta) >> 8;
737 738
    if (c->idelta < 16) c->idelta = 16;

739
    return c->sample1;
740 741
}

742 743 744 745 746 747 748 749 750 751 752 753
static inline short adpcm_ct_expand_nibble(ADPCMChannelStatus *c, char nibble)
{
    int sign, delta, diff;
    int new_step;

    sign = nibble & 8;
    delta = nibble & 7;
    /* perform direct multiplication instead of series of jumps proposed by
     * the reference ADPCM implementation since modern CPUs can do the mults
     * quickly enough */
    diff = ((2 * delta + 1) * c->step) >> 3;
    /* predictor update is not so trivial: predictor is multiplied on 254/256 before updating */
Aurelien Jacobs's avatar
Aurelien Jacobs committed
754 755
    c->predictor = ((c->predictor * 254) >> 8) + (sign ? -diff : diff);
    c->predictor = av_clip_int16(c->predictor);
756
    /* calculate new step and clamp it to range 511..32767 */
Stefan Gehrer's avatar
Stefan Gehrer committed
757
    new_step = (AdaptationTable[nibble & 7] * c->step) >> 8;
Aurelien Jacobs's avatar
Aurelien Jacobs committed
758
    c->step = av_clip(new_step, 511, 32767);
759

760
    return (short)c->predictor;
761 762
}

763 764 765 766 767 768 769 770 771
static inline short adpcm_sbpro_expand_nibble(ADPCMChannelStatus *c, char nibble, int size, int shift)
{
    int sign, delta, diff;

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

    /* clamp result */
Aurelien Jacobs's avatar
Aurelien Jacobs committed
772
    c->predictor = av_clip(c->predictor + (sign ? -diff : diff), -16384,16256);
773 774 775 776 777 778 779 780 781 782

    /* calculate new step */
    if (delta >= (2*size - 3) && c->step < 3)
        c->step++;
    else if (delta == 0 && c->step > 0)
        c->step--;

    return (short) c->predictor;
}

783 784 785 786 787 788 789 790
static inline short adpcm_yamaha_expand_nibble(ADPCMChannelStatus *c, unsigned char nibble)
{
    if(!c->step) {
        c->predictor = 0;
        c->step = 127;
    }

    c->predictor += (c->step * yamaha_difflookup[nibble]) / 8;
791
    c->predictor = av_clip_int16(c->predictor);
792
    c->step = (c->step * yamaha_indexscale[nibble]) >> 8;
793
    c->step = av_clip(c->step, 127, 24567);
794 795 796
    return c->predictor;
}

797
static void xa_decode(short *out, const unsigned char *in,
798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820
    ADPCMChannelStatus *left, ADPCMChannelStatus *right, int inc)
{
    int i, j;
    int shift,filter,f0,f1;
    int s_1,s_2;
    int d,s,t;

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

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

        s_1 = left->sample1;
        s_2 = left->sample2;

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

            t = (signed char)(d<<4)>>4;
            s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
            s_2 = s_1;
821 822 823
            s_1 = av_clip_int16(s);
            *out = s_1;
            out += inc;
824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845
        }

        if (inc==2) { /* stereo */
            left->sample1 = s_1;
            left->sample2 = s_2;
            s_1 = right->sample1;
            s_2 = right->sample2;
            out = out + 1 - 28*2;
        }

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

        f0 = xa_adpcm_table[filter][0];
        f1 = xa_adpcm_table[filter][1];

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

            t = (signed char)d >> 4;
            s = ( t<<shift ) + ((s_1*f0 + s_2*f1+32)>>6);
            s_2 = s_1;
846 847 848
            s_1 = av_clip_int16(s);
            *out = s_1;
            out += inc;
849 850 851 852 853 854 855 856 857 858 859 860 861 862
        }

        if (inc==2) { /* stereo */
            right->sample1 = s_1;
            right->sample2 = s_2;
            out -= 1;
        } else {
            left->sample1 = s_1;
            left->sample2 = s_2;
        }
    }
}


863 864 865 866
/* DK3 ADPCM support macro */
#define DK3_GET_NEXT_NIBBLE() \
    if (decode_top_nibble_next) \
    { \
Michael Niedermayer's avatar
Michael Niedermayer committed
867
        nibble = last_byte >> 4; \
868 869 870 871 872 873 874 875 876 877
        decode_top_nibble_next = 0; \
    } \
    else \
    { \
        last_byte = *src++; \
        if (src >= buf + buf_size) break; \
        nibble = last_byte & 0x0F; \
        decode_top_nibble_next = 1; \
    }

878
static int adpcm_decode_frame(AVCodecContext *avctx,
879
                            void *data, int *data_size,
Michael Niedermayer's avatar
const  
Michael Niedermayer committed
880
                            const uint8_t *buf, int buf_size)
881 882 883
{
    ADPCMContext *c = avctx->priv_data;
    ADPCMChannelStatus *cs;
Michael Niedermayer's avatar
Michael Niedermayer committed
884
    int n, m, channel, i;
885 886
    int block_predictor[2];
    short *samples;
887
    short *samples_end;
Michael Niedermayer's avatar
const  
Michael Niedermayer committed
888
    const uint8_t *src;
889 890
    int st; /* stereo */

891 892 893 894 895 896
    /* DK3 ADPCM accounting variables */
    unsigned char last_byte = 0;
    unsigned char nibble;
    int decode_top_nibble_next = 0;
    int diff_channel;

897 898 899 900 901 902 903 904
    /* EA ADPCM state variables */
    uint32_t samples_in_chunk;
    int32_t previous_left_sample, previous_right_sample;
    int32_t current_left_sample, current_right_sample;
    int32_t next_left_sample, next_right_sample;
    int32_t coeff1l, coeff2l, coeff1r, coeff2r;
    uint8_t shift_left, shift_right;
    int count1, count2;
Robert Marston's avatar
Robert Marston committed
905
    int coeff[2][2], shift[2];//used in EA MAXIS ADPCM
906

Mike Melanson's avatar
Mike Melanson committed
907 908 909
    if (!buf_size)
        return 0;

910 911 912 913 914 915
    //should protect all 4bit ADPCM variants
    //8 is needed for CODEC_ID_ADPCM_IMA_WAV with 2 channels
    //
    if(*data_size/4 < buf_size + 8)
        return -1;

916
    samples = data;
917 918
    samples_end= samples + *data_size/2;
    *data_size= 0;
919 920
    src = buf;

921
    st = avctx->channels == 2 ? 1 : 0;
922 923 924

    switch(avctx->codec->id) {
    case CODEC_ID_ADPCM_IMA_QT:
925 926
        n = buf_size - 2*avctx->channels;
        for (channel = 0; channel < avctx->channels; channel++) {
Baptiste Coudurier's avatar
Baptiste Coudurier committed
927 928
            cs = &(c->status[channel]);
            /* (pppppp) (piiiiiii) */
929

Baptiste Coudurier's avatar
Baptiste Coudurier committed
930 931 932 933
            /* Bits 15-7 are the _top_ 9 bits of the 16-bit initial predictor value */
            cs->predictor = (*src++) << 8;
            cs->predictor |= (*src & 0x80);
            cs->predictor &= 0xFF80;
934

Baptiste Coudurier's avatar
Baptiste Coudurier committed
935 936 937
            /* sign extension */
            if(cs->predictor & 0x8000)
                cs->predictor -= 0x10000;
938

Baptiste Coudurier's avatar
Baptiste Coudurier committed
939
            cs->predictor = av_clip_int16(cs->predictor);
940

Baptiste Coudurier's avatar
Baptiste Coudurier committed
941
            cs->step_index = (*src++) & 0x7F;
942

Baptiste Coudurier's avatar
Baptiste Coudurier committed
943 944 945 946
            if (cs->step_index > 88){
                av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
                cs->step_index = 88;
            }
947

Baptiste Coudurier's avatar
Baptiste Coudurier committed
948
            cs->step = step_table[cs->step_index];
949

Baptiste Coudurier's avatar
Baptiste Coudurier committed
950
            samples = (short*)data + channel;
951

Baptiste Coudurier's avatar
Baptiste Coudurier committed
952 953 954 955 956 957 958
            for(m=32; n>0 && m>0; n--, m--) { /* in QuickTime, IMA is encoded by chuncks of 34 bytes (=64 samples) */
                *samples = adpcm_ima_expand_nibble(cs, src[0] & 0x0F, 3);
                samples += avctx->channels;
                *samples = adpcm_ima_expand_nibble(cs, src[0] >> 4  , 3);
                samples += avctx->channels;
                src ++;
            }
959
        }
960 961
        if (st)
            samples--;
962 963
        break;
    case CODEC_ID_ADPCM_IMA_WAV:
964 965 966
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
            buf_size = avctx->block_align;

967 968
//        samples_per_block= (block_align-4*chanels)*8 / (bits_per_sample * chanels) + 1;

Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
969 970
        for(i=0; i<avctx->channels; i++){
            cs = &(c->status[i]);
971
            cs->predictor = *samples++ = (int16_t)bytestream_get_le16(&src);
972

Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
973
            cs->step_index = *src++;
974 975 976 977 978
            if (cs->step_index > 88){
                av_log(avctx, AV_LOG_ERROR, "ERROR: step_index = %i\n", cs->step_index);
                cs->step_index = 88;
            }
            if (*src++) av_log(avctx, AV_LOG_ERROR, "unused byte should be null but is %d!!\n", src[-1]); /* unused */
979 980
        }

981 982 983 984 985 986 987
        while(src < buf + buf_size){
            for(m=0; m<4; m++){
                for(i=0; i<=st; i++)
                    *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] & 0x0F, 3);
                for(i=0; i<=st; i++)
                    *samples++ = adpcm_ima_expand_nibble(&c->status[i], src[4*i] >> 4  , 3);
                src++;
988
            }
989
            src += 4*st;
990
        }
Michael Niedermayer's avatar
Michael Niedermayer committed
991 992 993
        break;
    case CODEC_ID_ADPCM_4XM:
        cs = &(c->status[0]);
994
        c->status[0].predictor= (int16_t)bytestream_get_le16(&src);
Michael Niedermayer's avatar
Michael Niedermayer committed
995
        if(st){
996
            c->status[1].predictor= (int16_t)bytestream_get_le16(&src);
Michael Niedermayer's avatar
Michael Niedermayer committed
997
        }
998
        c->status[0].step_index= (int16_t)bytestream_get_le16(&src);
Michael Niedermayer's avatar
Michael Niedermayer committed
999
        if(st){
1000
            c->status[1].step_index= (int16_t)bytestream_get_le16(&src);
Michael Niedermayer's avatar
Michael Niedermayer committed
1001
        }
1002 1003
        if (cs->step_index < 0) cs->step_index = 0;
        if (cs->step_index > 88) cs->step_index = 88;
Michael Niedermayer's avatar
Michael Niedermayer committed
1004 1005 1006

        m= (buf_size - (src - buf))>>st;
        for(i=0; i<m; i++) {
1007
            *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] & 0x0F, 4);
Michael Niedermayer's avatar
Michael Niedermayer committed
1008
            if (st)
Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
1009 1010
                *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] & 0x0F, 4);
            *samples++ = adpcm_ima_expand_nibble(&c->status[0], src[i] >> 4, 4);
1011
            if (st)
Michael Niedermayer's avatar
cleanup  
Michael Niedermayer committed
1012
                *samples++ = adpcm_ima_expand_nibble(&c->status[1], src[i+m] >> 4, 4);
1013
        }
Michael Niedermayer's avatar
Michael Niedermayer committed
1014 1015 1016

        src += m<<st;

1017 1018
        break;
    case CODEC_ID_ADPCM_MS:
1019 1020
        if (avctx->block_align != 0 && buf_size > avctx->block_align)
            buf_size = avctx->block_align;
1021 1022 1023
        n = buf_size - 7 * avctx->channels;
        if (n < 0)
            return -1;
1024
        block_predictor[0] = av_clip(*src++, 0, 6);
1025 1026
        block_predictor[1] = 0;
        if (st)
1027
            block_predictor[1] = av_clip(*src++, 0, 6);
1028
        c->status[0].idelta = (int16_t)bytestream_get_le16(&src);
1029
        if (st){