decode.c 25.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 - 2016
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>

55
#include "decode.h"
56
#include "libaec.h"
57

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

62
#define ROS 5
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
63
#define RSI_USED(state) ((size_t)(state->rsip - state->rsi_buffer))
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
64
#define BUFFERSPACE(strm) (strm->avail_in >= strm->state->in_blklen      \
65 66
                           && strm->avail_out >= strm->state->out_blklen)

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

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
143 144 145

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

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

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

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

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

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

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

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

199
static inline void put_sample(struct aec_stream *strm, uint32_t s)
200 201 202
{
    struct internal_state *state = strm->state;

203
    *state->rsip++ = s;
204
    strm->avail_out -= state->bytes_per_sample;
205 206
}

207
static inline uint32_t direct_get(struct aec_stream *strm, int n)
208 209
{
    /**
210
       Get n bit from input stream
211 212 213 214

       No checking whatsoever. Read bits are dumped.
     */

215
    struct internal_state *state = strm->state;
216
    int b;
217
    if (state->bitp < n)
218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
    {
        b = (63 - state->bitp) >> 3;
        if (b == 6) {
            state->acc = (state->acc << 48)
                | ((uint64_t)strm->next_in[0] << 40)
                | ((uint64_t)strm->next_in[1] << 32)
                | ((uint64_t)strm->next_in[2] << 24)
                | ((uint64_t)strm->next_in[3] << 16)
                | ((uint64_t)strm->next_in[4] << 8)
                | (uint64_t)strm->next_in[5];
        } else if (b == 7) {
            state->acc = (state->acc << 56)
                | ((uint64_t)strm->next_in[0] << 48)
                | ((uint64_t)strm->next_in[1] << 40)
                | ((uint64_t)strm->next_in[2] << 32)
                | ((uint64_t)strm->next_in[3] << 24)
                | ((uint64_t)strm->next_in[4] << 16)
                | ((uint64_t)strm->next_in[5] << 8)
                | (uint64_t)strm->next_in[6];
        } else if (b == 5) {
            state->acc = (state->acc << 40)
                | ((uint64_t)strm->next_in[0] << 32)
                | ((uint64_t)strm->next_in[1] << 24)
                | ((uint64_t)strm->next_in[2] << 16)
                | ((uint64_t)strm->next_in[3] << 8)
                | (uint64_t)strm->next_in[4];
        } else if (b == 4) {
            state->acc = (state->acc << 32)
                | ((uint64_t)strm->next_in[0] << 24)
                | ((uint64_t)strm->next_in[1] << 16)
                | ((uint64_t)strm->next_in[2] << 8)
                | (uint64_t)strm->next_in[3];
        } else if (b == 3) {
            state->acc = (state->acc << 24)
                | ((uint64_t)strm->next_in[0] << 16)
                | ((uint64_t)strm->next_in[1] << 8)
                | (uint64_t)strm->next_in[2];
        } else if (b == 2) {
            state->acc = (state->acc << 16)
                | ((uint64_t)strm->next_in[0] << 8)
                | (uint64_t)strm->next_in[1];
        } else if (b == 1) {
            state->acc = (state->acc << 8)
                | (uint64_t)strm->next_in[0];
        }
        strm->next_in += b;
        strm->avail_in -= b;
        state->bitp += b << 3;
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
267

268
    state->bitp -= n;
269
    return (state->acc >> state->bitp) & (UINT64_MAX >> (64 - n));
270 271
}

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

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

281
    uint32_t fs = 0;
282 283 284 285
#if HAVE_BSR64
    unsigned long i;
#else
    int i;
286
#endif
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
287
    struct internal_state *state = strm->state;
288

289 290 291 292
    if (state->bitp)
        state->acc &= UINT64_MAX >> (64 - state->bitp);
    else
        state->acc = 0;
293

294
    while (state->acc == 0) {
295 296 297
        if (strm->avail_in < 7)
            return 0;

298 299 300 301 302 303 304 305 306 307
        state->acc = (state->acc << 56)
            | ((uint64_t)strm->next_in[0] << 48)
            | ((uint64_t)strm->next_in[1] << 40)
            | ((uint64_t)strm->next_in[2] << 32)
            | ((uint64_t)strm->next_in[3] << 24)
            | ((uint64_t)strm->next_in[4] << 16)
            | ((uint64_t)strm->next_in[5] << 8)
            | (uint64_t)strm->next_in[6];
        strm->next_in += 7;
        strm->avail_in -= 7;
308
        fs += state->bitp;
309
        state->bitp = 56;
310
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
311

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
312 313 314 315
#ifndef __has_builtin
#define __has_builtin(x) 0  /* Compatibility with non-clang compilers. */
#endif
#if HAVE_DECL___BUILTIN_CLZLL || __has_builtin(__builtin_clzll)
316
    i = 63 - __builtin_clzll(state->acc);
317
#elif HAVE_BSR64
318
    _BitScanReverse64(&i, state->acc);
319
#else
320 321 322
    i = state->bitp - 1;
    while ((state->acc & (UINT64_C(1) << i)) == 0)
        i--;
323
#endif
324 325
    fs += state->bitp - i - 1;
    state->bitp = i;
326 327 328
    return fs;
}

329
static inline uint32_t bits_ask(struct aec_stream *strm, int n)
330 331 332 333 334 335 336 337 338 339 340 341
{
    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;
}

342
static inline uint32_t bits_get(struct aec_stream *strm, int n)
343 344
{
    return (strm->state->acc >> (strm->state->bitp - n))
345
        & (UINT64_MAX >> (64 - n));
346 347
}

348
static inline void bits_drop(struct aec_stream *strm, int n)
349 350 351 352
{
    strm->state->bitp -= n;
}

353
static inline uint32_t fs_ask(struct aec_stream *strm)
354 355 356
{
    if (bits_ask(strm, 1) == 0)
        return 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
357
    while ((strm->state->acc & (UINT64_C(1) << (strm->state->bitp - 1))) == 0) {
358 359 360 361 362 363 364 365 366 367 368 369 370 371
        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;
}

372
static inline void fs_drop(struct aec_stream *strm)
373 374 375 376 377
{
    strm->state->fs = 0;
    strm->state->bitp--;
}

378
static inline uint32_t copysample(struct aec_stream *strm)
379
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
380
    if (bits_ask(strm, strm->bits_per_sample) == 0
381
        || strm->avail_out < strm->state->bytes_per_sample)
382
        return 0;
383

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
384 385
    put_sample(strm, bits_get(strm, strm->bits_per_sample));
    bits_drop(strm, strm->bits_per_sample);
386 387
    return 1;
}
388 389 390 391 392

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

393 394 395 396 397 398
    if (state->rsi_size == RSI_USED(state)) {
        state->flush_output(strm);
        state->flush_start = state->rsi_buffer;
        state->rsip = state->rsi_buffer;
    }

399
    if (state->rsip == state->rsi_buffer) {
400
        if (strm->flags & AEC_PAD_RSI)
401
            state->bitp -= state->bitp % 8;
402
        if (state->pp) {
403
            state->ref = 1;
404 405
            state->encoded_block_size = strm->block_size - 1;
        }
406
    } else {
407
        state->ref = 0;
408
        state->encoded_block_size = strm->block_size;
409
    }
410

411 412 413 414
    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);
