Home
last modified time | relevance | path

Searched refs:cur_ix_masked (Results 1 – 7 of 7) sorted by relevance

/external/brotli/c/enc/
Dhash_longest_match_quickly_inc.h136 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
137 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
138 int compare_char = data[cur_ix_masked + best_len_in]; in FN()
149 &data[cur_ix_masked], in FN()
159 compare_char = data[cur_ix_masked + best_len]; in FN()
183 &data[cur_ix_masked], in FN()
209 &data[cur_ix_masked], in FN()
219 compare_char = data[cur_ix_masked + best_len]; in FN()
226 handle, &data[cur_ix_masked], max_length, max_backward + gap, in FN()
Dhash_to_binary_tree_inc.h120 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
125 const uint32_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
159 FindMatchLengthWithLimit(&data[cur_ix_masked + cur_len], in FN()
163 0 == memcmp(&data[cur_ix_masked], &data[prev_ix_masked], len)); in FN()
175 if (data[cur_ix_masked + len] > data[prev_ix_masked + len]) { in FN()
209 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
224 if (data[cur_ix_masked] != data[prev_ix] || in FN()
225 data[cur_ix_masked + 1] != data[prev_ix + 1]) { in FN()
230 FindMatchLengthWithLimit(&data[prev_ix], &data[cur_ix_masked], in FN()
248 &data[cur_ix_masked], minlen, max_length, &dict_matches[0])) { in FN()
Dhash_longest_match64_inc.h171 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
191 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
193 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
198 &data[cur_ix_masked], in FN()
220 &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 handle, &data[cur_ix_masked], max_length, max_backward + gap, in FN()
Dhash_longest_match_inc.h164 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
184 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
186 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
191 &data[cur_ix_masked], in FN()
213 FN(HashBytes)(&data[cur_ix_masked], self->hash_shift_); in FN()
225 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
227 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
232 &data[cur_ix_masked], in FN()
254 handle, &data[cur_ix_masked], max_length, max_backward + gap, in FN()
Dhash_forgetful_chain_inc.h164 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
170 const size_t key = FN(HashBytes)(&data[cur_ix_masked]); in FN()
186 &data[cur_ix_masked], in FN()
217 if (cur_ix_masked + best_len > ring_buffer_mask || in FN()
219 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
224 &data[cur_ix_masked], in FN()
245 handle, &data[cur_ix_masked], max_length, max_backward + gap, in FN()
Dhash_rolling_inc.h162 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN() local
190 &data[cur_ix_masked], in FN()
Dbackward_references_hq.c412 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes() local
452 uint8_t continuation = ringbuffer[cur_ix_masked + best_len]; in UpdateNodes()
453 if (cur_ix_masked + best_len > ringbuffer_mask) { in UpdateNodes()
472 &ringbuffer[cur_ix_masked], in UpdateNodes()