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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
146 147 148

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

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

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

static inline void put_lsb_32(struct aec_stream *strm, uint32_t data)
{
170 171 172 173
    *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
174 175 176 177
}

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
178 179 180
    *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
181 182 183 184
}

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

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
194 195 196 197 198 199 200
FLUSH(msb_32)
FLUSH(msb_24)
FLUSH(msb_16)
FLUSH(lsb_32)
FLUSH(lsb_24)
FLUSH(lsb_16)
FLUSH(8)
201

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

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

216
static inline void put_sample(struct aec_stream *strm, uint32_t s)
217 218 219
{
    struct internal_state *state = strm->state;

220
    *state->rsip++ = s;
221
    strm->avail_out -= state->bytes_per_sample;
222
    check_rsi_end(strm);
223 224
}

225 226 227 228 229 230
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
231 232 233 234 235 236 237 238 239

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

249 250
}

251
static inline uint32_t direct_get(struct aec_stream *strm, int n)
252 253
{
    /**
254
       Get n bit from input stream
255 256 257 258

       No checking whatsoever. Read bits are dumped.
     */

259
    struct internal_state *state = strm->state;
260

261 262
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
263

264
    state->bitp -= n;
265
    return (state->acc >> state->bitp) & (UINT64_MAX >> (64 - n));
266 267
}

268
static inline uint32_t direct_get_fs(struct aec_stream *strm)
269 270 271 272
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
273
       Essentially counts the number of 0 bits until a 1 is
274
       encountered.
275 276
     */

277
    uint32_t fs = 0;
278 279 280 281
#if HAVE_DECL___BUILTIN_CLZLL
    int lz;
#elif HAVE_BSR64
    unsigned long lz;
282
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
283
    struct internal_state *state = strm->state;
284

285 286 287 288
    if (state->bitp)
        state->acc &= UINT64_MAX >> (64 - state->bitp);
    else
        state->acc = 0;
289

290 291 292
    while (state->acc == 0) {
        fs += state->bitp;
        state->bitp = 0;
293
        fill_acc(strm);
294
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
295

Thomas Jahns's avatar
Thomas Jahns committed
296
#if HAVE_DECL___BUILTIN_CLZLL
297 298 299
    lz = __builtin_clzll(state->acc);
    fs += lz + state->bitp - 64;
    state->bitp = 63 - lz;
300 301 302 303
#elif HAVE_BSR64
    _BitScanReverse64(&lz, state->acc);
    fs += state->bitp - 1 - lz;
    state->bitp = lz;
304
#else
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
305
    state->bitp--;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
306
    while ((state->acc & (UINT64_C(1) << state->bitp)) == 0) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
307
        state->bitp--;
308
        fs++;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
309
    }
310
#endif
311 312 313
    return fs;
}

314
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
315 316 317 318 319 320 321 322 323 324 325 326
{
    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;
}

327
static inline uint32_t bits_get(struct aec_stream *strm, int n)
328 329
{
    return (strm->state->acc >> (strm->state->bitp - n))
330
        & (UINT64_MAX >> (64 - n));
331 332
}

333
static inline void bits_drop(struct aec_stream *strm, int n)
334 335 336 337
{
    strm->state->bitp -= n;
}

338
static inline uint32_t fs_ask(struct aec_stream *strm)
339 340 341
{
    if (bits_ask(strm, 1) == 0)
        return 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
342
    while ((strm->state->acc & (UINT64_C(1) << (strm->state->bitp - 1))) == 0) {
343 344 345 346 347 348 349 350 351 352 353 354 355 356
        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;
}

357
static inline void fs_drop(struct aec_stream *strm)
358 359 360 361 362
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

363
static inline uint32_t copysample(struct aec_stream *strm)
364
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
365
    if (bits_ask(strm, strm->bits_per_sample) == 0
366 367
        || strm->avail_out == 0)
        return 0;
368

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
369 370
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
371 372
    return 1;
}
373 374 375 376 377

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

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

411
    check_rsi_end(strm);
412 413 414 415 416 417 418
    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
419
    int k = state->id - 1;
420 421

    do {
422 423
        if (fs_ask(strm) == 0)
            return M_EXIT;
424
        state->rsip[state->i] = state->fs << k;
425
        fs_drop(strm);
426
    } while(++state->i < state->n);
427

428
    state->i = 0;
429
    state->mode = m_split_output;
430

431 432 433 434 435
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
436
    uint32_t i, k;
437 438
    struct internal_state *state = strm->state;

439 440 441 442
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;

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

445
        for (i = 0; i < strm->block_size - state->ref; i++)
446
            state->rsip[i] = direct_get_fs(strm) << k;
447

448 449 450 451 452 453
        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;
        }
454

455
        strm->avail_out -= state->out_blklen;
456
        check_rsi_end(strm);
457

