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

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

Completed in 6 milliseconds