* to walk through the hash chain, until the special index `0' is reached,
* indicating the end of the hash chain.
*/
* to walk through the hash chain, until the special index `0' is reached,
* indicating the end of the hash chain.
*/
const u8 window[], uint str_pos, uint hash)
{
hash = update_hash(hash, window[str_pos + LZ_MIN_MATCH - 1]);
const u8 window[], uint str_pos, uint hash)
{
hash = update_hash(hash, window[str_pos + LZ_MIN_MATCH - 1]);
* @strstart: The index of the start of the string in the window that
* we are trying to find a match for.
* @prev_tab: The array of prev pointers for the hash table.
* @strstart: The index of the start of the string in the window that
* we are trying to find a match for.
* @prev_tab: The array of prev pointers for the hash table.
- * @cur_match: The index of the head of the hash chain for matches
- * having the hash value of the string beginning
+ * @cur_match: The index of the head of the hash chain for matches
+ * having the hash value of the string beginning
* beginning at (@strstart - 1).
* @match_start_ret: A location into which the index of the start of the
* match will be returned.
* beginning at (@strstart - 1).
* @match_start_ret: A location into which the index of the start of the
* match will be returned.
* Returns the length of the match that was found.
*/
static uint longest_match(const u8 window[], uint bytes_remaining,
* Returns the length of the match that was found.
*/
static uint longest_match(const u8 window[], uint bytes_remaining,
- uint strstart, const u16 prev_tab[],
- uint cur_match, uint prev_len,
- uint *match_start_ret,
+ uint strstart, const u16 prev_tab[],
+ uint cur_match, uint prev_len,
+ uint *match_start_ret,
* @record_literal: A function that will be called to produce the
* intermediate representation of a literal, given
* the character of the literal. This function
* @record_literal: A function that will be called to produce the
* intermediate representation of a literal, given
* the character of the literal. This function
* hash_head is set to the index of the previous string in the
* hash bucket, or 0 if there is no such string */
if (uncompressed_len - cur_input_pos >= params->min_match) {
* hash_head is set to the index of the previous string in the
* hash bucket, or 0 if there is no such string */
if (uncompressed_len - cur_input_pos >= params->min_match) {
* string of window index 0 (in particular we have to
* avoid a match of the string with itself at the start
* of the input file). */
* string of window index 0 (in particular we have to
* avoid a match of the string with itself at the start
* of the input file). */