decode.c 21.6 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
        uint32_t *bp, *flush_end;                                       \
        int64_t d, m, th2;                                              \
Moritz Hanke's avatar
Moritz Hanke committed
78
        int64_t data, med, half_d, xmin, xmax;                          \
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;              \
                                                                        \
Moritz Hanke's avatar
Moritz Hanke committed
102 103 104
            xmin = state->xmin;                                         \
            xmax = state->xmax;                                         \
                                                                        \
105 106
            for (bp = state->flush_start; bp < flush_end; bp++) {       \
                d = *bp;                                                \
Moritz Hanke's avatar
Moritz Hanke committed
107 108 109 110 111 112 113 114 115 116 117
                half_d = (d + 1) >> 1;                                  \
                                                                        \
                if (data < med) {                                       \
                    if (half_d <= data - xmin) {                        \
                        if (d & 1)                                      \
                            data -= half_d;                             \
                        else                                            \
                            data += half_d;                             \
                    } else {                                            \
                        data = xmin + d;                                \
                    }                                                   \
118
                } else {                                                \
Moritz Hanke's avatar
Moritz Hanke committed
119 120 121 122 123 124 125 126
                    if (half_d <= xmax - data) {                        \
                        if (d & 1)                                      \
                            data -= half_d;                             \
                        else                                            \
                            data += half_d;                             \
                    } else {                                            \
                        data = xmax - d;                                \
                    }                                                   \
127
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
128
                put_##KIND(strm, data);                                 \
129
            }                                                           \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
130
            state->last_out = data;                                     \
131
        } else {                                                        \
132 133
            for (bp = state->flush_start; bp < flush_end; bp++)         \
                put_##KIND(strm, *bp);                                  \
134
        }                                                               \
135
        state->flush_start = state->rsip;                               \
136
    }
137

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
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 184 185 186 187 188 189 190 191 192

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

194
static inline void check_rsi_end(struct aec_stream *strm)
195
{
196
    /**
197
       Flush output if end of RSI reached
198
     */
199
    struct internal_state *state = strm->state;
200

201
    if (state->rsip - state->rsi_buffer == state->rsi_size) {
202
        state->flush_output(strm);
203 204
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
205
    }
206 207
}

208
static inline void put_sample(struct aec_stream *strm, uint32_t s)
209 210 211
{
    struct internal_state *state = strm->state;

212
    *state->rsip++ = s;
213
    strm->avail_out -= state->bytes_per_sample;
214
    check_rsi_end(strm);
215 216
}

217 218 219 220 221 222 223 224 225 226 227
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)
228 229
{
    /**
230
       Get n bit from input stream
231 232 233 234

       No checking whatsoever. Read bits are dumped.
     */

235
    struct internal_state *state = strm->state;
236

237 238
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
239

240 241 242 243
    state->bitp -= n;
    return (state->acc >> state->bitp) & ((1ULL << n) - 1);
}

244
static inline uint32_t direct_get_fs(struct aec_stream *strm)
245 246 247 248
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
249 250 251 252
       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.
253 254
     */

255
    uint32_t fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
256
    struct internal_state *state = strm->state;
257

258 259 260
    state->acc &= ((1ULL << state->bitp) - 1);

    if (state->acc == 0)
261
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
262

263 264 265 266
#ifdef AEC_HAVE___BUILTIN_CLZL
    fs = __builtin_clzll(state->acc) - (64 - state->bitp);
    state->bitp -= fs + 1;
#else
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
267 268 269
    state->bitp--;
    while ((state->acc & (1ULL << state->bitp)) == 0) {
        state->bitp--;
270
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
271
    }
272
#endif
273 274 275
    return fs;
}

276
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
277 278 279 280 281 282 283 284 285 286 287 288
{
    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;
}

289
static inline uint32_t bits_get(struct aec_stream *strm, int n)
290 291 292 293 294
{
    return (strm->state->acc >> (strm->state->bitp - n))
        & ((1ULL << n) - 1);
}

