HomeSort by relevance Sort by last modified time
    Searched refs:ZOPFLI_MAX_MATCH (Results 1 - 3 of 3) sorted by null

  /external/zopfli/src/zopfli/
util.h 32 #define ZOPFLI_MAX_MATCH 258
107 character more than a multiple of ZOPFLI_MAX_MATCH times. This should not affect
squeeze.c 248 ZOPFLI_MAX_MATCH characters before and after our position. */
249 if (h->same[i & ZOPFLI_WINDOW_MASK] > ZOPFLI_MAX_MATCH * 2
250 && i > instart + ZOPFLI_MAX_MATCH + 1
251 && i + ZOPFLI_MAX_MATCH * 2 + 1 < inend
252 && h->same[(i - ZOPFLI_MAX_MATCH) & ZOPFLI_WINDOW_MASK]
253 > ZOPFLI_MAX_MATCH) {
254 double symbolcost = costmodel(ZOPFLI_MAX_MATCH, 1, costcontext);
255 /* Set the length to reach each one to ZOPFLI_MAX_MATCH, and the cost to
257 ZOPFLI_MAX_MATCH values to avoid calling ZopfliFindLongestMatch. */
258 for (k = 0; k < ZOPFLI_MAX_MATCH; k++)
    [all...]
lz77.c 174 (*limit == ZOPFLI_MAX_MATCH || s->lmc->length[lmcpos] <= *limit ||
186 if (*limit == ZOPFLI_MAX_MATCH && *length >= ZOPFLI_MIN_MATCH) {
219 if (s->lmc && limit == ZOPFLI_MAX_MATCH && sublen && !cache_available) {
258 assert(limit <= ZOPFLI_MAX_MATCH);
399 ZopfliFindLongestMatch(s, h, in, i, inend, ZOPFLI_MAX_MATCH, dummysublen,
410 if (lengthscore >= ZOPFLI_MIN_MATCH && leng < ZOPFLI_MAX_MATCH) {
432 else if (lengthscore >= ZOPFLI_MIN_MATCH && leng < ZOPFLI_MAX_MATCH) {

Completed in 25 milliseconds