istereo

annotate libs/libjpeg/jdhuff.h @ 28:c0ae8e668447

find changesets by author, revision, files, or words in the commit message
added vmath library
author John Tsiombikas <nuclear@mutantstargoat.com>
date Thu, 08 Sep 2011 08:30:42 +0300
parents
children
rev   line source
nuclear@26 1 /*
nuclear@26 2 * jdhuff.h
nuclear@26 3 *
nuclear@26 4 * Copyright (C) 1991-1997, Thomas G. Lane.
nuclear@26 5 * This file is part of the Independent JPEG Group's software.
nuclear@26 6 * For conditions of distribution and use, see the accompanying README file.
nuclear@26 7 *
nuclear@26 8 * This file contains declarations for Huffman entropy decoding routines
nuclear@26 9 * that are shared between the sequential decoder (jdhuff.c) and the
nuclear@26 10 * progressive decoder (jdphuff.c). No other modules need to see these.
nuclear@26 11 */
nuclear@26 12
nuclear@26 13 /* Short forms of external names for systems with brain-damaged linkers. */
nuclear@26 14
nuclear@26 15 #ifdef NEED_SHORT_EXTERNAL_NAMES
nuclear@26 16 #define jpeg_make_d_derived_tbl jMkDDerived
nuclear@26 17 #define jpeg_fill_bit_buffer jFilBitBuf
nuclear@26 18 #define jpeg_huff_decode jHufDecode
nuclear@26 19 #endif /* NEED_SHORT_EXTERNAL_NAMES */
nuclear@26 20
nuclear@26 21
nuclear@26 22 /* Derived data constructed for each Huffman table */
nuclear@26 23
nuclear@26 24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
nuclear@26 25
nuclear@26 26 typedef struct {
nuclear@26 27 /* Basic tables: (element [0] of each array is unused) */
nuclear@26 28 INT32 maxcode[18]; /* largest code of length k (-1 if none) */
nuclear@26 29 /* (maxcode[17] is a sentinel to ensure jpeg_huff_decode terminates) */
nuclear@26 30 INT32 valoffset[17]; /* huffval[] offset for codes of length k */
nuclear@26 31 /* valoffset[k] = huffval[] index of 1st symbol of code length k, less
nuclear@26 32 * the smallest code of length k; so given a code of length k, the
nuclear@26 33 * corresponding symbol is huffval[code + valoffset[k]]
nuclear@26 34 */
nuclear@26 35
nuclear@26 36 /* Link to public Huffman table (needed only in jpeg_huff_decode) */
nuclear@26 37 JHUFF_TBL *pub;
nuclear@26 38
nuclear@26 39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
nuclear@26 40 * the input data stream. If the next Huffman code is no more
nuclear@26 41 * than HUFF_LOOKAHEAD bits long, we can obtain its length and
nuclear@26 42 * the corresponding symbol directly from these tables.
nuclear@26 43 */
nuclear@26 44 int look_nbits[1<<HUFF_LOOKAHEAD]; /* # bits, or 0 if too long */
nuclear@26 45 UINT8 look_sym[1<<HUFF_LOOKAHEAD]; /* symbol, or unused */
nuclear@26 46 } d_derived_tbl;
nuclear@26 47
nuclear@26 48 /* Expand a Huffman table definition into the derived format */
nuclear@26 49 EXTERN(void) jpeg_make_d_derived_tbl
nuclear@26 50 JPP((j_decompress_ptr cinfo, boolean isDC, int tblno,
nuclear@26 51 d_derived_tbl ** pdtbl));
nuclear@26 52
nuclear@26 53
nuclear@26 54 /*
nuclear@26 55 * Fetching the next N bits from the input stream is a time-critical operation
nuclear@26 56 * for the Huffman decoders. We implement it with a combination of inline
nuclear@26 57 * macros and out-of-line subroutines. Note that N (the number of bits
nuclear@26 58 * demanded at one time) never exceeds 15 for JPEG use.
nuclear@26 59 *
nuclear@26 60 * We read source bytes into get_buffer and dole out bits as needed.
nuclear@26 61 * If get_buffer already contains enough bits, they are fetched in-line
nuclear@26 62 * by the macros CHECK_BIT_BUFFER and GET_BITS. When there aren't enough
nuclear@26 63 * bits, jpeg_fill_bit_buffer is called; it will attempt to fill get_buffer
nuclear@26 64 * as full as possible (not just to the number of bits needed; this
nuclear@26 65 * prefetching reduces the overhead cost of calling jpeg_fill_bit_buffer).
nuclear@26 66 * Note that jpeg_fill_bit_buffer may return FALSE to indicate suspension.
nuclear@26 67 * On TRUE return, jpeg_fill_bit_buffer guarantees that get_buffer contains
nuclear@26 68 * at least the requested number of bits --- dummy zeroes are inserted if
nuclear@26 69 * necessary.
nuclear@26 70 */
nuclear@26 71
nuclear@26 72 typedef INT32 bit_buf_type; /* type of bit-extraction buffer */
nuclear@26 73 #define BIT_BUF_SIZE 32 /* size of buffer in bits */
nuclear@26 74
nuclear@26 75 /* If long is > 32 bits on your machine, and shifting/masking longs is
nuclear@26 76 * reasonably fast, making bit_buf_type be long and setting BIT_BUF_SIZE
nuclear@26 77 * appropriately should be a win. Unfortunately we can't define the size
nuclear@26 78 * with something like #define BIT_BUF_SIZE (sizeof(bit_buf_type)*8)
nuclear@26 79 * because not all machines measure sizeof in 8-bit bytes.
nuclear@26 80 */
nuclear@26 81
nuclear@26 82 typedef struct { /* Bitreading state saved across MCUs */
nuclear@26 83 bit_buf_type get_buffer; /* current bit-extraction buffer */
nuclear@26 84 int bits_left; /* # of unused bits in it */
nuclear@26 85 } bitread_perm_state;
nuclear@26 86
nuclear@26 87 typedef struct { /* Bitreading working state within an MCU */
nuclear@26 88 /* Current data source location */
nuclear@26 89 /* We need a copy, rather than munging the original, in case of suspension */
nuclear@26 90 const JOCTET * next_input_byte; /* => next byte to read from source */
nuclear@26 91 size_t bytes_in_buffer; /* # of bytes remaining in source buffer */
nuclear@26 92 /* Bit input buffer --- note these values are kept in register variables,
nuclear@26 93 * not in this struct, inside the inner loops.
nuclear@26 94 */
nuclear@26 95 bit_buf_type get_buffer; /* current bit-extraction buffer */
nuclear@26 96 int bits_left; /* # of unused bits in it */
nuclear@26 97 /* Pointer needed by jpeg_fill_bit_buffer. */
nuclear@26 98 j_decompress_ptr cinfo; /* back link to decompress master record */
nuclear@26 99 } bitread_working_state;
nuclear@26 100
nuclear@26 101 /* Macros to declare and load/save bitread local variables. */
nuclear@26 102 #define BITREAD_STATE_VARS \
nuclear@26 103 register bit_buf_type get_buffer; \
nuclear@26 104 register int bits_left; \
nuclear@26 105 bitread_working_state br_state
nuclear@26 106
nuclear@26 107 #define BITREAD_LOAD_STATE(cinfop,permstate) \
nuclear@26 108 br_state.cinfo = cinfop; \
nuclear@26 109 br_state.next_input_byte = cinfop->src->next_input_byte; \
nuclear@26 110 br_state.bytes_in_buffer = cinfop->src->bytes_in_buffer; \
nuclear@26 111 get_buffer = permstate.get_buffer; \
nuclear@26 112 bits_left = permstate.bits_left;
nuclear@26 113
nuclear@26 114 #define BITREAD_SAVE_STATE(cinfop,permstate) \
nuclear@26 115 cinfop->src->next_input_byte = br_state.next_input_byte; \
nuclear@26 116 cinfop->src->bytes_in_buffer = br_state.bytes_in_buffer; \
nuclear@26 117 permstate.get_buffer = get_buffer; \
nuclear@26 118 permstate.bits_left = bits_left
nuclear@26 119
nuclear@26 120 /*
nuclear@26 121 * These macros provide the in-line portion of bit fetching.
nuclear@26 122 * Use CHECK_BIT_BUFFER to ensure there are N bits in get_buffer
nuclear@26 123 * before using GET_BITS, PEEK_BITS, or DROP_BITS.
nuclear@26 124 * The variables get_buffer and bits_left are assumed to be locals,
nuclear@26 125 * but the state struct might not be (jpeg_huff_decode needs this).
nuclear@26 126 * CHECK_BIT_BUFFER(state,n,action);
nuclear@26 127 * Ensure there are N bits in get_buffer; if suspend, take action.
nuclear@26 128 * val = GET_BITS(n);
nuclear@26 129 * Fetch next N bits.
nuclear@26 130 * val = PEEK_BITS(n);
nuclear@26 131 * Fetch next N bits without removing them from the buffer.
nuclear@26 132 * DROP_BITS(n);
nuclear@26 133 * Discard next N bits.
nuclear@26 134 * The value N should be a simple variable, not an expression, because it
nuclear@26 135 * is evaluated multiple times.
nuclear@26 136 */
nuclear@26 137
nuclear@26 138 #define CHECK_BIT_BUFFER(state,nbits,action) \
nuclear@26 139 { if (bits_left < (nbits)) { \
nuclear@26 140 if (! jpeg_fill_bit_buffer(&(state),get_buffer,bits_left,nbits)) \
nuclear@26 141 { action; } \
nuclear@26 142 get_buffer = (state).get_buffer; bits_left = (state).bits_left; } }
nuclear@26 143
nuclear@26 144 #define GET_BITS(nbits) \
nuclear@26 145 (((int) (get_buffer >> (bits_left -= (nbits)))) & ((1<<(nbits))-1))
nuclear@26 146
nuclear@26 147 #define PEEK_BITS(nbits) \
nuclear@26 148 (((int) (get_buffer >> (bits_left - (nbits)))) & ((1<<(nbits))-1))
nuclear@26 149
nuclear@26 150 #define DROP_BITS(nbits) \
nuclear@26 151 (bits_left -= (nbits))
nuclear@26 152
nuclear@26 153 /* Load up the bit buffer to a depth of at least nbits */
nuclear@26 154 EXTERN(boolean) jpeg_fill_bit_buffer
nuclear@26 155 JPP((bitread_working_state * state, register bit_buf_type get_buffer,
nuclear@26 156 register int bits_left, int nbits));
nuclear@26 157
nuclear@26 158
nuclear@26 159 /*
nuclear@26 160 * Code for extracting next Huffman-coded symbol from input bit stream.
nuclear@26 161 * Again, this is time-critical and we make the main paths be macros.
nuclear@26 162 *
nuclear@26 163 * We use a lookahead table to process codes of up to HUFF_LOOKAHEAD bits
nuclear@26 164 * without looping. Usually, more than 95% of the Huffman codes will be 8
nuclear@26 165 * or fewer bits long. The few overlength codes are handled with a loop,
nuclear@26 166 * which need not be inline code.
nuclear@26 167 *
nuclear@26 168 * Notes about the HUFF_DECODE macro:
nuclear@26 169 * 1. Near the end of the data segment, we may fail to get enough bits
nuclear@26 170 * for a lookahead. In that case, we do it the hard way.
nuclear@26 171 * 2. If the lookahead table contains no entry, the next code must be
nuclear@26 172 * more than HUFF_LOOKAHEAD bits long.
nuclear@26 173 * 3. jpeg_huff_decode returns -1 if forced to suspend.
nuclear@26 174 */
nuclear@26 175
nuclear@26 176 #define HUFF_DECODE(result,state,htbl,failaction,slowlabel) \
nuclear@26 177 { register int nb, look; \
nuclear@26 178 if (bits_left < HUFF_LOOKAHEAD) { \
nuclear@26 179 if (! jpeg_fill_bit_buffer(&state,get_buffer,bits_left, 0)) {failaction;} \
nuclear@26 180 get_buffer = state.get_buffer; bits_left = state.bits_left; \
nuclear@26 181 if (bits_left < HUFF_LOOKAHEAD) { \
nuclear@26 182 nb = 1; goto slowlabel; \
nuclear@26 183 } \
nuclear@26 184 } \
nuclear@26 185 look = PEEK_BITS(HUFF_LOOKAHEAD); \
nuclear@26 186 if ((nb = htbl->look_nbits[look]) != 0) { \
nuclear@26 187 DROP_BITS(nb); \
nuclear@26 188 result = htbl->look_sym[look]; \
nuclear@26 189 } else { \
nuclear@26 190 nb = HUFF_LOOKAHEAD+1; \
nuclear@26 191 slowlabel: \
nuclear@26 192 if ((result=jpeg_huff_decode(&state,get_buffer,bits_left,htbl,nb)) < 0) \
nuclear@26 193 { failaction; } \
nuclear@26 194 get_buffer = state.get_buffer; bits_left = state.bits_left; \
nuclear@26 195 } \
nuclear@26 196 }
nuclear@26 197
nuclear@26 198 /* Out-of-line case for Huffman code fetching */
nuclear@26 199 EXTERN(int) jpeg_huff_decode
nuclear@26 200 JPP((bitread_working_state * state, register bit_buf_type get_buffer,
nuclear@26 201 register int bits_left, d_derived_tbl * htbl, int min_bits));