295
static inline void bits_drop(struct aec_stream *strm, int n)
296 297 298 299
{
    strm->state->bitp -= n;
}

300
static inline uint32_t fs_ask(struct aec_stream *strm)
301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
{
    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;
}

319
static inline uint32_t fs_get(struct aec_stream *strm)
320 321 322 323
{
    return strm->state->fs;
}

324
static inline void fs_drop(struct aec_stream *strm)
325 326 327 328 329
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

330
static inline uint32_t copysample(struct aec_stream *strm)
331
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
332
    if (bits_ask(strm, strm->bits_per_sample) == 0
333 334
        || strm->avail_out == 0)
        return 0;
335

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
336 337
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
338 339
    return 1;
}
340 341 342 343 344

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

345
    if (state->pp && state->rsip == state->rsi_buffer)
346 347 348 349
        state->ref = 1;
    else
        state->ref = 0;

350 351 352 353
    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);
354 355 356 357 358 359 360 361 362 363 364
    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 {
365
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
366
            return M_EXIT;
367 368
        *state->rsip++ += bits_get(strm, k);
        strm->avail_out -= state->bytes_per_sample;
369
        bits_drop(strm, k);
370
    } while(++state->i < state->n);
371

372
    check_rsi_end(strm);
373 374 375 376 377 378 379
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
380
    int k = state->id - 1;
381 382

    do {
383 384
        if (fs_ask(strm) == 0)
            return M_EXIT;
385
        state->rsip[state->i] = fs_get(strm) << k;
386
        fs_drop(strm);
387
    } while(++state->i < state->n);
388

389
    state->i = 0;
390 391 392 393 394 395
    state->mode = m_split_output;
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
396
    int i, k;
397 398
    struct internal_state *state = strm->state;

399 400 401 402
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

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

405
        for (i = 0; i < strm->block_size - state->ref; i++)
406
            state->rsip[i] = direct_get_fs(strm) << k;
407

408
        for (i = state->ref; i < strm->block_size; i++)
409
            *state->rsip++ += direct_get(strm, k);
410

411
        strm->avail_out -= state->out_blklen;
412
        check_rsi_end(strm);
413

414 415 416 417 418
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
419 420
        if (copysample(strm) == 0)
            return M_EXIT;
421 422 423 424 425
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

426
    state->i = 0;
427 428 429 430 431 432 433 434
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

435 436 437 438 439
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
440 441 442 443 444 445 446

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
447
    int i, zero_blocks, b, zero_bytes;
448 449
    struct internal_state *state = strm->state;

450 451 452 453
    if (fs_ask(strm) == 0)
        return M_EXIT;
    zero_blocks = fs_get(strm) + 1;
    fs_drop(strm);
454 455

    if (zero_blocks == ROS) {
456
        b = (state->rsip - state->rsi_buffer) / strm->block_size;
457 458 459 460 461 462
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
463
        i = zero_blocks * strm->block_size - 1;
464
    else
465
        i = zero_blocks * strm->block_size;
466

467 468
    zero_bytes = i * state->bytes_per_sample;
    if (strm->avail_out >= zero_bytes) {
469 470
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
471
        strm->avail_out -= zero_bytes;
472
        check_rsi_end(strm);
473

474 475 476 477
        state->mode = m_id;
        return M_CONTINUE;
    }

478
    strm->state->i = i;
479 480 481 482 483 484
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
485
    int32_t m, d1;
486 487 488
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
489 490 491
        if (fs_ask(strm) == 0)
            return M_EXIT;
        m = fs_get(strm);
492
        d1 = m - state->se_table[2 * m + 1];
493 494

        if ((state->i & 1) == 0) {
495 496 497
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
498 499 500
            state->i++;
        }

501 502 503
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
504
        state->i++;
505
        fs_drop(strm);
506 507 508 509 510 511 512 513
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
514 515
    int i;
    int32_t m, d1;
516 517
    struct internal_state *state = strm->state;

518 519 520 521 522 523 524 525 526 527 528 529 530 531
    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++;
        }
