Lines Matching refs:scan

1152     register Bytef *scan = s->window + s->strstart; /* current string */  in longest_match()  local
1170 register ush scan_start = *(ushf*)scan; in longest_match()
1171 register ush scan_end = *(ushf*)(scan+best_len-1); in longest_match()
1174 register Byte scan_end1 = scan[best_len-1]; in longest_match()
1175 register Byte scan_end = scan[best_len]; in longest_match()
1222 Assert(scan[2] == match[2], "scan[2]?"); in longest_match()
1223 scan++, match++; in longest_match()
1225 } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) && in longest_match()
1226 *(ushf*)(scan+=2) == *(ushf*)(match+=2) && in longest_match()
1227 *(ushf*)(scan+=2) == *(ushf*)(match+=2) && in longest_match()
1228 *(ushf*)(scan+=2) == *(ushf*)(match+=2) && in longest_match()
1229 scan < strend); in longest_match()
1233 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); in longest_match()
1234 if (*scan == *match) scan++; in longest_match()
1236 len = (MAX_MATCH - 1) - (int)(strend-scan); in longest_match()
1237 scan = strend - (MAX_MATCH-1); in longest_match()
1243 *match != *scan || in longest_match()
1244 *++match != scan[1]) continue; in longest_match()
1252 scan += 2, match++; in longest_match()
1253 Assert(*scan == *match, "match[2]?"); in longest_match()
1259 } while (*++scan == *++match && *++scan == *++match && in longest_match()
1260 *++scan == *++match && *++scan == *++match && in longest_match()
1261 *++scan == *++match && *++scan == *++match && in longest_match()
1262 *++scan == *++match && *++scan == *++match && in longest_match()
1263 scan < strend); in longest_match()
1265 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); in longest_match()
1267 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1268 scan = strend - MAX_MATCH; in longest_match()
1277 scan_end = *(ushf*)(scan+best_len-1); in longest_match()
1279 scan_end1 = scan[best_len-1]; in longest_match()
1280 scan_end = scan[best_len]; in longest_match()
1300 register Bytef *scan = s->window + s->strstart; /* current string */ in longest_match() local
1318 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; in longest_match()
1326 scan += 2, match += 2; in longest_match()
1327 Assert(*scan == *match, "match[2]?"); in longest_match()
1333 } while (*++scan == *++match && *++scan == *++match && in longest_match()
1334 *++scan == *++match && *++scan == *++match && in longest_match()
1335 *++scan == *++match && *++scan == *++match && in longest_match()
1336 *++scan == *++match && *++scan == *++match && in longest_match()
1337 scan < strend); in longest_match()
1339 Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan"); in longest_match()
1341 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1866 Bytef *scan, *strend; /* scan goes up to strend for length of run */ in deflate_rle() local
1884 scan = s->window + s->strstart - 1; in deflate_rle()
1885 prev = *scan; in deflate_rle()
1886 if (prev == *++scan && prev == *++scan && prev == *++scan) { in deflate_rle()
1889 } while (prev == *++scan && prev == *++scan && in deflate_rle()
1890 prev == *++scan && prev == *++scan && in deflate_rle()
1891 prev == *++scan && prev == *++scan && in deflate_rle()
1892 prev == *++scan && prev == *++scan && in deflate_rle()
1893 scan < strend); in deflate_rle()
1894 s->match_length = MAX_MATCH - (int)(strend - scan); in deflate_rle()
1898 Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); in deflate_rle()