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

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

Completed in 6 milliseconds