Searched refs:ringbuffer_mask (Results 1 - 12 of 12) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dbackward_references.h30 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
H A Dbackward_references_hq.h28 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,
H A Dbackward_references_hq.c138 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 ||
135 ZopfliCostModelSetFromCommands(ZopfliCostModel * self,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,const Command * commands,size_t num_commands,size_t last_insert_len) argument
198 ZopfliCostModelSetFromLiteralCosts(ZopfliCostModel * self,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask) argument
402 UpdateNodes(const size_t num_bytes,const size_t block_start,const size_t pos,const uint8_t * ringbuffer,const size_t ringbuffer_mask,const BrotliEncoderParams * params,const size_t max_backward_limit,const int * starting_dist_cache,const size_t num_matches,const BackwardMatch * matches,const ZopfliCostModel * model,StartPosQueue * queue,ZopfliNode * nodes) argument
616 ZopfliIterate(size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,const BrotliEncoderParams * params,const size_t gap,const int * dist_cache,const ZopfliCostModel * model,const uint32_t * num_matches,const BackwardMatch * matches,ZopfliNode * nodes) argument
657 BrotliZopfliComputeShortestPath(MemoryManager * m,size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,ContextLut literal_context_lut,const BrotliEncoderParams * params,const int * dist_cache,Hasher * hasher,ZopfliNode * nodes) argument
722 BrotliCreateZopfliBackwardReferences(MemoryManager * m,size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,ContextLut literal_context_lut,const BrotliEncoderParams * params,Hasher * hasher,int * dist_cache,size_t * last_insert_len,Command * commands,size_t * num_commands,size_t * num_literals) argument
739 BrotliCreateHqZopfliBackwardReferences(MemoryManager * m,size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,ContextLut literal_context_lut,const BrotliEncoderParams * params,Hasher * hasher,int * dist_cache,size_t * last_insert_len,Command * commands,size_t * num_commands,size_t * num_literals) argument
[all...]
H A Dbackward_references_inc.h12 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,
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);
H A Dbackward_references.c124 size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask,
132 position, ringbuffer, ringbuffer_mask, \
123 BrotliCreateBackwardReferences(size_t num_bytes,size_t position,const uint8_t * ringbuffer,size_t ringbuffer_mask,ContextLut literal_context_lut,const BrotliEncoderParams * params,Hasher * hasher,int * dist_cache,size_t * last_insert_len,Command * commands,size_t * num_commands,size_t * num_literals) argument
H A Dhash_longest_match64_inc.h134 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);
H A Dhash_longest_match_inc.h130 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);
H A Dhash_longest_match_quickly_inc.h121 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);
H A Dhash_to_binary_tree_inc.h300 size_t ringbuffer_mask) {
321 FN(StoreAndFindMatches)(self, ringbuffer, i, ringbuffer_mask,
/xsrc/external/mit/brotli/dist/c/dec/
H A Dstate.h260 int ringbuffer_mask; member in struct:BrotliDecoderStateStruct
H A Dstate.c51 s->ringbuffer_mask = 0;
H A Ddecode.c1271 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];

Completed in 13 milliseconds