decode.c 23.7 KB
Newer Older
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
1 2
/**
 * @file decode.c
3 4
 *
 * @section LICENSE
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
5
 * Copyright 2012 - 2014
6
 *
7 8 9 10
 * Mathis Rosenhauer, Moritz Hanke, Joerg Behrens
 * Deutsches Klimarechenzentrum GmbH
 * Bundesstr. 45a
 * 20146 Hamburg Germany
11
 *
12 13 14 15 16
 * Luis Kornblueh
 * Max-Planck-Institut fuer Meteorologie
 * Bundesstr. 53
 * 20146 Hamburg
 * Germany
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
 *
 * 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
44 45 46
 * @section DESCRIPTION
 *
 * Adaptive Entropy Decoder
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
47
 * Based on CCSDS documents 121.0-B-2 and 120.0-G-3
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
48 49
 *
 */
50 51 52 53 54

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
55
#include "libaec.h"
56
#include "decode.h"
57

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
58 59 60 61
#if HAVE_BSR64
#  include <intrin.h>
#endif

62 63
#define ROS 5

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
64
#define BUFFERSPACE(strm) (strm->avail_in >= strm->state->in_blklen      \
65 66
                           && strm->avail_out >= strm->state->out_blklen)

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
143 144 145

static inline void put_msb_32(struct aec_stream *strm, uint32_t data)
{
146 147 148 149
    *strm->next_out++ = (unsigned char)(data >> 24);
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
150 151 152 153
}

static inline void put_msb_24(struct aec_stream *strm, uint32_t data)
{
154 155 156
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
157 158 159 160
}

static inline void put_msb_16(struct aec_stream *strm, uint32_t data)
{
161 162
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
163 164 165 166
}

static inline void put_lsb_32(struct aec_stream *strm, uint32_t data)
{
167 168 169 170
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)(data >> 16);
    *strm->next_out++ = (unsigned char)(data >> 24);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
171 172 173 174
}

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
175 176 177
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)(data >> 16);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
178 179 180 181
}

static inline void put_lsb_16(struct aec_stream *strm, uint32_t data)
{
182 183
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
184 185 186 187
}

static inline void put_8(struct aec_stream *strm, uint32_t data)
{
188
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
189 190
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
191 192 193 194 195 196 197
FLUSH(msb_32)
FLUSH(msb_24)
FLUSH(msb_16)
FLUSH(lsb_32)
FLUSH(lsb_24)
FLUSH(lsb_16)
FLUSH(8)
198

199
static inline void check_rsi_end(struct aec_stream *strm)
200
{
201
    /**
202
       Flush output if end of RSI reached
203
     */
204
    struct internal_state *state = strm->state;
205

206
    if (state->rsi_size == (size_t)(state->rsip - state->rsi_buffer)) {
207
        state->flush_output(strm);
208 209
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
210
    }
211 212
}

213
static inline void put_sample(struct aec_stream *strm, uint32_t s)
214 215 216
{
    struct internal_state *state = strm->state;

217
    *state->rsip++ = s;
218
    strm->avail_out -= state->bytes_per_sample;
219
    check_rsi_end(strm);
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;
Moritz Hanke's avatar
Moritz Hanke committed
228 229 230 231 232 233 234 235 236

    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):
237
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
Moritz Hanke's avatar
Moritz Hanke committed
238 239 240 241 242 243 244
      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++;
    };
245 246
}

247
static inline uint32_t direct_get(struct aec_stream *strm, int n)
248 249
{
    /**
250
       Get n bit from input stream
251 252 253 254

       No checking whatsoever. Read bits are dumped.
     */

255
    struct internal_state *state = strm->state;
256

257 258
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
259

260
    state->bitp -= n;
261
    return (state->acc >> state->bitp) & (UINT64_MAX >> (64 - n));
262 263
}

264
static inline uint32_t direct_get_fs(struct aec_stream *strm)
265 266 267 268
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
269
       Essentially counts the number of 0 bits until a 1 is
270
       encountered.
271 272
     */

273
    uint32_t fs = 0;
274 275 276 277
#if HAVE_BSR64
    unsigned long i;
#else
    int i;
278
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
279
    struct internal_state *state = strm->state;
280

281 282 283 284
    if (state->bitp)
        state->acc &= UINT64_MAX >> (64 - state->bitp);
    else
        state->acc = 0;
285

