Home
last modified time | relevance | path

Searched refs:cur_ix_masked (Results 1 - 14 of 14) sorted by relevance

/third_party/node/deps/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in StoreAndFindMatches() local
123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in StoreAndFindMatches()
158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in StoreAndFindMatches()
162 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len)); in StoreAndFindMatches()
174 if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) { in StoreAndFindMatches()
210 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindAllMatches() local
225 if (data[cur_ix_masked] != data[prev_ix] || in FindAllMatches()
226 data[cur_ix_masked + 1] != data[prev_ix + 1]) { in FindAllMatches()
231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FindAllMatches()
249 &data[cur_ix_masked], minle in FindAllMatches()
[all...]
H A Dhash_longest_match64_inc.h172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
199 &data[cur_ix_masked], in FindLongestMatch()
221 &data[cur_ix_masked], self->hash_mask_, self->hash_shift_); in FindLongestMatch()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
240 &data[cur_ix_masked], in FindLongestMatch()
262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_longest_match_inc.h168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
195 &data[cur_ix_masked], in FindLongestMatch()
217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FindLongestMatch()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
230 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
235 &data[cur_ix_masked], in FindLongestMatch()
257 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_longest_match_quickly_inc.h157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
158 int compare_char = data[cur_ix_masked + best_len_in]; in FindLongestMatch()
159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
171 &data[prev_ix], &data[cur_ix_masked], max_length); in FindLongestMatch()
184 compare_char = data[cur_ix_masked + len]; in FindLongestMatch()
205 &data[cur_ix_masked], in FindLongestMatch()
236 &data[cur_ix_masked], in FindLongestMatch()
243 compare_char = data[cur_ix_masked + len]; in FindLongestMatch()
253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_forgetful_chain_inc.h203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
225 &data[cur_ix_masked], in FindLongestMatch()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
263 &data[cur_ix_masked], in FindLongestMatch()
284 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_rolling_inc.h158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
186 &data[cur_ix_masked], in FindLongestMatch()
H A Dbackward_references_hq.c411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes() local
453 uint8_t continuation = ringbuffer[cur_ix_masked + best_len]; in UpdateNodes()
454 if (cur_ix_masked + best_len > ringbuffer_mask) { in UpdateNodes()
473 &ringbuffer[cur_ix_masked], in UpdateNodes()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_to_binary_tree_inc.h118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in StoreAndFindMatches() local
123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in StoreAndFindMatches()
158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in StoreAndFindMatches()
162 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len)); in StoreAndFindMatches()
174 if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) { in StoreAndFindMatches()
210 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindAllMatches() local
225 if (data[cur_ix_masked] != data[prev_ix] || in FindAllMatches()
226 data[cur_ix_masked + 1] != data[prev_ix + 1]) { in FindAllMatches()
231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FindAllMatches()
249 &data[cur_ix_masked], minle in FindAllMatches()
[all...]
H A Dhash_longest_match_inc.h168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
195 &data[cur_ix_masked], in FindLongestMatch()
217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FindLongestMatch()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
230 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
235 &data[cur_ix_masked], in FindLongestMatch()
257 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_longest_match_quickly_inc.h157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
158 int compare_char = data[cur_ix_masked + best_len_in]; in FindLongestMatch()
159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
171 &data[prev_ix], &data[cur_ix_masked], max_length); in FindLongestMatch()
184 compare_char = data[cur_ix_masked + len]; in FindLongestMatch()
205 &data[cur_ix_masked], in FindLongestMatch()
236 &data[cur_ix_masked], in FindLongestMatch()
243 compare_char = data[cur_ix_masked + len]; in FindLongestMatch()
253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_longest_match64_inc.h172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
199 &data[cur_ix_masked], in FindLongestMatch()
221 &data[cur_ix_masked], self->hash_mask_, self->hash_shift_); in FindLongestMatch()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
240 &data[cur_ix_masked], in FindLongestMatch()
262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_forgetful_chain_inc.h203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FindLongestMatch()
225 &data[cur_ix_masked], in FindLongestMatch()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FindLongestMatch()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FindLongestMatch()
263 &data[cur_ix_masked], in FindLongestMatch()
284 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FindLongestMatch()
H A Dhash_rolling_inc.h158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FindLongestMatch() local
186 &data[cur_ix_masked], in FindLongestMatch()
H A Dbackward_references_hq.c411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes() local
453 uint8_t continuation = ringbuffer[cur_ix_masked + best_len]; in UpdateNodes()
454 if (cur_ix_masked + best_len > ringbuffer_mask) { in UpdateNodes()
473 &ringbuffer[cur_ix_masked], in UpdateNodes()

Completed in 12 milliseconds