decode.c 20.5 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->rsip;                                        \
82
        if (state->pp) {                                                \
83 84 85
            if (state->flush_start == state->rsi_buffer                 \
                && state->rsip > state->rsi_buffer) {                   \
                state->last_out = *state->rsi_buffer;                   \
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
                    if (data < med)                                     \
111
                        data = state->xmin + d;                         \
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
        state->flush_start = state->rsip;                               \
123
    }
124

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
125 126 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

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

181
static inline void check_rsi_end(struct aec_stream *strm)
182
{
183
    /**
184
       Flush output if end of RSI reached
185
     */
186
    struct internal_state *state = strm->state;
187

188
    if (state->rsip - state->rsi_buffer == state->rsi_size) {
189
        state->flush_output(strm);
190 191
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
192
    }
193 194
}

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

199
    *state->rsip++ = s;
200
    strm->avail_out -= state->bytes_per_sample;
201
    check_rsi_end(strm);
202 203
}

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

    strm->avail_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)
215 216
{
    /**
217
       Get n bit from input stream
218 219 220 221

       No checking whatsoever. Read bits are dumped.
     */

222
    struct internal_state *state = strm->state;
223

224 225
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
226

227 228 229 230
    state->bitp -= n;
    return (state->acc >> state->bitp) & ((1ULL << n) - 1);
}

231
static inline uint32_t direct_get_fs(struct aec_stream *strm)
232 233 234 235
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
236 237 238 239
       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.
240 241
     */

242
    uint32_t fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
243
    struct internal_state *state = strm->state;
244

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

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

    return fs;
}

257
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
258 259 260 261 262 263 264 265 266 267 268 269
{
    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;
}

270
static inline uint32_t bits_get(struct aec_stream *strm, int n)
271 272 273 274 275
{
    return (strm->state->acc >> (strm->state->bitp - n))
        & ((1ULL << n) - 1);
}

276
static inline void bits_drop(struct aec_stream *strm, int n)
277 278 279 280
{
    strm->state->bitp -= n;
}

281
static inline uint32_t fs_ask(struct aec_stream *strm)
282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299
{
    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->state->acc <<= 8;
            strm->state->acc |= *strm->next_in++;
            strm->state->bitp += 8;
        }
        strm->state->fs++;
        strm->state->bitp--;
    }
    return 1;
}

300
static inline uint32_t fs_get(struct aec_stream *strm)
301 302 303 304
{
    return strm->state->fs;
}

305
static inline void fs_drop(struct aec_stream *strm)
306 307 308 309 310
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

311
static inline uint32_t copysample(struct aec_stream *strm)
312
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
313
    if (bits_ask(strm, strm->bits_per_sample) == 0
314 315
        || strm->avail_out == 0)
        return 0;
316

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
317 318
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
319 320
    return 1;
}
321 322 323 324 325

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

326
    if (state->pp && state->rsip == state->rsi_buffer)
327 328 329 330
        state->ref = 1;
    else
        state->ref = 0;

331 332 333 334
    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);
335 336 337 338 339 340 341 342 343 344 345
    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 {
346
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
347
            return M_EXIT;
348 349
        *state->rsip++ += bits_get(strm, k);
        strm->avail_out -= state->bytes_per_sample;
350
        bits_drop(strm, k);
351
    } while(++state->i < state->n);
352

353
    check_rsi_end(strm);
354 355 356 357 358 359 360
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
361
    int k = state->id - 1;
362 363

    do {
364 365
        if (fs_ask(strm) == 0)
            return M_EXIT;
366
        state->rsip[state->i] = fs_get(strm) << k;
367
        fs_drop(strm);
368
    } while(++state->i < state->n);
369

370
    state->i = 0;
371 372 373 374 375 376
    state->mode = m_split_output;
    return M_CONTINUE;
}

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

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

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

386
        for (i = 0; i < strm->block_size - state->ref; i++)
387
            state->rsip[i] = direct_get_fs(strm) << k;
388

389
        for (i = state->ref; i < strm->block_size; i++)
390
            *state->rsip++ += direct_get(strm, k);
391

392
        strm->avail_out -= state->out_blklen;
393
        check_rsi_end(strm);
394

395 396 397 398 399
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
400 401
        if (copysample(strm) == 0)
            return M_EXIT;
402 403 404 405 406
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

407
    state->i = 0;
408 409 410 411 412 413 414 415
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
428
    int i, zero_blocks, b, zero_bytes;