415 416 417 418 419 420 421 422 423 424
    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 {
425
        if (bits_ask(strm, k) == 0 || strm->avail_out < state->bytes_per_sample)
426
            return M_EXIT;
427 428 429 430
        if (k)
            *state->rsip++ += bits_get(strm, k);
        else
            state->rsip++;
431
        strm->avail_out -= state->bytes_per_sample;
432
        bits_drop(strm, k);
433
    } while(++state->i < state->n);
434 435 436 437 438 439 440 441

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_split_fs(struct aec_stream *strm)
{
    struct internal_state *state = strm->state;
442
    int k = state->id - 1;
443 444

    do {
445 446
        if (fs_ask(strm) == 0)
            return M_EXIT;
447
        state->rsip[state->i] = state->fs << k;
448
        fs_drop(strm);
449
    } while(++state->i < state->n);
450

451
    state->i = 0;
452
    state->mode = m_split_output;
453

454 455 456 457 458
    return M_CONTINUE;
}

static int m_split(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
459
    size_t i;
460
    size_t binary_part;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
461
    int k;
462 463
    struct internal_state *state = strm->state;

464 465
    if (BUFFERSPACE(strm)) {
        k = state->id - 1;
466
        binary_part = (k * state->encoded_block_size) / 8 + 9;
467 468

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

471
        for (i = 0; i < state->encoded_block_size; i++)
472
            state->rsip[i] = direct_get_fs(strm) << k;
473

474
        if (k) {
475
            if (strm->avail_in < binary_part)
476 477
                return M_ERROR;

478
            for (i = 0; i < state->encoded_block_size; i++)
479 480
                *state->rsip++ += direct_get(strm, k);
        } else {
481
            state->rsip += state->encoded_block_size;
482
        }
483

484
        strm->avail_out -= state->out_blklen;
485 486
        state->mode = m_id;
    } else {
487 488 489 490 491
        if (state->ref && (copysample(strm) == 0))
            return M_EXIT;
        state->n = state->encoded_block_size;
        state->i = 0;
        state->mode = m_split_fs;
492 493 494 495 496 497 498 499
    }
    return M_CONTINUE;
}

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

