decode.h 3.91 KB
Newer Older
1 2 3 4 5 6 7 8 9
/**
 * @file decode.c
 *
 * @author Mathis Rosenhauer, Deutsches Klimarechenzentrum
 * @author Moritz Hanke, Deutsches Klimarechenzentrum
 * @author Joerg Behrens, Deutsches Klimarechenzentrum
 * @author Luis Kornblueh, Max-Planck-Institut fuer Meteorologie
 *
 * @section LICENSE
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
10
 * Copyright 2012 - 2014
11 12 13 14 15 16 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 44 45 46 47 48 49
 *
 * Mathis Rosenhauer,                 Luis Kornblueh
 * Moritz Hanke,
 * Joerg Behrens
 *
 * Deutsches Klimarechenzentrum GmbH  Max-Planck-Institut fuer Meteorologie
 * Bundesstr. 45a                     Bundesstr. 53
 * 20146 Hamburg                      20146 Hamburg
 * Germany                            Germany
 *
 * 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.
 *
 * @section DESCRIPTION
 *
 * Adaptive Entropy Decoder
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
50
 * Based on CCSDS documents 121.0-B-2 and 120.0-G-3
51 52 53
 *
 */

54
#ifndef DECODE_H
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
55
#define DECODE_H 1
56

Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
57 58 59 60
#if HAVE_CONFIG_H
#  include <config.h>
#endif

61
#if HAVE_STDINT_H
Mathis Rosenhauer's avatar
Mathis Rosenhauer committed
62
#  include <stdint.h>
63 64 65 66
#endif

#define M_CONTINUE 1
#define M_EXIT 0
67
#define M_ERROR (-1)
68 69 70 71 72

#define MIN(a, b) (((a) < (b))? (a): (b))

struct internal_state {
    int (*mode)(struct aec_stream *);
73 74
    int id;                 /* option ID */
    int id_len;             /* bit length of code option identification key */
75
    int (**id_table)(struct aec_stream *); /* table maps IDs to states */
76
    void (*flush_output)(struct aec_stream *);
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
    int64_t last_out;       /* previous output for post-processing */
    int64_t xmin;           /* minimum integer for post-processing */
    int64_t xmax;           /* maximum integer for post-processing */
    int in_blklen;          /* length of uncompressed input block
                               should be the longest possible block */
    int out_blklen;         /* length of output block in bytes */
    int n, i;               /* counter for samples */
    uint64_t acc;           /* accumulator for currently used bit sequence */
    int bitp;               /* bit pointer to the next unused bit in
                               accumulator */
    int fs;                 /* last fundamental sequence in accumulator */
    int ref;                /* 1 if current block has reference sample */
    int pp;                 /* 1 if postprocessor has to be used */
    int bytes_per_sample;   /* storage size of samples in bytes */
    uint32_t *rsi_buffer;   /* output buffer holding one reference
                               sample interval */
    uint32_t *rsip;         /* current position of output in rsi_buffer */
    size_t rsi_size;        /* rsi in bytes */
    uint32_t *flush_start;  /* first not yet flushed byte in rsi_buffer */
96
    int se_table[182];      /* table for decoding second extension option */
97 98 99
} decode_state;

#endif /* DECODE_H */