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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
126 127 128

static inline void put_msb_32(struct aec_stream *strm, uint32_t data)
{
129 130 131 132
    *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
133 134 135 136
}

static inline void put_msb_24(struct aec_stream *strm, uint32_t data)
{
137 138 139
    *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
140 141 142 143
}

static inline void put_msb_16(struct aec_stream *strm, uint32_t data)
{
144 145
    *strm->next_out++ = (unsigned char)(data >> 8);
    *strm->next_out++ = (unsigned char)data;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
146 147 148 149
}

static inline void put_lsb_32(struct aec_stream *strm, uint32_t data)
{
150 151 152 153
    *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
154 155 156 157
}

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
158 159 160
    *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
161 162 163 164
}

static inline void put_lsb_16(struct aec_stream *strm, uint32_t data)
{
165 166
    *strm->next_out++ = (unsigned char)data;
    *strm->next_out++ = (unsigned char)(data >> 8);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
167 168 169 170
}

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
174 175 176 177 178 179 180
FLUSH(msb_32)
FLUSH(msb_24)
FLUSH(msb_16)
FLUSH(lsb_32)
FLUSH(lsb_24)
FLUSH(lsb_16)
FLUSH(8)
181

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

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

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

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

205 206 207 208 209 210
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
211 212 213 214 215 216 217 218 219

    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):
220
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
Moritz Hanke's avatar
Moritz Hanke committed
221 222 223 224 225 226 227 228
      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++;
    };

229 230
}

231
static inline uint32_t direct_get(struct aec_stream *strm, 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
    state->bitp -= n;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
245
    return (state->acc >> state->bitp) & ((UINT64_C(1) << n) - 1);
246 247
}

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
       Essentially counts the number of 0 bits until a 1 is
254
       encountered.
255 256
     */

257
    uint32_t fs = 0;
258 259 260 261
#if HAVE_DECL___BUILTIN_CLZLL
    int lz;
#elif HAVE_BSR64
    unsigned long lz;
262
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
263
    struct internal_state *state = strm->state;
264

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
265
    state->acc &= ((UINT64_C(1) << state->bitp) - 1);
266

267 268 269
    while (state->acc == 0) {
        fs += state->bitp;
        state->bitp = 0;
270
        fill_acc(strm);
271
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
272

Thomas Jahns's avatar
Thomas Jahns committed
273
#if HAVE_DECL___BUILTIN_CLZLL
274 275 276
    lz = __builtin_clzll(state->acc);
    fs += lz + state->bitp - 64;
    state->bitp = 63 - lz;
277 278 279 280
#elif HAVE_BSR64
    _BitScanReverse64(&lz, state->acc);
    fs += state->bitp - 1 - lz;
    state->bitp = lz;
281
#else
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
282
    state->bitp--;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
283
    while ((state->acc & (UINT64_C(1) << state->bitp)) == 0) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
284
        state->bitp--;
285
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
286
    }
287
#endif
288 289 290
    return fs;
}

291
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
292 293 294 295 296 297 298 299 300 301 302 303
{
    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;
}

304
static inline uint32_t bits_get(struct aec_stream *strm, int n)
305 306
{
    return (strm->state->acc >> (strm->state->bitp - n))
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
307
        & ((UINT64_C(1) << n) - 1);
308 309
}

310
static inline void bits_drop(struct aec_stream *strm, int n)
311 312 313 314
{
    strm->state->bitp -= n;
}

315
static inline uint32_t fs_ask(struct aec_stream *strm)
316 317 318
{
    if (bits_ask(strm, 1) == 0)
        return 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
319
    while ((strm->state->acc & (UINT64_C(1) << (strm->state->bitp - 1))) == 0) {
320 321 322 323 324 325 326 327 328 329 330 331 332 333
        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;
}

334
static inline void fs_drop(struct aec_stream *strm)
335 336 337 338 339
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

340
static inline uint32_t copysample(struct aec_stream *strm)
341
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
342
    if (bits_ask(strm, strm->bits_per_sample) == 0
343 344
        || strm->avail_out == 0)
        return 0;
345

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
346 347
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
348 349
    return 1;
}
350 351 352 353 354

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

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

385
    check_rsi_end(strm);
386 387 388 389 390 391 392
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
393
    int k = state->id - 1;
394 395

    do {
396 397
        if (fs_ask(strm) == 0)
            return M_EXIT;
398
        state->rsip[state->i] = state->fs << k;
399
        fs_drop(strm);
400
    } while(++state->i < state->n);
401

402
    state->i = 0;
403 404 405 406 407 408
    state->mode = m_split_output;
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
409
    uint32_t i, k;
410 411
    struct internal_state *state = strm->state;

412 413 414 415
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

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

418
        for (i = 0; i < strm->block_size - state->ref; i++)
419
            state->rsip[i] = direct_get_fs(strm) << k;
420

421
        for (i = state->ref; i < strm->block_size; i++)
422
            *state->rsip++ += direct_get(strm, k);
423

