Home
last modified time | relevance | path

Searched refs:max_backward (Results 1 - 16 of 16) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in StoreAndFindMatches()
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in StoreAndFindMatches()
206 const size_t max_length, const size_t max_backward, in FindAllMatches()
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindAllMatches()
241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches()
274 const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1; in Store() local
276 max_backward, NULL, NULL); in Store()
314 const size_t max_backward = in StitchToPreviousBlock() local
322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in StitchToPreviousBlock()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
201 FindAllMatches( HashToBinaryTree* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const BrotliEncoderParams* params, BackwardMatch* matches) FindAllMatches() argument
H A Dhash_composite_inc.h114 const size_t max_length, const size_t max_backward, in FindLongestMatch()
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
109 FindLongestMatch( HashComposite* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_forgetful_chain_inc.h188 Does not look for matches further away than max_backward.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FindLongestMatch()
191 FindLongestMatch( HashForgetfulChain* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match64_inc.h159 Does not look for matches further away than max_backward.
167 const size_t max_length, const size_t max_backward, in FindLongestMatch()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
162 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match_inc.h155 Does not look for matches further away than max_backward.
163 const size_t max_length, const size_t max_backward, in FindLongestMatch()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
158 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match_quickly_inc.h144 Does not look for matches further away than max_backward.
152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
147 FindLongestMatch( HashLongestMatchQuickly* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash.h138 const uint8_t* data, size_t max_length, size_t max_backward, in TestStaticDictionaryItem()
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary()
192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
175 SearchInStaticDictionary( const BrotliEncoderDictionary* dictionary, HasherCommon* common, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out, BROTLI_BOOL shallow) SearchInStaticDictionary() argument
H A Dhash_rolling_inc.h155 const size_t max_length, const size_t max_backward, in FindLongestMatch()
183 if (backward <= max_backward) { in FindLongestMatch()
150 FindLongestMatch( HashRolling* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in StoreAndFindMatches()
146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in StoreAndFindMatches()
206 const size_t max_length, const size_t max_backward, in FindAllMatches()
221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindAllMatches()
241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FindAllMatches()
274 const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1; in Store() local
276 max_backward, NULL, NULL); in Store()
314 const size_t max_backward = in StitchToPreviousBlock() local
322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in StitchToPreviousBlock()
113 StoreAndFindMatches( HashToBinaryTree* BROTLI_RESTRICT self, const uint8_t* BROTLI_RESTRICT data, const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, BackwardMatch* BROTLI_RESTRICT matches) StoreAndFindMatches() argument
201 FindAllMatches( HashToBinaryTree* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const BrotliEncoderParams* params, BackwardMatch* matches) FindAllMatches() argument
H A Dhash_composite_inc.h114 const size_t max_length, const size_t max_backward, in FindLongestMatch()
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FindLongestMatch()
109 FindLongestMatch( HashComposite* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match_inc.h155 Does not look for matches further away than max_backward.
163 const size_t max_length, const size_t max_backward, in FindLongestMatch()
183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
158 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match_quickly_inc.h144 Does not look for matches further away than max_backward.
152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FindLongestMatch()
147 FindLongestMatch( HashLongestMatchQuickly* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_forgetful_chain_inc.h188 Does not look for matches further away than max_backward.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FindLongestMatch()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FindLongestMatch()
252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FindLongestMatch()
191 FindLongestMatch( HashForgetfulChain* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash_longest_match64_inc.h159 Does not look for matches further away than max_backward.
167 const size_t max_length, const size_t max_backward, in FindLongestMatch()
187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FindLongestMatch()
162 FindLongestMatch( HashLongestMatch* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument
H A Dhash.h138 const uint8_t* data, size_t max_length, size_t max_backward, in TestStaticDictionaryItem()
158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem()
178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary()
192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
136 TestStaticDictionaryItem( const BrotliEncoderDictionary* dictionary, size_t len, size_t word_idx, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out) TestStaticDictionaryItem() argument
175 SearchInStaticDictionary( const BrotliEncoderDictionary* dictionary, HasherCommon* common, const uint8_t* data, size_t max_length, size_t max_backward, size_t max_distance, HasherSearchResult* out, BROTLI_BOOL shallow) SearchInStaticDictionary() argument
H A Dhash_rolling_inc.h155 const size_t max_length, const size_t max_backward, in FindLongestMatch()
183 if (backward <= max_backward) { in FindLongestMatch()
150 FindLongestMatch( HashRolling* BROTLI_RESTRICT self, const BrotliEncoderDictionary* dictionary, const uint8_t* BROTLI_RESTRICT data, const size_t ring_buffer_mask, const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, const size_t max_length, const size_t max_backward, const size_t dictionary_distance, const size_t max_distance, HasherSearchResult* BROTLI_RESTRICT out) FindLongestMatch() argument

Completed in 12 milliseconds