decode.c 25.6 KB
Newer Older
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
1 2
/**
 * @file decode.c
3 4
 *
 * @section LICENSE
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
5
 * Copyright 2012 - 2016
6
 *
7 8 9 10
 * Mathis Rosenhauer, Moritz Hanke, Joerg Behrens
 * Deutsches Klimarechenzentrum GmbH
 * Bundesstr. 45a
 * 20146 Hamburg Germany
11
 *
12 13 14 15 16
 * Luis Kornblueh
 * Max-Planck-Institut fuer Meteorologie
 * Bundesstr. 53
 * 20146 Hamburg
 * Germany
17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
 *
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above
 *    copyright notice, this list of conditions and the following
 *    disclaimer in the documentation and/or other materials provided
 *    with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
 * COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 * OF THE POSSIBILITY OF SUCH DAMAGE.
 *
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
44 45 46
 * @section DESCRIPTION
 *
 * Adaptive Entropy Decoder
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
47
 * Based on CCSDS documents 121.0-B-2 and 120.0-G-3
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
48 49
 *
 */
50 51 52 53 54

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
55
#include "libaec.h"
56
#include "decode.h"
57

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
58 59 60 61
#if HAVE_BSR64
#  include <intrin.h>
#endif

62 63
#define ROS 5

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
64
#define BUFFERSPACE(strm) (strm->avail_in >= strm->state->in_blklen      \
65 66
                           && strm->avail_out >= strm->state->out_blklen)

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102
#define FLUSH(KIND)                                                      \
    static void flush_##KIND(struct aec_stream *strm)                    \
    {                                                                    \
        uint32_t *flush_end, *bp, half_d;                                \
        int32_t data, m;                                                 \
        struct internal_state *state = strm->state;                      \
                                                                         \
        flush_end = state->rsip;                                         \
        if (state->pp) {                                                 \
            if (state->flush_start == state->rsi_buffer                  \
                && state->rsip > state->rsi_buffer) {                    \
                state->last_out = *state->rsi_buffer;                    \
                                                                         \
                if (strm->flags & AEC_DATA_SIGNED) {                     \
                    m = UINT32_C(1) << (strm->bits_per_sample - 1);      \
                    /* Reference samples have to be sign extended */     \
                    state->last_out = (state->last_out ^ m) - m;         \
                }                                                        \
                put_##KIND(strm, (uint32_t)state->last_out);             \
                state->flush_start++;                                    \
            }                                                            \
                                                                         \
            data = state->last_out;                                      \
                                                                         \
            if (state->xmin == 0) {                                      \
                uint32_t xmax, med, d;                                   \
                med = state->xmax / 2 + 1;                               \
                xmax = state->xmax;                                      \
                                                                         \
                for (bp = state->flush_start; bp < flush_end; bp++) {    \
                    d = *bp;                                             \
                    half_d = (d >> 1) + (d & 1);                         \
                    /*in this case: data >= med == data & med */         \
                    uint32_t mask = (data & med)?xmax:0;                 \
                                                                         \
                    /*in this case: xmax - data == xmax ^ data */        \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
103
                    if (half_d <= (mask ^ (uint32_t)data)) {             \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119
                        data += (d >> 1)^(~((d & 1) - 1));               \
                    } else {                                             \
                        data = mask ^ d;                                 \
                    }                                                    \
                    put_##KIND(strm, (uint32_t)data);                    \
                }                                                        \
                state->last_out = data;                                  \
            } else {                                                     \
                int32_t xmax, d;                                         \
                xmax = state->xmax;                                      \
                                                                         \
                for (bp = state->flush_start; bp < flush_end; bp++) {    \
                    d = *bp;                                             \
                    half_d = ((uint32_t)d >> 1) + (d & 1);               \
                                                                         \
                    if (data < 0) {                                      \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
120
                        if (half_d <= xmax + (uint32_t)data + 1) {       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
121 122 123 124 125
                            data += ((uint32_t)d >> 1)^(~((d & 1) - 1)); \
                        } else {                                         \
                            data = d - xmax - 1;                         \
                        }                                                \
                    } else {                                             \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
126
                        if (half_d <= xmax - (uint32_t)data) {           \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
127 128 129 130 131 132 133 134 135 136 137 138 139 140
                            data += ((uint32_t)d >> 1)^(~((d & 1) - 1)); \
                        } else {                                         \
                            data = xmax - d;                             \
                        }                                                \
                    }                                                    \
                    put_##KIND(strm, (uint32_t)data);                    \
                }                                                        \
                state->last_out = data;                                  \
            }                                                            \
        } else {                                                         \
            for (bp = state->flush_start; bp < flush_end; bp++)          \
                put_##KIND(strm, *bp);                                   \
        }                                                                \
        state->flush_start = state->rsip;                                \
141
    }
