decode.c 20.8 KB
Newer Older
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
1 2
/**
 * @file decode.c
3
 *
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
4
 * @author Mathis Rosenhauer, Deutsches Klimarechenzentrum
5 6 7 8 9 10 11 12 13 14 15 16 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 44 45 46
 * @author Moritz Hanke, Deutsches Klimarechenzentrum
 * @author Joerg Behrens, Deutsches Klimarechenzentrum
 * @author Luis Kornblueh, Max-Planck-Institut fuer Meteorologie
 *
 * @section LICENSE
 * Copyright 2012
 *
 * Mathis Rosenhauer,                 Luis Kornblueh
 * Moritz Hanke,
 * Joerg Behrens
 *
 * Deutsches Klimarechenzentrum GmbH  Max-Planck-Institut fuer Meteorologie
 * Bundesstr. 45a                     Bundesstr. 53
 * 20146 Hamburg                      20146 Hamburg
 * Germany                            Germany
 *
 * 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
47 48 49 50 51 52
 * @section DESCRIPTION
 *
 * Adaptive Entropy Decoder
 * Based on CCSDS documents 121.0-B-2 and 120.0-G-2
 *
 */
53

54 55 56 57 58 59
#include <config.h>

#if HAVE_STDINT_H
# include <stdint.h>
#endif

60 61 62 63 64
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <string.h>

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
65
#include "libaec.h"
66
#include "decode.h"
67

68 69 70 71 72
#define ROS 5

