Lines Matching defs:scan
1352 register Bytef *scan = s->window + s->strstart; /* current string */
1370 register ush scan_start = *(ushf*)scan;
1371 register ush scan_end = *(ushf*)(scan + best_len - 1);
1374 register Byte scan_end1 = scan[best_len - 1];
1375 register Byte scan_end = scan[best_len];
1414 /* It is not necessary to compare scan[2] and match[2] since they are
1423 Assert(scan[2] == match[2], "scan[2]?");
1424 scan++, match++;
1426 } while (*(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1427 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1428 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1429 *(ushf*)(scan += 2) == *(ushf*)(match += 2) &&
1430 scan < strend);
1433 /* Here, scan <= window + strstart + 257 */
1434 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1435 "wild scan");
1436 if (*scan == *match) scan++;
1438 len = (MAX_MATCH - 1) - (int)(strend - scan);
1439 scan = strend - (MAX_MATCH-1);
1445 *match != *scan ||
1446 *++match != scan[1]) continue;
1450 * It is not necessary to compare scan[2] and match[2] since they
1454 scan += 2, match++;
1455 Assert(*scan == *match, "match[2]?");
1461 } while (*++scan == *++match && *++scan == *++match &&
1462 *++scan == *++match && *++scan == *++match &&
1463 *++scan == *++match && *++scan == *++match &&
1464 *++scan == *++match && *++scan == *++match &&
1465 scan < strend);
1467 Assert(scan <= s->window + (unsigned)(s->window_size - 1),
1468 "wild scan");
1470 len = MAX_MATCH - (int)(strend - scan);
1471 scan = strend - MAX_MATCH;
1480 scan_end = *(ushf*)(scan + best_len - 1);
1482 scan_end1 = scan[best_len - 1];
1483 scan_end = scan[best_len];
1499 register Bytef *scan = s->window + s->strstart; /* current string */
1518 if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
1522 * It is not necessary to compare scan[2] and match[2] since they
1526 scan += 2, match += 2;
1527 Assert(*scan == *match, "match[2]?");
1533 } while (*++scan == *++match && *++scan == *++match &&
1534 *++scan == *++match && *++scan == *++match &&
1535 *++scan == *++match && *++scan == *++match &&
1536 *++scan == *++match && *++scan == *++match &&
1537 scan < strend);
1539 Assert(scan <= s->window + (unsigned)(s->window_size - 1), "wild scan");
1541 len = MAX_MATCH - (int)(strend - scan);
2043 Bytef *scan, *strend; /* scan goes up to strend for length of run */
2061 scan = s->window + s->strstart - 1;
2062 prev = *scan;
2063 if (prev == *++scan && prev == *++scan && prev == *++scan) {
2066 } while (prev == *++scan && prev == *++scan &&
2067 prev == *++scan && prev == *++scan &&
2068 prev == *++scan && prev == *++scan &&
2069 prev == *++scan && prev == *++scan &&
2070 scan < strend);
2071 s->match_length = MAX_MATCH - (uInt)(strend - scan);
2075 Assert(scan <= s->window + (uInt)(s->window_size - 1),
2076 "wild scan");