decode.c 20.9 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)                   \
    {                                                                   \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
76 77 78
        uint32_t *bp, *flush_end;                                       \
        int64_t d, m, th2;                                              \
        int64_t data, med;                                              \
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
            }                                                           \
                                                                        \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
96 97 98 99 100 101
            data = state->last_out;                                     \
            if (strm->flags & AEC_DATA_SIGNED)                          \
                med = 0;                                                \
            else                                                        \
                med = (state->xmax - state->xmin) / 2 + 1;              \
                                                                        \
102 103
            for (bp = state->flush_start; bp < flush_end; bp++) {       \
                d = *bp;                                                \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
104 105 106 107 108
                th2 = (data < med ?                                     \
                       data - state->xmin :                             \
                       state->xmax - data) << 1;                        \
                if (d <= th2) {                                         \
                    data += ((d + 1) / 2 ^ -(d & 1)) + (d & 1);         \
109
                } else {                                                \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
110 111
                    if (data < med)                                     \
                        data = d + state->xmin;                         \
112
                    else                                                \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
113
                        data = state->xmax - d;                         \
114
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
115
                put_##KIND(strm, data);                                 \
116
            }                                                           \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
117
            state->last_out = data;                                     \
118
        } else {                                                        \
119 120
            for (bp = state->flush_start; bp < flush_end; bp++)         \
                put_##KIND(strm, *bp);                                  \
121
        }                                                               \
122 123
        if (state->bufp == state->buf + state->buf_size) {              \
            state->flush_start = state->buf;                            \
124
        } else {                                                        \
125
            state->flush_start = state->bufp;                           \
126 127
        }                                                               \
    }
128

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
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 182 183

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);
184

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

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

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

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

208 209 210 211 212 213 214 215 216 217 218 219
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)
220 221
{
    /**
222
       Get n bit from input stream
223 224 225 226

       No checking whatsoever. Read bits are dumped.
     */

227
    struct internal_state *state = strm->state;
228

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

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

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
241 242 243 244
       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.
245 246
     */

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

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

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

    return fs;
}

262
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
263 264 265 266 267 268 269 270 271 272 273 274 275
{
    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;
}

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

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

287
static inline uint32_t fs_ask(struct aec_stream *strm)
288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
{
    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;
}

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

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

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

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

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

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

338 339 340 341
    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);
342 343 344 345 346 347 348 349 350 351 352
    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 {
353
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
354 355 356
            return M_EXIT;
        put_sample(strm, (state->block[state->i] << k) + bits_get(strm, k));
        bits_drop(strm, k);
357 358 359 360 361 362 363 364 365 366 367
    } 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 {
368 369 370 371
        if (fs_ask(strm) == 0)
            return M_EXIT;
        state->block[state->i] = fs_get(strm);
        fs_drop(strm);
372 373 374 375 376 377 378 379 380
    } while(state->i--);

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

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

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

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

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

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

396 397 398
        strm->avail_out -= state->out_blklen;
        strm->total_out += state->out_blklen;
        check_flush(strm);
399

400 401 402 403 404
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
405 406
        if (copysample(strm) == 0)
            return M_EXIT;
407 408 409 410 411 412 413 414 415 416 417 418 419 420
        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;

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

    state->mode = m_id;
    return M_CONTINUE;
}

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

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

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

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

453 454 455 456 457 458 459 460
    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);

461 462 463 464
        state->mode = m_id;
        return M_CONTINUE;
    }

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

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

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

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

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

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

    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;

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

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

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

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

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

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

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

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

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

    create_se_table(state->se_table);

623 624
    strm->state = state;

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

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

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

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

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

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

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

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

691 692 693
    strm->total_in = 0;
    strm->total_out = 0;

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

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

714 715 716 717
    struct internal_state *state= strm->state;

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

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

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

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