Lines Matching defs:cur
1374 int cur, last_match_pos = 0;
1429 for (cur = 1; cur < last_match_pos; cur++) {
1430 const BYTE* const curPtr = ip + cur;
1435 cur, opt[cur].price, opt[cur+1].price, cur+1);
1438 if ( (opt[cur+1].price <= opt[cur].price)
1440 && (opt[cur+MINMATCH].price < opt[cur].price + 3/*min seq price*/) )
1444 if (opt[cur+1].price <= opt[cur].price) continue;
1447 DEBUGLOG(7, "search at rPos:%u", cur);
1452 newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dict, favorDecSpeed);
1456 || (newMatch.len + cur >= LZ4_OPT_NUM) ) {
1460 last_match_pos = cur + 1;
1465 { int const baseLitlen = opt[cur].litlen;
1468 int const price = opt[cur].price - LZ4HC_literalsPrice(baseLitlen) + LZ4HC_literalsPrice(baseLitlen+litlen);
1469 int const pos = cur + litlen;
1479 /* set prices using match at position = cur */
1483 assert(cur + newMatch.len < LZ4_OPT_NUM);
1485 int const pos = cur + ml;
1491 if (opt[cur].mlen == 1) {
1492 ll = opt[cur].litlen;
1493 price = ((cur > ll) ? opt[cur - ll].price : 0)
1497 price = opt[cur].price + LZ4HC_sequencePrice(0, ml);
1523 } /* for (cur = 1; cur <= last_match_pos; cur++) */
1528 cur = last_match_pos - best_mlen;
1530 encode: /* cur, last_match_pos, best_mlen, best_off must be set */
1531 assert(cur < LZ4_OPT_NUM);
1534 { int candidate_pos = cur;