generic-library/isa-l
1
0
Fork 0
mirror of https://github.com/intel/isa-l.git synced 2024-12-12 17:33:50 +01:00
Code Issues Projects Releases Wiki Activity
3732485914
isa-l/igzip/igzip_inflate.c
Roy Oursler 3732485914 igzip: Accept multiple inflate codes for matches of 258 
Allow inflate to accept code 284 with extra bits 0x1f to be accepted
as a match of length 258. This matches zlib's behaviour.

Change-Id: Id85052ceea2b23d3db9c147672dd7996a4c66786
Signed-off-by: Roy Oursler <roy.j.oursler@intel.com>
2018-06-14 15:30:14 -07:00

1838 lines
56 KiB
C
Raw Blame History

/**********************************************************************
Copyright(c) 2011-2016 Intel Corporation All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* 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.
* Neither the name of Intel Corporation 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 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
OWNER 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.
**********************************************************************/
#include <stdint.h>
#include "igzip_lib.h"
#include "huff_codes.h"
#include "igzip_checksums.h"
extern int decode_huffman_code_block_stateless(struct inflate_state *);
#define LARGE_SHORT_SYM_LEN 25
#define LARGE_SHORT_SYM_MASK ((1 << LARGE_SHORT_SYM_LEN) - 1)
#define LARGE_LONG_SYM_LEN 10
#define LARGE_LONG_SYM_MASK ((1 << LARGE_LONG_SYM_LEN) - 1)
#define LARGE_SHORT_CODE_LEN_OFFSET 28
#define LARGE_LONG_CODE_LEN_OFFSET 10
#define LARGE_FLAG_BIT_OFFSET 25
#define LARGE_FLAG_BIT (1 << LARGE_FLAG_BIT_OFFSET)
#define LARGE_SYM_COUNT_OFFSET 26
#define LARGE_SYM_COUNT_LEN 2
#define LARGE_SYM_COUNT_MASK ((1 << LARGE_SYM_COUNT_LEN) - 1)
#define LARGE_SHORT_MAX_LEN_OFFSET 26
#define SMALL_SHORT_SYM_LEN 9
#define SMALL_SHORT_SYM_MASK ((1 << SMALL_SHORT_SYM_LEN) - 1)
#define SMALL_LONG_SYM_LEN 9
#define SMALL_LONG_SYM_MASK ((1 << SMALL_LONG_SYM_LEN) - 1)
#define SMALL_SHORT_CODE_LEN_OFFSET 11
#define SMALL_LONG_CODE_LEN_OFFSET 10
#define SMALL_FLAG_BIT_OFFSET 10
#define SMALL_FLAG_BIT (1 << SMALL_FLAG_BIT_OFFSET)
#define DIST_SYM_OFFSET 0
#define DIST_SYM_LEN 5
#define DIST_SYM_MASK ((1 << DIST_SYM_LEN) - 1)
#define DIST_SYM_EXTRA_OFFSET 5
#define DIST_SYM_EXTRA_LEN 4
#define DIST_SYM_EXTRA_MASK ((1 << DIST_SYM_EXTRA_LEN) - 1)
#define MAX_LIT_LEN_CODE_LEN 21
#define MAX_LIT_LEN_COUNT MAX_LIT_LEN_CODE_LEN + 2
#define MAX_LIT_LEN_SYM 512
#define LIT_LEN_ELEMS 514
#define INVALID_SYMBOL 0x1FFF
#define INVALID_CODE 0xFFFFFF
#define MIN_DEF_MATCH 3
#define TRIPLE_SYM_FLAG 0
#define DOUBLE_SYM_FLAG TRIPLE_SYM_FLAG + 1
#define SINGLE_SYM_FLAG DOUBLE_SYM_FLAG + 1
#define DEFAULT_SYM_FLAG TRIPLE_SYM_FLAG
/* structure contain lookup data based on RFC 1951 */
struct rfc1951_tables {
uint8_t dist_extra_bit_count[32];
uint32_t dist_start[32];
uint8_t len_extra_bit_count[32];
uint16_t len_start[32];
};
/* The following tables are based on the tables in the deflate standard,
* RFC 1951 page 11. */
static struct rfc1951_tables rfc_lookup_table = {
.dist_extra_bit_count = {
0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x02, 0x02,
0x03, 0x03, 0x04, 0x04, 0x05, 0x05, 0x06, 0x06,
0x07, 0x07, 0x08, 0x08, 0x09, 0x09, 0x0a, 0x0a,
0x0b, 0x0b, 0x0c, 0x0c, 0x0d, 0x0d, 0x00, 0x00},
.dist_start = {
0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0007, 0x0009, 0x000d,
0x0011, 0x0019, 0x0021, 0x0031, 0x0041, 0x0061, 0x0081, 0x00c1,
0x0101, 0x0181, 0x0201, 0x0301, 0x0401, 0x0601, 0x0801, 0x0c01,
0x1001, 0x1801, 0x2001, 0x3001, 0x4001, 0x6001, 0x0000, 0x0000},
.len_extra_bit_count = {
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x01, 0x01, 0x01, 0x01, 0x02, 0x02, 0x02, 0x02,
0x03, 0x03, 0x03, 0x03, 0x04, 0x04, 0x04, 0x04,
0x05, 0x05, 0x05, 0x05, 0x00, 0x00, 0x00, 0x00},
.len_start = {
0x0003, 0x0004, 0x0005, 0x0006, 0x0007, 0x0008, 0x0009, 0x000a,
0x000b, 0x000d, 0x000f, 0x0011, 0x0013, 0x0017, 0x001b, 0x001f,
0x0023, 0x002b, 0x0033, 0x003b, 0x0043, 0x0053, 0x0063, 0x0073,
0x0083, 0x00a3, 0x00c3, 0x00e3, 0x0102, 0x0103, 0x0000, 0x0000}
};
struct slver {
uint16_t snum;
uint8_t ver;
uint8_t core;
};
/* Version info */
struct slver isal_inflate_init_slver_00010088;
struct slver isal_inflate_init_slver = { 0x0088, 0x01, 0x00 };
struct slver isal_inflate_reset_slver_0001008f;
struct slver isal_inflate_reset_slver = { 0x008f, 0x01, 0x00 };
struct slver isal_inflate_stateless_slver_00010089;
struct slver isal_inflate_stateless_slver = { 0x0089, 0x01, 0x00 };
struct slver isal_inflate_slver_0001008a;
struct slver isal_inflate_slver = { 0x008a, 0x01, 0x00 };
struct slver isal_inflate_set_dict_slver_0001008d;
struct slver isal_inflate_set_dict_slver = { 0x008d, 0x01, 0x00 };
/*Performs a copy of length repeat_length data starting at dest -
* lookback_distance into dest. This copy copies data previously copied when the
* src buffer and the dest buffer overlap. */
static void inline byte_copy(uint8_t * dest, uint64_t lookback_distance, int repeat_length)
{
uint8_t *src = dest - lookback_distance;
for (; repeat_length > 0; repeat_length--)
*dest++ = *src++;
}
static void update_checksum(struct inflate_state *state, uint8_t * start_in, uint64_t length)
{
switch (state->crc_flag) {
case ISAL_GZIP:
case ISAL_GZIP_NO_HDR:
state->crc = crc32_gzip(state->crc, start_in, length);
break;
case ISAL_ZLIB:
case ISAL_ZLIB_NO_HDR:
state->crc = isal_adler32_bam1(state->crc, start_in, length);
break;
}
}
static void finalize_adler32(struct inflate_state *state)
{
state->crc = (state->crc & 0xffff0000) | (((state->crc & 0xffff) + 1) % ADLER_MOD);
}
/*
* Returns integer with first length bits reversed and all higher bits zeroed
*/
static uint16_t inline bit_reverse2(uint16_t bits, uint8_t length)
{
bits = ((bits >> 1) & 0x55555555) | ((bits & 0x55555555) << 1); // swap bits
bits = ((bits >> 2) & 0x33333333) | ((bits & 0x33333333) << 2); // swap pairs
bits = ((bits >> 4) & 0x0F0F0F0F) | ((bits & 0x0F0F0F0F) << 4); // swap nibbles
bits = ((bits >> 8) & 0x00FF00FF) | ((bits & 0x00FF00FF) << 8); // swap bytes
return bits >> (16 - length);
}
/* Load data from the in_stream into a buffer to allow for handling unaligned data*/
static void inline inflate_in_load(struct inflate_state *state, int min_required)
{
uint64_t temp = 0;
uint8_t new_bytes;
if (state->read_in_length >= 64)
return;
if (state->avail_in >= 8) {
/* If there is enough space to load a 64 bits, load the data and use
* that to fill read_in */
new_bytes = 8 - (state->read_in_length + 7) / 8;
temp = *(uint64_t *) state->next_in;
state->read_in |= temp << state->read_in_length;
state->next_in += new_bytes;
state->avail_in -= new_bytes;
state->read_in_length += new_bytes * 8;
} else {
/* Else fill the read_in buffer 1 byte at a time */
while (state->read_in_length < 57 && state->avail_in > 0) {
temp = *state->next_in;
state->read_in |= temp << state->read_in_length;
state->next_in++;
state->avail_in--;
state->read_in_length += 8;
}
}
}
/* Returns the next bit_count bits from the in stream and shifts the stream over
* by bit-count bits */
static uint64_t inline inflate_in_read_bits(struct inflate_state *state, uint8_t bit_count)
{
uint64_t ret;
assert(bit_count < 57);
/* Load inflate_in if not enough data is in the read_in buffer */
if (state->read_in_length < bit_count)
inflate_in_load(state, bit_count);
ret = (state->read_in) & ((1 << bit_count) - 1);
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
return ret;
}
static int inline set_codes(struct huff_code *huff_code_table, int table_length,
uint16_t * count)
{
uint32_t max;
uint32_t next_code[MAX_HUFF_TREE_DEPTH + 1];
int i;
/* Setup for calculating huffman codes */
next_code[0] = 0;
next_code[1] = 0;
for (i = 2; i < MAX_HUFF_TREE_DEPTH + 1; i++)
next_code[i] = (next_code[i - 1] + count[i - 1]) << 1;
max = (next_code[MAX_HUFF_TREE_DEPTH] + count[MAX_HUFF_TREE_DEPTH]);
if (max > (1 << MAX_HUFF_TREE_DEPTH))
return ISAL_INVALID_BLOCK;
/* Calculate code corresponding to a given symbol */
for (i = 0; i < table_length; i++) {
/* Store codes as zero for invalid codes used in static header construction */
huff_code_table[i].code =
bit_reverse2(next_code[huff_code_table[i].length],
huff_code_table[i].length);
next_code[huff_code_table[i].length] += 1;
}
return 0;
}
static void inline expand_lit_len_huffcode(struct huff_code *lit_len_huff,
uint16_t * count_total)
{
int huff_index = LIT_LEN - 1;
int len_sym, len_start, len_end, extra_count, len;
uint16_t count_prev, count_current;
uint32_t code, code_len;
struct huff_code *expand_next = &lit_len_huff[LIT_LEN_ELEMS - 1];
for (; huff_index >= ISAL_DEF_LIT_SYMBOLS; huff_index--) {
len_sym = huff_index - ISAL_DEF_LIT_SYMBOLS;
len_start = rfc_lookup_table.len_start[len_sym];
extra_count = rfc_lookup_table.len_extra_bit_count[len_sym];
len_end = (1 << extra_count) + len_start;
code = lit_len_huff[huff_index].code;
code_len = lit_len_huff[huff_index].length;
if (code_len == 0) {
for (len = len_end - 1; len >= len_start; len--) {
expand_next->code_and_extra = 0;
expand_next->length = 0;
expand_next--;
}
} else {
count_total[code_len]--;
count_total[code_len + extra_count] += len_end - len_start;
for (len = len_end - 1; len >= len_start; len--) {
expand_next->code_and_extra =
code | ((len - len_start) << code_len);
expand_next->length = code_len + extra_count;
expand_next--;
}
}
}
count_prev = count_total[1];
count_total[0] = 0;
count_total[1] = 0;
for (int i = 2; i < MAX_LIT_LEN_COUNT; i++) {
count_current = count_total[i];
count_total[i] = count_total[i - 1] + count_prev;
count_prev = count_current;
}
}
static int inline index_to_sym(int index)
{
return (index != 513) ? index : 512;
}
/* Sets result to the inflate_huff_code corresponding to the huffcode defined by
* the lengths in huff_code_table,where count is a histogram of the appearance
* of each code length */
static void make_inflate_huff_code_lit_len(struct inflate_huff_code_large *result,
struct huff_code *huff_code_table,
uint32_t table_length, uint16_t * count_total,
uint32_t multisym)
{
int i, j, k;
uint16_t code = 0;
uint16_t long_code_list[LIT_LEN_ELEMS];
uint32_t long_code_length = 0;
uint16_t temp_code_list[1 << (MAX_LIT_LEN_CODE_LEN - ISAL_DECODE_LONG_BITS)];
uint32_t temp_code_length;
uint32_t long_code_lookup_length = 0;
uint32_t max_length;
uint16_t first_bits;
uint32_t code_length;
uint16_t long_bits;
uint16_t min_increment;
uint32_t code_list[LIT_LEN_ELEMS + 2]; /* The +2 is for the extra codes in the static header */
uint32_t code_list_len;
uint16_t count_total_tmp[MAX_LIT_LEN_COUNT];
uint32_t insert_index;
uint32_t last_length, min_length;
uint32_t copy_size;
uint32_t *short_code_lookup = result->short_code_lookup;
int index1, index2, index3;
int sym1, sym2, sym3, sym1_index, sym2_index, sym3_index;
uint32_t sym1_code, sym2_code, sym3_code, sym1_len, sym2_len, sym3_len;
uint32_t max_symbol = MAX_LIT_LEN_SYM;
memcpy(count_total_tmp, count_total, sizeof(count_total_tmp));
code_list_len = count_total[MAX_LIT_LEN_COUNT - 1];
if (code_list_len == 0) {
memset(result->short_code_lookup, 0, sizeof(result->short_code_lookup));
return;
}
for (i = 0; i < table_length; i++) {
code_length = huff_code_table[i].length;
if (code_length > 0) {
insert_index = count_total_tmp[code_length];
code_list[insert_index] = i;
count_total_tmp[code_length]++;
}
}
for (k = 0; k < code_list_len; k++) {
i = code_list[k];
if (huff_code_table[i].length > ISAL_DECODE_LONG_BITS) {
/* Store the element in a list of elements with long codes. */
long_code_list[long_code_length] = i;
long_code_length++;
}
}
/* Determine the length of the first code */
last_length = huff_code_table[code_list[0]].length;
if (last_length > ISAL_DECODE_LONG_BITS)
last_length = ISAL_DECODE_LONG_BITS;
copy_size = (1 << (last_length - 1));
/* Initialize short_code_lookup, so invalid lookups process data */
memset(short_code_lookup, 0x00, copy_size * sizeof(*short_code_lookup));
min_length = last_length;
k = 0;
for (; last_length <= ISAL_DECODE_LONG_BITS; last_length++) {
/* Copy forward previosly set codes */
memcpy(short_code_lookup + copy_size, short_code_lookup,
sizeof(*short_code_lookup) * copy_size);
copy_size <<= 1;
/* Encode code singletons */
while (k < code_list_len
&& huff_code_table[code_list[k]].length == last_length) {
sym1_index = code_list[k];
sym1 = index_to_sym(sym1_index);
sym1_len = huff_code_table[sym1_index].length;
sym1_code = huff_code_table[sym1_index].code;
/* Set new codes */
if (sym1 <= max_symbol)
short_code_lookup[sym1_code] =
sym1 | sym1_len << LARGE_SHORT_CODE_LEN_OFFSET |
(1 << LARGE_SYM_COUNT_OFFSET);
k++;
}
/* Continue if no pairs are possible */
if (multisym >= SINGLE_SYM_FLAG || last_length < 2 * min_length)
continue;
/* Encode code pairs */
for (index1 = count_total[min_length];
index1 < count_total[last_length - min_length + 1]; index1++) {
sym1_index = code_list[index1];
sym1 = index_to_sym(sym1_index);
sym1_len = huff_code_table[sym1_index].length;
sym1_code = huff_code_table[sym1_index].code;
/*Check that sym1 is a literal */
if (sym1 >= 256) {
index1 = count_total[sym1_len + 1] - 1;
continue;
}
sym2_len = last_length - sym1_len;
for (index2 = count_total[sym2_len];
index2 < count_total[sym2_len + 1]; index2++) {
sym2_index = code_list[index2];
sym2 = index_to_sym(sym2_index);
/* Check that sym2 is an existing symbol */
if (sym2 > max_symbol)
break;
sym2_code = huff_code_table[sym2_index].code;
code = sym1_code | (sym2_code << sym1_len);
code_length = sym1_len + sym2_len;
short_code_lookup[code] =
sym1 | (sym2 << 8) |
(code_length << LARGE_SHORT_CODE_LEN_OFFSET)
| (2 << LARGE_SYM_COUNT_OFFSET);
}
}
/* Continue if no triples are possible */
if (multisym >= DOUBLE_SYM_FLAG || last_length < 3 * min_length)
continue;
/* Encode code triples */
for (index1 = count_total[min_length];
index1 < count_total[last_length - 2 * min_length + 1]; index1++) {
sym1_index = code_list[index1];
sym1 = index_to_sym(sym1_index);
sym1_len = huff_code_table[sym1_index].length;
sym1_code = huff_code_table[sym1_index].code;
/*Check that sym1 is a literal */
if (sym1 >= 256) {
index1 = count_total[sym1_len + 1] - 1;
continue;
}
if (last_length - sym1_len < 2 * min_length)
break;
for (index2 = count_total[min_length];
index2 < count_total[last_length - sym1_len - min_length + 1];
index2++) {
sym2_index = code_list[index2];
sym2 = index_to_sym(sym2_index);
sym2_len = huff_code_table[sym2_index].length;
sym2_code = huff_code_table[sym2_index].code;
/* Check that sym2 is a literal */
if (sym2 >= 256) {
index2 = count_total[sym2_len + 1] - 1;
continue;
}
sym3_len = last_length - sym1_len - sym2_len;
for (index3 = count_total[sym3_len];
index3 < count_total[sym3_len + 1]; index3++) {
sym3_index = code_list[index3];
sym3 = index_to_sym(sym3_index);
sym3_code = huff_code_table[sym3_index].code;
/* Check that sym3 is writable existing symbol */
if (sym3 > max_symbol - 1)
break;
code = sym1_code | (sym2_code << sym1_len) |
(sym3_code << (sym2_len + sym1_len));
code_length = sym1_len + sym2_len + sym3_len;
short_code_lookup[code] =
sym1 | (sym2 << 8) | sym3 << 16 |
(code_length << LARGE_SHORT_CODE_LEN_OFFSET)
| (3 << LARGE_SYM_COUNT_OFFSET);
}
}
}
}
for (i = 0; i < long_code_length; i++) {
/*Set the look up table to point to a hint where the symbol can be found
* in the list of long codes and add the current symbol to the list of
* long codes. */
if (huff_code_table[long_code_list[i]].code_and_extra == INVALID_CODE)
continue;
max_length = huff_code_table[long_code_list[i]].length;
first_bits =
huff_code_table[long_code_list[i]].code_and_extra
& ((1 << ISAL_DECODE_LONG_BITS) - 1);
temp_code_list[0] = long_code_list[i];
temp_code_length = 1;
for (j = i + 1; j < long_code_length; j++) {
if ((huff_code_table[long_code_list[j]].code &
((1 << ISAL_DECODE_LONG_BITS) - 1)) == first_bits) {
if (max_length < huff_code_table[long_code_list[j]].length)
max_length = huff_code_table[long_code_list[j]].length;
temp_code_list[temp_code_length] = long_code_list[j];
temp_code_length++;
}
}
memset(&result->long_code_lookup[long_code_lookup_length], 0x00,
sizeof(*result->long_code_lookup) *
(1 << (max_length - ISAL_DECODE_LONG_BITS)));
for (j = 0; j < temp_code_length; j++) {
sym1_index = temp_code_list[j];
sym1 = index_to_sym(sym1_index);
sym1_len = huff_code_table[sym1_index].length;
sym1_code = huff_code_table[sym1_index].code_and_extra;
long_bits = sym1_code >> ISAL_DECODE_LONG_BITS;
min_increment = 1 << (sym1_len - ISAL_DECODE_LONG_BITS);
for (; long_bits < (1 << (max_length - ISAL_DECODE_LONG_BITS));
long_bits += min_increment) {
result->long_code_lookup[long_code_lookup_length + long_bits] =
sym1 | (sym1_len << LARGE_LONG_CODE_LEN_OFFSET);
}
huff_code_table[sym1_index].code_and_extra = INVALID_CODE;
}
result->short_code_lookup[first_bits] = long_code_lookup_length |
(max_length << LARGE_SHORT_MAX_LEN_OFFSET) | LARGE_FLAG_BIT;
long_code_lookup_length += 1 << (max_length - ISAL_DECODE_LONG_BITS);
}
}
static void inline make_inflate_huff_code_dist(struct inflate_huff_code_small *result,
struct huff_code *huff_code_table,
uint32_t table_length, uint16_t * count,
uint32_t max_symbol)
{
int i, j, k;
uint16_t long_code_list[LIT_LEN];
uint32_t long_code_length = 0;
uint16_t temp_code_list[1 << (15 - ISAL_DECODE_SHORT_BITS)];
uint32_t temp_code_length;
uint32_t long_code_lookup_length = 0;
uint32_t max_length;
uint16_t first_bits;
uint32_t code_length;
uint16_t long_bits;
uint16_t min_increment;
uint32_t code_list[DIST_LEN + 2]; /* The +2 is for the extra codes in the static header */
uint32_t code_list_len;
uint32_t count_total[17];
uint32_t insert_index;
uint32_t last_length;
uint32_t copy_size;
uint16_t *short_code_lookup = result->short_code_lookup;
count_total[0] = 0;
count_total[1] = 0;
for (i = 2; i < 17; i++)
count_total[i] = count_total[i - 1] + count[i - 1];
code_list_len = count_total[16];
if (code_list_len == 0) {
memset(result->short_code_lookup, 0, sizeof(result->short_code_lookup));
return;
}
for (i = 0; i < table_length; i++) {
code_length = huff_code_table[i].length;
if (code_length > 0) {
insert_index = count_total[code_length];
code_list[insert_index] = i;
count_total[code_length]++;
}
}
last_length = huff_code_table[code_list[0]].length;
if (last_length > ISAL_DECODE_SHORT_BITS)
last_length = ISAL_DECODE_SHORT_BITS;
copy_size = (1 << last_length);
/* Initialize short_code_lookup, so invalid lookups process data */
memset(short_code_lookup, 0x00, copy_size * sizeof(*short_code_lookup));
for (k = 0; k < code_list_len; k++) {
i = code_list[k];
if (huff_code_table[i].length > ISAL_DECODE_SHORT_BITS)
break;
while (huff_code_table[i].length > last_length) {
memcpy(short_code_lookup + copy_size, short_code_lookup,
sizeof(*short_code_lookup) * copy_size);
last_length++;
copy_size <<= 1;
}
/* Set lookup table to return the current symbol concatenated
* with the code length when the first DECODE_LENGTH bits of the
* address are the same as the code for the current symbol. The
* first 9 bits are the code, bits 14:10 are the code length,
* bit 15 is a flag representing this is a symbol*/
if (i < max_symbol)
short_code_lookup[huff_code_table[i].code] = i |
rfc_lookup_table.dist_extra_bit_count[i] << DIST_SYM_EXTRA_OFFSET |
(huff_code_table[i].length) << SMALL_SHORT_CODE_LEN_OFFSET;
else
short_code_lookup[huff_code_table[i].code] = 0;
}
while (ISAL_DECODE_SHORT_BITS > last_length) {
memcpy(short_code_lookup + copy_size, short_code_lookup,
sizeof(*short_code_lookup) * copy_size);
last_length++;
copy_size <<= 1;
}
while (k < code_list_len) {
i = code_list[k];
/* Store the element in a list of elements with long codes. */
long_code_list[long_code_length] = i;
long_code_length++;
k++;
}
for (i = 0; i < long_code_length; i++) {
/*Set the look up table to point to a hint where the symbol can be found
* in the list of long codes and add the current symbol to the list of
* long codes. */
if (huff_code_table[long_code_list[i]].code == 0xFFFF)
continue;
max_length = huff_code_table[long_code_list[i]].length;
first_bits =
huff_code_table[long_code_list[i]].code
& ((1 << ISAL_DECODE_SHORT_BITS) - 1);
temp_code_list[0] = long_code_list[i];
temp_code_length = 1;
for (j = i + 1; j < long_code_length; j++) {
if ((huff_code_table[long_code_list[j]].code &
((1 << ISAL_DECODE_SHORT_BITS) - 1)) == first_bits) {
if (max_length < huff_code_table[long_code_list[j]].length)
max_length = huff_code_table[long_code_list[j]].length;
temp_code_list[temp_code_length] = long_code_list[j];
temp_code_length++;
}
}
memset(&result->long_code_lookup[long_code_lookup_length], 0x00,
2 * (1 << (max_length - ISAL_DECODE_SHORT_BITS)));
for (j = 0; j < temp_code_length; j++) {
code_length = huff_code_table[temp_code_list[j]].length;
long_bits =
huff_code_table[temp_code_list[j]].code >> ISAL_DECODE_SHORT_BITS;
min_increment = 1 << (code_length - ISAL_DECODE_SHORT_BITS);
for (; long_bits < (1 << (max_length - ISAL_DECODE_SHORT_BITS));
long_bits += min_increment) {
result->long_code_lookup[long_code_lookup_length + long_bits] =
temp_code_list[j] |
rfc_lookup_table.dist_extra_bit_count[temp_code_list[j]] <<
DIST_SYM_EXTRA_OFFSET |
(code_length << SMALL_LONG_CODE_LEN_OFFSET);
}
huff_code_table[temp_code_list[j]].code = 0xFFFF;
}
result->short_code_lookup[first_bits] = long_code_lookup_length |
(max_length << SMALL_SHORT_CODE_LEN_OFFSET) | SMALL_FLAG_BIT;
long_code_lookup_length += 1 << (max_length - ISAL_DECODE_SHORT_BITS);
}
}
static void inline make_inflate_huff_code_header(struct inflate_huff_code_small *result,
struct huff_code *huff_code_table,
uint32_t table_length, uint16_t * count,
uint32_t max_symbol)
{
int i, j, k;
uint16_t long_code_list[LIT_LEN];
uint32_t long_code_length = 0;
uint16_t temp_code_list[1 << (15 - ISAL_DECODE_SHORT_BITS)];
uint32_t temp_code_length;
uint32_t long_code_lookup_length = 0;
uint32_t max_length;
uint16_t first_bits;
uint32_t code_length;
uint16_t long_bits;
uint16_t min_increment;
uint32_t code_list[DIST_LEN + 2]; /* The +2 is for the extra codes in the static header */
uint32_t code_list_len;
uint32_t count_total[17];
uint32_t insert_index;
uint32_t last_length;
uint32_t copy_size;
uint16_t *short_code_lookup = result->short_code_lookup;
count_total[0] = 0;
count_total[1] = 0;
for (i = 2; i < 17; i++)
count_total[i] = count_total[i - 1] + count[i - 1];
code_list_len = count_total[16];
if (code_list_len == 0) {
memset(result->short_code_lookup, 0, sizeof(result->short_code_lookup));
return;
}
for (i = 0; i < table_length; i++) {
code_length = huff_code_table[i].length;
if (code_length > 0) {
insert_index = count_total[code_length];
code_list[insert_index] = i;
count_total[code_length]++;
}
}
last_length = huff_code_table[code_list[0]].length;
if (last_length > ISAL_DECODE_SHORT_BITS)
last_length = ISAL_DECODE_SHORT_BITS;
copy_size = (1 << last_length);
/* Initialize short_code_lookup, so invalid lookups process data */
memset(short_code_lookup, 0x00, copy_size * sizeof(*short_code_lookup));
for (k = 0; k < code_list_len; k++) {
i = code_list[k];
if (huff_code_table[i].length > ISAL_DECODE_SHORT_BITS)
break;
while (huff_code_table[i].length > last_length) {
memcpy(short_code_lookup + copy_size, short_code_lookup,
sizeof(*short_code_lookup) * copy_size);
last_length++;
copy_size <<= 1;
}
/* Set lookup table to return the current symbol concatenated
* with the code length when the first DECODE_LENGTH bits of the
* address are the same as the code for the current symbol. The
* first 9 bits are the code, bits 14:10 are the code length,
* bit 15 is a flag representing this is a symbol*/
if (i < max_symbol)
short_code_lookup[huff_code_table[i].code] =
i | (huff_code_table[i].length) << SMALL_SHORT_CODE_LEN_OFFSET;
else
short_code_lookup[huff_code_table[i].code] = 0;
}
while (ISAL_DECODE_SHORT_BITS > last_length) {
memcpy(short_code_lookup + copy_size, short_code_lookup,
sizeof(*short_code_lookup) * copy_size);
last_length++;
copy_size <<= 1;
}
while (k < code_list_len) {
i = code_list[k];
/* Store the element in a list of elements with long codes. */
long_code_list[long_code_length] = i;
long_code_length++;
k++;
}
for (i = 0; i < long_code_length; i++) {
/*Set the look up table to point to a hint where the symbol can be found
* in the list of long codes and add the current symbol to the list of
* long codes. */
if (huff_code_table[long_code_list[i]].code == 0xFFFF)
continue;
max_length = huff_code_table[long_code_list[i]].length;
first_bits =
huff_code_table[long_code_list[i]].code
& ((1 << ISAL_DECODE_SHORT_BITS) - 1);
temp_code_list[0] = long_code_list[i];
temp_code_length = 1;
for (j = i + 1; j < long_code_length; j++) {
if ((huff_code_table[long_code_list[j]].code &
((1 << ISAL_DECODE_SHORT_BITS) - 1)) == first_bits) {
if (max_length < huff_code_table[long_code_list[j]].length)
max_length = huff_code_table[long_code_list[j]].length;
temp_code_list[temp_code_length] = long_code_list[j];
temp_code_length++;
}
}
memset(&result->long_code_lookup[long_code_lookup_length], 0x00,
2 * (1 << (max_length - ISAL_DECODE_SHORT_BITS)));
for (j = 0; j < temp_code_length; j++) {
code_length = huff_code_table[temp_code_list[j]].length;
long_bits =
huff_code_table[temp_code_list[j]].code >> ISAL_DECODE_SHORT_BITS;
min_increment = 1 << (code_length - ISAL_DECODE_SHORT_BITS);
for (; long_bits < (1 << (max_length - ISAL_DECODE_SHORT_BITS));
long_bits += min_increment) {
result->long_code_lookup[long_code_lookup_length + long_bits] =
temp_code_list[j] |
(code_length << SMALL_LONG_CODE_LEN_OFFSET);
}
huff_code_table[temp_code_list[j]].code = 0xFFFF;
}
result->short_code_lookup[first_bits] = long_code_lookup_length |
(max_length << SMALL_SHORT_CODE_LEN_OFFSET) | SMALL_FLAG_BIT;
long_code_lookup_length += 1 << (max_length - ISAL_DECODE_SHORT_BITS);
}
}
/* Sets the inflate_huff_codes in state to be the huffcodes corresponding to the
* deflate static header */
static int inline setup_static_header(struct inflate_state *state)
{
/* This could be turned into a memcpy of this functions output for
* higher speed, but then DECODE_LOOKUP_SIZE couldn't be changed without
* regenerating the table. */
int i;
struct huff_code lit_code[LIT_LEN_ELEMS];
struct huff_code dist_code[DIST_LEN + 2];
uint32_t multisym = SINGLE_SYM_FLAG;
/* These tables are based on the static huffman tree described in RFC
* 1951 */
uint16_t lit_count[MAX_LIT_LEN_COUNT] = {
0, 0, 0, 0, 0, 0, 0, 24,
152, 112, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0
};
uint16_t dist_count[16] = {
0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
/* These for loops set the code lengths for the static literal/length
* and distance codes defined in the deflate standard RFC 1951 */
for (i = 0; i < 144; i++)
lit_code[i].length = 8;
for (i = 144; i < 256; i++)
lit_code[i].length = 9;
for (i = 256; i < 280; i++)
lit_code[i].length = 7;
for (i = 280; i < LIT_LEN + 2; i++)
lit_code[i].length = 8;
for (i = 0; i < DIST_LEN + 2; i++)
dist_code[i].length = 5;
set_codes(lit_code, LIT_LEN + 2, lit_count);
lit_count[8] -= 2;
expand_lit_len_huffcode(lit_code, lit_count);
set_codes(dist_code, DIST_LEN + 2, dist_count);
make_inflate_huff_code_lit_len(&state->lit_huff_code, lit_code, LIT_LEN_ELEMS,
lit_count, multisym);
make_inflate_huff_code_dist(&state->dist_huff_code, dist_code, DIST_LEN + 2,
dist_count, DIST_LEN);
state->block_state = ISAL_BLOCK_CODED;
return 0;
}
/* Decodes the next symbol symbol in in_buffer using the huff code defined by
* huff_code and returns the value in next_lits and sym_count */
static void inline decode_next_lit_len(uint32_t * next_lits, uint32_t * sym_count,
struct inflate_state *state,
struct inflate_huff_code_large *huff_code)
{
uint32_t next_bits;
uint32_t next_sym;
uint32_t bit_count;
uint32_t bit_mask;
if (state->read_in_length <= ISAL_DEF_MAX_CODE_LEN)
inflate_in_load(state, 0);
next_bits = state->read_in & ((1 << ISAL_DECODE_LONG_BITS) - 1);
/* next_sym is a possible symbol decoded from next_bits. If bit 15 is 0,
* next_code is a symbol. Bits 9:0 represent the symbol, and bits 14:10
* represent the length of that symbols huffman code. If next_sym is not
* a symbol, it provides a hint of where the large symbols containin
* this code are located. Note the hint is at largest the location the
* first actual symbol in the long code list.*/
next_sym = huff_code->short_code_lookup[next_bits];
if ((next_sym & LARGE_FLAG_BIT) == 0) {
/* Return symbol found if next_code is a complete huffman code
* and shift in buffer over by the length of the next_code */
bit_count = next_sym >> LARGE_SHORT_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
if (bit_count == 0)
next_sym = INVALID_SYMBOL;
*sym_count = (next_sym >> LARGE_SYM_COUNT_OFFSET) & LARGE_SYM_COUNT_MASK;
*next_lits = next_sym & LARGE_SHORT_SYM_MASK;
} else {
/* If a symbol is not found, do a lookup in the long code
* list starting from the hint in next_sym */
bit_mask = next_sym >> LARGE_SHORT_MAX_LEN_OFFSET;
bit_mask = (1 << bit_mask) - 1;
next_bits = state->read_in & bit_mask;
next_sym =
huff_code->long_code_lookup[(next_sym & LARGE_SHORT_SYM_MASK) +
(next_bits >> ISAL_DECODE_LONG_BITS)];
bit_count = next_sym >> LARGE_LONG_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
if (bit_count == 0)
next_sym = INVALID_SYMBOL;
*sym_count = 1;
*next_lits = next_sym & LARGE_LONG_SYM_MASK;
}
}
static uint16_t inline decode_next_dist(struct inflate_state *state,
struct inflate_huff_code_small *huff_code)
{
uint16_t next_bits;
uint16_t next_sym;
uint32_t bit_count;
uint32_t bit_mask;
if (state->read_in_length <= ISAL_DEF_MAX_CODE_LEN)
inflate_in_load(state, 0);
next_bits = state->read_in & ((1 << ISAL_DECODE_SHORT_BITS) - 1);
/* next_sym is a possible symbol decoded from next_bits. If bit 15 is 0,
* next_code is a symbol. Bits 9:0 represent the symbol, and bits 14:10
* represent the length of that symbols huffman code. If next_sym is not
* a symbol, it provides a hint of where the large symbols containin
* this code are located. Note the hint is at largest the location the
* first actual symbol in the long code list.*/
next_sym = huff_code->short_code_lookup[next_bits];
if ((next_sym & SMALL_FLAG_BIT) == 0) {
/* Return symbol found if next_code is a complete huffman code
* and shift in buffer over by the length of the next_code */
bit_count = next_sym >> SMALL_SHORT_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
if (bit_count == 0)
next_sym = INVALID_SYMBOL;
return next_sym & DIST_SYM_MASK;
} else {
/* If a symbol is not found, perform a linear search of the long code
* list starting from the hint in next_sym */
bit_mask = (next_sym - SMALL_FLAG_BIT) >> SMALL_SHORT_CODE_LEN_OFFSET;
bit_mask = (1 << bit_mask) - 1;
next_bits = state->read_in & bit_mask;
next_sym =
huff_code->long_code_lookup[(next_sym & SMALL_SHORT_SYM_MASK) +
(next_bits >> ISAL_DECODE_SHORT_BITS)];
bit_count = next_sym >> SMALL_LONG_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
return next_sym & DIST_SYM_MASK;
}
}
static uint16_t inline decode_next_header(struct inflate_state *state,
struct inflate_huff_code_small *huff_code)
{
uint16_t next_bits;
uint16_t next_sym;
uint32_t bit_count;
uint32_t bit_mask;
if (state->read_in_length <= ISAL_DEF_MAX_CODE_LEN)
inflate_in_load(state, 0);
next_bits = state->read_in & ((1 << ISAL_DECODE_SHORT_BITS) - 1);
/* next_sym is a possible symbol decoded from next_bits. If bit 15 is 0,
* next_code is a symbol. Bits 9:0 represent the symbol, and bits 14:10
* represent the length of that symbols huffman code. If next_sym is not
* a symbol, it provides a hint of where the large symbols containin
* this code are located. Note the hint is at largest the location the
* first actual symbol in the long code list.*/
next_sym = huff_code->short_code_lookup[next_bits];
if ((next_sym & SMALL_FLAG_BIT) == 0) {
/* Return symbol found if next_code is a complete huffman code
* and shift in buffer over by the length of the next_code */
bit_count = next_sym >> SMALL_SHORT_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
if (bit_count == 0)
next_sym = INVALID_SYMBOL;
return next_sym & SMALL_SHORT_SYM_MASK;
} else {
/* If a symbol is not found, perform a linear search of the long code
* list starting from the hint in next_sym */
bit_mask = (next_sym - SMALL_FLAG_BIT) >> SMALL_SHORT_CODE_LEN_OFFSET;
bit_mask = (1 << bit_mask) - 1;
next_bits = state->read_in & bit_mask;
next_sym =
huff_code->long_code_lookup[(next_sym & SMALL_SHORT_SYM_MASK) +
(next_bits >> ISAL_DECODE_SHORT_BITS)];
bit_count = next_sym >> SMALL_LONG_CODE_LEN_OFFSET;
state->read_in >>= bit_count;
state->read_in_length -= bit_count;
return next_sym & SMALL_LONG_SYM_MASK;
}
}
/* Reads data from the in_buffer and sets the huff code corresponding to that
* data */
static int inline setup_dynamic_header(struct inflate_state *state)
{
int i, j;
struct huff_code code_huff[CODE_LEN_CODES];
struct huff_code lit_and_dist_huff[LIT_LEN_ELEMS];
struct huff_code *previous = NULL, *current, *end;
struct inflate_huff_code_small inflate_code_huff;
uint8_t hclen, hdist, hlit;
uint16_t code_count[16], lit_count[MAX_LIT_LEN_COUNT], dist_count[16];
uint16_t *count;
uint16_t symbol;
uint32_t multisym = DEFAULT_SYM_FLAG;
/* This order is defined in RFC 1951 page 13 */
const uint8_t code_length_code_order[CODE_LEN_CODES] = {
0x10, 0x11, 0x12, 0x00, 0x08, 0x07, 0x09, 0x06,
0x0a, 0x05, 0x0b, 0x04, 0x0c, 0x03, 0x0d, 0x02,
0x0e, 0x01, 0x0f
};
if (state->bfinal && state->avail_in <= 8 * 1024) {
multisym = DOUBLE_SYM_FLAG;
}
memset(code_count, 0, sizeof(code_count));
memset(lit_count, 0, sizeof(lit_count));
memset(dist_count, 0, sizeof(dist_count));
memset(code_huff, 0, sizeof(code_huff));
memset(lit_and_dist_huff, 0, sizeof(lit_and_dist_huff));
/* These variables are defined in the deflate standard, RFC 1951 */
hlit = inflate_in_read_bits(state, 5);
hdist = inflate_in_read_bits(state, 5);
hclen = inflate_in_read_bits(state, 4);
if (hlit > 29 || hdist > 29 || hclen > 15)
return ISAL_INVALID_BLOCK;
/* Create the code huffman code for decoding the lit/len and dist huffman codes */
for (i = 0; i < hclen + 4; i++) {
code_huff[code_length_code_order[i]].length = inflate_in_read_bits(state, 3);
code_count[code_huff[code_length_code_order[i]].length] += 1;
}
/* Check that the code huffman code has a symbol */
for (i = 1; i < 16; i++) {
if (code_count[i] != 0)
break;
}
if (state->read_in_length < 0)
return ISAL_END_INPUT;
if (i == 16 || set_codes(code_huff, CODE_LEN_CODES, code_count))
return ISAL_INVALID_BLOCK;
make_inflate_huff_code_header(&inflate_code_huff, code_huff, CODE_LEN_CODES,
code_count, CODE_LEN_CODES);
/* Decode the lit/len and dist huffman codes using the code huffman code */
count = lit_count;
current = lit_and_dist_huff;
end = lit_and_dist_huff + LIT_LEN + hdist + 1;
while (current < end) {
/* If finished decoding the lit/len huffman code, start decoding
* the distance code these decodings are in the same loop
* because the len/lit and dist huffman codes are run length
* encoded together. */
if (current == lit_and_dist_huff + 257 + hlit)
current = lit_and_dist_huff + LIT_LEN;
if (current == lit_and_dist_huff + LIT_LEN)
count = dist_count;
symbol = decode_next_header(state, &inflate_code_huff);
if (state->read_in_length < 0) {
if (current > &lit_and_dist_huff[256]
&& lit_and_dist_huff[256].length <= 0)
return ISAL_INVALID_BLOCK;
return ISAL_END_INPUT;
}
if (symbol < 16) {
/* If a length is found, update the current lit/len/dist
* to have length symbol */
count[symbol]++;
current->length = symbol;
previous = current;
current++;
} else if (symbol == 16) {
/* If a repeat length is found, update the next repeat
* length lit/len/dist elements to have the value of the
* repeated length */
if (previous == NULL) /* No elements available to be repeated */
return ISAL_INVALID_BLOCK;
i = 3 + inflate_in_read_bits(state, 2);
if (current + i > end)
return ISAL_INVALID_BLOCK;
for (j = 0; j < i; j++) {
*current = *previous;
count[current->length]++;
previous = current;
if (current == lit_and_dist_huff + 256 + hlit) {
current = lit_and_dist_huff + LIT_LEN;
count = dist_count;
} else
current++;
}
} else if (symbol == 17) {
/* If a repeat zeroes if found, update then next
* repeated zeroes length lit/len/dist elements to have
* length 0. */
i = 3 + inflate_in_read_bits(state, 3);
for (j = 0; j < i; j++) {
previous = current;
if (current == lit_and_dist_huff + 256 + hlit) {
current = lit_and_dist_huff + LIT_LEN;
count = dist_count;
} else
current++;
}
} else if (symbol == 18) {
/* If a repeat zeroes if found, update then next
* repeated zeroes length lit/len/dist elements to have
* length 0. */
i = 11 + inflate_in_read_bits(state, 7);
for (j = 0; j < i; j++) {
previous = current;
if (current == lit_and_dist_huff + 256 + hlit) {
current = lit_and_dist_huff + LIT_LEN;
count = dist_count;
} else
current++;
}
} else
return ISAL_INVALID_BLOCK;
}
if (current > end || lit_and_dist_huff[256].length <= 0)
return ISAL_INVALID_BLOCK;
if (state->read_in_length < 0)
return ISAL_END_INPUT;
if (set_codes(&lit_and_dist_huff[LIT_LEN], DIST_LEN, dist_count))
return ISAL_INVALID_BLOCK;
make_inflate_huff_code_dist(&state->dist_huff_code, &lit_and_dist_huff[LIT_LEN],
DIST_LEN, dist_count, DIST_LEN);
if (set_codes(lit_and_dist_huff, LIT_LEN, lit_count))
return ISAL_INVALID_BLOCK;
expand_lit_len_huffcode(lit_and_dist_huff, lit_count);
make_inflate_huff_code_lit_len(&state->lit_huff_code, lit_and_dist_huff, LIT_LEN_ELEMS,
lit_count, multisym);
state->block_state = ISAL_BLOCK_CODED;
return 0;
}
/* Reads in the header pointed to by in_stream and sets up state to reflect that
* header information*/
static int read_header(struct inflate_state *state)
{
uint8_t bytes;
uint32_t btype;
uint16_t len, nlen;
int ret = 0;
/* btype and bfinal are defined in RFC 1951, bfinal represents whether
* the current block is the end of block, and btype represents the
* encoding method on the current block. */
state->bfinal = inflate_in_read_bits(state, 1);
btype = inflate_in_read_bits(state, 2);
if (state->read_in_length < 0)
ret = ISAL_END_INPUT;
else if (btype == 0) {
inflate_in_load(state, 40);
bytes = state->read_in_length / 8;
if (bytes < 4)
return ISAL_END_INPUT;
state->read_in >>= state->read_in_length % 8;
state->read_in_length = bytes * 8;
len = state->read_in & 0xFFFF;
state->read_in >>= 16;
nlen = state->read_in & 0xFFFF;
state->read_in >>= 16;
state->read_in_length -= 32;
/* Check if len and nlen match */
if (len != (~nlen & 0xffff))
return ISAL_INVALID_BLOCK;
state->type0_block_len = len;
state->block_state = ISAL_BLOCK_TYPE0;
ret = 0;
} else if (btype == 1)
ret = setup_static_header(state);
else if (btype == 2)
ret = setup_dynamic_header(state);
else
ret = ISAL_INVALID_BLOCK;
return ret;
}
/* Reads in the header pointed to by in_stream and sets up state to reflect that
* header information*/
static int read_header_stateful(struct inflate_state *state)
{
uint64_t read_in_start = state->read_in;
int32_t read_in_length_start = state->read_in_length;
uint8_t *next_in_start = state->next_in;
uint32_t avail_in_start = state->avail_in;
int block_state_start = state->block_state;
int ret;
int copy_size;
int bytes_read;
if (block_state_start == ISAL_BLOCK_HDR) {
/* Setup so read_header decodes data in tmp_in_buffer */
copy_size = ISAL_DEF_MAX_HDR_SIZE - state->tmp_in_size;
if (copy_size > state->avail_in)
copy_size = state->avail_in;
memcpy(&state->tmp_in_buffer[state->tmp_in_size], state->next_in, copy_size);
state->next_in = state->tmp_in_buffer;
state->avail_in = state->tmp_in_size + copy_size;
}
ret = read_header(state);
if (block_state_start == ISAL_BLOCK_HDR) {
/* Setup so state is restored to a valid state */
bytes_read = state->next_in - state->tmp_in_buffer - state->tmp_in_size;
if (bytes_read < 0)
bytes_read = 0;
state->next_in = next_in_start + bytes_read;
state->avail_in = avail_in_start - bytes_read;
}
if (ret == ISAL_END_INPUT) {
/* Save off data so header can be decoded again with more data */
state->read_in = read_in_start;
state->read_in_length = read_in_length_start;
memcpy(&state->tmp_in_buffer[state->tmp_in_size], next_in_start,
avail_in_start);
state->tmp_in_size += avail_in_start;
state->avail_in = 0;
state->next_in = next_in_start + avail_in_start;
state->block_state = ISAL_BLOCK_HDR;
} else
state->tmp_in_size = 0;
return ret;
}
static int inline decode_literal_block(struct inflate_state *state)
{
uint32_t len = state->type0_block_len;
uint32_t bytes = state->read_in_length / 8;
/* If the block is uncompressed, perform a memcopy while
* updating state data */
state->block_state = state->bfinal ? ISAL_BLOCK_INPUT_DONE : ISAL_BLOCK_NEW_HDR;
if (state->avail_out < len) {
len = state->avail_out;
state->block_state = ISAL_BLOCK_TYPE0;
}
if (state->avail_in + bytes < len) {
len = state->avail_in + bytes;
state->block_state = ISAL_BLOCK_TYPE0;
}
if (state->read_in_length) {
if (len >= bytes) {
memcpy(state->next_out, &state->read_in, bytes);
state->next_out += bytes;
state->avail_out -= bytes;
state->total_out += bytes;
state->type0_block_len -= bytes;
state->read_in = 0;
state->read_in_length = 0;
len -= bytes;
bytes = 0;
} else {
memcpy(state->next_out, &state->read_in, len);
state->next_out += len;
state->avail_out -= len;
state->total_out += len;
state->type0_block_len -= len;
state->read_in >>= 8 * len;
state->read_in_length -= 8 * len;
bytes -= len;
len = 0;
}
}
memcpy(state->next_out, state->next_in, len);
state->next_out += len;
state->avail_out -= len;
state->total_out += len;
state->next_in += len;
state->avail_in -= len;
state->type0_block_len -= len;
if (state->avail_in + bytes == 0 && state->block_state != ISAL_BLOCK_INPUT_DONE)
return ISAL_END_INPUT;
if (state->avail_out == 0 && state->type0_block_len > 0)
return ISAL_OUT_OVERFLOW;
return 0;
}
/* Decodes the next block if it was encoded using a huffman code */
int decode_huffman_code_block_stateless_base(struct inflate_state *state)
{
uint16_t next_lit;
uint8_t next_dist;
uint32_t repeat_length;
uint32_t look_back_dist;
uint64_t read_in_tmp;
int32_t read_in_length_tmp;
uint8_t *next_in_tmp, *next_out_tmp;
uint32_t avail_in_tmp, avail_out_tmp, total_out_tmp;
uint32_t next_lits, sym_count;
state->copy_overflow_length = 0;
state->copy_overflow_distance = 0;
while (state->block_state == ISAL_BLOCK_CODED) {
/* While not at the end of block, decode the next
* symbol */
inflate_in_load(state, 0);
read_in_tmp = state->read_in;
read_in_length_tmp = state->read_in_length;
next_in_tmp = state->next_in;
avail_in_tmp = state->avail_in;
next_out_tmp = state->next_out;
avail_out_tmp = state->avail_out;
total_out_tmp = state->total_out;
decode_next_lit_len(&next_lits, &sym_count, state, &state->lit_huff_code);
if (sym_count == 0)
return ISAL_INVALID_SYMBOL;
if (state->read_in_length < 0) {
state->read_in = read_in_tmp;
state->read_in_length = read_in_length_tmp;
state->next_in = next_in_tmp;
state->avail_in = avail_in_tmp;
return ISAL_END_INPUT;
}
while (sym_count > 0) {
next_lit = next_lits & 0xffff;
if (next_lit < 256 || sym_count > 1) {
/* If the next symbol is a literal,
* write out the symbol and update state
* data accordingly. */
if (state->avail_out < 1) {
state->write_overflow_lits = next_lits;
state->write_overflow_len = sym_count;
next_lits = next_lits >> (8 * (sym_count - 1));
sym_count = 1;
if (next_lits < 256)
return ISAL_OUT_OVERFLOW;
else if (next_lits == 256) {
state->write_overflow_len -= 1;
state->block_state = state->bfinal ?
ISAL_BLOCK_INPUT_DONE : ISAL_BLOCK_NEW_HDR;
return ISAL_OUT_OVERFLOW;
} else {
state->write_overflow_len -= 1;
continue;
}
}
*state->next_out = next_lit;
state->next_out++;
state->avail_out--;
state->total_out++;
} else if (next_lit == 256) {
/* If the next symbol is the end of
* block, update the state data
* accordingly */
state->block_state = state->bfinal ?
ISAL_BLOCK_INPUT_DONE : ISAL_BLOCK_NEW_HDR;
} else if (next_lit <= MAX_LIT_LEN_SYM) {
/* Else if the next symbol is a repeat
* length, read in the length extra
* bits, the distance code, the distance
* extra bits. Then write out the
* corresponding data and update the
* state data accordingly*/
repeat_length = next_lit - 254;
next_dist = decode_next_dist(state, &state->dist_huff_code);
if (next_dist >= DIST_LEN)
return ISAL_INVALID_SYMBOL;
look_back_dist = rfc_lookup_table.dist_start[next_dist] +
inflate_in_read_bits(state,
rfc_lookup_table.dist_extra_bit_count
[next_dist]);
if (state->read_in_length < 0) {
state->read_in = read_in_tmp;
state->read_in_length = read_in_length_tmp;
state->next_in = next_in_tmp;
state->avail_in = avail_in_tmp;
state->next_out = next_out_tmp;
state->avail_out = avail_out_tmp;
state->total_out = total_out_tmp;
state->write_overflow_lits = 0;
state->write_overflow_len = 0;
return ISAL_END_INPUT;
}
if (look_back_dist > state->total_out + state->dict_length)
return ISAL_INVALID_LOOKBACK;
if (state->avail_out < repeat_length) {
state->copy_overflow_length =
repeat_length - state->avail_out;
state->copy_overflow_distance = look_back_dist;
repeat_length = state->avail_out;
}
if (look_back_dist > repeat_length)
memcpy(state->next_out,
state->next_out - look_back_dist,
repeat_length);
else
byte_copy(state->next_out, look_back_dist,
repeat_length);
state->next_out += repeat_length;
state->avail_out -= repeat_length;
state->total_out += repeat_length;
if (state->copy_overflow_length > 0)
return ISAL_OUT_OVERFLOW;
} else
/* Else the read in bits do not
* correspond to any valid symbol */
return ISAL_INVALID_SYMBOL;
next_lits >>= 8;
sym_count--;
}
}
return 0;
}
void isal_inflate_init(struct inflate_state *state)
{
state->read_in = 0;
state->read_in_length = 0;
state->next_in = NULL;
state->avail_in = 0;
state->next_out = NULL;
state->avail_out = 0;
state->total_out = 0;
state->dict_length = 0;
state->block_state = ISAL_BLOCK_NEW_HDR;
state->bfinal = 0;
state->crc_flag = 0;
state->crc = 0;
state->type0_block_len = 0;
state->write_overflow_lits = 0;
state->write_overflow_len = 0;
state->copy_overflow_length = 0;
state->copy_overflow_distance = 0;
state->tmp_in_size = 0;
state->tmp_out_processed = 0;
state->tmp_out_valid = 0;
}
void isal_inflate_reset(struct inflate_state *state)
{
state->read_in = 0;
state->read_in_length = 0;
state->total_out = 0;
state->dict_length = 0;
state->block_state = ISAL_BLOCK_NEW_HDR;
state->bfinal = 0;
state->crc = 0;
state->type0_block_len = 0;
state->write_overflow_lits = 0;
state->write_overflow_len = 0;
state->copy_overflow_length = 0;
state->copy_overflow_distance = 0;
state->tmp_in_size = 0;
state->tmp_out_processed = 0;
state->tmp_out_valid = 0;
}
int isal_inflate_set_dict(struct inflate_state *state, uint8_t * dict, uint32_t dict_len)
{
if (state->block_state != ISAL_BLOCK_NEW_HDR
|| state->tmp_out_processed != state->tmp_out_valid)
return ISAL_INVALID_STATE;
if (dict_len > IGZIP_HIST_SIZE) {
dict = dict + dict_len - IGZIP_HIST_SIZE;
dict_len = IGZIP_HIST_SIZE;
}
memcpy(state->tmp_out_buffer, dict, dict_len);
state->tmp_out_processed = dict_len;
state->tmp_out_valid = dict_len;
state->dict_length = dict_len;
return COMP_OK;
}
int isal_inflate_stateless(struct inflate_state *state)
{
uint32_t ret = 0;
uint8_t *start_out = state->next_out;
state->read_in = 0;
state->read_in_length = 0;
state->block_state = ISAL_BLOCK_NEW_HDR;
state->dict_length = 0;
state->bfinal = 0;
state->crc = 0;
state->total_out = 0;
while (state->block_state != ISAL_BLOCK_FINISH) {
if (state->block_state == ISAL_BLOCK_NEW_HDR) {
ret = read_header(state);
if (ret)
break;
}
if (state->block_state == ISAL_BLOCK_TYPE0)
ret = decode_literal_block(state);
else
ret = decode_huffman_code_block_stateless(state);
if (ret)
break;
if (state->block_state == ISAL_BLOCK_INPUT_DONE)
state->block_state = ISAL_BLOCK_FINISH;
}
if (state->crc_flag) {
update_checksum(state, start_out, state->next_out - start_out);
if (state->crc_flag == ISAL_ZLIB || state->crc_flag == ISAL_ZLIB_NO_HDR)
finalize_adler32(state);
}
/* Undo count stuff of bytes read into the read buffer */
state->next_in -= state->read_in_length / 8;
state->avail_in += state->read_in_length / 8;
return ret;
}
int isal_inflate(struct inflate_state *state)
{
uint8_t *start_out = state->next_out;
uint32_t avail_out = state->avail_out;
uint32_t copy_size = 0;
int32_t shift_size = 0;
int ret = 0;
if (state->block_state != ISAL_BLOCK_FINISH) {
state->total_out += state->tmp_out_valid - state->tmp_out_processed;
/* If space in tmp_out buffer, decompress into the tmp_out_buffer */
if (state->tmp_out_valid < 2 * ISAL_DEF_HIST_SIZE) {
/* Setup to start decoding into temp buffer */
state->next_out = &state->tmp_out_buffer[state->tmp_out_valid];
state->avail_out =
sizeof(state->tmp_out_buffer) - ISAL_LOOK_AHEAD -
state->tmp_out_valid;
if ((int32_t) state->avail_out < 0)
state->avail_out = 0;
/* Decode into internal buffer until exit */
while (state->block_state != ISAL_BLOCK_INPUT_DONE) {
if (state->block_state == ISAL_BLOCK_NEW_HDR
|| state->block_state == ISAL_BLOCK_HDR) {
ret = read_header_stateful(state);
if (ret)
break;
}
if (state->block_state == ISAL_BLOCK_TYPE0) {
ret = decode_literal_block(state);
} else
ret = decode_huffman_code_block_stateless(state);
if (ret)
break;
}
/* Copy valid data from internal buffer into out_buffer */
if (state->write_overflow_len != 0) {
*(uint32_t *) state->next_out = state->write_overflow_lits;
state->next_out += state->write_overflow_len;
state->total_out += state->write_overflow_len;
state->write_overflow_lits = 0;
state->write_overflow_len = 0;
}
if (state->copy_overflow_length != 0) {
byte_copy(state->next_out, state->copy_overflow_distance,
state->copy_overflow_length);
state->tmp_out_valid += state->copy_overflow_length;
state->next_out += state->copy_overflow_length;
state->total_out += state->copy_overflow_length;
state->copy_overflow_distance = 0;
state->copy_overflow_length = 0;
}
state->tmp_out_valid = state->next_out - state->tmp_out_buffer;
/* Setup state for decompressing into out_buffer */
state->next_out = start_out;
state->avail_out = avail_out;
}
/* Copy data from tmp_out buffer into out_buffer */
copy_size = state->tmp_out_valid - state->tmp_out_processed;
if (copy_size > avail_out)
copy_size = avail_out;
memcpy(state->next_out,
&state->tmp_out_buffer[state->tmp_out_processed], copy_size);
state->tmp_out_processed += copy_size;
state->avail_out -= copy_size;
state->next_out += copy_size;
if (ret == ISAL_INVALID_LOOKBACK || ret == ISAL_INVALID_BLOCK
|| ret == ISAL_INVALID_SYMBOL) {
/* Set total_out to not count data in tmp_out_buffer */
state->total_out -= state->tmp_out_valid - state->tmp_out_processed;
if (state->crc_flag)
update_checksum(state, start_out, state->next_out - start_out);
return ret;
}
/* If all data from tmp_out buffer has been processed, start
* decompressing into the out buffer */
if (state->tmp_out_processed == state->tmp_out_valid) {
while (state->block_state != ISAL_BLOCK_INPUT_DONE) {
if (state->block_state == ISAL_BLOCK_NEW_HDR
|| state->block_state == ISAL_BLOCK_HDR) {
ret = read_header_stateful(state);
if (ret)
break;
}
if (state->block_state == ISAL_BLOCK_TYPE0)
ret = decode_literal_block(state);
else
ret = decode_huffman_code_block_stateless(state);
if (ret)
break;
}
}
if (state->crc_flag)
update_checksum(state, start_out, state->next_out - start_out);
if (state->block_state != ISAL_BLOCK_INPUT_DONE
|| state->copy_overflow_length + state->write_overflow_len +
state->tmp_out_valid > sizeof(state->tmp_out_buffer)) {
/* Save decompression history in tmp_out buffer */
if (state->tmp_out_valid == state->tmp_out_processed
&& avail_out - state->avail_out >= ISAL_DEF_HIST_SIZE) {
memcpy(state->tmp_out_buffer,
state->next_out - ISAL_DEF_HIST_SIZE,
ISAL_DEF_HIST_SIZE);
state->tmp_out_valid = ISAL_DEF_HIST_SIZE;
state->tmp_out_processed = ISAL_DEF_HIST_SIZE;
} else if (state->tmp_out_processed >= ISAL_DEF_HIST_SIZE) {
shift_size = state->tmp_out_valid - ISAL_DEF_HIST_SIZE;
if (shift_size > state->tmp_out_processed)
shift_size = state->tmp_out_processed;
memmove(state->tmp_out_buffer,
&state->tmp_out_buffer[shift_size],
state->tmp_out_valid - shift_size);
state->tmp_out_valid -= shift_size;
state->tmp_out_processed -= shift_size;
}
}
/* Write overflow data into tmp buffer */
if (state->write_overflow_len != 0) {
*(uint32_t *) & state->tmp_out_buffer[state->tmp_out_valid] =
state->write_overflow_lits;
state->tmp_out_valid += state->write_overflow_len;
state->total_out += state->write_overflow_len;
state->write_overflow_lits = 0;
state->write_overflow_len = 0;
}
if (state->copy_overflow_length != 0) {
byte_copy(&state->tmp_out_buffer[state->tmp_out_valid],
state->copy_overflow_distance, state->copy_overflow_length);
state->tmp_out_valid += state->copy_overflow_length;
state->total_out += state->copy_overflow_length;
state->copy_overflow_distance = 0;
state->copy_overflow_length = 0;
}
if (ret == ISAL_INVALID_LOOKBACK || ret == ISAL_INVALID_BLOCK
|| ret == ISAL_INVALID_SYMBOL) {
state->total_out -= state->tmp_out_valid - state->tmp_out_processed;
return ret;
}
if (state->block_state == ISAL_BLOCK_INPUT_DONE
&& state->tmp_out_valid == state->tmp_out_processed) {
state->block_state = ISAL_BLOCK_FINISH;
if (state->crc_flag == ISAL_ZLIB
|| state->crc_flag == ISAL_ZLIB_NO_HDR)
finalize_adler32(state);
}
state->total_out -= state->tmp_out_valid - state->tmp_out_processed;
}
return ISAL_DECOMP_OK;
}
Reference in New Issue View Git Blame Copy Permalink