/usr/include/io_lib/deflate_interlaced.h is in libstaden-read-dev 1.14.6-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 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 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 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 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 | /*
* Copyright (c) 2007-2008 Genome Research Ltd.
* Author(s): James Bonfield
*
* 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.
*
* 3. Neither the names Genome Research Ltd and Wellcome Trust Sanger
* Institute nor the names of its contributors may be used to endorse
* or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY GENOME RESEARCH LTD 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 GENOME RESEARCH
* LTD 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.
*/
#ifndef _DEFLATE_SIMPLE_H_
#define _DEFLATE_SIMPLE_H_
#ifdef __cplusplus
extern "C" {
#endif
/* inlined codes */
#define CODE_INLINE 0
/* predefined codes */
#define CODE_DNA 1 /* DNA, uppercase only */
#define CODE_DNA_AMBIG 2 /* DNA, uc with ambiguity codes */
#define CODE_ENGLISH 3 /* English text */
#define NCODES_STATIC 4 /* Cheat, but we count from 0 for ease */
/* predefined elsewhere in HUFF chunks, 128 onwards */
#define CODE_USER 128
#define MAX_CODE_LEN 15 /* maximum allowed by RFC 1951 */
#ifndef ZTR_FORM_STHUFF
# define ZTR_FORM_STHUFF 77
#endif
/* A single symbol and it's encoding */
typedef struct {
signed int symbol; /* 0-255 character, 256 = exception code, 257 = EOF */
int nbits;
unsigned int code;
int freq;
} huffman_code_t;
/* A collection of huffman_code_t along with decoding optimisations */
typedef struct {
huffman_code_t *codes;
int ncodes;
int codes_static;
huffman_code_t lookup[258]; /* Mapping of symbol character to code */
int max_code_len;
} huffman_codes_t;
/* Use for store_bits() and get_bits() */
typedef struct block {
unsigned char *data;
size_t alloc;
size_t byte;
int bit;
} block_t;
/* Tree and jump-table data structures used for fast decoding. */
typedef struct {
/* Graph construction */
unsigned short c[2]; /* child node */
signed short l[2]; /* symbol to emit on transition. -1 => none */
} htree_t;
typedef struct {
/* Byte-wise jumping table */
unsigned short jump;
unsigned char symbol[4];
unsigned char nsymbols;
unsigned char top_bit; /* bit 9 of symbol[] */
} h_jump4_t;
/* A collection of huffman_codes_t, for use with the multi-code codec */
typedef struct {
huffman_codes_t **codes;
int ncodes;
int code_set; /* (128-255) The user specified number for this encoding */
/* Cached binary version of codeset, assumes last block */
block_t *blk;
int bit_num; /* if 1st block, which bit will stored codes end on */
/* Cache huffman_multi_decode parameters */
h_jump4_t (*decode_J4)[16];
htree_t *decode_t;
} huffman_codeset_t;
block_t *block_create(unsigned char *data, size_t size);
void block_destroy(block_t *blk, int keep_data);
int block_resize(block_t *blk, size_t size);
void store_bytes(block_t *block, unsigned char *val, int nbytes);
int huffman_encode(block_t *blk, huffman_codes_t *c, int code_set,
unsigned char *data, int len);
block_t *huffman_decode(block_t *in, huffman_codes_t *c);
int huffman_multi_encode(block_t *blk, huffman_codeset_t *cs,
int code_set, unsigned char *data, int len);
block_t *huffman_multi_decode(block_t *in, huffman_codeset_t *cs);
huffman_codeset_t *codes2codeset(huffman_code_t *codes, int ncodes,
int code_num);
huffman_codeset_t *generate_code_set(int code_set, int ncodes,
unsigned char *data, int len,
int eof, int max_code_len,
int all_codes);
int store_codes(block_t *out,
huffman_codeset_t *c,
int last_block);
huffman_codeset_t *restore_codes(block_t *block, int *bfinal);
void huffman_codes_destroy(huffman_codes_t *c);
void huffman_codeset_destroy(huffman_codeset_t *cs);
#ifdef __cplusplus
}
#endif
#endif /* _DEFLATE_SIMPLE_H_ */
|