Searched refs:lenBest (Results 1 – 2 of 2) sorted by relevance
113 int lenBest = 0; in getMatches() local120 lenBest = 2; in getMatches()132 lenBest = 3; in getMatches()139 while (lenBest < matchLenLimit && buf[readPos + lenBest - delta2] in getMatches()140 == buf[readPos + lenBest]) in getMatches()141 ++lenBest; in getMatches()143 matches.len[matches.count - 1] = lenBest; in getMatches()147 if (lenBest >= niceLenLimit) in getMatches()153 if (lenBest < 3) in getMatches()154 lenBest = 3; in getMatches()[all …]
95 int lenBest = 0; in getMatches() local102 lenBest = 2; in getMatches()114 lenBest = 3; in getMatches()121 while (lenBest < matchLenLimit && buf[readPos + lenBest - delta2] in getMatches()122 == buf[readPos + lenBest]) in getMatches()123 ++lenBest; in getMatches()125 matches.len[matches.count - 1] = lenBest; in getMatches()129 if (lenBest >= niceLenLimit) { in getMatches()137 if (lenBest < 3) in getMatches()138 lenBest = 3; in getMatches()[all …]