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.h115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length, in FN()
118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
129 size_t node_left = FN(LeftChildIndex)(self, cur_ix); in FN()
132 size_t node_right = FN(RightChildIndex)(self, cur_ix); in FN()
141 buckets[key] = (uint32_t)cur_ix; in FN()
144 const size_t backward = cur_ix - prev_ix; in FN()
205 const size_t ring_buffer_mask, const size_t cur_ix, in FN()
210 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
214 size_t stop = cur_ix - short_match_max_backward; in FN()
217 if (cur_ix < short_match_max_backward) { stop = 0; } in FN()
[all …]
Dhash_longest_match_quickly_inc.h152 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN()
157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
165 size_t prev_ix = cur_ix - cached_backward; in FN()
167 if (prev_ix < cur_ix) { in FN()
179 buckets[key] = (uint32_t)cur_ix; in FN()
195 buckets[key] = (uint32_t)cur_ix; in FN()
196 backward = cur_ix - prev_ix; in FN()
222 key_out = keys[(cur_ix & BUCKET_SWEEP_MASK) >> 3]; in FN()
227 backward = cur_ix - prev_ix; in FN()
257 buckets[key_out] = (uint32_t)cur_ix; in FN()
Dhash_rolling_inc.h154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
161 if ((cur_ix & (JUMP - 1)) != 0) return; in FN()
166 for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) { in FN()
179 if (pos == cur_ix && found_ix != FN(kInvalidPos)) { in FN()
182 size_t backward = (uint32_t)(cur_ix - found_ix); in FN()
202 self->next_ix = cur_ix + JUMP; in FN()
Dhash_forgetful_chain_inc.h196 const size_t cur_ix, const size_t max_length, const size_t max_backward, in FN()
203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
216 size_t prev_ix = (cur_ix - backward); in FN()
219 if (prev_ix >= cur_ix || backward > max_backward) { in FN()
246 size_t delta = cur_ix - addr[key]; in FN()
253 prev_ix = (cur_ix - backward) & ring_buffer_mask; in FN()
280 FN(Store)(self, data, ring_buffer_mask, cur_ix); in FN()
Dhash_longest_match64_inc.h166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
183 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
184 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.h162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask; in FN()
179 size_t prev_ix = (size_t)(cur_ix - backward); in FN()
180 if (prev_ix >= cur_ix) { in FN()
223 const size_t backward = cur_ix - prev_ix; in FN()
252 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix; in FN()
Dhash_composite_inc.h113 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix, in FN()
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN()
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance, in FN()
Dbackward_references_hq.c410 const size_t cur_ix = block_start + pos; in UpdateNodes() local
411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask; in UpdateNodes()
412 const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit); in UpdateNodes()
414 cur_ix + stream_offset, max_backward_limit); in UpdateNodes()
451 size_t prev_ix = cur_ix - backward; in UpdateNodes()
463 if (prev_ix >= cur_ix) { in UpdateNodes()