Microoptimise in hash_search.

This commit is contained in:
Con Kolivas 2012-12-31 15:02:49 +11:00
parent e1fd5d6d11
commit 6f0410d28f

6
rzip.c
View file

@ -633,10 +633,9 @@ static inline bool hash_search(rzip_control *control, struct rzip_state *st,
} }
while (p < end) { while (p < end) {
i64 reverse, mlen, offset = 0; i64 reverse, mlen, offset;
p++; sb->offset_search = ++p;
sb->offset_search = p;
if (unlikely(sb->offset_search > sb->offset_low + sb->size_low)) if (unlikely(sb->offset_search > sb->offset_low + sb->size_low))
remap_low_sb(control, &control->sb); remap_low_sb(control, &control->sb);
@ -665,6 +664,7 @@ static inline bool hash_search(rzip_control *control, struct rzip_state *st,
if ((t & st->minimum_tag_mask) != st->minimum_tag_mask) if ((t & st->minimum_tag_mask) != st->minimum_tag_mask)
continue; continue;
offset = 0;
mlen = find_best_match(control, st, t, p, end, &offset, &reverse); mlen = find_best_match(control, st, t, p, end, &offset, &reverse);
/* Only insert occasionally into hash. */ /* Only insert occasionally into hash. */