decode.c 22.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
 * @author Moritz Hanke, Deutsches Klimarechenzentrum
 * @author Joerg Behrens, Deutsches Klimarechenzentrum
 * @author Luis Kornblueh, Max-Planck-Institut fuer Meteorologie
 *
 * @section LICENSE
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
10
 * Copyright 2012 - 2014
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
 *
 * 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
 * @section DESCRIPTION
 *
 * Adaptive Entropy Decoder
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
50
 * Based on CCSDS documents 121.0-B-2 and 120.0-G-3
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
51 52
 *
 */
53 54 55 56 57

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
58
#include "libaec.h"
59
#include "decode.h"
60

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
61 62 63 64
#if HAVE_BSR64
#  include <intrin.h>
#endif

65 66 67 68 69
#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
70
#define FLUSH(KIND)                                                     \
71 72
    static void flush_##KIND(struct aec_stream *strm)                   \
    {                                                                   \
73
        uint32_t *bp, *flush_end;                                       \
74
        int64_t d, m;                                                   \
Moritz Hanke's avatar
Moritz Hanke committed
75
        int64_t data, med, half_d, xmin, xmax;                          \
76 77
        struct internal_state *state = strm->state;                     \
                                                                        \
78
        flush_end = state->rsip;                                        \
79
        if (state->pp) {                                                \
80 81 82
            if (state->flush_start == state->rsi_buffer                 \
                && state->rsip > state->rsi_buffer) {                   \
                state->last_out = *state->rsi_buffer;                   \
83 84
                                                                        \
                if (strm->flags & AEC_DATA_SIGNED) {                    \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
85
                    m = 1ULL << (strm->bits_per_sample - 1);            \
86
                    /* Reference samples have to be sign extended */    \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
87
                    state->last_out = (state->last_out ^ m) - m;        \
88
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
89
                put_##KIND(strm, state->last_out);                      \
90
                state->flush_start++;                                   \
91 92
            }                                                           \
                                                                        \
93 94 95 96 97 98
            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
99 100 101
            xmin = state->xmin;                                         \
            xmax = state->xmax;                                         \
                                                                        \
102 103
            for (bp = state->flush_start; bp < flush_end; bp++) {       \
                d = *bp;                                                \
Moritz Hanke's avatar
Moritz Hanke committed
104 105 106 107 108 109 110 111 112 113 114
                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;                                \
                    }                                                   \
115
                } else {                                                \
Moritz Hanke's avatar
Moritz Hanke committed
116 117 118 119 120 121 122 123
                    if (half_d <= xmax - data) {                        \
                        if (d & 1)                                      \
                            data -= half_d;                             \
                        else                                            \
                            data += half_d;                             \
                    } else {                                            \
                        data = xmax - d;                                \
                    }                                                   \
124
                }                                                       \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
125
                put_##KIND(strm, data);                                 \
126
            }                                                           \
127
            state->last_out = data;                                     \
128
        } else {                                                        \
129 130
            for (bp = state->flush_start; bp < flush_end; bp++)         \
                put_##KIND(strm, *bp);                                  \
131
        }                                                               \
132
        state->flush_start = state->rsip;                               \
133
    }
134

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

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

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

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

205
static inline void put_sample(struct aec_stream *strm, uint32_t s)
206 207 208
{
    struct internal_state *state = strm->state;

209
    *state->rsip++ = s;
210
    strm->avail_out -= state->bytes_per_sample;
211
    check_rsi_end(strm);
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->state->bitp += b << 3;
Moritz Hanke's avatar
Moritz Hanke committed
220 221 222 223 224 225 226 227 228

    switch (b) {
      case (7):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
      case (6):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
      case (5):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
      case (4):
229
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
Moritz Hanke's avatar
Moritz Hanke committed
230 231 232 233 234 235 236 237
      case (3):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
      case (2):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
      case (1):
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
    };

238 239 240
}

static inline uint32_t direct_get(struct aec_stream *strm, unsigned int n)
241 242
{
    /**
243
       Get n bit from input stream
244 245 246 247

       No checking whatsoever. Read bits are dumped.
     */

248
    struct internal_state *state = strm->state;
249

250 251
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
252

253 254 255 256
    state->bitp -= n;
    return (state->acc >> state->bitp) & ((1ULL << n) - 1);
}

257
static inline uint32_t direct_get_fs(struct aec_stream *strm)
258 259 260 261
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
262
       Essentially counts the number of 0 bits until a 1 is
263
       encountered.
264 265
     */

266
    uint32_t fs = 0;
267
#if HAVE_DECL___BUILTIN_CLZLL||HAVE_BSR64
268
    uint32_t lz;