142

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
143 144 145

static inline void put_msb_32(struct aec_stream *strm, uint32_t data)
{
146 147 148 149
    *strm->next_out++ = (unsigned char)(data >> 24);
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
150 151 152 153
}

static inline void put_msb_24(struct aec_stream *strm, uint32_t data)
{
154 155 156
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
157 158 159 160
}

static inline void put_msb_16(struct aec_stream *strm, uint32_t data)
{
161 162
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
163 164 165 166
}

static inline void put_lsb_32(struct aec_stream *strm, uint32_t data)
{
167 168 169 170
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 24);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
171 172 173 174
}

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
175 176 177
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)(data >> 16);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
178 179 180 181
}

static inline void put_lsb_16(struct aec_stream *strm, uint32_t data)
{
182 183
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
184 185 186 187
}

static inline void put_8(struct aec_stream *strm, uint32_t data)
{
188
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
189 190
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
191 192 193 194 195 196 197
FLUSH(msb_32)
FLUSH(msb_24)
FLUSH(msb_16)
FLUSH(lsb_32)
FLUSH(lsb_24)
FLUSH(lsb_16)
FLUSH(8)
198

199
static inline void check_rsi_end(struct aec_stream *strm)
200
{
201
    /**
202
       Flush output if end of RSI reached
203
     */
204
    struct internal_state *state = strm->state;
205

206
    if (state->rsi_size == (size_t)(state->rsip - state->rsi_buffer)) {
207
        state->flush_output(strm);
208 209
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
210
    }
211 212
}

213
static inline void put_sample(struct aec_stream *strm, uint32_t s)
214 215 216
{
    struct internal_state *state = strm->state;

217
    *state->rsip++ = s;
218
    strm->avail_out -= state->bytes_per_sample;
219
    check_rsi_end(strm);
220 221
}

222
static inline uint32_t direct_get(struct aec_stream *strm, int n)
223 224
{
    /**
225
       Get n bit from input stream
226 227 228 229

       No checking whatsoever. Read bits are dumped.
     */

230
    struct internal_state *state = strm->state;
231
    int b;
232

233
    if (state->bitp < n)
234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282
    {
        b = (63 - state->bitp) >> 3;
        if (b == 6) {
            state->acc = (state->acc << 48)
                | ((uint64_t)strm->next_in[0] << 40)
                | ((uint64_t)strm->next_in[1] << 32)
                | ((uint64_t)strm->next_in[2] << 24)
                | ((uint64_t)strm->next_in[3] << 16)
                | ((uint64_t)strm->next_in[4] << 8)
                | (uint64_t)strm->next_in[5];
        } else if (b == 7) {
            state->acc = (state->acc << 56)
                | ((uint64_t)strm->next_in[0] << 48)
                | ((uint64_t)strm->next_in[1] << 40)
                | ((uint64_t)strm->next_in[2] << 32)
                | ((uint64_t)strm->next_in[3] << 24)
                | ((uint64_t)strm->next_in[4] << 16)
                | ((uint64_t)strm->next_in[5] << 8)
                | (uint64_t)strm->next_in[6];
        } else if (b == 5) {
            state->acc = (state->acc << 40)
                | ((uint64_t)strm->next_in[0] << 32)
                | ((uint64_t)strm->next_in[1] << 24)
                | ((uint64_t)strm->next_in[2] << 16)
                | ((uint64_t)strm->next_in[3] << 8)
                | (uint64_t)strm->next_in[4];
        } else if (b == 4) {
            state->acc = (state->acc << 32)
                | ((uint64_t)strm->next_in[0] << 24)
                | ((uint64_t)strm->next_in[1] << 16)
                | ((uint64_t)strm->next_in[2] << 8)
                | (uint64_t)strm->next_in[3];
        } else if (b == 3) {
            state->acc = (state->acc << 24)
                | ((uint64_t)strm->next_in[0] << 16)
                | ((uint64_t)strm->next_in[1] << 8)
                | (uint64_t)strm->next_in[2];
        } else if (b == 2) {
            state->acc = (state->acc << 16)
                | ((uint64_t)strm->next_in[0] << 8)
                | (uint64_t)strm->next_in[1];
        } else if (b == 1) {
            state->acc = (state->acc << 8)
                | (uint64_t)strm->next_in[0];
        }
        strm->next_in += b;
        strm->avail_in -= b;
        state->bitp += b << 3;
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
283

284
    state->bitp -= n;
285
    return (state->acc >> state->bitp) & (UINT64_MAX >> (64 - n));
286 287
}

288
static inline uint32_t direct_get_fs(struct aec_stream *strm)
289 290 291 292
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
293
       Essentially counts the number of 0 bits until a 1 is
294
       encountered.
295 296
     */

297
    uint32_t fs = 0;
298 299 300 301
#if HAVE_BSR64
    unsigned long i;
#else
    int i;
302
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
303
    struct internal_state *state = strm->state;
304

305 306 307 308
    if (state->bitp)
        state->acc &= UINT64_MAX >> (64 - state->bitp);
    else
        state->acc = 0;
309

310
    while (state->acc == 0) {
311 312 313 314 315 316 317 318 319 320
        state->acc = (state->acc << 56)
            | ((uint64_t)strm->next_in[0] << 48)
            | ((uint64_t)strm->next_in[1] << 40)
            | ((uint64_t)strm->next_in[2] << 32)
            | ((uint64_t)strm->next_in[3] << 24)
            | ((uint64_t)strm->next_in[4] << 16)
            | ((uint64_t)strm->next_in[5] << 8)
            | (uint64_t)strm->next_in[6];
        strm->next_in += 7;
        strm->avail_in -= 7;
321
        fs += state->bitp;
322
        state->bitp = 56;
323
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
324

Thomas Jahns's avatar
Thomas Jahns committed
325
#if HAVE_DECL___BUILTIN_CLZLL
326
    i = 63 - __builtin_clzll(state->acc);
327
#elif HAVE_BSR64
328
    _BitScanReverse64(&i, state->acc);
329
#else
330 331 332
    i = state->bitp - 1;
    while ((state->acc & (UINT64_C(1) << i)) == 0)
        i--;
333
#endif
334 335
    fs += state->bitp - i - 1;
    state->bitp = i;
336 337 338
    return fs;
}

339
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
340 341 342 343 344 345 346 347 348 349 350 351
{
    while (strm->state->bitp < n) {
        if (strm->avail_in == 0)
            return 0;
        strm->avail_in--;
        strm->state->acc <<= 8;
        strm->state->acc |= *strm->next_in++;
        strm->state->bitp += 8;
    }
    return 1;
}

352
static inline uint32_t bits_get(struct aec_stream *strm, int n)
353 354
{
    return (strm->state->acc >> (strm->state->bitp - n))
355
        & (UINT64_MAX >> (64 - n));
356 357
}

358
static inline void bits_drop(struct aec_stream *strm, int n)
359 360 361 362
{
    strm->state->bitp -= n;
}

363
static inline uint32_t fs_ask(struct aec_stream *strm)
364 365 366
{
    if (bits_ask(strm, 1) == 0)
        return 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
367
    while ((strm->state->acc & (UINT64_C(1) << (strm->state->bitp - 1))) == 0) {
368 369 370 371 372 373 374 375 376 377 378 379 380 381
        if (strm->state->bitp == 1) {
            if (strm->avail_in == 0)
                return 0;
            strm->avail_in--;
            strm->state->acc <<= 8;
            strm->state->acc |= *strm->next_in++;
            strm->state->bitp += 8;
        }
        strm->state->fs++;
        strm->state->bitp--;
    }
    return 1;
}

382
static inline void fs_drop(struct aec_stream *strm)
383 384 385 386 387
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

388
static inline uint32_t copysample(struct aec_stream *strm)
389
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
390
    if (bits_ask(strm, strm->bits_per_sample) == 0
391
        || strm->avail_out < strm->state->bytes_per_sample)
392
        return 0;
393

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
394 395
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
396 397
    return 1;
}
398 399 400 401 402

static int m_id(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;

403 404
    if (state->rsip == state->rsi_buffer) {
        if(strm->flags & AEC_PAD_RSI)
405
            state->bitp -= state->bitp % 8;
406 407 408
        if (state->pp)
            state->ref = 1;
    } else {
409
        state->ref = 0;
410
    }
411 412 413 414
    if (bits_ask(strm, state->id_len) == 0)
        return M_EXIT;
    state->id = bits_get(strm, state->id_len);
    bits_drop(strm, state->id_len);
415 416 417 418 419 420 421 422 423 424 425
    state->mode = state->id_table[state->id];

    return M_CONTINUE;
}

static int m_split_output(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
    int k = state->id - 1;

    do {
426
        if (bits_ask(strm, k) == 0 || strm->avail_out < state->bytes_per_sample)
427
            return M_EXIT;
428 429 430 431
        if (k)
            *state->rsip++ += bits_get(strm, k);
        else
            state->rsip++;
432
        strm->avail_out -= state->bytes_per_sample;
433
        bits_drop(strm, k);
434
    } while(++state->i < state->n);
435

436
    check_rsi_end(strm);
437 438 439 440 441 442 443
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
444
    int k = state->id - 1;
445 446

    do {
447 448
        if (fs_ask(strm) == 0)
            return M_EXIT;
449
        state->rsip[state->i] = state->fs << k;
450
        fs_drop(strm);
451
    } while(++state->i < state->n);
452

453
    state->i = 0;
454
    state->mode = m_split_output;
455

456 457 458 459 460
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
461 462
    size_t i;
    int k;
463 464
    struct internal_state *state = strm->state;

465 466 467 468
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

        if (state->ref)
469
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
470

471
        for (i = 0; i < strm->block_size - state->ref; i++)
472
            state->rsip[i] = direct_get_fs(strm) << k;
473

474 475 476 477 478 479
        if (k) {
            for (i = state->ref; i < strm->block_size; i++)
                *state->rsip++ += direct_get(strm, k);
        } else {
            state->rsip += strm->block_size - state->ref;
        }
480

481
        strm->avail_out -= state->out_blklen;
482
        check_rsi_end(strm);
483

484 485 486 487 488
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
489 490
        if (copysample(strm) == 0)
            return M_EXIT;
491 492 493 494 495
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

496
    state->i = 0;
497 498 499 500 501 502 503 504
    state->mode = m_split_fs;
    return M_CONTINUE;
}

static int m_zero_output(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;

505
    do {
506
        if (strm->avail_out < state->bytes_per_sample)
507 508 509
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
510 511 512 513 514 515 516

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
517
    uint32_t i, zero_blocks, b, zero_bytes;
518 519
    struct internal_state *state = strm->state;

520 521
    if (fs_ask(strm) == 0)
        return M_EXIT;
522
    zero_blocks = state->fs + 1;
523
    fs_drop(strm);
524 525

    if (zero_blocks == ROS) {
526
        b = (int)(state->rsip - state->rsi_buffer) / strm->block_size;
527 528 529 530 531 532
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
533
        i = zero_blocks * strm->block_size - 1;
534
    else
535
        i = zero_blocks * strm->block_size;
536

537
    zero_bytes = i * state->bytes_per_sample;
538

539
    if (strm->avail_out >= zero_bytes) {
540 541 542
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

543 544
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
545
        strm->avail_out -= zero_bytes;
546
        check_rsi_end(strm);
547

548 549 550 551
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
552
    state->i = i;
553 554 555 556 557 558
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
559
    int32_t m, d1;
560 561 562
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
563 564
        if (fs_ask(strm) == 0)
            return M_EXIT;
565
        m = state->fs;
566
        d1 = m - state->se_table[2 * m + 1];
567 568

        if ((state->i & 1) == 0) {
569
            if (strm->avail_out < state->bytes_per_sample)
570 571
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
572 573 574
            state->i++;
        }

575
        if (strm->avail_out < state->bytes_per_sample)
576 577
            return M_EXIT;
        put_sample(strm, d1);
578
        state->i++;
579
        fs_drop(strm);
580 581 582 583 584 585 586 587
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
588
    uint32_t i;
589
    int32_t m, d1;
590 591
    struct internal_state *state = strm->state;

592 593 594 595 596 597 598 599 600 601 602 603 604 605
    if (BUFFERSPACE(strm)) {
        i = state->ref;

        while (i < strm->block_size) {
            m = direct_get_fs(strm);
            d1 = m - state->se_table[2 * m + 1];

            if ((i & 1) == 0) {
                put_sample(strm, state->se_table[2 * m] - d1);
                i++;
            }
            put_sample(strm, d1);
            i++;
        }
606 607 608 609 610 611 612 613 614 615 616 617 618
        state->mode = m_id;
        return M_CONTINUE;
    }

    state->mode = m_se_decode;
    state->i = state->ref;
    return M_CONTINUE;
}

static int m_low_entropy_ref(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;

619 620
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
621 622 623 624 625 626 627 628 629 630 631 632 633 634

    if(state->id == 1) {
        state->mode = m_se;
        return M_CONTINUE;
    }

    state->mode = m_zero_block;
    return M_CONTINUE;
}

static int m_low_entropy(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;

635 636 637 638
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
639 640 641 642 643 644 645 646
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

static int m_uncomp_copy(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;

647 648 649 650
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
651 652 653 654 655 656 657

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
658
    size_t i;
659 660
    struct internal_state *state = strm->state;

661
    if (BUFFERSPACE(strm)) {
662
        for (i = 0; i < strm->block_size; i++)
663
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
664
        strm->avail_out -= state->out_blklen;
665
        check_rsi_end(strm);
666

667 668 669 670 671 672 673 674 675
        state->mode = m_id;
        return M_CONTINUE;
    }

    state->i = strm->block_size;
    state->mode = m_uncomp_copy;
    return M_CONTINUE;
}

676 677 678 679 680 681 682 683 684 685 686 687 688 689 690
static void create_se_table(int *table)
{
    int i, j, k, ms;

    k = 0;
    for (i = 0; i < 13; i++) {
        ms = k;
        for (j = 0; j <= i; j++) {
            table[2 * k] = i;
            table[2 * k + 1] = ms;
            k++;
        }
    }
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
691
int aec_decode_init(struct aec_stream *strm)
692
{
693
    int i, modi;
694
    struct internal_state *state;
695

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
696
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
697
        return AEC_CONF_ERROR;
698

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
699
    state = malloc(sizeof(struct internal_state));
700
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
701
        return AEC_MEM_ERROR;
702
    memset(state, 0, sizeof(struct internal_state));
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
703

704 705
    create_se_table(state->se_table);

706 707
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
708
    if (strm->bits_per_sample > 16) {
709
        state->id_len = 5;
710

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
711 712
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
713
            if (strm->flags & AEC_DATA_MSB)
714
                state->flush_output = flush_msb_24;
715
            else
716
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
717
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
718
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
719
            if (strm->flags & AEC_DATA_MSB)
720
                state->flush_output = flush_msb_32;
721
            else
722
                state->flush_output = flush_lsb_32;
723 724
        }
        state->out_blklen = strm->block_size
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
725
            * state->bytes_per_sample;
726
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
727 728
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
729
        state->id_len = 4;
730
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
731
        if (strm->flags & AEC_DATA_MSB)
732
            state->flush_output = flush_msb_16;
733
        else
734
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
735
    } else {
736
        if (strm->flags & AEC_RESTRICTED) {
737 738 739 740 741 742 743 744 745 746 747 748
            if (strm->bits_per_sample <= 4) {
                if (strm->bits_per_sample <= 2)
                    state->id_len = 1;
                else
                    state->id_len = 2;
            } else {
                return AEC_CONF_ERROR;
            }
        } else {
            state->id_len = 3;
        }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
749
        state->bytes_per_sample = 1;
750
        state->out_blklen = strm->block_size;
751
        state->flush_output = flush_8;
752 753
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
754
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
755 756
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample + 1);
        state->xmin = ~state->xmax;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
757
    } else {
758
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
759
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample);
760
    }
761

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
762
    state->in_blklen = (strm->block_size * strm->bits_per_sample
763
                        + state->id_len) / 8 + 9;
764 765

    modi = 1UL << state->id_len;
766
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
767
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
768
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
769

770
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
771
    for (i = 1; i < modi - 1; i++) {
772
        state->id_table[i] = m_split;
773
    }
774
    state->id_table[modi - 1] = m_uncomp;
775

776 777 778
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
779 780
        return AEC_MEM_ERROR;

781
    state->ref = 0;
782 783 784
    strm->total_in = 0;
    strm->total_out = 0;

785 786
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
787
    state->bitp = 0;
788
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
789
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
790
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
791
    return AEC_OK;
792 793
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
794
int aec_decode(struct aec_stream *strm, int flush)
795
{
796 797 798 799 800 801 802 803 804
    /**
       Finite-state machine implementation of the adaptive entropy
       decoder.

       Can work with one byte input und one sample output buffers. If
       enough buffer space is available, then faster implementations
       of the states are called. Inspired by zlib.
    */

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
805
    struct internal_state *state = strm->state;
806
    int status;
807

808 809 810
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

811 812 813 814 815 816 817
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

818 819 820 821
    if (status == M_EXIT && strm->avail_out > 0 &&
        strm->avail_out < state->bytes_per_sample)
        return AEC_MEM_ERROR;

822
    state->flush_output(strm);
823 824 825 826

    strm->total_in -= strm->avail_in;
    strm->total_out -= strm->avail_out;

827 828
    return AEC_OK;
}
829

830 831
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
832
    struct internal_state *state = strm->state;
833

834
    free(state->id_table);
835
    free(state->rsi_buffer);
836
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
837
    return AEC_OK;
838
}
839

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
840
int aec_buffer_decode(struct aec_stream *strm)
841 842 843 844 845 846 847 848 849 850 851
{
    int status;

    status = aec_decode_init(strm);
    if (status != AEC_OK)
        return status;

    status = aec_decode(strm, AEC_FLUSH);
    aec_decode_end(strm);
    return status;
}