286 287 288
    while (state->acc == 0) {
        fs += state->bitp;
        state->bitp = 0;
289
        fill_acc(strm);
290
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
291

Thomas Jahns's avatar
Thomas Jahns committed
292
#if HAVE_DECL___BUILTIN_CLZLL
293
    i = 63 - __builtin_clzll(state->acc);
294
#elif HAVE_BSR64
295
    _BitScanReverse64(&i, state->acc);
296
#else
297 298 299
    i = state->bitp - 1;
    while ((state->acc & (UINT64_C(1) << i)) == 0)
        i--;
300
#endif
301 302
    fs += state->bitp - i - 1;
    state->bitp = i;
303 304 305
    return fs;
}

306
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
307 308 309 310 311 312 313 314 315 316 317 318
{
    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;
}

319
static inline uint32_t bits_get(struct aec_stream *strm, int n)
320 321
{
    return (strm->state->acc >> (strm->state->bitp - n))
322
        & (UINT64_MAX >> (64 - n));
323 324
}

325
static inline void bits_drop(struct aec_stream *strm, int n)
326 327 328 329
{
    strm->state->bitp -= n;
}

330
static inline uint32_t fs_ask(struct aec_stream *strm)
331 332 333
{
    if (bits_ask(strm, 1) == 0)
        return 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
334
    while ((strm->state->acc & (UINT64_C(1) << (strm->state->bitp - 1))) == 0) {
335 336 337 338 339 340 341 342 343 344 345 346 347 348
        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;
}

349
static inline void fs_drop(struct aec_stream *strm)
350 351 352 353 354
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

355
static inline uint32_t copysample(struct aec_stream *strm)
356
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
357
    if (bits_ask(strm, strm->bits_per_sample) == 0
358 359
        || strm->avail_out == 0)
        return 0;
360

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
361 362
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
363 364
    return 1;
}
365 366 367 368 369

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

370 371
    if (state->rsip == state->rsi_buffer) {
        if(strm->flags & AEC_PAD_RSI)
372
            state->bitp -= state->bitp % 8;
373 374 375
        if (state->pp)
            state->ref = 1;
    } else {
376
        state->ref = 0;
377
    }
378 379 380 381
    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);
382 383 384 385 386 387 388 389 390 391 392
    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 {
393
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
394
            return M_EXIT;
395 396 397 398
        if (k)
            *state->rsip++ += bits_get(strm, k);
        else
            state->rsip++;
399
        strm->avail_out -= state->bytes_per_sample;
400
        bits_drop(strm, k);
401
    } while(++state->i < state->n);
402

403
    check_rsi_end(strm);
404 405 406 407 408 409 410
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
411
    int k = state->id - 1;
412 413

    do {
414 415
        if (fs_ask(strm) == 0)
            return M_EXIT;
416
        state->rsip[state->i] = state->fs << k;
417
        fs_drop(strm);
418
    } while(++state->i < state->n);
419

420
    state->i = 0;
421
    state->mode = m_split_output;
422

423 424 425 426 427
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
428
    uint32_t i, k;
429 430
    struct internal_state *state = strm->state;

431 432 433 434
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

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

437
        for (i = 0; i < strm->block_size - state->ref; i++)
438
            state->rsip[i] = direct_get_fs(strm) << k;
439

440 441 442 443 444 445
        if (k) {
            for (i = state->ref; i < strm->block_size; i++)
                *state->rsip++ += direct_get(strm, k);
        } else {
            state->rsip += strm->block_size - state->ref;
        }
446

447
        strm->avail_out -= state->out_blklen;
448
        check_rsi_end(strm);
449

450 451 452 453 454
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
455 456
        if (copysample(strm) == 0)
            return M_EXIT;
457 458 459 460 461
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

462
    state->i = 0;
463 464 465 466 467 468 469 470
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

471 472 473 474 475
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
476 477 478 479 480 481 482

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
483
    uint32_t i, zero_blocks, b, zero_bytes;
484 485
    struct internal_state *state = strm->state;

486 487
    if (fs_ask(strm) == 0)
        return M_EXIT;
488
    zero_blocks = state->fs + 1;
489
    fs_drop(strm);