269
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
270
    struct internal_state *state = strm->state;
271

272 273
    state->acc &= ((1ULL << state->bitp) - 1);

274 275 276
    while (state->acc == 0) {
        fs += state->bitp;
        state->bitp = 0;
277
        fill_acc(strm);
278
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
279

Thomas Jahns's avatar
Thomas Jahns committed
280
#if HAVE_DECL___BUILTIN_CLZLL
281 282 283
    lz = __builtin_clzll(state->acc);
    fs += lz + state->bitp - 64;
    state->bitp = 63 - lz;
284 285 286 287
#elif HAVE_BSR64
    _BitScanReverse64(&lz, state->acc);
    fs += state->bitp - 1 - lz;
    state->bitp = lz;
288
#else
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
289 290 291
    state->bitp--;
    while ((state->acc & (1ULL << state->bitp)) == 0) {
        state->bitp--;
292
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
293
    }
294
#endif
295 296 297
    return fs;
}

298
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
299 300 301 302 303 304 305 306 307 308 309 310
{
    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;
}

311
static inline uint32_t bits_get(struct aec_stream *strm, int n)
312 313 314 315 316
{
    return (strm->state->acc >> (strm->state->bitp - n))
        & ((1ULL << n) - 1);
}

317
static inline void bits_drop(struct aec_stream *strm, int n)
318 319 320 321
{
    strm->state->bitp -= n;
}

322
static inline uint32_t fs_ask(struct aec_stream *strm)
323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
{
    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;
}

341
static inline void fs_drop(struct aec_stream *strm)
342 343 344 345 346
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

347
static inline uint32_t copysample(struct aec_stream *strm)
348
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
349
    if (bits_ask(strm, strm->bits_per_sample) == 0
350 351
        || strm->avail_out == 0)
        return 0;
352

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
353 354
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
355 356
    return 1;
}
357 358 359 360 361

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

362 363
    if (state->rsip == state->rsi_buffer) {
        if(strm->flags & AEC_PAD_RSI)
364
            state->bitp -= state->bitp % 8;
365 366 367
        if (state->pp)
            state->ref = 1;
    } else {
368
        state->ref = 0;
369
    }
370 371 372 373
    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);
374 375 376 377 378 379 380 381 382 383 384
    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 {
385
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
386
            return M_EXIT;
387 388
        *state->rsip++ += bits_get(strm, k);
        strm->avail_out -= state->bytes_per_sample;
389
        bits_drop(strm, k);
390
    } while(++state->i < state->n);
391

392
    check_rsi_end(strm);
393 394 395 396 397 398 399
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
400
    int k = state->id - 1;
401 402

    do {
403 404
        if (fs_ask(strm) == 0)
            return M_EXIT;
405
        state->rsip[state->i] = state->fs << k;
406
        fs_drop(strm);
407
    } while(++state->i < state->n);
408

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

