• Home
  • Raw
  • Download

Lines Matching refs:ml

573     int   ml0, ml, ml2, ml3;  in LZ4HC_compress_hashChain()  local
589ml = LZ4HC_InsertAndFindBestMatch(ctx, ip, matchlimit, &ref, maxNbAttempts, patternAnalysis, dict); in LZ4HC_compress_hashChain()
590 if (ml<MINMATCH) { ip++; continue; } in LZ4HC_compress_hashChain()
593 start0 = ip; ref0 = ref; ml0 = ml; in LZ4HC_compress_hashChain()
596 if (ip+ml <= mflimit) { in LZ4HC_compress_hashChain()
598 ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2, in LZ4HC_compress_hashChain()
601 ml2 = ml; in LZ4HC_compress_hashChain()
604 if (ml2 == ml) { /* No better match => encode ML1 */ in LZ4HC_compress_hashChain()
606 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
612 ip = start0; ref = ref0; ml = ml0; /* restore initial ML1 */ in LZ4HC_compress_hashChain()
617 ml = ml2; in LZ4HC_compress_hashChain()
629 int new_ml = ml; in LZ4HC_compress_hashChain()
651 if (start2 < ip+ml) ml = (int)(start2 - ip); in LZ4HC_compress_hashChain()
654 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
658 ml = ml2; in LZ4HC_compress_hashChain()
665 if (start3 < ip+ml+3) { /* Not enough space for match 2 : remove it */ in LZ4HC_compress_hashChain()
666 …if (start3 >= (ip+ml)) { /* can write Seq1 immediately ==> Seq2 is removed, so Seq3 becomes Seq1 … in LZ4HC_compress_hashChain()
667 if (start2 < ip+ml) { in LZ4HC_compress_hashChain()
668 int correction = (int)(ip+ml - start2); in LZ4HC_compress_hashChain()
680 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
683 ml = ml3; in LZ4HC_compress_hashChain()
702 if (start2 < ip+ml) { in LZ4HC_compress_hashChain()
705 if (ml > OPTIMAL_ML) ml = OPTIMAL_ML; in LZ4HC_compress_hashChain()
706 if (ip + ml > start2 + ml2 - MINMATCH) ml = (int)(start2 - ip) + ml2 - MINMATCH; in LZ4HC_compress_hashChain()
707 correction = ml - (int)(start2 - ip); in LZ4HC_compress_hashChain()
714 ml = (int)(start2 - ip); in LZ4HC_compress_hashChain()
718 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
721 ip = start2; ref = ref2; ml = ml2; in LZ4HC_compress_hashChain()
775 assert(maxMlSize < INT_MAX); assert(ml >= 0); in LZ4HC_compress_hashChain()
776 if ((size_t)ml > maxMlSize) ml = (int)maxMlSize; in LZ4HC_compress_hashChain()
777 if ((oend + LASTLITERALS) - (op + ll_totalCost + 2) - 1 + ml >= MFLIMIT) { in LZ4HC_compress_hashChain()
778 LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, notLimited, oend); in LZ4HC_compress_hashChain()
1465 int ml = MINMATCH; in LZ4HC_compress_optimal() local
1468 for ( ; ml <= matchML ; ml++) { in LZ4HC_compress_optimal()
1469 int const pos = cur + ml; in LZ4HC_compress_optimal()
1478 + LZ4HC_sequencePrice(ll, ml); in LZ4HC_compress_optimal()
1481 price = opt[cur].price + LZ4HC_sequencePrice(0, ml); in LZ4HC_compress_optimal()
1488 pos, price, ml); in LZ4HC_compress_optimal()
1490 if ( (ml == matchML) /* last pos of last match */ in LZ4HC_compress_optimal()
1493 opt[pos].mlen = ml; in LZ4HC_compress_optimal()
1537 int const ml = opt[rPos].mlen; in LZ4HC_compress_optimal() local
1539 …if (ml == 1) { ip++; rPos++; continue; } /* literal; note: can end up with several literals, in w… in LZ4HC_compress_optimal()
1540 rPos += ml; in LZ4HC_compress_optimal()
1541 assert(ml >= MINMATCH); in LZ4HC_compress_optimal()
1544 …if ( LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ip - offset, limit, oend) ) { /* updates… in LZ4HC_compress_optimal()
1545 ovml = ml; in LZ4HC_compress_optimal()