48 static size_t longest_match_std(const u8 *src, struct lznt *ctx)  in longest_match_std()  argument
55 		((40543U * ((((src[0] << 4) ^ src[1]) << 4) ^ src[2])) >> 4) &  in longest_match_std()
60 	if (hash[0] >= ctx->unc && hash[0] < src && hash[0][0] == src[0] &&  in longest_match_std()
61 	    hash[0][1] == src[1] && hash[0][2] == src[2]) {  in longest_match_std()
64 			len1 += get_match_len(src + 3, ctx->unc_end,  in longest_match_std()
68 	if (hash[1] >= ctx->unc && hash[1] < src && hash[1][0] == src[0] &&  in longest_match_std()
69 	    hash[1][1] == src[1] && hash[1][2] == src[2]) {  in longest_match_std()
72 			len2 += get_match_len(src + 3, ctx->unc_end,  in longest_match_std()
85 	hash[0] = src;  in longest_match_std()
89 static size_t longest_match_best(const u8 *src, struct lznt *ctx)  in longest_match_best()  argument
94 	if (ctx->unc >= src || !ctx->max_len)  in longest_match_best()
98 	for (ptr = ctx->unc; ptr < src; ++ptr) {  in longest_match_best()
100 			get_match_len(src, ctx->unc_end, ptr, ctx->max_len);  in longest_match_best()
319 	size_t (*match)(const u8 *src, struct lznt *ctx);  in compress_lznt()