static int m_split(struct aec_stream *strm)
{
416
    int i, k;
417 418
    struct internal_state *state = strm->state;

419 420 421 422
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

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

425
        for (i = 0; i < strm->block_size - state->ref; i++)
426
            state->rsip[i] = direct_get_fs(strm) << k;
427

428
        for (i = state->ref; i < strm->block_size; i++)
429
            *state->rsip++ += direct_get(strm, k);
430

431
        strm->avail_out -= state->out_blklen;
432
        check_rsi_end(strm);
433

434 435 436 437 438
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
439 440
        if (copysample(strm) == 0)
            return M_EXIT;
441 442 443 444 445
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

446
    state->i = 0;
447 448 449 450 451 452 453 454
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

455 456 457 458 459
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
460 461 462 463 464 465 466

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
467
    int i, zero_blocks, b, zero_bytes;
468 469
    struct internal_state *state = strm->state;

470 471
    if (fs_ask(strm) == 0)
        return M_EXIT;
472
    zero_blocks = state->fs + 1;
473
    fs_drop(strm);
474 475

    if (zero_blocks == ROS) {
476
        b = (state->rsip - state->rsi_buffer) / strm->block_size;
477 478 479 480 481 482
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
483
        i = zero_blocks * strm->block_size - 1;
484
    else
485
        i = zero_blocks * strm->block_size;
486

487
    zero_bytes = i * state->bytes_per_sample;
488

489
    if (strm->avail_out >= zero_bytes) {
490 491 492
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

493 494
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
495
        strm->avail_out -= zero_bytes;
496
        check_rsi_end(strm);
497

498 499 500 501
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
502
    state->i = i;
503 504 505 506 507 508
    state->mode = m_zero_output;
    return M_CONTINUE;
}

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

    while(state->i < strm->block_size) {
513 514
        if (fs_ask(strm) == 0)
            return M_EXIT;
515
        m = state->fs;
516
        d1 = m - state->se_table[2 * m + 1];
517 518

        if ((state->i & 1) == 0) {
519 520 521
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
522 523 524
            state->i++;
        }

525 526 527
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
528
        state->i++;
529
        fs_drop(strm);
530 531 532 533 534 535 536 537
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
538 539
    int i;
    int32_t m, d1;
540 541
    struct internal_state *state = strm->state;

542 543 544 545 546 547 548 549 550 551 552 553 554 555
    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++;
        }
556 557 558 559 560 561 562 563 564 565 566 567 568
        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;

569 570
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
571 572 573 574 575 576 577 578 579 580 581 582 583 584

    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;

585 586 587 588
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
589 590 591 592 593 594 595 596
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

597 598 599 600
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
601 602 603 604 605 606 607

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
608
    int i;
609 610
    struct internal_state *state = strm->state;

611
    if (BUFFERSPACE(strm)) {
612
        for (i = 0; i < strm->block_size; i++)
613
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
614
        strm->avail_out -= state->out_blklen;
615
        check_rsi_end(strm);
616

617 618 619 620 621 622 623 624 625
        state->mode = m_id;
        return M_CONTINUE;
    }

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

626 627 628 629 630 631 632 633 634 635 636 637 638 639 640
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
641
int aec_decode_init(struct aec_stream *strm)
642
{
643
    int i, modi;
644
    struct internal_state *state;
645

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
646
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
647
        return AEC_CONF_ERROR;
648

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
649
    state = malloc(sizeof(struct internal_state));
650
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
651
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
652

653 654
    create_se_table(state->se_table);

655 656
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
657
    if (strm->bits_per_sample > 16) {
658
        state->id_len = 5;
659

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
660 661
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
662
            if (strm->flags & AEC_DATA_MSB)
663
                state->flush_output = flush_msb_24;
664
            else
665
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
666
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
667
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
668
            if (strm->flags & AEC_DATA_MSB)
669
                state->flush_output = flush_msb_32;
670
            else
671
                state->flush_output = flush_lsb_32;
672 673
        }
        state->out_blklen = strm->block_size
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
674
            * state->bytes_per_sample;
675
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
676 677
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
678
        state->id_len = 4;
679
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
680
        if (strm->flags & AEC_DATA_MSB)
681
            state->flush_output = flush_msb_16;
682
        else
683
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
684
    } else {
685
        if (strm->flags & AEC_RESTRICTED) {
686 687 688 689 690 691 692 693 694 695 696 697
            if (strm->bits_per_sample <= 4) {
                if (strm->bits_per_sample <= 2)
                    state->id_len = 1;
                else
                    state->id_len = 2;
            } else {
                return AEC_CONF_ERROR;
            }
        } else {
            state->id_len = 3;
        }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
698
        state->bytes_per_sample = 1;
699
        state->out_blklen = strm->block_size;
700
        state->flush_output = flush_8;
701 702
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
703
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
704 705
        state->xmin = -(1ULL << (strm->bits_per_sample - 1));
        state->xmax = (1ULL << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
706
    } else {
707
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
708
        state->xmax = (1ULL << strm->bits_per_sample) - 1;
709
    }
710

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
711
    state->in_blklen = (strm->block_size * strm->bits_per_sample
712
                        + state->id_len) / 8 + 9;
713 714

    modi = 1UL << state->id_len;
715
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
716
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
717
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
718

719
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
720
    for (i = 1; i < modi - 1; i++) {
721
        state->id_table[i] = m_split;
722
    }
723
    state->id_table[modi - 1] = m_uncomp;
724

725 726 727
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
728 729
        return AEC_MEM_ERROR;

730 731 732
    strm->total_in = 0;
    strm->total_out = 0;

733 734
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
735
    state->bitp = 0;
736
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
737
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
738
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
739
    return AEC_OK;
740 741
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
742
int aec_decode(struct aec_stream *strm, int flush)
743
{
744 745 746 747 748 749 750 751 752
    /**
       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.
    */

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
753
    struct internal_state *state = strm->state;
754
    int status;
755

756 757 758
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

759 760 761 762 763 764 765
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

766
    state->flush_output(strm);
767 768 769 770

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

771 772
    return AEC_OK;
}
773

774 775
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
776
    struct internal_state *state = strm->state;
777

778
    free(state->id_table);
779
    free(state->rsi_buffer);
780
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
781
    return AEC_OK;
782
}
783

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
784
int aec_buffer_decode(struct aec_stream *strm)
785 786 787 788 789 790 791 792 793 794 795
{
    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;
}