Home
last modified time | relevance | path

Searched refs:cur_ix (Results 1 – 8 of 8) sorted by relevance

/external/brotli/c/enc/
Dhash_to_binary_tree_inc.h117 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in FN()
120 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
130 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in FN()
133 size_t node_right = FN(RightChildIndex)(self, cur_ix); in FN()
142 self->buckets_[key] = (uint32_t)cur_ix; in FN()
145 const size_t backward = cur_ix - prev_ix; in FN()
204 const size_t ring_buffer_mask, const size_t cur_ix, in FN()
209 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
213 size_t stop = cur_ix - short_match_max_backward; in FN()
216 if (cur_ix < short_match_max_backward) { stop = 0; } in FN()
[all …]
Dhash_longest_match_quickly_inc.h131 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN()
136 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
143 size_t prev_ix = cur_ix - cached_backward; in FN()
145 if (prev_ix < cur_ix) { in FN()
161 self->buckets_[key] = (uint32_t)cur_ix; in FN()
173 self->buckets_[key] = (uint32_t)cur_ix; in FN()
174 backward = cur_ix - prev_ix; in FN()
199 const size_t backward = cur_ix - prev_ix; in FN()
229 self->buckets_[key + ((cur_ix >> 3) % BUCKET_SWEEP)] = (uint32_t)cur_ix; in FN()
Dhash_rolling_inc.h157 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
162 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
165 if ((cur_ix & (JUMP - 1)) != 0) return; in FN()
170 for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) { in FN()
183 if (pos == cur_ix && found_ix != FN(kInvalidPos)) { in FN()
186 size_t backward = (uint32_t)(cur_ix - found_ix); in FN()
206 self->next_ix = cur_ix + JUMP; in FN()
Dhash_forgetful_chain_inc.h160 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN()
164 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
177 size_t prev_ix = (cur_ix - backward); in FN()
180 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
207 size_t delta = cur_ix - self->addr[key]; in FN()
214 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
241 FN(Store)(handle, data, ring_buffer_mask, cur_ix); in FN()
Dhash_longest_match64_inc.h163 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
171 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
182 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
183 if (prev_ix >= cur_ix) { in FN()
228 const size_t backward = cur_ix - prev_ix; in FN()
257 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FN()
Dhash_longest_match_inc.h156 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
164 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
175 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
176 if (prev_ix >= cur_ix) { in FN()
220 const size_t backward = cur_ix - prev_ix; in FN()
249 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FN()
Dhash_composite_inc.h123 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
129 distance_cache, cur_ix, max_length, max_backward, gap, in FN()
132 distance_cache, cur_ix, max_length, max_backward, gap, in FN()
Dbackward_references_hq.c411 const size_t cur_ix = block_start + pos; in UpdateNodes() local
412 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes()
413 const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit); in UpdateNodes()
450 size_t prev_ix = cur_ix - backward; in UpdateNodes()
462 if (prev_ix >= cur_ix) { in UpdateNodes()