500
    do {
501
        if (strm->avail_out < state->bytes_per_sample)
502 503 504
            return M_EXIT;
        put_sample(strm, 0);
    } while(--state->i);
505 506 507 508 509 510 511

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_zero_block(struct aec_stream *strm)
{
512
    uint32_t i, zero_blocks, b, zero_bytes;
513 514
    struct internal_state *state = strm->state;

515 516
    if (fs_ask(strm) == 0)
        return M_EXIT;
517
    zero_blocks = state->fs + 1;
518
    fs_drop(strm);
519 520

    if (zero_blocks == ROS) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
521
        b = (int)RSI_USED(state) / strm->block_size;
522 523 524 525 526
        zero_blocks = MIN(strm->rsi - b, 64 - (b % 64));
    } else if (zero_blocks > ROS) {
        zero_blocks--;
    }

527
    i = zero_blocks * strm->block_size - state->ref;
528
    zero_bytes = i * state->bytes_per_sample;
529

530 531
    if (state->rsi_size - RSI_USED(state) < i)
        return M_ERROR;
532

533
    if (strm->avail_out >= zero_bytes) {
534 535
        memset(state->rsip, 0, i * sizeof(uint32_t));
        state->rsip += i;
536
        strm->avail_out -= zero_bytes;
537 538 539 540
        state->mode = m_id;
        return M_CONTINUE;
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
541
    state->i = i;
542 543 544 545 546 547
    state->mode = m_zero_output;
    return M_CONTINUE;
}

static int m_se_decode(struct aec_stream *strm)
{
548
    int32_t m, d1;
549 550 551
    struct internal_state *state = strm->state;

    while(state->i < strm->block_size) {
552 553
        if (fs_ask(strm) == 0)
            return M_EXIT;
554
        m = state->fs;
555 556
        if (m > SE_TABLE_SIZE)
            return M_ERROR;
557
        d1 = m - state->se_table[2 * m + 1];
558 559

        if ((state->i & 1) == 0) {
560
            if (strm->avail_out < state->bytes_per_sample)
561 562
                return M_EXIT;
            put_sample(strm, state->se_table[2 * m] - d1);
563 564 565
            state->i++;
        }

566
        if (strm->avail_out < state->bytes_per_sample)
567 568
            return M_EXIT;
        put_sample(strm, d1);
569
        state->i++;
570
        fs_drop(strm);
571 572 573 574 575 576 577 578
    }

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_se(struct aec_stream *strm)
{
579
    uint32_t i;
580 581
    uint32_t m;
    int32_t d1;
582 583
    struct internal_state *state = strm->state;

584 585 586 587 588
    if (BUFFERSPACE(strm)) {
        i = state->ref;

        while (i < strm->block_size) {
            m = direct_get_fs(strm);
589 590 591 592

            if (m > SE_TABLE_SIZE)
                return M_ERROR;

593 594 595 596 597 598 599 600 601
            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++;
        }
602
        state->mode = m_id;
603 604 605
    } else {
        state->mode = m_se_decode;
        state->i = state->ref;
606 607 608 609 610 611 612 613
    }
    return M_CONTINUE;
}

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

614 615
    if (state->ref && copysample(strm) == 0)
        return M_EXIT;
616

617
    if (state->id == 1) {
618 619 620 621 622 623 624 625 626 627 628 629
        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;

630 631 632 633
    if (bits_ask(strm, 1) == 0)
        return M_EXIT;
    state->id = bits_get(strm, 1);
    bits_drop(strm, 1);
634 635 636 637 638 639 640 641
    state->mode = m_low_entropy_ref;
    return M_CONTINUE;
}

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

642 643 644 645
    do {
        if (copysample(strm) == 0)
            return M_EXIT;
    } while(--state->i);
646 647 648 649 650 651 652

    state->mode = m_id;
    return M_CONTINUE;
}

static int m_uncomp(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
653
    size_t i;
654 655
    struct internal_state *state = strm->state;

656
    if (BUFFERSPACE(strm)) {
657
        for (i = 0; i < strm->block_size; i++)
658
            *state->rsip++ = direct_get(strm, strm->bits_per_sample);
659
        strm->avail_out -= state->out_blklen;
660
        state->mode = m_id;
661 662 663
    } else {
        state->i = strm->block_size;
        state->mode = m_uncomp_copy;
664 665 666 667
    }
    return M_CONTINUE;
}

