398
398
num_entries = (src->size - 1) / RABIN_WINDOW;
399
399
if (max_bytes_to_index > 0) {
401
401
if (num_entries > max_entries) {
402
402
/* Limit the max number of matching entries. This reduces the 'best'
403
403
* possible match, but means we don't consume all of ram.