Searched refs:prev2 (Results 1 – 12 of 12) sorted by relevance
54 h->prev2 = (unsigned short*)malloc(sizeof(*h->prev2) * window_size); in ZopfliInitHash()60 h->prev2[i] = i; in ZopfliInitHash()73 free(h->prev2); in ZopfliCleanHash()123 h->prev2[hpos] = h->head2[h->val2]; in ZopfliUpdateHash()125 else h->prev2[hpos] = hpos; in ZopfliUpdateHash()
39 unsigned short* prev2; /* Index to index of prev. occurance of same hash. */ member
337 hprev = h->prev2; in ZopfliFindLongestMatch()
361 ExeContext *prev2, *prev; in record_ExeContext_wrk2() local375 prev2 = NULL; in record_ExeContext_wrk2()390 prev2 = prev; in record_ExeContext_wrk2()400 if (prev2 != NULL && prev != NULL) { in record_ExeContext_wrk2()402 vg_assert(prev2->chain == prev); in record_ExeContext_wrk2()404 prev2->chain = list; in record_ExeContext_wrk2()408 else if (prev2 == NULL && prev != NULL) { in record_ExeContext_wrk2()
231 int prev2, prev, c; in usrc_writeArrayOfMostlyInvChars() local236 prev2=prev=-1; in usrc_writeArrayOfMostlyInvChars()245 (col>=24 && prev2>=0x20 && prev==0) || in usrc_writeArrayOfMostlyInvChars()256 prev2=prev; in usrc_writeArrayOfMostlyInvChars()
250 int prev2 = m_curTokenLen > 5 ? getChar(m_curTokenLen-2) : 0; in advance() local253 if (prev2 == '-' && prev1 == '-') in advance()
296 opus_val16 prev2; in anti_collapse() local301 prev2 = prev2logE[c*m->nbEBands+i]; in anti_collapse()305 prev2 = MAX16(prev2,prev2logE[m->nbEBands+i]); in anti_collapse()307 Ediff = EXTEND32(logE[c*m->nbEBands+i])-EXTEND32(MIN16(prev1,prev2)); in anti_collapse()
148 int prev2; member902 if (p->opt[cur].prev2) in Backward()1151 if (curOpt->prev2) in GetOptimum()1176 if (curOpt->prev1IsChar && curOpt->prev2) in GetOptimum()1301 opt->prev2 = False; in GetOptimum()1380 opt->prev2 = True; in GetOptimum()1469 opt->prev2 = True; in GetOptimum()
149 int prev2; member903 if (p->opt[cur].prev2) in Backward()1152 if (curOpt->prev2) in GetOptimum()1177 if (curOpt->prev1IsChar && curOpt->prev2) in GetOptimum()1302 opt->prev2 = False; in GetOptimum()1381 opt->prev2 = True; in GetOptimum()1470 opt->prev2 = True; in GetOptimum()
3053 + int prev2;3807 + if (p->opt[cur].prev2)4056 + if (curOpt->prev2)4081 + if (curOpt->prev1IsChar && curOpt->prev2)4206 + opt->prev2 = False;4285 + opt->prev2 = True;4374 + opt->prev2 = True;