Home
last modified time | relevance | path

Searched refs:prev_ix (Results 1 – 6 of 6) sorted by relevance

/external/brotli/c/enc/
Dhash_to_binary_tree_inc.h126 size_t prev_ix = buckets[key]; in FN() local
144 const size_t backward = cur_ix - prev_ix; in FN()
145 const size_t prev_ix_masked = prev_ix & ring_buffer_mask; in FN()
169 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in FN()
170 forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)]; in FN()
177 forest[node_left] = (uint32_t)prev_ix; in FN()
179 node_left = FN(RightChildIndex)(self, prev_ix); in FN()
180 prev_ix = forest[node_left]; in FN()
184 forest[node_right] = (uint32_t)prev_ix; in FN()
186 node_right = FN(LeftChildIndex)(self, prev_ix); in FN()
[all …]
Dhash_longest_match_quickly_inc.h165 size_t prev_ix = cur_ix - cached_backward; in FN() local
167 if (prev_ix < cur_ix) { in FN()
168 prev_ix &= (uint32_t)ring_buffer_mask; in FN()
169 if (compare_char == data[prev_ix + best_len]) { in FN()
171 &data[prev_ix], &data[cur_ix_masked], max_length); in FN()
194 prev_ix = buckets[key]; in FN()
196 backward = cur_ix - prev_ix; in FN()
197 prev_ix &= (uint32_t)ring_buffer_mask; in FN()
198 if (compare_char != data[prev_ix + best_len_in]) { in FN()
204 len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
[all …]
Dhash_longest_match64_inc.h183 size_t prev_ix = (size_t)(cur_ix - backward); in FN() local
184 if (prev_ix >= cur_ix) { in FN()
190 prev_ix &= ring_buffer_mask; in FN()
193 prev_ix + best_len > ring_buffer_mask || in FN()
194 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
198 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
227 size_t prev_ix = bucket[--i & self->block_mask_]; in FN() local
228 const size_t backward = cur_ix - prev_ix; in FN()
232 prev_ix &= ring_buffer_mask; in FN()
234 prev_ix + best_len > ring_buffer_mask || in FN()
[all …]
Dhash_longest_match_inc.h179 size_t prev_ix = (size_t)(cur_ix - backward); in FN() local
180 if (prev_ix >= cur_ix) { in FN()
186 prev_ix &= ring_buffer_mask; in FN()
189 prev_ix + best_len > ring_buffer_mask || in FN()
190 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
194 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
222 size_t prev_ix = bucket[--i & self->block_mask_]; in FN() local
223 const size_t backward = cur_ix - prev_ix; in FN()
227 prev_ix &= ring_buffer_mask; in FN()
229 prev_ix + best_len > ring_buffer_mask || in FN()
[all …]
Dhash_forgetful_chain_inc.h216 size_t prev_ix = (cur_ix - backward); in FN() local
218 if (i > 0 && tiny_hashes[(uint16_t)prev_ix] != tiny_hash) continue; in FN()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
222 prev_ix &= ring_buffer_mask; in FN()
224 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
249 size_t prev_ix; in FN() local
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
257 prev_ix + best_len > ring_buffer_mask || in FN()
258 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
262 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
Dbackward_references_hq.c451 size_t prev_ix = cur_ix - backward; in UpdateNodes() local
463 if (prev_ix >= cur_ix) { in UpdateNodes()
467 prev_ix &= ringbuffer_mask; in UpdateNodes()
468 if (prev_ix + best_len > ringbuffer_mask || in UpdateNodes()
469 continuation != ringbuffer[prev_ix + best_len]) { in UpdateNodes()
472 len = FindMatchLengthWithLimit(&ringbuffer[prev_ix], in UpdateNodes()