/third_party/node/deps/brotli/c/enc/ |
D | hash_to_binary_tree_inc.h | 116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in FN() 146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in FN() 206 const size_t max_length, const size_t max_backward, in FN() 221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FN() 274 const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1; in FN() local 276 max_backward, NULL, NULL); in FN() 314 const size_t max_backward = in FN() local 322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in FN()
|
D | hash_composite_inc.h | 114 const size_t max_length, const size_t max_backward, in FN() 118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN() 121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN()
|
D | hash.h | 138 const uint8_t* data, size_t max_length, size_t max_backward, in TestStaticDictionaryItem() argument 158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem() 178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary() argument 192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
|
D | hash_longest_match_quickly_inc.h | 152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN() 201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN() 232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
|
D | hash_longest_match64_inc.h | 167 const size_t max_length, const size_t max_backward, in FN() 187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
|
D | hash_longest_match_inc.h | 163 const size_t max_length, const size_t max_backward, in FN() 183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
|
D | hash_forgetful_chain_inc.h | 196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN() 219 if (prev_ix >= cur_ix || backward > max_backward) { in FN() 252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FN()
|
D | hash_rolling_inc.h | 155 const size_t max_length, const size_t max_backward, in FN() 183 if (backward <= max_backward) { in FN()
|
/third_party/skia/third_party/externals/brotli/c/enc/ |
D | hash_to_binary_tree_inc.h | 116 const size_t max_backward, size_t* const BROTLI_RESTRICT best_len, in FN() 146 if (backward == 0 || backward > max_backward || depth_remaining == 0) { in FN() 206 const size_t max_length, const size_t max_backward, in FN() 221 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 241 ring_buffer_mask, max_length, max_backward, &best_len, matches); in FN() 274 const size_t max_backward = self->window_mask_ - BROTLI_WINDOW_GAP + 1; in FN() local 276 max_backward, NULL, NULL); in FN() 314 const size_t max_backward = in FN() local 322 MAX_TREE_COMP_LENGTH, max_backward, NULL, NULL); in FN()
|
D | hash_composite_inc.h | 114 const size_t max_length, const size_t max_backward, in FN() 118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN() 121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN()
|
D | hash.h | 138 const uint8_t* data, size_t max_length, size_t max_backward, in TestStaticDictionaryItem() argument 158 backward = max_backward + 1 + word_idx + in TestStaticDictionaryItem() 178 size_t max_backward, size_t max_distance, in SearchInStaticDictionary() argument 192 max_length, max_backward, max_distance, out); in SearchInStaticDictionary()
|
D | hash_longest_match_quickly_inc.h | 152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN() 201 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN() 232 if (BROTLI_PREDICT_FALSE(backward == 0 || backward > max_backward)) { in FN()
|
D | hash_longest_match_inc.h | 163 const size_t max_length, const size_t max_backward, in FN() 183 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 224 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
|
D | hash_longest_match64_inc.h | 167 const size_t max_length, const size_t max_backward, in FN() 187 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN() 229 if (BROTLI_PREDICT_FALSE(backward > max_backward)) { in FN()
|
D | hash_forgetful_chain_inc.h | 196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN() 219 if (prev_ix >= cur_ix || backward > max_backward) { in FN() 252 if (backward > max_backward || (CAPPED_CHAINS && !delta)) break; in FN()
|
D | hash_rolling_inc.h | 155 const size_t max_length, const size_t max_backward, in FN() 183 if (backward <= max_backward) { in FN()
|