564     register Byte *scan = s->window + s->strstart; /* current string */  in longest_match()  local
582     register ush scan_start = *(ush*)scan;  in longest_match()
583     register ush scan_end   = *(ush*)(scan+best_len-1);  in longest_match()
586     register Byte scan_end1  = scan[best_len-1];  in longest_match()
587     register Byte scan_end   = scan[best_len];  in longest_match()
620         /* It is not necessary to compare scan[2] and match[2] since they are  in longest_match()
629         Assert(scan[2] == match[2], "scan[2]?");  in longest_match()
630         scan++, match++;  in longest_match()
632         } while (*(ush*)(scan+=2) == *(ush*)(match+=2) &&  in longest_match()
633                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&  in longest_match()
634                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&  in longest_match()
635                  *(ush*)(scan+=2) == *(ush*)(match+=2) &&  in longest_match()
636                  scan < strend);  in longest_match()
639         /* Here, scan <= window+strstart+257 */  in longest_match()
640         Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");  in longest_match()
641         if (*scan == *match) scan++;  in longest_match()
643         len = (MAX_MATCH - 1) - (int)(strend-scan);  in longest_match()
644         scan = strend - (MAX_MATCH-1);  in longest_match()
650             *match            != *scan     ||  in longest_match()
651             *++match          != scan[1])      continue;  in longest_match()
655          * It is not necessary to compare scan[2] and match[2] since they  in longest_match()
659         scan += 2, match++;  in longest_match()
660         Assert(*scan == *match, "match[2]?");  in longest_match()
666         } while (*++scan == *++match && *++scan == *++match &&  in longest_match()
667                  *++scan == *++match && *++scan == *++match &&  in longest_match()
668                  *++scan == *++match && *++scan == *++match &&  in longest_match()
669                  *++scan == *++match && *++scan == *++match &&  in longest_match()
670                  scan < strend);  in longest_match()
672         Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");  in longest_match()
674         len = MAX_MATCH - (int)(strend - scan);  in longest_match()
675         scan = strend - MAX_MATCH;  in longest_match()
684             scan_end = *(ush*)(scan+best_len-1);  in longest_match()
686             scan_end1  = scan[best_len-1];  in longest_match()
687             scan_end   = scan[best_len];  in longest_match()