/* Near-optimal parsing */
xpress_params->choose_items_func = xpress_choose_items_near_optimal;
- if (max_window_size >= 32768)
+ if (max_window_size >= 16384)
xpress_params->mf_algo = LZ_MF_BINARY_TREES;
else
xpress_params->mf_algo = LZ_MF_HASH_CHAINS;
mf_params->nice_match_len = xpress_params->nice_match_length;
}
-static inline bool
-xpress_window_size_valid(size_t window_size)
-{
- return (window_size > 0 && window_size <= XPRESS_MAX_OFFSET + 1);
-}
-
static void
xpress_free_compressor(void *_c);
u64 size = 0;
struct xpress_compressor_params params;
- if (!xpress_window_size_valid(max_window_size))
+ if (max_window_size > XPRESS_MAX_OFFSET + 1)
return 0;
xpress_build_params(compression_level, max_window_size, ¶ms);
struct xpress_compressor_params params;
struct lz_mf_params mf_params;
- if (!xpress_window_size_valid(max_window_size))
+ if (max_window_size > XPRESS_MAX_OFFSET + 1)
return WIMLIB_ERR_INVALID_PARAM;
xpress_build_params(compression_level, max_window_size, ¶ms);