decode.c 24.2 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)                   \
    {                                                                   \
Moritz Hanke's avatar
Moritz Hanke committed
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;                                     \
                                                                        \
Moritz Hanke's avatar
Moritz Hanke committed
91
            if (state->xmin == 0) {                                     \
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
92
                                                                        \
Moritz Hanke's avatar
Moritz Hanke committed
93 94 95
              uint32_t xmax, med, d;                                    \
              med = state->xmax / 2 + 1;                                \
              xmax = state->xmax;                                       \
Moritz Hanke's avatar
Moritz Hanke committed
96
                                                                        \
Moritz Hanke's avatar
Moritz Hanke committed
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
                                                                        \
Moritz Hanke's avatar
Moritz Hanke committed
101 102 103 104 105 106 107
                  if (data < med) {                                     \
                      if (half_d <= data) {                             \
                          data += (d >> 1)^(~((d & 1) - 1));            \
                      } else {                                          \
                          data = d;                                     \
                      }                                                 \
                  } else {                                              \
108 109
                      /*in this case (xmax - data == xmax ^ data)*/     \
                      if (half_d <= (xmax ^ data)) {                    \
Moritz Hanke's avatar
Moritz Hanke committed
110 111
                          data += (d >> 1)^(~((d & 1) - 1));            \
                      } else {                                          \
112
                          data = xmax ^ d;                              \
Moritz Hanke's avatar
Moritz Hanke committed
113 114 115 116 117 118 119 120
                      }                                                 \
                  }                                                     \
                  put_##KIND(strm, (uint32_t)data);                     \
              }                                                         \
              state->last_out = data;                                   \
                                                                        \
            } else {                                                    \
                                                                        \
121
              int32_t xmax, d;                                          \
Moritz Hanke's avatar
Moritz Hanke committed
122 123 124 125 126 127 128
              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) {                                       \
129
                      if (half_d <= xmax + data + 1) {                  \
Moritz Hanke's avatar
Moritz Hanke committed
130 131
                          data += ((uint32_t)d >> 1)^(~((d & 1) - 1));  \
                      } else {                                          \
132
                          data = d - xmax - 1;                          \
Moritz Hanke's avatar
Moritz Hanke committed
133 134 135 136 137 138 139 140 141 142 143
                      }                                                 \
                  } 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;                                   \
144 145
            }                                                           \
        } else {                                                        \
146 147
            for (bp = state->flush_start; bp < flush_end; bp++)         \
                put_##KIND(strm, *bp);                                  \
148
        }                                                               \
149
        state->flush_start = state->rsip;                               \
150
    }
151

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
152 153 154

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

static inline void put_msb_24(struct aec_stream *strm, uint32_t data)
{
163 164 165
    *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
166 167 168 169
}

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

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

static inline void put_lsb_24(struct aec_stream *strm, uint32_t data)
{
184 185 186
    *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
187 188 189 190
}

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

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
200 201 202 203 204 205 206
FLUSH(msb_32)
FLUSH(msb_24)
FLUSH(msb_16)
FLUSH(lsb_32)
FLUSH(lsb_24)
FLUSH(lsb_16)
FLUSH(8)
207

208
static inline void check_rsi_end(struct aec_stream *strm)
209
{
210
    /**
211
       Flush output if end of RSI reached
212
     */
213
    struct internal_state *state = strm->state;
214

215
    if (state->rsi_size == (size_t)(state->rsip - state->rsi_buffer)) {
216
        state->flush_output(strm);
217 218
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
219
    }
220 221
}

222
static inline void put_sample(struct aec_stream *strm, uint32_t s)
223 224 225
{
    struct internal_state *state = strm->state;

226
    *state->rsip++ = s;
227
    strm->avail_out -= state->bytes_per_sample;
228
    check_rsi_end(strm);
229 230
}

231 232 233 234 235 236
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
237 238 239 240 241 242 243 244 245

    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):
246
        strm->state->acc = (strm->state->acc << 8) | *strm->next_in++;
Moritz Hanke's avatar
Moritz Hanke committed
247 248 249 250 251 252 253 254
      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++;
    };

255 256
}

257
static inline uint32_t direct_get(struct aec_stream *strm, int n)
258 259
{
    /**
260
       Get n bit from input stream
261 262 263 264

       No checking whatsoever. Read bits are dumped.
     */

265
    struct internal_state *state = strm->state;
266

267 268
    if (state->bitp < n)
        fill_acc(strm);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
269

270
    state->bitp -= n;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
271
    return (state->acc >> state->bitp) & ((UINT64_C(1) << n) - 1);
272 273
}