#define BUFFERSPACE(strm) (strm->avail_in >= strm->state->in_blklen     \
                           && strm->avail_out >= strm->state->out_blklen)

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
73
#define FLUSH(KIND)                                                     \
74 75
    static void flush_##KIND(struct aec_stream *strm)                   \
    {                                                                   \
76
        int64_t x, d, th, lower, m;                                     \
77
        int64_t data;                                                   \
78
        uint32_t *bp, *bend, *flush_end;                                \
79 80
        struct internal_state *state = strm->state;                     \
                                                                        \
81
        flush_end = state->bufp;                                        \
82
        if (state->pp) {                                                \
83 84
            if (state->flush_start == state->buf                        \
                && state->bufp > state->buf) {                          \
85
                state->last_out = state->buf[0];                        \
86 87
                                                                        \
                if (strm->flags & AEC_DATA_SIGNED) {                    \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
88
                    m = 1ULL << (strm->bits_per_sample - 1);            \
89
                    /* Reference samples have to be sign extended */    \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
90
                    state->last_out = (state->last_out ^ m) - m;        \
91
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
92
                put_##KIND(strm, state->last_out);                      \
93
                state->flush_start++;                                   \
94 95
            }                                                           \
                                                                        \
96 97
            for (bp = state->flush_start; bp < flush_end; bp++) {       \
                d = *bp;                                                \
98 99 100 101 102 103
                x = state->last_out;                                    \
                lower = x - state->xmin;                                \
                th = MIN(lower, state->xmax - x);                       \
                                                                        \
                if (d <= 2 * th) {                                      \
                    if (d & 1)                                          \
104
                        data = x - (d + 1) / 2;                         \
105
                    else                                                \
106
                        data = x + d / 2;                               \
107 108
                } else {                                                \
                    if (th == lower)                                    \
109
                        data = x + d - th;                              \
110
                    else                                                \
111
                        data = x + th - d;                              \
112
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
113
                put_##KIND(strm, data);                                 \
114
                state->last_out = data;                                 \
115 116
            }                                                           \
        } else {                                                        \
117 118
            for (bp = state->flush_start; bp < flush_end; bp++)         \
                put_##KIND(strm, *bp);                                  \
119
        }                                                               \
120 121
        if (state->bufp == state->buf + state->buf_size) {              \
            state->flush_start = state->buf;                            \
122
        } else {                                                        \
123
            state->flush_start = state->bufp;                           \
124 125
        }                                                               \
    }
126

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181

static inline void put_msb_32(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data >> 24;
    *strm->next_out++ = data >> 16;
    *strm->next_out++ = data >> 8;
    *strm->next_out++ = data;
}

static inline void put_msb_24(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data >> 16;
    *strm->next_out++ = data >> 8;
    *strm->next_out++ = data;
}

static inline void put_msb_16(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data >> 8;
    *strm->next_out++ = data;
}

static inline void put_lsb_32(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data;
    *strm->next_out++ = data >> 8;
    *strm->next_out++ = data >> 16;
    *strm->next_out++ = data >> 24;
}

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data;
    *strm->next_out++ = data >> 8;
    *strm->next_out++ = data >> 16;
}

static inline void put_lsb_16(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data;
    *strm->next_out++ = data >> 8;
}

static inline void put_8(struct aec_stream *strm, uint32_t data)
{
    *strm->next_out++ = data;
}

FLUSH(msb_32);
FLUSH(msb_24);
FLUSH(msb_16);
FLUSH(lsb_32);
FLUSH(lsb_24);
FLUSH(lsb_16);
FLUSH(8);
182

183
static inline void check_flush(struct aec_stream *strm)
184
{
185 186 187
    /**
       Update counters and flush output if necessary
     */
188
    struct internal_state *state = strm->state;
189

190
    if (state->bufp == state->buf + state->buf_size) {
191
        state->flush_output(strm);
192
        state->bufp = state->buf;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
193
    }
194 195
}

196
static inline void put_sample(struct aec_stream *strm, uint32_t s)
197 198 199
{
    struct internal_state *state = strm->state;

200 201 202 203
    *state->bufp++ = s;
    strm->avail_out -= state->bytes_per_sample;
    strm->total_out += state->bytes_per_sample;
    check_flush(strm);
204 205
}

206 207 208 209 210 211 212 213 214 215 216 217
static inline void fill_acc(struct aec_stream *strm)
{
    int b = (63 - strm->state->bitp) >> 3;

    strm->avail_in -= b;
    strm->total_in += b;
    strm->state->bitp += b << 3;
    while (b--)
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
}

static inline uint32_t direct_get(struct aec_stream *strm, unsigned int n)
218 219
{
    /**
220
       Get n bit from input stream
221 222 223 224

       No checking whatsoever. Read bits are dumped.
     */

225
    struct internal_state *state = strm->state;
226

227 228
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
229

230 231 232 233
    state->bitp -= n;
    return (state->acc >> state->bitp) & ((1ULL << n) - 1);
}

234
static inline uint32_t direct_get_fs(struct aec_stream *strm)
235 236 237 238
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
239 240 241 242
       Essentially counts the number of 0 bits until a 1 is
       encountered. The longest FS we can safely detect is 56 bits. If
       no FS is found in accumulator then we top it up to at least 56
       bits.
243 244
     */

245
    uint32_t fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
246
    struct internal_state *state = strm->state;
247

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
248
    if ((state->acc & ((1ULL << state->bitp) - 1)) == 0)
249
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
250 251 252 253

    state->bitp--;
    while ((state->acc & (1ULL << state->bitp)) == 0) {
        state->bitp--;
254
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
255
    }
256 257 258 259

    return fs;
}

260
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
261 262 263 264 265 266 267 268 269 270 271 272 273
{
    while (strm->state->bitp < n) {
        if (strm->avail_in == 0)
            return 0;
        strm->avail_in--;
        strm->total_in++;
        strm->state->acc <<= 8;
        strm->state->acc |= *strm->next_in++;
        strm->state->bitp += 8;
    }
    return 1;
}

274
static inline uint32_t bits_get(struct aec_stream *strm, int n)
275 276 277 278 279
{
    return (strm->state->acc >> (strm->state->bitp - n))
        & ((1ULL << n) - 1);
}

280
static inline void bits_drop(struct aec_stream *strm, int n)
281 282 283 284
{
    strm->state->bitp -= n;
}

285
static inline uint32_t fs_ask(struct aec_stream *strm)
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
{
    if (bits_ask(strm, 1) == 0)
        return 0;
    while ((strm->state->acc & (1ULL << (strm->state->bitp - 1))) == 0) {
        if (strm->state->bitp == 1) {
            if (strm->avail_in == 0)
                return 0;
            strm->avail_in--;
            strm->total_in++;
            strm->state->acc <<= 8;
            strm->state->acc |= *strm->next_in++;
            strm->state->bitp += 8;
        }
        strm->state->fs++;
        strm->state->bitp--;
    }
    return 1;
}