424
        strm->avail_out -= state->out_blklen;
425
        check_rsi_end(strm);
426

427 428 429 430 431
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
432 433
        if (copysample(strm) == 0)
            return M_EXIT;
434 435 436 437 438
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

439
    state->i = 0;
440 441 442 443 444 445 446 447
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

448 449 450 451 452
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
453 454 455 456 457 458 459

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
460
    uint32_t i, zero_blocks, b, zero_bytes;
461 462
    struct internal_state *state = strm->state;

463 464
    if (fs_ask(strm) == 0)
        return M_EXIT;
465
    zero_blocks = state->fs + 1;
466
    fs_drop(strm);
467 468

    if (zero_blocks == ROS) {
469
        b = (int)(state->rsip - state->rsi_buffer) / strm->block_size;
470 471 472 473 474 475
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
476
        i = zero_blocks * strm->block_size - 1;
477
    else
478
        i = zero_blocks * strm->block_size;
479

480
    zero_bytes = i * state->bytes_per_sample;
481

482
    if (strm->avail_out >= zero_bytes) {
483 484 485
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

486 487
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
488
        strm->avail_out -= zero_bytes;
489
        check_rsi_end(strm);
490

491 492 493 494
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
495
    state->i = i;
496 497 498 499 500 501
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
502
    int32_t m, d1;
503 504 505
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
506 507
        if (fs_ask(strm) == 0)
            return M_EXIT;
508
        m = state->fs;
509
        d1 = m - state->se_table[2 * m + 1];
510 511

        if ((state->i & 1) == 0) {
512 513 514
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
515 516 517
            state->i++;
        }

518 519 520
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
521
        state->i++;
522
        fs_drop(strm);
523 524 525 526 527 528 529 530
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
531
    uint32_t i;
532
    int32_t m, d1;
533 534
    struct internal_state *state = strm->state;

535 536 537 538 539 540 541 542 543 544 545 546 547 548
    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++;
        }
549 550 551 552 553 554 555 556 557 558 559 560 561
        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;

562 563
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
564 565 566 567 568 569 570 571 572 573 574 575 576 577

    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;

578 579 580 581
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
582 583 584 585 586 587 588 589
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

590 591 592 593
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
594 595 596 597 598 599 600

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
601
    uint32_t i;
602 603
    struct internal_state *state = strm->state;

604
    if (BUFFERSPACE(strm)) {
605
        for (i = 0; i < strm->block_size; i++)
606
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
607
        strm->avail_out -= state->out_blklen;
608
        check_rsi_end(strm);
609

610 611 612 613 614 615 616 617 618
        state->mode = m_id;
        return M_CONTINUE;
    }

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

619 620 621 622 623 624 625 626 627 628 629 630 631 632 633
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
634
int aec_decode_init(struct aec_stream *strm)
635
{
636
    int i, modi;
637
    struct internal_state *state;
638

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
639
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
640
        return AEC_CONF_ERROR;
641

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
642
    state = malloc(sizeof(struct internal_state));
643
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
644
        return AEC_MEM_ERROR;
645
    memset(state, 0, sizeof(struct internal_state));
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
646

647 648
    create_se_table(state->se_table);

649 650
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
651
    if (strm->bits_per_sample > 16) {
652
        state->id_len = 5;
653

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
697
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
698 699
        state->xmin = -(INT64_C(1) << (strm->bits_per_sample - 1));
        state->xmax = (UINT64_C(1) << (strm->bits_per_sample - 1)) - 1;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
700
    } else {
701
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
702
        state->xmax = (UINT64_C(1) << strm->bits_per_sample) - 1;
703
    }
704

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
705
    state->in_blklen = (strm->block_size * strm->bits_per_sample
706
                        + state->id_len) / 8 + 9;
707 708

    modi = 1UL << state->id_len;
709
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
710
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
711
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
712

713
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
714
    for (i = 1; i < modi - 1; i++) {
715
        state->id_table[i] = m_split;
716
    }
717
    state->id_table[modi - 1] = m_uncomp;
718

719 720 721
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
722 723
        return AEC_MEM_ERROR;

724
    state->ref = 0;
725 726 727
    strm->total_in = 0;
    strm->total_out = 0;

728 729
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
730
    state->bitp = 0;
731
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
732
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
733
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
734
    return AEC_OK;
735 736
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
737
int aec_decode(struct aec_stream *strm, int flush)
738
{
739 740 741 742 743 744 745 746 747
    /**
       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
748
    struct internal_state *state = strm->state;
749
    int status;
750

751 752 753
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

754 755 756 757 758 759 760
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

761
    state->flush_output(strm);
762 763 764 765

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

766 767
    return AEC_OK;
}
768

769 770
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
771
    struct internal_state *state = strm->state;
772

773
    free(state->id_table);
774
    free(state->rsi_buffer);
775
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
776
    return AEC_OK;
777
}
778

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
779
int aec_buffer_decode(struct aec_stream *strm)
780 781 782 783 784 785 786 787 788 789 790
{
    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;
}