429 430
    struct internal_state *state = strm->state;

431 432 433 434
    if (fs_ask(strm) == 0)
        return M_EXIT;
    zero_blocks = fs_get(strm) + 1;
    fs_drop(strm);
435 436

    if (zero_blocks == ROS) {
437
        b = (state->rsip - state->rsi_buffer) / strm->block_size;
438 439 440 441 442 443
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
444
        i = zero_blocks * strm->block_size - 1;
445
    else
446
        i = zero_blocks * strm->block_size;
447

448 449
    zero_bytes = i * state->bytes_per_sample;
    if (strm->avail_out >= zero_bytes) {
450 451
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
452
        strm->avail_out -= zero_bytes;
453
        check_rsi_end(strm);
454

455 456 457 458
        state->mode = m_id;
        return M_CONTINUE;
    }

459
    strm->state->i = i;
460 461 462 463 464 465
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
466
    int32_t m, d1;
467 468 469
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
470 471 472
        if (fs_ask(strm) == 0)
            return M_EXIT;
        m = fs_get(strm);
473
        d1 = m - state->se_table[2 * m + 1];
474 475

        if ((state->i & 1) == 0) {
476 477 478
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
479 480 481
            state->i++;
        }

482 483 484
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
485
        state->i++;
486
        fs_drop(strm);
487 488 489 490 491 492 493 494
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
495 496
    int i;
    int32_t m, d1;
497 498
    struct internal_state *state = strm->state;

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

526 527
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
528 529 530 531 532 533 534 535 536 537 538 539 540 541

    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;

542 543 544 545
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
546 547 548 549 550 551 552 553
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

554 555 556 557
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
558 559 560 561 562 563 564

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
565
    int i;
566 567
    struct internal_state *state = strm->state;

568
    if (BUFFERSPACE(strm)) {
569
        for (i = 0; i < strm->block_size; i++)
570
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
571
        strm->avail_out -= state->out_blklen;
572
        check_rsi_end(strm);
573

574 575 576 577 578 579 580 581 582
        state->mode = m_id;
        return M_CONTINUE;
    }

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

583 584 585 586 587 588 589 590 591 592 593 594 595 596 597
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
598
int aec_decode_init(struct aec_stream *strm)
599
{
600
    int i, modi;
601
    struct internal_state *state;
602

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
603
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
604
        return AEC_CONF_ERROR;
605

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
606
    state = malloc(sizeof(struct internal_state));
607
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
608
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
609

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
610
    state->se_table = malloc(182 * sizeof(int));
611 612 613 614 615
    if (state->se_table == NULL)
        return AEC_MEM_ERROR;

    create_se_table(state->se_table);

616 617
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
618
    if (strm->bits_per_sample > 16) {
619
        state->id_len = 5;
620

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
652
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
653 654
        state->xmin = -(1ULL << (strm->bits_per_sample - 1));
        state->xmax = (1ULL << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
655
    } else {
656
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
657
        state->xmax = (1ULL << strm->bits_per_sample) - 1;
658
    }
659

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
660
    state->in_blklen = (strm->block_size * strm->bits_per_sample
661
                        + state->id_len) / 8 + 9;
662 663

    modi = 1UL << state->id_len;
664
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
665
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
666
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
667

668
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
669
    for (i = 1; i < modi - 1; i++) {
670
        state->id_table[i] = m_split;
671
    }
672
    state->id_table[modi - 1] = m_uncomp;
673

674 675 676
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
677 678
        return AEC_MEM_ERROR;

679 680 681
    strm->total_in = 0;
    strm->total_out = 0;

682 683
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
684
    state->bitp = 0;
685
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
686
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
687
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
688
    return AEC_OK;
689 690
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
691
int aec_decode(struct aec_stream *strm, int flush)
692
{
693 694 695 696 697 698 699 700 701
    /**
       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.
    */

702 703
    struct internal_state *state= strm->state;

704 705 706
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

707 708
    while (state->mode(strm) == M_CONTINUE);
    state->flush_output(strm);
709 710 711 712

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

713 714
    return AEC_OK;
}
715

716 717
int aec_decode_end(struct aec_stream *strm)
{
718
    struct internal_state *state= strm->state;
719

720
    free(state->id_table);
721
    free(state->se_table);
722
    free(state->rsi_buffer);
723
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
724
    return AEC_OK;
725
}
726

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