| /xsrc/external/mit/brotli/dist/c/enc/ |
| backward_references.h | 30 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
|
| backward_references_hq.h | 28 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
35 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
82 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
|
| backward_references_hq.c | 138 size_t ringbuffer_mask,
166 histogram_literal[ringbuffer[(pos + j) & ringbuffer_mask]]++;
191 cost_literal[ringbuffer[(position + i) & ringbuffer_mask]];
201 size_t ringbuffer_mask) {
208 BrotliEstimateBitCostsForLiterals(position, num_bytes, ringbuffer_mask,
404 const uint8_t* ringbuffer, const size_t ringbuffer_mask,
411 const size_t cur_ix_masked = cur_ix & ringbuffer_mask;
454 if (cur_ix_masked + best_len > ringbuffer_mask) {
467 prev_ix &= ringbuffer_mask;
468 if (prev_ix + best_len > ringbuffer_mask ||
[all...] |
| backward_references_inc.h | 12 const uint8_t* ringbuffer, size_t ringbuffer_mask,
51 ringbuffer, ringbuffer_mask, dist_cache, position, max_length,
70 ringbuffer, ringbuffer_mask, dist_cache, position + 1, max_length, local
118 FN(StoreRange)(privat, ringbuffer, ringbuffer_mask, range_start,
144 FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
153 FN(Store)(privat, ringbuffer, ringbuffer_mask, position);
|
| backward_references.c | 124 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
132 position, ringbuffer, ringbuffer_mask, \
|
| hash_longest_match64_inc.h | 134 size_t ringbuffer_mask) {
139 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
140 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
141 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
|
| hash_longest_match_inc.h | 130 size_t ringbuffer_mask) {
135 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
136 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
137 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
|
| hash_longest_match_quickly_inc.h | 121 const uint8_t* ringbuffer, size_t ringbuffer_mask) {
126 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 3);
127 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 2);
128 FN(Store)(self, ringbuffer, ringbuffer_mask, position - 1);
|
| hash_to_binary_tree_inc.h | 300 size_t ringbuffer_mask) {
321 FN(StoreAndFindMatches)(self, ringbuffer, i, ringbuffer_mask,
|
| /xsrc/external/mit/brotli/dist/c/dec/ |
| state.h | 260 int ringbuffer_mask; member in struct:BrotliDecoderStateStruct
|
| state.c | 51 s->ringbuffer_mask = 0;
|
| decode.c | 1271 s->ringbuffer + (s->partial_pos_out & (size_t)s->ringbuffer_mask);
1349 s->ringbuffer_mask = s->new_ringbuffer_size - 1;
1825 uint8_t p1 = s->ringbuffer[(pos - 1) & s->ringbuffer_mask];
1826 uint8_t p2 = s->ringbuffer[(pos - 2) & s->ringbuffer_mask];
1856 BROTLI_LOG_ARRAY_INDEX(s->ringbuffer, pos & s->ringbuffer_mask);
1956 int src_start = (pos - s->distance_code) & s->ringbuffer_mask;
2001 s->ringbuffer[(pos - s->distance_code) & s->ringbuffer_mask];
|
