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

185
    state->buf[state->buf_i++] = s;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
186 187
    strm->avail_out -= state->bytes_per_sample;
    strm->total_out += state->bytes_per_sample;
188

189
    if (state->buf_i == state->buf_size) {
190
        state->flush_output(strm);
191
        state->buf_i = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
192
    }
193 194
}

195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
static uint32_t *get_block_buffer(struct aec_stream *strm)
{
    /**
       Return a pointer to (the remaining part of) a block buffer
     */
    return strm->state->buf + strm->state->buf_i;
}

static void flush_block_buffer(struct aec_stream *strm)
{
    /**
       Update counters and flush output if necessary
     */
    struct internal_state *state = strm->state;
    int b = strm->block_size - state->buf_i % strm->block_size;

    state->buf_i += b;
    strm->avail_out -= b * state->bytes_per_sample;
    strm->total_out += b * state->bytes_per_sample;
    if (state->buf_i == state->buf_size) {
        state->flush_output(strm);
        state->buf_i = 0;
    }
}

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

       No checking whatsoever. Read bits are dumped.
     */

239
    struct internal_state *state = strm->state;
240

241 242
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
243

244 245 246 247
    state->bitp -= n;
    return (state->acc >> state->bitp) & ((1ULL << n) - 1);
}

248
static inline uint32_t direct_get_fs(struct aec_stream *strm)
249 250 251 252
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
253 254 255 256
       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.
257 258
     */

259
    uint32_t fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
260
    struct internal_state *state = strm->state;
261

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
262
    if ((state->acc & ((1ULL << state->bitp) - 1)) == 0)
263
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
264 265 266 267

    state->bitp--;
    while ((state->acc & (1ULL << state->bitp)) == 0) {
        state->bitp--;
268
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
269
    }
270 271 272 273

    return fs;
}

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

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

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

299
static inline uint32_t fs_ask(struct aec_stream *strm)
300 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->total_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->buf_i == 0)
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 367 368
            return M_EXIT;
        put_sample(strm, (state->block[state->i] << k) + bits_get(strm, k));
        bits_drop(strm, k);
369 370 371 372 373 374 375 376 377 378 379
    } 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 {
380 381 382 383
        if (fs_ask(strm) == 0)
            return M_EXIT;
        state->block[state->i] = fs_get(strm);
        fs_drop(strm);
384 385 386 387 388 389 390 391 392
    } while(state->i--);

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

static int m_split(struct aec_stream *strm)
{
393
    int i, k;
394
    uint32_t *block;
395 396
    struct internal_state *state = strm->state;

397 398
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;
399
        block = get_block_buffer(strm);
400 401

        if (state->ref)
402
            block[0] = direct_get(strm, strm->bits_per_sample);
403 404

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

407 408 409 410
        for (i = state->ref; i < strm->block_size; i++)
            block[i] += direct_get(strm, k);

        flush_block_buffer(strm);
411

412 413 414 415 416
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
417 418
        if (copysample(strm) == 0)
            return M_EXIT;
419 420 421 422 423 424 425 426 427 428 429 430 431 432
        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;

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

    state->mode = m_id;
    return M_CONTINUE;
}

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

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

    if (zero_blocks == ROS) {
454
        b = state->buf_i / strm->block_size;
455 456 457 458 459 460
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

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

465 466 467
    if (strm->avail_out >= i * state->bytes_per_sample) {
        while (i--)
            put_sample(strm, 0);
468 469 470 471
        state->mode = m_id;
        return M_CONTINUE;
    }

472
    strm->state->i = i;
473 474 475 476 477 478
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
479
    int32_t m, d1;
480 481 482
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
483 484 485
        if (fs_ask(strm) == 0)
            return M_EXIT;
        m = fs_get(strm);
486
        d1 = m - state->se_table[2 * m + 1];
487 488

        if ((state->i & 1) == 0) {
489 490 491
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
492 493 494
            state->i++;
        }

495 496 497
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
498
        state->i++;
499
        fs_drop(strm);
500 501 502 503 504 505 506 507
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
508 509
    int i;
    int32_t m, d1;
510 511
    struct internal_state *state = strm->state;

512 513 514 515 516 517 518 519 520 521 522 523 524 525
    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++;
        }
526 527 528 529 530 531 532 533 534 535 536 537 538
        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;

539 540
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
541 542 543 544 545 546 547 548 549 550 551 552 553 554

    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;

555 556 557 558
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
559 560 561 562 563 564 565 566
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

567 568 569 570
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
571 572 573 574 575 576 577

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
578
    int i;
579
    uint32_t *block;
580 581
    struct internal_state *state = strm->state;

582
    if (BUFFERSPACE(strm)) {
583 584 585 586
        block = get_block_buffer(strm);
        for (i = 0; i < strm->block_size; i++)
            block[i] = direct_get(strm, strm->bits_per_sample);
        flush_block_buffer(strm);
587 588 589 590 591 592 593 594 595
        state->mode = m_id;
        return M_CONTINUE;
    }

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

596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
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
611
int aec_decode_init(struct aec_stream *strm)
612
{
613
    int i, modi;
614
    struct internal_state *state;
615

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
616
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
617
        return AEC_CONF_ERROR;
618

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
619
    state = malloc(sizeof(struct internal_state));
620
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
621
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
622

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
623
    state->se_table = malloc(182 * sizeof(int));
624 625 626 627 628
    if (state->se_table == NULL)
        return AEC_MEM_ERROR;

    create_se_table(state->se_table);

629 630
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
631
    if (strm->bits_per_sample > 16) {
632
        state->id_len = 5;
633

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
665
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
666 667
        state->xmin = -(1ULL << (strm->bits_per_sample - 1));
        state->xmax = (1ULL << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
668
    } else {
669
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
670
        state->xmax = (1ULL << strm->bits_per_sample) - 1;
671
    }
672

673
    state->ref_int = strm->block_size * strm->rsi;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
674
    state->in_blklen = (strm->block_size * strm->bits_per_sample
675
                        + state->id_len) / 8 + 9;
676 677

    modi = 1UL << state->id_len;
678
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
679
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
680
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
681

682
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
683
    for (i = 1; i < modi - 1; i++) {
684
        state->id_table[i] = m_split;
685
    }
686
    state->id_table[modi - 1] = m_uncomp;
687

688
    state->block = malloc(strm->block_size * sizeof(uint32_t));
689
    if (state->block == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
690
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
691

692
    state->buf_size = strm->rsi * strm->block_size;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
693
    state->buf = malloc(state->buf_size * sizeof(uint32_t));
694
    if (state->buf == NULL)
695 696
        return AEC_MEM_ERROR;

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

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

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

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

    while (state->mode(strm) == M_CONTINUE);
    state->flush_output(strm);
724 725
    return AEC_OK;
}
726

727 728
int aec_decode_end(struct aec_stream *strm)
{
729
    struct internal_state *state= strm->state;
730

731 732
    free(state->block);
    free(state->id_table);
733
    free(state->se_table);
734
    free(state->buf);
735
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
736
    return AEC_OK;
737
}
738

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
739
int aec_buffer_decode(struct aec_stream *strm)
740 741 742 743 744 745 746 747 748 749 750
{
    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;
}