Lines Matching full:start2
331 const BYTE* start2 = NULL;
355 ml2 = LZ4HC_InsertAndGetWiderMatch(ctx, ip + ml - 2, ip + 0, matchlimit, ml, &ref2, &start2, maxNbAttempts);
364 if (start2 < ip + ml0) { /* empirical */
372 if ((start2 - ip) < 3) { /* First Match too small : removed */
374 ip = start2;
385 if ((start2 - ip) < OPTIMAL_ML) {
389 if (ip+new_ml > start2 + ml2 - MINMATCH) new_ml = (int)(start2 - ip) + ml2 - MINMATCH;
390 correction = new_ml - (int)(start2 - ip);
392 start2 += correction;
397 /* Now, we have start2 = ip+new_ml, with new_ml = min(ml, OPTIMAL_ML=18) */
399 if (start2 + ml2 < mflimit)
400 ml3 = LZ4HC_InsertAndGetWiderMatch(ctx, start2 + ml2 - 3, start2, matchlimit, ml2, &ref3, &start3, maxNbAttempts);
405 if (start2 < ip+ml) ml = (int)(start2 - ip);
408 ip = start2;
415 if (start2 < ip+ml) {
416 int correction = (int)(ip+ml - start2);
417 start2 += correction;
421 start2 = start3;
432 start0 = start2;
438 start2 = start3;
448 if (start2 < ip+ml) {
449 if ((start2 - ip) < (int)ML_MASK) {
452 if (ip + ml > start2 + ml2 - MINMATCH) ml = (int)(start2 - ip) + ml2 - MINMATCH;
453 correction = ml - (int)(start2 - ip);
455 start2 += correction;
460 ml = (int)(start2 - ip);
465 ip = start2;
469 start2 = start3;