305
static inline uint32_t fs_get(struct aec_stream *strm)
306 307 308 309
{
    return strm->state->fs;
}

310
static inline void fs_drop(struct aec_stream *strm)
311 312 313 314 315
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

316
static inline uint32_t copysample(struct aec_stream *strm)
317
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
318
    if (bits_ask(strm, strm->bits_per_sample) == 0
319 320
        || strm->avail_out == 0)
        return 0;
321

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
322 323
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
324 325
    return 1;
}
326 327 328 329 330

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

331
    if (state->pp && state->bufp == state->buf)
332 333 334 335
        state->ref = 1;
    else
        state->ref = 0;

336 337 338 339
    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);
340 341 342 343 344 345 346 347 348 349 350
    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 {
351
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
352 353 354
            return M_EXIT;
        put_sample(strm, (state->block[state->i] << k) + bits_get(strm, k));
        bits_drop(strm, k);
355 356 357 358 359 360 361 362 363 364 365
    } while(state->i--);

    state->mode = m_id;
    return M_CONTINUE;
}

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

    do {
366 367 368 369
        if (fs_ask(strm) == 0)
            return M_EXIT;
        state->block[state->i] = fs_get(strm);
        fs_drop(strm);
370 371 372 373 374 375 376 377 378
    } while(state->i--);

    state->i = state->n - 1;
    state->mode = m_split_output;
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
379
    int i, k;
380 381
    struct internal_state *state = strm->state;

382 383 384 385
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

        if (state->ref)
386
            *state->bufp++ = direct_get(strm, strm->bits_per_sample);
387

388 389
        for (i = 0; i < strm->block_size - state->ref; i++)
            state->bufp[i] = direct_get_fs(strm) << k;
390

391
        for (i = state->ref; i < strm->block_size; i++)
392
            *state->bufp++ += direct_get(strm, k);
393

394 395 396
        strm->avail_out -= state->out_blklen;
        strm->total_out += state->out_blklen;
        check_flush(strm);
397

398 399 400 401 402
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
403 404
        if (copysample(strm) == 0)
            return M_EXIT;
405 406 407 408 409 410 411 412 413 414 415 416 417 418
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

    state->i = state->n - 1;
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

419 420 421 422 423
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
424 425 426 427 428 429 430

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
431
    int i, zero_blocks, b, zero_bytes;
432 433
    struct internal_state *state = strm->state;

434 435 436 437
    if (fs_ask(strm) == 0)
        return M_EXIT;
    zero_blocks = fs_get(strm) + 1;
    fs_drop(strm);
438 439

    if (zero_blocks == ROS) {
440
        b = (state->bufp - state->buf) / strm->block_size;
441 442 443 444 445 446
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
447
        i = zero_blocks * strm->block_size - 1;
448
    else
449
        i = zero_blocks * strm->block_size;
450

451 452 453 454 455 456 457 458
    zero_bytes = i * state->bytes_per_sample;
    if (strm->avail_out >= zero_bytes) {
        memset(state->bufp, 0, i * sizeof(uint32_t));
        state->bufp += i;
        strm->avail_out -= zero_bytes;
        strm->total_out += zero_bytes;
        check_flush(strm);

459 460 461 462
        state->mode = m_id;
        return M_CONTINUE;
    }

463
    strm->state->i = i;
464 465 466 467 468 469
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
470
    int32_t m, d1;
471 472 473
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
474 475 476
        if (fs_ask(strm) == 0)
            return M_EXIT;
        m = fs_get(strm);
477
        d1 = m - state->se_table[2 * m + 1];
478 479

        if ((state->i & 1) == 0) {
480 481 482
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
483 484 485
            state->i++;
        }

486 487 488
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
489
        state->i++;
490
        fs_drop(strm);
491 492 493 494 495 496 497 498
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
499 500
    int i;
    int32_t m, d1;
501 502
    struct internal_state *state = strm->state;

503 504 505 506 507 508 509 510 511 512 513 514 515 516
    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++;
        }
517 518 519 520 521 522 523 524 525 526 527 528 529
        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;

530 531
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
532 533 534 535 536 537 538 539 540 541 542 543 544 545

    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;

546 547 548 549
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
550 551 552 553 554 555 556 557
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

