Lines Matching refs:scan

1114     register Bytef *scan = s->window + s->strstart; /* current string */

1132     register ush scan_start = *(ushf*)scan;

1133     register ush scan_end   = *(ushf*)(scan+best_len-1);

1136     register Byte scan_end1  = scan[best_len-1];

1137     register Byte scan_end   = scan[best_len];

1175         /* It is not necessary to compare scan[2] and match[2] since they are

1184         Assert(scan[2] == match[2], "scan[2]?");

1185         scan++, match++;

1187         } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&

1188                  *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&

1189                  *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&

1190                  *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&

1191                  scan < strend);

1194         /* Here, scan <= window+strstart+257 */

1195         Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

1196         if (*scan == *match) scan++;

1198         len = (MAX_MATCH - 1) - (int)(strend-scan);

1199         scan = strend - (MAX_MATCH-1);

1205             *match            != *scan     ||

1206             *++match          != scan[1])      continue;

1210          * It is not necessary to compare scan[2] and match[2] since they

1214         scan += 2, match++;

1215         Assert(*scan == *match, "match[2]?");

1221         } while (*++scan == *++match && *++scan == *++match &&

1222                  *++scan == *++match && *++scan == *++match &&

1223                  *++scan == *++match && *++scan == *++match &&

1224                  *++scan == *++match && *++scan == *++match &&

1225                  scan < strend);

1227         Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

1229         len = MAX_MATCH - (int)(strend - scan);

1230         scan = strend - MAX_MATCH;

1239             scan_end = *(ushf*)(scan+best_len-1);

1241             scan_end1  = scan[best_len-1];

1242             scan_end   = scan[best_len];

1262     register Bytef *scan = s->window + s->strstart; /* current string */

1280     if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;

1284      * It is not necessary to compare scan[2] and match[2] since they

1288     scan += 2, match += 2;

1289     Assert(*scan == *match, "match[2]?");

1295     } while (*++scan == *++match && *++scan == *++match &&

1296              *++scan == *++match && *++scan == *++match &&

1297              *++scan == *++match && *++scan == *++match &&

1298              *++scan == *++match && *++scan == *++match &&

1299              scan < strend);

1301     Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");

1303     len = MAX_MATCH - (int)(strend - scan);

1805     Bytef *scan, *strend;   /* scan goes up to strend for length of run */

1823             scan = s->window + s->strstart - 1;

1824             prev = *scan;

1825             if (prev == *++scan && prev == *++scan && prev == *++scan) {

1828                 } while (prev == *++scan && prev == *++scan &&

1829                          prev == *++scan && prev == *++scan &&

1830                          prev == *++scan && prev == *++scan &&

1831                          prev == *++scan && prev == *++scan &&

1832                          scan < strend);

1833                 s->match_length = MAX_MATCH - (int)(strend - scan);