Searched refs:prev_ix (Results 1 – 6 of 6) sorted by relevance
| /external/brotli/c/enc/ |
| D | hash_longest_match_quickly_inc.h | 143 size_t prev_ix = cur_ix - cached_backward; in FN() local
145 if (prev_ix < cur_ix) { in FN()
146 prev_ix &= (uint32_t)ring_buffer_mask; in FN()
147 if (compare_char == data[prev_ix + best_len]) { in FN()
148 size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
172 prev_ix = self->buckets_[key]; in FN()
174 backward = cur_ix - prev_ix; in FN()
175 prev_ix &= (uint32_t)ring_buffer_mask; in FN()
176 if (compare_char != data[prev_ix + best_len_in]) { in FN()
182 len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
[all …]
|
| D | hash_to_binary_tree_inc.h | 127 size_t prev_ix = self->buckets_[key]; in FN() local
145 const size_t backward = cur_ix - prev_ix; in FN()
146 const size_t prev_ix_masked = prev_ix & ring_buffer_mask; in FN()
170 forest[node_left] = forest[FN(LeftChildIndex)(self, prev_ix)]; in FN()
171 forest[node_right] = forest[FN(RightChildIndex)(self, prev_ix)]; in FN()
178 forest[node_left] = (uint32_t)prev_ix; in FN()
180 node_left = FN(RightChildIndex)(self, prev_ix); in FN()
181 prev_ix = forest[node_left]; in FN()
185 forest[node_right] = (uint32_t)prev_ix; in FN()
187 node_right = FN(LeftChildIndex)(self, prev_ix); in FN()
[all …]
|
| D | hash_longest_match64_inc.h | 182 size_t prev_ix = (size_t)(cur_ix - backward); in FN() local
183 if (prev_ix >= cur_ix) { in FN()
189 prev_ix &= ring_buffer_mask; in FN()
192 prev_ix + best_len > ring_buffer_mask || in FN()
193 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
197 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 …]
|
| D | hash_longest_match_inc.h | 175 size_t prev_ix = (size_t)(cur_ix - backward); in FN() local
176 if (prev_ix >= cur_ix) { in FN()
182 prev_ix &= ring_buffer_mask; in FN()
185 prev_ix + best_len > ring_buffer_mask || in FN()
186 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
190 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
219 size_t prev_ix = bucket[--i & self->block_mask_]; in FN() local
220 const size_t backward = cur_ix - prev_ix; in FN()
224 prev_ix &= ring_buffer_mask; in FN()
226 prev_ix + best_len > ring_buffer_mask || in FN()
[all …]
|
| D | hash_forgetful_chain_inc.h | 177 size_t prev_ix = (cur_ix - backward); in FN() local
179 if (i > 0 && self->tiny_hash[(uint16_t)prev_ix] != tiny_hash) continue; in FN()
180 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
183 prev_ix &= ring_buffer_mask; in FN()
185 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
210 size_t prev_ix; in FN() local
214 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
218 prev_ix + best_len > ring_buffer_mask || in FN()
219 data[cur_ix_masked + best_len] != data[prev_ix + best_len]) { in FN()
223 const size_t len = FindMatchLengthWithLimit(&data[prev_ix], in FN()
|
| D | backward_references_hq.c | 450 size_t prev_ix = cur_ix - backward; in UpdateNodes() local
462 if (prev_ix >= cur_ix) { in UpdateNodes()
466 prev_ix &= ringbuffer_mask; in UpdateNodes()
467 if (prev_ix + best_len > ringbuffer_mask || in UpdateNodes()
468 continuation != ringbuffer[prev_ix + best_len]) { in UpdateNodes()
471 len = FindMatchLengthWithLimit(&ringbuffer[prev_ix], in UpdateNodes()
|