Searched refs:FindMatchLengthWithLimit (Results 1 - 12 of 12) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dfind_match_length.h21 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1, function in typeref:typename:BROTLI_INLINE size_t
51 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1,
H A Dhash_longest_match_quickly_inc.h170 const size_t len = FindMatchLengthWithLimit(
204 len = FindMatchLengthWithLimit(&data[prev_ix],
235 len = FindMatchLengthWithLimit(&data[prev_ix],
H A Dstatic_dict.c38 return FindMatchLengthWithLimit(&dictionary->data[offset], data,
53 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len);
59 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) ==
H A Dhash_forgetful_chain_inc.h224 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
262 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
H A Dhash_longest_match64_inc.h198 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
239 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
H A Dhash_longest_match_inc.h194 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
234 const size_t len = FindMatchLengthWithLimit(&data[prev_ix],
H A Dhash_to_binary_tree_inc.h158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len],
231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked],
H A Dhash_rolling_inc.h185 const size_t len = FindMatchLengthWithLimit(&data[found_ix_masked],
H A Dhash.h150 FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len);
H A Dcompress_fragment.c563 size_t matched = 5 + FindMatchLengthWithLimit(
623 size_t matched = 5 + FindMatchLengthWithLimit(
H A Dcompress_fragment_two_pass.c325 size_t matched = min_match + FindMatchLengthWithLimit(
390 size_t matched = min_match + FindMatchLengthWithLimit(
H A Dbackward_references_hq.c472 len = FindMatchLengthWithLimit(&ringbuffer[prev_ix],

Completed in 13 milliseconds