32 	size_t max_len;  member
39 				   size_t max_len)  in get_match_len()  argument
43 	while (ptr + len < end && ptr[len] == prev[len] && ++len < max_len)  in get_match_len()
63 		if (ctx->max_len > 3)  in longest_match_std()
65 					      hash[0] + 3, ctx->max_len - 3);  in longest_match_std()
71 		if (ctx->max_len > 3)  in longest_match_std()
73 					      hash[1] + 3, ctx->max_len - 3);  in longest_match_std()
91 	size_t max_len;  in longest_match_best()  local
94 	if (ctx->unc >= src || !ctx->max_len)  in longest_match_best()
97 	max_len = 0;  in longest_match_best()
100 			get_match_len(src, ctx->unc_end, ptr, ctx->max_len);  in longest_match_best()
101 		if (len >= max_len) {  in longest_match_best()
102 			max_len = len;  in longest_match_best()
107 	return max_len >= 3 ? max_len : 0;  in longest_match_best()
161 	ctx->max_len = s_max_len[0];  in compress_chunk()
164 		size_t max_len;  in compress_chunk()  local
167 			ctx->max_len = s_max_len[++idx];  in compress_chunk()
170 		max_len = up + 3 <= unc_end ? (*match)(up, ctx) : 0;  in compress_chunk()
172 		if (!max_len) {  in compress_chunk()
179 			t16 = make_pair(up - ctx->best_match, max_len, idx);  in compress_chunk()
184 			up += max_len;  in compress_chunk()