989     const Byte *data2;  in GetOptimum()  local
991     data2 = data - (reps[i] + 1);  in GetOptimum()
992     if (data[0] != data2[0] || data[1] != data2[1])  in GetOptimum()
997     for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1292       const Byte *data2 = data - (reps[0] + 1);  in GetOptimum()  local
1297       for (temp = 1; temp < limit && data[temp] == data2[temp]; temp++);  in GetOptimum()
1335       const Byte *data2 = data - (reps[repIndex] + 1);  in GetOptimum()  local
1336       if (data[0] != data2[0] || data[1] != data2[1])  in GetOptimum()
1338       for (lenTest = 2; lenTest < numAvail && data[lenTest] == data2[lenTest]; lenTest++);  in GetOptimum()
1368           for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++);  in GetOptimum()
1378                     data[lenTest], data2[lenTest], p->ProbPrices);  in GetOptimum()
1452           const Byte *data2 = data - (curBack + 1);  in GetOptimum()  local
1458           for (; lenTest2 < limit && data[lenTest2] == data2[lenTest2]; lenTest2++);  in GetOptimum()
1467                     data[lenTest], data2[lenTest], p->ProbPrices);  in GetOptimum()
1535     const Byte *data2 = data - (p->reps[i] + 1);  in GetOptimumFast()  local
1536     if (data[0] != data2[0] || data[1] != data2[1])  in GetOptimumFast()
1538     for (len = 2; len < numAvail && data[len] == data2[len]; len++);  in GetOptimumFast()
1604     const Byte *data2 = data - (p->reps[i] + 1);  in GetOptimumFast()  local
1605     if (data[0] != data2[0] || data[1] != data2[1])  in GetOptimumFast()
1608     for (len = 2; len < limit && data[len] == data2[len]; len++);  in GetOptimumFast()