1188          int cur, last_match_pos = 0;  in LZ4HC_compress_optimal()  local
1228          last_match_pos = firstMatch.len;  in LZ4HC_compress_optimal()
1231                  opt[last_match_pos+addLit].mlen = 1; /* literal */  in LZ4HC_compress_optimal()
1232                  opt[last_match_pos+addLit].off = 0;  in LZ4HC_compress_optimal()
1233                  opt[last_match_pos+addLit].litlen = addLit;  in LZ4HC_compress_optimal()
1234 …        opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit);  in LZ4HC_compress_optimal()
1236                              last_match_pos+addLit, opt[last_match_pos+addLit].price, addLit);  in LZ4HC_compress_optimal()
1240          for (cur = 1; cur < last_match_pos; cur++) {  in LZ4HC_compress_optimal()
1263 …newMatch = LZ4HC_FindLongerMatch(ctx, curPtr, matchlimit, last_match_pos - cur, nbSearches, dict, …  in LZ4HC_compress_optimal()
1271                  last_match_pos = cur + 1;  in LZ4HC_compress_optimal()
1301                                  pos, last_match_pos);  in LZ4HC_compress_optimal()
1312                      if (pos > last_match_pos+TRAILING_LITERALS  in LZ4HC_compress_optimal()
1318                            && (last_match_pos < pos) )  in LZ4HC_compress_optimal()
1319                              last_match_pos = pos;  in LZ4HC_compress_optimal()
1328                      opt[last_match_pos+addLit].mlen = 1; /* literal */  in LZ4HC_compress_optimal()
1329                      opt[last_match_pos+addLit].off = 0;  in LZ4HC_compress_optimal()
1330                      opt[last_match_pos+addLit].litlen = addLit;  in LZ4HC_compress_optimal()
1331 …        opt[last_match_pos+addLit].price = opt[last_match_pos].price + LZ4HC_literalsPrice(addLit);  in LZ4HC_compress_optimal()
1332 …DEBUGLOG(7, "rPos:%3i => price:%3i (litlen=%i)", last_match_pos+addLit, opt[last_match_pos+addLit]…  in LZ4HC_compress_optimal()
1336          best_mlen = opt[last_match_pos].mlen;  in LZ4HC_compress_optimal()
1337          best_off = opt[last_match_pos].off;  in LZ4HC_compress_optimal()
1338          cur = last_match_pos - best_mlen;  in LZ4HC_compress_optimal()
1342          assert(last_match_pos >= 1);  /* == 1 when only one candidate */  in LZ4HC_compress_optimal()
1343 …   DEBUGLOG(6, "reverse traversal, looking for shortest path (last_match_pos=%i)", last_match_pos);  in LZ4HC_compress_optimal()
1362              while (rPos < last_match_pos) {  in LZ4HC_compress_optimal()