Lines Matching refs:scan
1359 register Bytef *scan = s->window + s->strstart; /* current string */
1377 register ush scan_start = *(ushf*)scan;
1378 register ush scan_end = *(ushf*)(scan + best_len - 1);
1381 register Byte scan_end1 = scan[best_len - 1];
1382 register Byte scan_end = scan[best_len];
1421 /* It is not necessary to compare scan[2] and match[2] since they are
1430 Assert(scan[2] == match[2], "scan[2]?");
1431 scan++, match++;
1433 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1434 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1435 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1436 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1437 scan < strend);
1440 /* Here, scan <= window + strstart + 257 */
1441 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1442 "wild scan");
1443 if (*scan == *match) scan++;
1445 len = (MAX_MATCH - 1) - (int)(strend - scan);
1446 scan = strend - (MAX_MATCH-1);
1452 *match != *scan ||
1453 *++match != scan[1]) continue;
1457 * It is not necessary to compare scan[2] and match[2] since they
1461 scan += 2, match++;
1462 Assert(*scan == *match, "match[2]?");
1468 } while (*++scan == *++match && *++scan == *++match &&
1469 *++scan == *++match && *++scan == *++match &&
1470 *++scan == *++match && *++scan == *++match &&
1471 *++scan == *++match && *++scan == *++match &&
1472 scan < strend);
1474 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1475 "wild scan");
1477 len = MAX_MATCH - (int)(strend - scan);
1478 scan = strend - MAX_MATCH;
1487 scan_end = *(ushf*)(scan + best_len - 1);
1489 scan_end1 = scan[best_len - 1];
1490 scan_end = scan[best_len];
1507 register Bytef *scan = s->window + s->strstart; /* current string */
1526 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1530 * It is not necessary to compare scan[2] and match[2] since they
1534 scan += 2, match += 2;
1535 Assert(*scan == *match, "match[2]?");
1541 } while (*++scan == *++match && *++scan == *++match &&
1542 *++scan == *++match && *++scan == *++match &&
1543 *++scan == *++match && *++scan == *++match &&
1544 *++scan == *++match && *++scan == *++match &&
1545 scan < strend);
1547 Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan");
1549 len = MAX_MATCH - (int)(strend - scan);
2056 Bytef *scan, *strend; /* scan goes up to strend for length of run */
2074 scan = s->window + s->strstart - 1;
2075 prev = *scan;
2076 if (prev == *++scan && prev == *++scan && prev == *++scan) {
2079 } while (prev == *++scan && prev == *++scan &&
2080 prev == *++scan && prev == *++scan &&
2081 prev == *++scan && prev == *++scan &&
2082 prev == *++scan && prev == *++scan &&
2083 scan < strend);
2084 s->match_length = MAX_MATCH - (uInt)(strend - scan);
2088 Assert(scan <= s->window + (uInt)(s->window_size - 1),
2089 "wild scan");