Lines Matching defs:cur
33 if (hv) match, then cur[0] and cur[1] also match
35 #define HASH2_CALC hv = GetUi16(cur);
41 if (cur[0]) and (h2) match, then cur[1] also match
42 if (cur[0]) and (hv) match, then cur[1] and cur[2] also match
45 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
47 hv = (temp ^ ((UInt32)cur[2] << 8)) & p->hashMask; }
50 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
52 temp ^= ((UInt32)cur[2] << 8); \
54 hv = (temp ^ (p->crc[cur[3]] << kLzHash_CrcShift_1)) & p->hashMask; }
57 UInt32 temp = p->crc[cur[0]] ^ cur[1]; \
59 temp ^= ((UInt32)cur[2] << 8); \
61 temp ^= (p->crc[cur[3]] << kLzHash_CrcShift_1); \
63 hv = (temp ^ (p->crc[cur[4]] << kLzHash_CrcShift_2)) & p->hashMask; }
65 #define HASH_ZIP_CALC hv = ((cur[2] | ((UInt32)cur[0] << 8)) ^ p->crc[cur[1]]) & 0xFFFF;
873 static UInt32 * Hc_GetMatchesSpec(size_t lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
885 const Byte *pb = cur - delta;
887 if (pb[maxLen] == cur[maxLen] && *pb == *cur)
891 if (pb[len] != cur[len])
906 const Byte *lim = cur + lenLimit;
923 if (cur[maxLen] == cur[(ptrdiff_t)maxLen + diff])
925 const Byte *c = cur;
930 d[0] = (UInt32)(lim - cur);
936 const unsigned len = (unsigned)(c - cur);
955 UInt32 * GetMatchesSpec1(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
977 const Byte *pb = cur - delta;
980 if (pb[len] == cur[len])
982 if (++len != lenLimit && pb[len] == cur[len])
984 if (pb[len] != cur[len])
999 if (pb[len] < cur[len])
1025 static void SkipMatchesSpec(UInt32 lenLimit, UInt32 curMatch, UInt32 pos, const Byte *cur, CLzRef *son,
1045 const Byte *pb = cur - delta;
1047 if (pb[len] == cur[len])
1050 if (pb[len] != cur[len])
1061 if (pb[len] < cur[len])
1106 unsigned lenLimit; UInt32 hv; const Byte *cur; UInt32 curMatch; \
1108 cur = p->buffer;
1131 const Byte *c = cur + maxLen; \
1132 const Byte *lim = cur + lenLimit; \
1134 maxLen = (unsigned)(c - cur); }
1185 if (d2 < mmm && *(cur - d2) == *cur)
1229 if (d2 < mmm && *(cur - d2) == *cur)
1234 if (*(cur - d2 + 2) == cur[2])
1238 else if (d3 < mmm && *(cur - d3) == *cur)
1247 else if (d3 < mmm && *(cur - d3) == *cur)
1299 if (d2 < mmm && *(cur - d2) == *cur)
1304 if (*(cur - d2 + 2) == cur[2])
1307 else if (d3 < mmm && *(cur - d3) == *cur)
1316 else if (d3 < mmm && *(cur - d3) == *cur)
1326 if (*(cur - d2 + 3) != cur[3])
1369 if (d2 < mmm && *(cur - d2) == *cur)
1374 if (*(cur - d2 + 2) == cur[2])
1378 else if (d3 < mmm && *(cur - d3) == *cur)
1387 else if (d3 < mmm && *(cur - d3) == *cur)
1439 if (d2 < mmm && *(cur - d2) == *cur)
1444 if (*(cur - d2 + 2) == cur[2])
1447 else if (d3 < mmm && *(cur - d3) == *cur)
1456 else if (d3 < mmm && *(cur - d3) == *cur)
1466 if (*(cur - d2 + 3) != cur[3])
1565 const Byte *cur; \
1576 cur = p->buffer; \
1584 cur++; pos++; *son++ = curMatch; \
1586 p->buffer = cur; \