490 491

    if (zero_blocks == ROS) {
492
        b = (int)(state->rsip - state->rsi_buffer) / strm->block_size;
493 494 495 496 497 498
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
499
        i = zero_blocks * strm->block_size - 1;
500
    else
501
        i = zero_blocks * strm->block_size;
502

503
    zero_bytes = i * state->bytes_per_sample;
504

505
    if (strm->avail_out >= zero_bytes) {
506 507 508
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

509 510
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
511
        strm->avail_out -= zero_bytes;
512
        check_rsi_end(strm);
513

514 515 516 517
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
518
    state->i = i;
519 520 521 522 523 524
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
525
    int32_t m, d1;
526 527 528
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
529 530
        if (fs_ask(strm) == 0)
            return M_EXIT;
531
        m = state->fs;
532
        d1 = m - state->se_table[2 * m + 1];
533 534

        if ((state->i & 1) == 0) {
535 536 537
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
538 539 540
            state->i++;
        }

541 542 543
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
544
        state->i++;
545
        fs_drop(strm);
546 547 548 549 550 551 552 553
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
554
    uint32_t i;
555
    int32_t m, d1;
556 557
    struct internal_state *state = strm->state;

558 559 560 561 562 563 564 565 566 567 568 569 570 571
    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++;
        }
572 573 574 575 576 577 578 579 580 581 582 583 584
        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;

585 586
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
587 588 589 590 591 592 593 594 595 596 597 598 599 600

    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;

601 602 603 604
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
605 606 607 608 609 610 611 612
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

613 614 615 616
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
617 618 619 620 621 622 623

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
624
    uint32_t i;
625 626
    struct internal_state *state = strm->state;

627
    if (BUFFERSPACE(strm)) {
628
        for (i = 0; i < strm->block_size; i++)
629
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
630
        strm->avail_out -= state->out_blklen;
631
        check_rsi_end(strm);
632

633 634 635 636 637 638 639 640 641
        state->mode = m_id;
        return M_CONTINUE;
    }

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

642 643 644 645 646 647 648 649 650 651 652 653 654 655 656
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
657
int aec_decode_init(struct aec_stream *strm)
658
{
659
    int i, modi;
660
    struct internal_state *state;
661

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
662
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
663
        return AEC_CONF_ERROR;
664

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
665
    state = malloc(sizeof(struct internal_state));
666
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
667
        return AEC_MEM_ERROR;
668
    memset(state, 0, sizeof(struct internal_state));
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
669

670 671
    create_se_table(state->se_table);

672 673
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
674
    if (strm->bits_per_sample > 16) {
675
        state->id_len = 5;
676

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
677 678
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
679
            if (strm->flags & AEC_DATA_MSB)
680
                state->flush_output = flush_msb_24;
681
            else
682
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
683
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
684
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
685
            if (strm->flags & AEC_DATA_MSB)
686
                state->flush_output = flush_msb_32;
687
            else
688
                state->flush_output = flush_lsb_32;
689 690
        }
        state->out_blklen = strm->block_size
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
691
            * state->bytes_per_sample;
692
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
693 694
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
695
        state->id_len = 4;
696
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
697
        if (strm->flags & AEC_DATA_MSB)
698
            state->flush_output = flush_msb_16;
699
        else
700
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
701
    } else {
702
        if (strm->flags & AEC_RESTRICTED) {
703 704 705 706 707 708 709 710 711 712 713 714
            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
715
        state->bytes_per_sample = 1;
716
        state->out_blklen = strm->block_size;
717
        state->flush_output = flush_8;
718 719
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
720
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
721 722
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample + 1);
        state->xmin = ~state->xmax;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
723
    } else {
724
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
725
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample);
726
    }
727

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
728
    state->in_blklen = (strm->block_size * strm->bits_per_sample
729
                        + state->id_len) / 8 + 9;
730 731

    modi = 1UL << state->id_len;
732
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
733
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
734
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
735

736
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
737
    for (i = 1; i < modi - 1; i++) {
738
        state->id_table[i] = m_split;
739
    }
740
    state->id_table[modi - 1] = m_uncomp;
741

742 743 744
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
745 746
        return AEC_MEM_ERROR;

747
    state->ref = 0;
748 749 750
    strm->total_in = 0;
    strm->total_out = 0;

751 752
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
753
    state->bitp = 0;
754
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
755
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
756
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
757
    return AEC_OK;
758 759
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
760
int aec_decode(struct aec_stream *strm, int flush)
761
{
762 763 764 765 766 767 768 769 770
    /**
       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
771
    struct internal_state *state = strm->state;
772
    int status;
773

774 775 776
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

777 778 779 780 781 782 783
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

784
    state->flush_output(strm);
785 786 787 788

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

789 790
    return AEC_OK;
}
791

792 793
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
794
    struct internal_state *state = strm->state;
795

796
    free(state->id_table);
797
    free(state->rsi_buffer);
798
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
799
    return AEC_OK;
800
}
801

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
802
int aec_buffer_decode(struct aec_stream *strm)
803 804 805 806 807 808 809 810 811 812 813
{
    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;
}