558 559 560 561
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
562 563 564 565 566 567 568

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
569
    int i;
570 571
    struct internal_state *state = strm->state;

572
    if (BUFFERSPACE(strm)) {
573
        for (i = 0; i < strm->block_size; i++)
574 575 576 577 578
            *state->bufp++ = direct_get(strm, strm->bits_per_sample);
        strm->avail_out -= state->out_blklen;
        strm->total_out += state->out_blklen;
        check_flush(strm);

579 580 581 582 583 584 585 586 587
        state->mode = m_id;
        return M_CONTINUE;
    }

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

588 589 590 591 592 593 594 595 596 597 598 599 600 601 602
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
603
int aec_decode_init(struct aec_stream *strm)
604
{
605
    int i, modi;
606
    struct internal_state *state;
607

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
608
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
609
        return AEC_CONF_ERROR;
610

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
611
    state = malloc(sizeof(struct internal_state));
612
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
613
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
614

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
615
    state->se_table = malloc(182 * sizeof(int));
616 617 618 619 620
    if (state->se_table == NULL)
        return AEC_MEM_ERROR;

    create_se_table(state->se_table);

621 622
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
623
    if (strm->bits_per_sample > 16) {
624
        state->id_len = 5;
625

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
626 627
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
628
            if (strm->flags & AEC_DATA_MSB)
629
                state->flush_output = flush_msb_24;
630
            else
631
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
632
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
633
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
634
            if (strm->flags & AEC_DATA_MSB)
635
                state->flush_output = flush_msb_32;
636
            else
637
                state->flush_output = flush_lsb_32;
638 639
        }
        state->out_blklen = strm->block_size
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
640
            * state->bytes_per_sample;
641
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
642 643
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
644
        state->id_len = 4;
645
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
646
        if (strm->flags & AEC_DATA_MSB)
647
            state->flush_output = flush_msb_16;
648
        else
649
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
650
    } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
651
        state->bytes_per_sample = 1;
652
        state->id_len = 3;
653
        state->out_blklen = strm->block_size;
654
        state->flush_output = flush_8;
655 656
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
657
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
658 659
        state->xmin = -(1ULL << (strm->bits_per_sample - 1));
        state->xmax = (1ULL << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
660
    } else {
661
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
662
        state->xmax = (1ULL << strm->bits_per_sample) - 1;
663
    }
664

665
    state->ref_int = strm->block_size * strm->rsi;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
666
    state->in_blklen = (strm->block_size * strm->bits_per_sample
667
                        + state->id_len) / 8 + 9;
668 669

    modi = 1UL << state->id_len;
670
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
671
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
672
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
673

674
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
675
    for (i = 1; i < modi - 1; i++) {
676
        state->id_table[i] = m_split;
677
    }
678
    state->id_table[modi - 1] = m_uncomp;
679

680
    state->block = malloc(strm->block_size * sizeof(uint32_t));
681
    if (state->block == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
682
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
683

684
    state->buf_size = strm->rsi * strm->block_size;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
685
    state->buf = malloc(state->buf_size * sizeof(uint32_t));
686
    if (state->buf == NULL)
687 688
        return AEC_MEM_ERROR;

689 690 691
    strm->total_in = 0;
    strm->total_out = 0;

692 693
    state->bufp = state->buf;
    state->flush_start = state->buf;
694
    state->bitp = 0;
695
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
696
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
697
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
698
    return AEC_OK;
699 700
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
701
int aec_decode(struct aec_stream *strm, int flush)
702
{
703 704 705 706 707 708 709 710 711
    /**
       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.
    */

712 713 714 715
    struct internal_state *state= strm->state;

    while (state->mode(strm) == M_CONTINUE);
    state->flush_output(strm);
716 717
    return AEC_OK;
}
718

719 720
int aec_decode_end(struct aec_stream *strm)
{
721
    struct internal_state *state= strm->state;
722

723 724
    free(state->block);
    free(state->id_table);
725
    free(state->se_table);
726
    free(state->buf);
727
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
728
    return AEC_OK;
729
}
730

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
731
int aec_buffer_decode(struct aec_stream *strm)
732 733 734 735 736 737 738 739 740 741 742
{
    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;
}