decode.c 23.8 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;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
265
    return (state->acc >> state->bitp) & ((UINT64_C(1) << n) - 1);
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

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

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

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

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

324
static inline uint32_t bits_get(struct aec_stream *strm, int n)
325 326
{
    return (strm->state->acc >> (strm->state->bitp - n))
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
327
        & ((UINT64_C(1) << n) - 1);
328 329
}

330
static inline void bits_drop(struct aec_stream *strm, int n)
331 332 333 334
{
    strm->state->bitp -= n;
}

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

354
static inline void fs_drop(struct aec_stream *strm)
355 356 357 358 359
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

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

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

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

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

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

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

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

422
    state->i = 0;
423 424 425 426 427 428
    state->mode = m_split_output;
    return M_CONTINUE;
}

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

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

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

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

441
        for (i = state->ref; i < strm->block_size; i++)
442
            *state->rsip++ += direct_get(strm, k);
443

444
        strm->avail_out -= state->out_blklen;
445
        check_rsi_end(strm);
446

447 448 449 450 451
        state->mode = m_id;
        return M_CONTINUE;
    }

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

459
    state->i = 0;
460 461 462 463 464 465 466 467
    state->mode = m_split_fs;
    return M_CONTINUE;
}

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
480
    uint32_t i, zero_blocks, b, zero_bytes;
481 482
    struct internal_state *state = strm->state;

483 484
    if (fs_ask(strm) == 0)
        return M_EXIT;
485
    zero_blocks = state->fs + 1;
486
    fs_drop(strm);
487 488

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

    if (state->ref)
496
        i = zero_blocks * strm->block_size - 1;
497
    else
498
        i = zero_blocks * strm->block_size;
499

500
    zero_bytes = i * state->bytes_per_sample;
501

502
    if (strm->avail_out >= zero_bytes) {
503 504 505
        if (state->rsi_size - (state->rsip - state->rsi_buffer) < i)
            return M_ERROR;

506 507
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
508
        strm->avail_out -= zero_bytes;
509
        check_rsi_end(strm);
510

511 512 513 514
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
515
    state->i = i;
516 517 518 519 520 521
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
522
    int32_t m, d1;
523 524 525
    struct internal_state *state = strm->state;

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
551
    uint32_t i;
552
    int32_t m, d1;
553 554
    struct internal_state *state = strm->state;

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

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

    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;

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

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

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

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
621
    uint32_t i;
622 623
    struct internal_state *state = strm->state;

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

630 631 632 633 634 635 636 637 638
        state->mode = m_id;
        return M_CONTINUE;
    }

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

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
659
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
660
        return AEC_CONF_ERROR;
661

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

667 668
    create_se_table(state->se_table);

669 670
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
671
    if (strm->bits_per_sample > 16) {
672
        state->id_len = 5;
673

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

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

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

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

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

739 740 741
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
742 743
        return AEC_MEM_ERROR;

744
    state->ref = 0;
745 746 747
    strm->total_in = 0;
    strm->total_out = 0;

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

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

771 772 773
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

774 775 776 777 778 779 780
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

781
    state->flush_output(strm);
782 783 784 785

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

786 787
    return AEC_OK;
}
788

789 790
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
791
    struct internal_state *state = strm->state;
792

793
    free(state->id_table);
794
    free(state->rsi_buffer);
795
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
796
    return AEC_OK;
797
}
798

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