Lines Matching defs:len_limit
184 /// Calculate len_limit and determine if there is enough input to run
187 /// chain skip function doesn't need len_limit so a simpler code is used
190 uint32_t len_limit = mf_avail(mf); \
191 if (mf->nice_len <= len_limit) { \
192 len_limit = mf->nice_len; \
193 } else if (len_limit < (len_min) \
221 matches_count = func(len_limit, pos, cur, cur_match, mf->depth, \
237 /// \param len_limit Don't look for matches longer than len_limit.
249 const uint32_t len_limit,
273 while (++len != len_limit)
283 if (len == len_limit)
321 for ( ; len_best != len_limit; ++len_best)
329 if (len_best == len_limit) {
400 for ( ; len_best != len_limit; ++len_best)
406 if (len_best == len_limit) {
454 const uint32_t len_limit,
487 while (++len != len_limit)
497 if (len == len_limit) {
522 const uint32_t len_limit,
552 while (++len != len_limit)
556 if (len == len_limit) {
583 bt_skip_func(len_limit, pos, cur, cur_match, mf->depth, \
642 for ( ; len_best != len_limit; ++len_best)
650 if (len_best == len_limit) {
715 for ( ; len_best != len_limit; ++len_best)
721 if (len_best == len_limit) {