Lines Matching defs:data2
1258 const Byte *data2;
1260 data2 = data - reps[i];
1261 if (data[0] != data2[0] || data[1] != data2[1])
1266 for (len = 2; len < numAvail && data[len] == data2[len]; len++)
1674 const Byte *data2 = data - reps[0];
1675 if (data[1] == data2[1] && data[2] == data2[2])
1681 for (len = 3; len < limit && data[len] == data2[len]; len++)
1728 const Byte *data2 = data - reps[repIndex];
1729 if (data[0] != data2[0] || data[1] != data2[1])
1732 for (len = 2; len < numAvail && data[len] == data2[len]; len++)
1775 if (data[len2 - 2] == data2[len2 - 2])
1776 if (data[len2 - 1] == data2[len2 - 1])
1783 data[len], data2[len], p->ProbPrices);
1792 for (; len2 < limit && data[len2] == data2[len2]; len2++)
1889 const Byte *data2 = data - dist - 1;
1897 if (data[len2 - 2] == data2[len2 - 2])
1898 if (data[len2 - 1] == data2[len2 - 1])
1900 for (; len2 < limit && data[len2] == data2[len2]; len2++)
1912 data[len], data2[len], p->ProbPrices);
1997 const Byte *data2 = data - p->reps[i];
1998 if (data[0] != data2[0] || data[1] != data2[1])
2000 for (len = 2; len < numAvail && data[len] == data2[len]; len++)
2076 const Byte *data2 = data - p->reps[i];
2077 if (data[0] != data2[0] || data[1] != data2[1])
2084 if (data[len] != data2[len])