| /third_party/node/deps/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
158 int compare_char = data[cur_ix_masked + best_len_in]; in FN()
159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
171 &data[prev_ix], &data[cur_ix_masked], max_length); in FN()
184 compare_char = data[cur_ix_masked + len]; in FN()
205 &data[cur_ix_masked], in FN()
236 &data[cur_ix_masked], in FN()
243 compare_char = data[cur_ix_masked + len]; in FN()
253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_to_binary_tree_inc.h | 118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in FN()
162 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len)); in FN()
174 if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) { in FN()
210 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
225 if (data[cur_ix_masked] != data[prev_ix] || in FN()
226 data[cur_ix_masked + 1] != data[prev_ix + 1]) { in FN()
231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FN()
249 &data[cur_ix_masked], minlen, max_length, &dict_matches[0])) { in FN()
|
| D | hash_longest_match_inc.h | 168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
195 &data[cur_ix_masked], in FN()
217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FN()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
230 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
235 &data[cur_ix_masked], in FN()
257 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_longest_match64_inc.h | 172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
199 &data[cur_ix_masked], in FN()
221 &data[cur_ix_masked], self->hash_mask_, self->hash_shift_); in FN()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
240 &data[cur_ix_masked], in FN()
262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_forgetful_chain_inc.h | 203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
225 &data[cur_ix_masked], in FN()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
263 &data[cur_ix_masked], in FN()
284 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_rolling_inc.h | 158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
186 &data[cur_ix_masked], in FN()
|
| D | backward_references_hq.c | 411 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/ |
| D | hash_longest_match_quickly_inc.h | 157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
158 int compare_char = data[cur_ix_masked + best_len_in]; in FN()
159 size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
171 &data[prev_ix], &data[cur_ix_masked], max_length); in FN()
184 compare_char = data[cur_ix_masked + len]; in FN()
205 &data[cur_ix_masked], in FN()
236 &data[cur_ix_masked], in FN()
243 compare_char = data[cur_ix_masked + len]; in FN()
253 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_to_binary_tree_inc.h | 118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
123 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
158 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in FN()
162 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len)); in FN()
174 if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) { in FN()
210 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
225 if (data[cur_ix_masked] != data[prev_ix] || in FN()
226 data[cur_ix_masked + 1] != data[prev_ix + 1]) { in FN()
231 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FN()
249 &data[cur_ix_masked], minlen, max_length, &dict_matches[0])) { in FN()
|
| D | hash_longest_match_inc.h | 168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
188 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
195 &data[cur_ix_masked], in FN()
217 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FN()
228 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
230 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
235 &data[cur_ix_masked], in FN()
257 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_longest_match64_inc.h | 172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
192 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
199 &data[cur_ix_masked], in FN()
221 &data[cur_ix_masked], self->hash_mask_, self->hash_shift_); in FN()
233 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
235 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
240 &data[cur_ix_masked], in FN()
262 self->common_, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_forgetful_chain_inc.h | 203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
209 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
225 &data[cur_ix_masked], in FN()
256 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
263 &data[cur_ix_masked], in FN()
284 self->common, &data[cur_ix_masked], max_length, dictionary_distance, in FN()
|
| D | hash_rolling_inc.h | 158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
186 &data[cur_ix_masked], in FN()
|
| D | backward_references_hq.c | 411 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()
|