Lines Matching refs:scan
1350 register Bytef *scan = s->window + s->strstart; /* current string */ in longest_match() local
1368 register ush scan_start = *(ushf*)scan; in longest_match()
1369 register ush scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1372 register Byte scan_end1 = scan[best_len - 1]; in longest_match()
1373 register Byte scan_end = scan[best_len]; in longest_match()
1421 Assert(scan[2] == match[2], "scan[2]?"); in longest_match()
1422 scan++, match++; in longest_match()
1424 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1425 *(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1426 *(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1427 *(ushf*)(scan += 2) == *(ushf*)(match += 2) && in longest_match()
1428 scan < strend); in longest_match()
1432 Assert(scan <= s->window + (unsigned)(s->window_size - 1), in longest_match()
1434 if (*scan == *match) scan++; in longest_match()
1436 len = (MAX_MATCH - 1) - (int)(strend - scan); in longest_match()
1437 scan = strend - (MAX_MATCH-1); in longest_match()
1443 *match != *scan || in longest_match()
1444 *++match != scan[1]) continue; in longest_match()
1452 scan += 2, match++; in longest_match()
1453 Assert(*scan == *match, "match[2]?"); in longest_match()
1459 } while (*++scan == *++match && *++scan == *++match && in longest_match()
1460 *++scan == *++match && *++scan == *++match && in longest_match()
1461 *++scan == *++match && *++scan == *++match && in longest_match()
1462 *++scan == *++match && *++scan == *++match && in longest_match()
1463 scan < strend); in longest_match()
1465 Assert(scan <= s->window + (unsigned)(s->window_size - 1), in longest_match()
1468 len = MAX_MATCH - (int)(strend - scan); in longest_match()
1469 scan = strend - MAX_MATCH; in longest_match()
1478 scan_end = *(ushf*)(scan + best_len - 1); in longest_match()
1480 scan_end1 = scan[best_len - 1]; in longest_match()
1481 scan_end = scan[best_len]; in longest_match()
1497 register Bytef *scan = s->window + s->strstart; /* current string */ in longest_match() local
1516 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1; in longest_match()
1524 scan += 2, match += 2; in longest_match()
1525 Assert(*scan == *match, "match[2]?"); in longest_match()
1531 } while (*++scan == *++match && *++scan == *++match && in longest_match()
1532 *++scan == *++match && *++scan == *++match && in longest_match()
1533 *++scan == *++match && *++scan == *++match && in longest_match()
1534 *++scan == *++match && *++scan == *++match && in longest_match()
1535 scan < strend); in longest_match()
1537 Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan"); in longest_match()
1539 len = MAX_MATCH - (int)(strend - scan); in longest_match()
2043 Bytef *scan, *strend; /* scan goes up to strend for length of run */ in deflate_rle() local
2061 scan = s->window + s->strstart - 1; in deflate_rle()
2062 prev = *scan; in deflate_rle()
2063 if (prev == *++scan && prev == *++scan && prev == *++scan) { in deflate_rle()
2066 } while (prev == *++scan && prev == *++scan && in deflate_rle()
2067 prev == *++scan && prev == *++scan && in deflate_rle()
2068 prev == *++scan && prev == *++scan && in deflate_rle()
2069 prev == *++scan && prev == *++scan && in deflate_rle()
2070 scan < strend); in deflate_rle()
2071 s->match_length = MAX_MATCH - (uInt)(strend - scan); in deflate_rle()
2075 Assert(scan <= s->window + (uInt)(s->window_size - 1), in deflate_rle()