Home
last modified time | relevance | path

Searched refs:BackwardMatch (Results 1 – 3 of 3) sorted by relevance

/external/brotli/c/enc/
Dhash.h220 typedef struct BackwardMatch { struct
223 } BackwardMatch; argument
225 static BROTLI_INLINE void InitBackwardMatch(BackwardMatch* self, in InitBackwardMatch()
231 static BROTLI_INLINE void InitDictionaryBackwardMatch(BackwardMatch* self, in InitDictionaryBackwardMatch()
238 static BROTLI_INLINE size_t BackwardMatchLength(const BackwardMatch* self) { in BackwardMatchLength()
242 static BROTLI_INLINE size_t BackwardMatchLengthCode(const BackwardMatch* self) { in BackwardMatchLengthCode()
Dhash_to_binary_tree_inc.h115 static BROTLI_INLINE BackwardMatch* FN(StoreAndFindMatches)( in FN()
119 BackwardMatch* BROTLI_RESTRICT matches) { in FN()
207 BackwardMatch* matches) { in FN()
208 BackwardMatch* const orig_matches = matches; in FN()
Dbackward_references_hq.c409 const BackwardMatch* matches, const ZopfliCostModel* model, in UpdateNodes()
506 BackwardMatch match = matches[j]; in UpdateNodes()
615 const BackwardMatch* matches, ZopfliNode* nodes) { in ZopfliIterate()
659 BackwardMatch matches[2 * (MAX_NUM_MATCHES_H10 + 64)]; in BrotliZopfliComputeShortestPath()
747 BackwardMatch* matches = BROTLI_ALLOC(m, BackwardMatch, matches_size); in BrotliCreateHqZopfliBackwardReferences()
759 BROTLI_ENSURE_CAPACITY(m, BackwardMatch, matches, matches_size, in BrotliCreateHqZopfliBackwardReferences()