Searched refs:hasher (Results 1 - 11 of 11) sorted by relevance

/xsrc/external/mit/brotli/dist/c/enc/
H A Dhash.h39 /* False if hasher needs to be "prepared" before use. */
393 static BROTLI_INLINE void HasherInit(Hasher* hasher) { argument
394 hasher->common.extra = NULL;
397 static BROTLI_INLINE void DestroyHasher(MemoryManager* m, Hasher* hasher) { argument
398 if (hasher->common.extra == NULL) return;
399 BROTLI_FREE(m, hasher->common.extra);
402 static BROTLI_INLINE void HasherReset(Hasher* hasher) { argument
403 hasher->common.is_prepared_ = BROTLI_FALSE;
408 switch (params->hasher.type) {
420 static BROTLI_INLINE void HasherSetup(MemoryManager* m, Hasher* hasher, argument
465 InitOrStitchToPreviousBlock(MemoryManager * m,Hasher * hasher,const uint8_t * data,size_t mask,BrotliEncoderParams * params,size_t position,size_t input_size,BROTLI_BOOL is_last) argument
[all...]
H A Dbackward_references.h32 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
H A Dbackward_references_hq.h30 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
37 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
H A Dparams.h41 BrotliHasherParams hasher; member in struct:BrotliEncoderParams
H A Dbackward_references.c126 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
128 switch (params->hasher.type) {
133 literal_context_lut, params, hasher, dist_cache, \
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 Dbackward_references_hq.c660 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes) {
687 num_matches = FindAllMatchesH10(&hasher->privat._H10,
704 /* Add the tail of the copy to the hasher. */
705 StoreRangeH10(&hasher->privat._H10,
725 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
732 dist_cache, hasher, nodes);
742 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
779 num_found_matches = FindAllMatchesH10(&hasher->privat._H10,
796 /* Add the tail of the copy to the hasher. */
797 StoreRangeH10(&hasher
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.h14 Hasher* hasher, int* dist_cache, size_t* last_insert_len,
16 HASHER()* privat = &hasher->privat.FN(_);
108 Depending on the hasher implementation, it can push all positions
H A Dhash_longest_match64_inc.h99 size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;
100 size_t block_size = (size_t)1 << params->hasher.block_bits;
H A Dhash_longest_match_inc.h98 size_t bucket_size = (size_t)1 << params->hasher.bucket_bits;
99 size_t block_size = (size_t)1 << params->hasher.block_bits;
H A Dencode.c1073 BROTLI_DCHECK(s->params.hasher.type == 10);
1081 BROTLI_DCHECK(s->params.hasher.type == 10);
1233 Hasher hasher; local in function:BrotliCompressBufferQuality10
1234 HasherInit(&hasher);
1251 InitOrStitchToPreviousBlock(m, &hasher, input_buffer, mask, &params,
1283 StitchToPreviousBlockH10(&hasher.privat._H10, block_size, block_start,
1286 input_buffer, mask, literal_context_lut, &params, dist_cache, &hasher,
1418 DestroyHasher(m, &hasher);
/xsrc/external/mit/MesaLib/dist/src/gtest/include/gtest/internal/
H A Dgtest-internal.h901 // The heuristic used is that the type contains an inner type `hasher` and does
908 static char test(typename U::hasher*, typename U::reverse_iterator*);
910 static int test(typename U::hasher*, ...);

Completed in 11 milliseconds