532 533 534 535 536 537 538 539 540 541 542 543 544
        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;

545 546
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
547 548 549 550 551 552 553 554 555 556 557 558 559 560

    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;

561 562 563 564
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
565 566 567 568 569 570 571 572
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

573 574 575 576
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
577 578 579 580 581 582 583

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
584
    int i;
585 586
    struct internal_state *state = strm->state;

587
    if (BUFFERSPACE(strm)) {
588
        for (i = 0; i < strm->block_size; i++)
589
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
590
        strm->avail_out -= state->out_blklen;
591
        check_rsi_end(strm);
592

593 594 595 596 597 598 599 600 601
        state->mode = m_id;
        return M_CONTINUE;
    }

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

602 603 604 605 606 607 608 609 610 611 612 613 614 615 616
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
617
int aec_decode_init(struct aec_stream *strm)
618
{
619
    int i, modi;
620
    struct internal_state *state;
621

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
622
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
623
        return AEC_CONF_ERROR;
624

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
625
    state = malloc(sizeof(struct internal_state));
626
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
627
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
628

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
629
    state->se_table = malloc(182 * sizeof(int));
630 631 632 633 634
    if (state->se_table == NULL)
        return AEC_MEM_ERROR;

    create_se_table(state->se_table);

635 636
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
637
    if (strm->bits_per_sample > 16) {
638
        state->id_len = 5;
639

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
640 641
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
642
            if (strm->flags & AEC_DATA_MSB)
643
                state->flush_output = flush_msb_24;
644
            else
645
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
646
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
647
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
648
            if (strm->flags & AEC_DATA_MSB)
649
                state->flush_output = flush_msb_32;
650
            else
651
                state->flush_output = flush_lsb_32;
652 653
        }
        state->out_blklen = strm->block_size
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
654
            * state->bytes_per_sample;
655
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
656 657
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
658
        state->id_len = 4;
659
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
660
        if (strm->flags & AEC_DATA_MSB)
661
            state->flush_output = flush_msb_16;
662
        else
663
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
664
    } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
665
        state->bytes_per_sample = 1;
666
        state->id_len = 3;
667
        state->out_blklen = strm->block_size;
668
        state->flush_output = flush_8;
669 670
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
671
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
672 673
        state->xmin = -(1ULL << (strm->bits_per_sample - 1));
        state->xmax = (1ULL << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
674
    } else {
675
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
676
        state->xmax = (1ULL << strm->bits_per_sample) - 1;
677
    }
678

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
679
    state->in_blklen = (strm->block_size * strm->bits_per_sample
680
                        + state->id_len) / 8 + 9;
681 682

    modi = 1UL << state->id_len;
683
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
684
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
685
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
686

687
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
688
    for (i = 1; i < modi - 1; i++) {
689
        state->id_table[i] = m_split;
690
    }
691
    state->id_table[modi - 1] = m_uncomp;
692

693 694 695
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
696 697
        return AEC_MEM_ERROR;

698 699 700
    strm->total_in = 0;
    strm->total_out = 0;

701 702
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
703
    state->bitp = 0;
704
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
705
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
706
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
707
    return AEC_OK;
708 709
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
710
int aec_decode(struct aec_stream *strm, int flush)
711
{
712 713 714 715 716 717 718 719 720
    /**
       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.
    */

721 722
    struct internal_state *state= strm->state;

723 724 725
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

726 727
    while (state->mode(strm) == M_CONTINUE);
    state->flush_output(strm);
728 729 730 731

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

732 733
    return AEC_OK;
}
734

735 736
int aec_decode_end(struct aec_stream *strm)
{
737
    struct internal_state *state= strm->state;
738

739
    free(state->id_table);
740
    free(state->se_table);
741
    free(state->rsi_buffer);
742
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
743
    return AEC_OK;
744
}
745

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
746
int aec_buffer_decode(struct aec_stream *strm)
747 748 749 750 751 752 753 754 755 756 757
{
    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;
}