274
static inline uint32_t direct_get_fs(struct aec_stream *strm)
275 276 277 278
{
    /**
       Interpret a Fundamental Sequence from the input buffer.

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
279
       Essentially counts the number of 0 bits until a 1 is
280
       encountered.
281 282
     */

283
    uint32_t fs = 0;
284 285 286 287
#if HAVE_DECL___BUILTIN_CLZLL
    int lz;
#elif HAVE_BSR64
    unsigned long lz;
288
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
289
    struct internal_state *state = strm->state;
290

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

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

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

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

330
static inline uint32_t bits_get(struct aec_stream *strm, int n)
331 332
{
    return (strm->state->acc >> (strm->state->bitp - n))
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
333
        & ((UINT64_C(1) << n) - 1);
334 335
}

336
static inline void bits_drop(struct aec_stream *strm, int n)
337 338 339 340
{
    strm->state->bitp -= n;
}

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

360
static inline void fs_drop(struct aec_stream *strm)
361 362 363 364 365
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

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

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

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

381 382
    if (state->rsip == state->rsi_buffer) {
        if(strm->flags & AEC_PAD_RSI)
383
            state->bitp -= state->bitp % 8;
384 385 386
        if (state->pp)
            state->ref = 1;
    } else {
387
        state->ref = 0;
388
    }
389 390 391 392
    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);
393 394 395 396 397 398 399 400 401 402 403
    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 {
404
        if (bits_ask(strm, k) == 0 || strm->avail_out == 0)
405
            return M_EXIT;
406 407
        *state->rsip++ += bits_get(strm, k);
        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 430 431 432 433 434
    state->mode = m_split_output;
    return M_CONTINUE;
}

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

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

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

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

447
        for (i = state->ref; i < strm->block_size; i++)
448
            *state->rsip++ += direct_get(strm, k);
449

450
        strm->avail_out -= state->out_blklen;
451
        check_rsi_end(strm);
452

453 454 455 456 457
        state->mode = m_id;
        return M_CONTINUE;
    }

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

465
    state->i = 0;
466 467 468 469 470 471 472 473
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
486
    uint32_t i, zero_blocks, b, zero_bytes;
487 488
    struct internal_state *state = strm->state;

489 490
    if (fs_ask(strm) == 0)
        return M_EXIT;
491
    zero_blocks = state->fs + 1;
492
    fs_drop(strm);
493 494

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

    if (state->ref)
502
        i = zero_blocks * strm->block_size - 1;
503
    else
504
        i = zero_blocks * strm->block_size;
505

506
    zero_bytes = i * state->bytes_per_sample;
507

508
    if (strm->avail_out >= zero_bytes) {
509 510 511
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

512 513
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
514
        strm->avail_out -= zero_bytes;
515
        check_rsi_end(strm);
516

517 518 519 520
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
521
    state->i = i;
522 523 524 525 526 527
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
528
    int32_t m, d1;
529 530 531
    struct internal_state *state = strm->state;

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
557
    uint32_t i;
558
    int32_t m, d1;
559 560
    struct internal_state *state = strm->state;

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

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

    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;

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
627
    uint32_t i;
628 629
    struct internal_state *state = strm->state;

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

636 637 638 639 640 641 642 643 644
        state->mode = m_id;
        return M_CONTINUE;
    }

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

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
665
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
666
        return AEC_CONF_ERROR;
667

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

673 674
    create_se_table(state->se_table);

675 676
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
677
    if (strm->bits_per_sample > 16) {
678
        state->id_len = 5;
679

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
723
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
724 725
        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
726
    } else {
727
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
728
        state->xmax = (UINT64_C(1) << strm->bits_per_sample) - 1;
729
    }
730

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

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

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

745 746 747
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
748 749
        return AEC_MEM_ERROR;

750
    state->ref = 0;
751 752 753
    strm->total_in = 0;
    strm->total_out = 0;

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

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

777 778 779
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

780 781 782 783 784 785 786
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

787
    state->flush_output(strm);
788 789 790 791

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

792 793
    return AEC_OK;
}
794

795 796
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
797
    struct internal_state *state = strm->state;
798

799
    free(state->id_table);
800
    free(state->rsi_buffer);
801
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
802
    return AEC_OK;
803
}
804

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