Lines Matching full:ml
577 int ml0, ml, ml2, ml3; in LZ4HC_compress_hashChain() local
593 …ml = LZ4HC_InsertAndFindBestMatch(ctx, ip, matchlimit, &ref, maxNbAttempts, patternAnalysis, dict); in LZ4HC_compress_hashChain()
594 if (ml<MINMATCH) { ip++; continue; } in LZ4HC_compress_hashChain()
597 start0 = ip; ref0 = ref; ml0 = ml; in LZ4HC_compress_hashChain()
600 if (ip+ml <= mflimit) { in LZ4HC_compress_hashChain()
602 ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2, in LZ4HC_compress_hashChain()
605 ml2 = ml; in LZ4HC_compress_hashChain()
608 if (ml2 == ml) { /* No better match => encode ML1 */ in LZ4HC_compress_hashChain()
610 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
616 ip = start0; ref = ref0; ml = ml0; /* restore initial ML1 */ in LZ4HC_compress_hashChain()
621 ml = ml2; in LZ4HC_compress_hashChain()
633 int new_ml = ml; in LZ4HC_compress_hashChain()
643 /* Now, we have start2 = ip+new_ml, with new_ml = min(ml, OPTIMAL_ML=18) */ in LZ4HC_compress_hashChain()
654 /* ip & ref are known; Now for ml */ in LZ4HC_compress_hashChain()
655 if (start2 < ip+ml) ml = (int)(start2 - ip); in LZ4HC_compress_hashChain()
658 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
662 ml = ml2; in LZ4HC_compress_hashChain()
669 if (start3 < ip+ml+3) { /* Not enough space for match 2 : remove it */ in LZ4HC_compress_hashChain()
670 …if (start3 >= (ip+ml)) { /* can write Seq1 immediately ==> Seq2 is removed, so Seq3 becomes Seq1 … in LZ4HC_compress_hashChain()
671 if (start2 < ip+ml) { in LZ4HC_compress_hashChain()
672 int correction = (int)(ip+ml - start2); in LZ4HC_compress_hashChain()
684 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
687 ml = ml3; in LZ4HC_compress_hashChain()
704 * ip & ref are known; Now decide ml. in LZ4HC_compress_hashChain()
706 if (start2 < ip+ml) { in LZ4HC_compress_hashChain()
709 if (ml > OPTIMAL_ML) ml = OPTIMAL_ML; in LZ4HC_compress_hashChain()
710 if (ip + ml > start2 + ml2 - MINMATCH) ml = (int)(start2 - ip) + ml2 - MINMATCH; in LZ4HC_compress_hashChain()
711 correction = ml - (int)(start2 - ip); in LZ4HC_compress_hashChain()
718 ml = (int)(start2 - ip); in LZ4HC_compress_hashChain()
722 … if (LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, limit, oend)) goto _dest_overflow; in LZ4HC_compress_hashChain()
725 ip = start2; ref = ref2; ml = ml2; in LZ4HC_compress_hashChain()
768 /* Assumption : ip, anchor, ml and ref must be set correctly */ in LZ4HC_compress_hashChain()
779 assert(maxMlSize < INT_MAX); assert(ml >= 0); in LZ4HC_compress_hashChain()
780 if ((size_t)ml > maxMlSize) ml = (int)maxMlSize; in LZ4HC_compress_hashChain()
781 if ((oend + LASTLITERALS) - (op + ll_totalCost + 2) - 1 + ml >= MFLIMIT) { in LZ4HC_compress_hashChain()
782 LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ref, notLimited, oend); in LZ4HC_compress_hashChain()
1481 int ml = MINMATCH; in LZ4HC_compress_optimal() local
1484 for ( ; ml <= matchML ; ml++) { in LZ4HC_compress_optimal()
1485 int const pos = cur + ml; in LZ4HC_compress_optimal()
1494 + LZ4HC_sequencePrice(ll, ml); in LZ4HC_compress_optimal()
1497 price = opt[cur].price + LZ4HC_sequencePrice(0, ml); in LZ4HC_compress_optimal()
1504 pos, price, ml); in LZ4HC_compress_optimal()
1506 if ( (ml == matchML) /* last pos of last match */ in LZ4HC_compress_optimal()
1509 opt[pos].mlen = ml; in LZ4HC_compress_optimal()
1553 int const ml = opt[rPos].mlen; in LZ4HC_compress_optimal() local
1555 …if (ml == 1) { ip++; rPos++; continue; } /* literal; note: can end up with several literals, in w… in LZ4HC_compress_optimal()
1556 rPos += ml; in LZ4HC_compress_optimal()
1557 assert(ml >= MINMATCH); in LZ4HC_compress_optimal()
1560 …if ( LZ4HC_encodeSequence(UPDATABLE(ip, op, anchor), ml, ip - offset, limit, oend) ) { /* updates… in LZ4HC_compress_optimal()
1561 ovml = ml; in LZ4HC_compress_optimal()
1619 …DEBUGLOG(6, "Space to end : %i + ml (%i)", (int)((oend + LASTLITERALS) - (op + ll_totalCost + 2) -… in LZ4HC_compress_optimal()