unsigned len;
unsigned best_len = min_len - 1;
- if (unlikely(max_len < LZ_HASH_REQUIRED_NBYTES + 1)) {
+ if (unlikely(max_len < LZ_HASH3_REQUIRED_NBYTES + 1)) {
*best_len_ret = best_len;
return lz_matchptr;
}
*next_hash = bt_matchfinder_hash_3_bytes(in_next + 1);
cur_node = mf->hash_tab[hash];
mf->hash_tab[hash] = in_next - in_begin;
- prefetch(&mf->hash_tab[*next_hash]);
+ prefetchw(&mf->hash_tab[*next_hash]);
pending_lt_ptr = bt_left_child(mf, in_next - in_begin);
pending_gt_ptr = bt_right_child(mf, in_next - in_begin);
unsigned best_lt_len, best_gt_len;
unsigned len;
- if (unlikely(in_end - in_next < LZ_HASH_REQUIRED_NBYTES + 1))
+ if (unlikely(in_end - in_next < LZ_HASH3_REQUIRED_NBYTES + 1))
return;
hash = *next_hash;
*next_hash = bt_matchfinder_hash_3_bytes(in_next + 1);
cur_node = mf->hash_tab[hash];
mf->hash_tab[hash] = in_next - in_begin;
- prefetch(&mf->hash_tab[*next_hash]);
+ prefetchw(&mf->hash_tab[*next_hash]);
depth_remaining = max_search_depth;
pending_lt_ptr = bt_left_child(mf, in_next - in_begin);