Lines Matching refs:scan
1397 register Bytef *scan = s->window + s->strstart; /* current string */
1415 register ush scan_start = *(ushf*)scan;
1416 register ush scan_end = *(ushf*)(scan + best_len - 1);
1419 register Byte scan_end1 = scan[best_len - 1];
1420 register Byte scan_end = scan[best_len];
1459 /* It is not necessary to compare scan[2] and match[2] since they are
1469 Assert(scan[2] == match[2], "scan[2]?");
1471 /* When using CRC hashing, scan[2] and match[2] may mismatch, but in
1476 Assert(scan[2] == match[2] || scan[3] != match[3], "scan[2]??");
1478 scan++, match++;
1480 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1481 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1482 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1483 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1484 scan < strend);
1487 /* Here, scan <= window + strstart + 257 */
1488 Assert(scan <= s->window+(unsigned)(s->window_size - 1),
1489 "wild scan");
1490 if (*scan == *match) scan++;
1492 len = (MAX_MATCH - 1) - (int)(strend - scan);
1493 scan = strend - (MAX_MATCH-1);
1499 *match != *scan ||
1500 *++match != scan[1]) continue;
1504 * It is not necessary to compare scan[2] and match[2] since they
1508 scan += 2, match++;
1510 Assert(*scan == *match, "match[2]?");
1512 /* When using CRC hashing, scan[2] and match[2] may mismatch, but in
1517 Assert(*scan == *match || scan[1] != match[1], "match[2]??");
1524 } while (*++scan == *++match && *++scan == *++match &&
1525 *++scan == *++match && *++scan == *++match &&
1526 *++scan == *++match && *++scan == *++match &&
1527 *++scan == *++match && *++scan == *++match &&
1528 scan < strend);
1530 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1531 "wild scan");
1533 len = MAX_MATCH - (int)(strend - scan);
1534 scan = strend - MAX_MATCH;
1543 scan_end = *(ushf*)(scan + best_len - 1);
1545 scan_end1 = scan[best_len - 1];
1546 scan_end = scan[best_len];
1562 register Bytef *scan = s->window + s->strstart; /* current string */
1581 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1585 * It is not necessary to compare scan[2] and match[2] since they
1589 scan += 2, match += 2;
1590 Assert(*scan == *match, "match[2]?");
1596 } while (*++scan == *++match && *++scan == *++match &&
1597 *++scan == *++match && *++scan == *++match &&
1598 *++scan == *++match && *++scan == *++match &&
1599 *++scan == *++match && *++scan == *++match &&
1600 scan < strend);
1602 Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan");
1604 len = MAX_MATCH - (int)(strend - scan);
2107 Bytef *scan, *strend; /* scan goes up to strend for length of run */
2125 scan = s->window + s->strstart - 1;
2126 prev = *scan;
2127 if (prev == *++scan && prev == *++scan && prev == *++scan) {
2130 } while (prev == *++scan && prev == *++scan &&
2131 prev == *++scan && prev == *++scan &&
2132 prev == *++scan && prev == *++scan &&
2133 prev == *++scan && prev == *++scan &&
2134 scan < strend);
2135 s->match_length = MAX_MATCH - (uInt)(strend - scan);
2139 Assert(scan <= s->window + (uInt)(s->window_size - 1),
2140 "wild scan");