458 459 460 461 462
        state->mode = m_id;
        return M_CONTINUE;
    }

    if (state->ref) {
463 464
        if (copysample(strm) == 0)
            return M_EXIT;
465 466 467 468 469
        state->n = strm->block_size - 1;
    } else {
        state->n = strm->block_size;
    }

470
    state->i = 0;
471 472 473 474 475 476 477 478
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

479 480 481 482 483
    do {
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
484 485 486 487 488 489 490

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
491
    uint32_t i, zero_blocks, b, zero_bytes;
492 493
    struct internal_state *state = strm->state;

494 495
    if (fs_ask(strm) == 0)
        return M_EXIT;
496
    zero_blocks = state->fs + 1;
497
    fs_drop(strm);
498 499

    if (zero_blocks == ROS) {
500
        b = (int)(state->rsip - state->rsi_buffer) / strm->block_size;
501 502 503 504 505 506
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

    if (state->ref)
507
        i = zero_blocks * strm->block_size - 1;
508
    else
509
        i = zero_blocks * strm->block_size;
510

511
    zero_bytes = i * state->bytes_per_sample;
512

513
    if (strm->avail_out >= zero_bytes) {
514 515 516
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

517 518
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
519
        strm->avail_out -= zero_bytes;
520
        check_rsi_end(strm);
521

522 523 524 525
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
526
    state->i = i;
527 528 529 530 531 532
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
533
    int32_t m, d1;
534 535 536
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
537 538
        if (fs_ask(strm) == 0)
            return M_EXIT;
539
        m = state->fs;
540
        d1 = m - state->se_table[2 * m + 1];
541 542

        if ((state->i & 1) == 0) {
543 544 545
            if (strm->avail_out == 0)
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
546 547 548
            state->i++;
        }

549 550 551
        if (strm->avail_out == 0)
            return M_EXIT;
        put_sample(strm, d1);
552
        state->i++;
553
        fs_drop(strm);
554 555 556 557 558 559 560 561
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
562
    uint32_t i;
563
    int32_t m, d1;
564 565
    struct internal_state *state = strm->state;

566 567 568 569 570 571 572 573 574 575 576 577 578 579
    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++;
        }
580 581 582 583 584 585 586 587 588 589 590 591 592
        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;

593 594
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
595 596 597 598 599 600 601 602 603 604 605 606 607 608

    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;

609 610 611 612
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
613 614 615 616 617 618 619 620
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

621 622 623 624
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
625 626 627 628 629 630 631

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
632
    uint32_t i;
633 634
    struct internal_state *state = strm->state;

635
    if (BUFFERSPACE(strm)) {
636
        for (i = 0; i < strm->block_size; i++)
637
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
638
        strm->avail_out -= state->out_blklen;
639
        check_rsi_end(strm);
640

641 642 643 644 645 646 647 648 649
        state->mode = m_id;
        return M_CONTINUE;
    }

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

650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
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
665
int aec_decode_init(struct aec_stream *strm)
666
{
667
    int i, modi;
668
    struct internal_state *state;
669

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
670
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
671
        return AEC_CONF_ERROR;
672

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
673
    state = malloc(sizeof(struct internal_state));
674
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
675
        return AEC_MEM_ERROR;
676
    memset(state, 0, sizeof(struct internal_state));
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
677

678 679
    create_se_table(state->se_table);

680 681
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
682
    if (strm->bits_per_sample > 16) {
683
        state->id_len = 5;
684

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
728
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
729 730
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample + 1);
        state->xmin = ~state->xmax;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
731
    } else {
732
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
733
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample);
734
    }
735

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
736
    state->in_blklen = (strm->block_size * strm->bits_per_sample
737
                        + state->id_len) / 8 + 9;
738 739

    modi = 1UL << state->id_len;
740
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
741
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
742
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
743

744
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
745
    for (i = 1; i < modi - 1; i++) {
746
        state->id_table[i] = m_split;
747
    }
748
    state->id_table[modi - 1] = m_uncomp;
749

750 751 752
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
753 754
        return AEC_MEM_ERROR;

755
    state->ref = 0;
756 757 758
    strm->total_in = 0;
    strm->total_out = 0;

759 760
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
761
    state->bitp = 0;
762
    state->fs = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
763
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
764
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
765
    return AEC_OK;
766 767
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
768
int aec_decode(struct aec_stream *strm, int flush)
769
{
770 771 772 773 774 775 776 777 778
    /**
       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
779
    struct internal_state *state = strm->state;
780
    int status;
781

782 783 784
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

785 786 787 788 789 790 791
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

792
    state->flush_output(strm);
793 794 795 796

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

797 798
    return AEC_OK;
}
799

800 801
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
802
    struct internal_state *state = strm->state;
803

804
    free(state->id_table);
805
    free(state->rsi_buffer);
806
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
807
    return AEC_OK;
808
}
809

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
810
int aec_buffer_decode(struct aec_stream *strm)
811 812 813 814 815 816 817 818 819 820 821
{
    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;
}