FindMatchLengthWithLimit (reference) in projects: third_party

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

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

/third_party/node/deps/brotli/c/enc/
H A D	find_match_length.h	`21 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1, in FindMatchLengthWithLimit() function 51 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1, in FindMatchLengthWithLimit() function`
H A D	hash_longest_match_quickly_inc.h	`170 const size_t len = FindMatchLengthWithLimit( in FindLongestMatch() 204 len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 235 len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	static_dict.c	`38 return FindMatchLengthWithLimit(&dictionary->data[offset], data, in DictMatchLength() 53 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len); in IsMatch() 59 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) == in IsMatch()`
H A D	hash_to_binary_tree_inc.h	`158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in StoreAndFindMatches() 231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FindAllMatches()`
H A D	hash_forgetful_chain_inc.h	`224 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 262 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_longest_match64_inc.h	`198 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 239 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_longest_match_inc.h	`194 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 234 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_rolling_inc.h	`185 const size_t len = FindMatchLengthWithLimit(&data[found_ix_masked], in FindLongestMatch()`
H A D	compress_fragment.c	`563 size_t matched = 5 + FindMatchLengthWithLimit( in BrotliCompressFragmentFastImpl() 623 size_t matched = 5 + FindMatchLengthWithLimit( in BrotliCompressFragmentFastImpl()`
H A D	compress_fragment_two_pass.c	`325 size_t matched = min_match + FindMatchLengthWithLimit( in CreateCommands() 390 size_t matched = min_match + FindMatchLengthWithLimit( in CreateCommands()`
H A D	hash.h	`150 FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len); in TestStaticDictionaryItem()`
H A D	backward_references_hq.c	`472 len = FindMatchLengthWithLimit(&ringbuffer[prev_ix], in UpdateNodes()`
/third_party/skia/third_party/externals/brotli/c/enc/
H A D	find_match_length.h	`21 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1, in FindMatchLengthWithLimit() function 51 static BROTLI_INLINE size_t FindMatchLengthWithLimit(const uint8_t* s1, in FindMatchLengthWithLimit() function`
H A D	hash_longest_match_quickly_inc.h	`170 const size_t len = FindMatchLengthWithLimit( in FindLongestMatch() 204 len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 235 len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	static_dict.c	`38 return FindMatchLengthWithLimit(&dictionary->data[offset], data, in DictMatchLength() 53 TO_BROTLI_BOOL(FindMatchLengthWithLimit(dict, data, w.len) == w.len); in IsMatch() 59 FindMatchLengthWithLimit(&dict[1], &data[1], w.len - 1u) == in IsMatch()`
H A D	hash_to_binary_tree_inc.h	`158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in StoreAndFindMatches() 231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FindAllMatches()`
H A D	hash_longest_match_inc.h	`194 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 234 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_forgetful_chain_inc.h	`224 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 262 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_longest_match64_inc.h	`198 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch() 239 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FindLongestMatch()`
H A D	hash_rolling_inc.h	`185 const size_t len = FindMatchLengthWithLimit(&data[found_ix_masked], in FindLongestMatch()`
H A D	compress_fragment.c	`563 size_t matched = 5 + FindMatchLengthWithLimit( in BrotliCompressFragmentFastImpl() 623 size_t matched = 5 + FindMatchLengthWithLimit( in BrotliCompressFragmentFastImpl()`
H A D	compress_fragment_two_pass.c	`325 size_t matched = min_match + FindMatchLengthWithLimit( in CreateCommands() 390 size_t matched = min_match + FindMatchLengthWithLimit( in CreateCommands()`
H A D	hash.h	`150 FindMatchLengthWithLimit(data, &dictionary->words->data[offset], len); in TestStaticDictionaryItem()`
H A D	backward_references_hq.c	`472 len = FindMatchLengthWithLimit(&ringbuffer[prev_ix], in UpdateNodes()`

Completed in 22 milliseconds