668 669 670 671 672 673 674 675 676 677 678 679 680 681 682
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
683
int aec_decode_init(struct aec_stream *strm)
684
{
685
    int i, modi;
686
    struct internal_state *state;
687

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
688
    if (strm->bits_per_sample > 32 || strm->bits_per_sample == 0)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
689
        return AEC_CONF_ERROR;
690

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
691
    state = malloc(sizeof(struct internal_state));
692
    if (state == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
693
        return AEC_MEM_ERROR;
694
    memset(state, 0, sizeof(struct internal_state));
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
695

696 697
    create_se_table(state->se_table);

698 699
    strm->state = state;

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
700
    if (strm->bits_per_sample > 16) {
701
        state->id_len = 5;
702

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
703 704
        if (strm->bits_per_sample <= 24 && strm->flags & AEC_DATA_3BYTE) {
            state->bytes_per_sample = 3;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
705
            if (strm->flags & AEC_DATA_MSB)
706
                state->flush_output = flush_msb_24;
707
            else
708
                state->flush_output = flush_lsb_24;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
709
        } else {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
710
            state->bytes_per_sample = 4;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
711
            if (strm->flags & AEC_DATA_MSB)
712
                state->flush_output = flush_msb_32;
713
            else
714
                state->flush_output = flush_lsb_32;
715
        }
716
        state->out_blklen = strm->block_size * state->bytes_per_sample;
717
    }
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
718 719
    else if (strm->bits_per_sample > 8) {
        state->bytes_per_sample = 2;
720
        state->id_len = 4;
721
        state->out_blklen = strm->block_size * 2;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
722
        if (strm->flags & AEC_DATA_MSB)
723
            state->flush_output = flush_msb_16;
724
        else
725
            state->flush_output = flush_lsb_16;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
726
    } else {
727
        if (strm->flags & AEC_RESTRICTED) {
728 729 730 731 732 733 734 735 736 737 738 739
            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
740
        state->bytes_per_sample = 1;
741
        state->out_blklen = strm->block_size;
742
        state->flush_output = flush_8;
743 744
    }

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
745
    if (strm->flags & AEC_DATA_SIGNED) {
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
746 747
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample + 1);
        state->xmin = ~state->xmax;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
748
    } else {
749
        state->xmin = 0;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
750
        state->xmax = UINT32_MAX >> (32 - strm->bits_per_sample);
751
    }
752

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
753
    state->in_blklen = (strm->block_size * strm->bits_per_sample
754
                        + state->id_len) / 8 + 16;
755 756

    modi = 1UL << state->id_len;
757
    state->id_table = malloc(modi * sizeof(int (*)(struct aec_stream *)));
758
    if (state->id_table == NULL)
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
759
        return AEC_MEM_ERROR;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
760

761
    state->id_table[0] = m_low_entropy;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
762
    for (i = 1; i < modi - 1; i++) {
763
        state->id_table[i] = m_split;
764
    }
765
    state->id_table[modi - 1] = m_uncomp;
766

767 768 769
    state->rsi_size = strm->rsi * strm->block_size;
    state->rsi_buffer = malloc(state->rsi_size * sizeof(uint32_t));
    if (state->rsi_buffer == NULL)
770 771
        return AEC_MEM_ERROR;

772
    state->pp = strm->flags & AEC_DATA_PREPROCESS;
773
    state->ref = 0;
774
    state->encoded_block_size = strm->block_size;
775 776 777
    strm->total_in = 0;
    strm->total_out = 0;

778 779
    state->rsip = state->rsi_buffer;
    state->flush_start = state->rsi_buffer;
780
    state->bitp = 0;
781
    state->fs = 0;
782
    state->mode = m_id;
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
783
    return AEC_OK;
784 785
}

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
786
int aec_decode(struct aec_stream *strm, int flush)
787
{
788 789 790 791 792 793 794 795 796
    /**
       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
797
    struct internal_state *state = strm->state;
798
    int status;
799

800 801 802
    strm->total_in += strm->avail_in;
    strm->total_out += strm->avail_out;

803 804 805 806 807 808 809
    do {
        status = state->mode(strm);
    } while (status == M_CONTINUE);

    if (status == M_ERROR)
        return AEC_DATA_ERROR;

810 811 812 813
    if (status == M_EXIT && strm->avail_out > 0 &&
        strm->avail_out < state->bytes_per_sample)
        return AEC_MEM_ERROR;

814
    state->flush_output(strm);
815 816 817 818

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

819 820
    return AEC_OK;
}
821

822 823
int aec_decode_end(struct aec_stream *strm)
{
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
824
    struct internal_state *state = strm->state;
825

826
    free(state->id_table);
827
    free(state->rsi_buffer);
828
    free(state);
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
829
    return AEC_OK;
830
}
831

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
832
int aec_buffer_decode(struct aec_stream *strm)
833 834 835 836 837 838 839 840 841 842 843
{
    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;
}