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

/xsrc/external/mit/brotli/dist/c/enc/
H A Dhash_to_binary_tree_inc.h112 This function must be called with increasing cur_ix positions. */
115 const size_t cur_ix, const size_t ring_buffer_mask, const size_t max_length,
118 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
129 size_t node_left = FN(LeftChildIndex)(self, cur_ix);
132 size_t node_right = FN(RightChildIndex)(self, cur_ix);
141 buckets[key] = (uint32_t)cur_ix;
144 const size_t backward = cur_ix - prev_ix;
194 /* Finds all backward matches of &data[cur_ix & ring_buffer_mask] up to the
195 length of max_length and stores the position cur_ix in the hash table.
205 const size_t ring_buffer_mask, const size_t cur_ix,
[all...]
H A Dhash_longest_match_quickly_inc.h139 /* Find a longest backward match of &data[cur_ix & ring_buffer_mask]
140 up to the length of max_length and stores the position cur_ix in the
152 const size_t cur_ix, const size_t max_length, const size_t max_backward,
157 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
165 size_t prev_ix = cur_ix - cached_backward;
167 if (prev_ix < cur_ix) {
179 buckets[key] = (uint32_t)cur_ix;
195 buckets[key] = (uint32_t)cur_ix;
196 backward = cur_ix - prev_ix;
222 key_out = keys[(cur_ix
[all...]
H A Dhash_rolling_inc.h154 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
158 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
161 if ((cur_ix & (JUMP - 1)) != 0) return;
166 for (pos = self->next_ix; pos <= cur_ix; pos += JUMP) {
179 if (pos == cur_ix && found_ix != FN(kInvalidPos)) {
181 if cur_ix is above 4GB, despite using 32-bit values in the table. */
182 size_t backward = (uint32_t)(cur_ix - found_ix);
202 self->next_ix = cur_ix + JUMP;
H A Dhash_forgetful_chain_inc.h180 /* Find a longest backward match of &data[cur_ix] up to the length of
181 max_length and stores the position cur_ix in the hash table.
196 const size_t cur_ix, const size_t max_length, const size_t max_backward,
203 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
216 size_t prev_ix = (cur_ix - backward);
219 if (prev_ix >= cur_ix || backward > max_backward) {
246 size_t delta = cur_ix - addr[key];
253 prev_ix = (cur_ix - backward) & ring_buffer_mask;
280 FN(Store)(self, data, ring_buffer_mask, cur_ix);
H A Dhash_longest_match64_inc.h151 /* Find a longest backward match of &data[cur_ix] up to the length of
152 max_length and stores the position cur_ix in the hash table.
166 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
172 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
183 size_t prev_ix = (size_t)(cur_ix - backward);
184 if (prev_ix >= cur_ix) {
228 const size_t backward = cur_ix - prev_ix;
257 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;
H A Dhash_longest_match_inc.h147 /* Find a longest backward match of &data[cur_ix] up to the length of
148 max_length and stores the position cur_ix in the hash table.
162 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
168 const size_t cur_ix_masked = cur_ix & ring_buffer_mask;
179 size_t prev_ix = (size_t)(cur_ix - backward);
180 if (prev_ix >= cur_ix) {
223 const size_t backward = cur_ix - prev_ix;
252 bucket[num[key] & self->block_mask_] = (uint32_t)cur_ix;
H A Dhash_composite_inc.h113 const int* BROTLI_RESTRICT distance_cache, const size_t cur_ix,
118 distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
121 distance_cache, cur_ix, max_length, max_backward, dictionary_distance,
H A Dbackward_references_hq.c410 const size_t cur_ix = block_start + pos; local in function:UpdateNodes
411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask;
412 const size_t max_distance = BROTLI_MIN(size_t, cur_ix, max_backward_limit);
414 cur_ix + stream_offset, max_backward_limit);
451 size_t prev_ix = cur_ix - backward;
463 if (prev_ix >= cur_ix) {

Completed in 8 milliseconds