Lines Matching defs:best_len
67 best_len equ dword ptr [esp+NbStack-36]
177 ; best_len = s->prev_length
178 mov best_len,ebx
191 ; bx = *(window+best_len-1)
198 ; bx = scan_end = *(window+best_len-1)
224 add edi,best_len
227 ; windowlen = window + best_len -1
238 ; edi = windowlen (window + best_len -1)
357 ; if we are here, we know that *(match+best_len-1) == scan_end
416 ; we go in normalbeg2 because *(ushf*)(match+best_len-1) == scan_end
425 ; if we are here, we know that *(match+best_len-1) == scan_end
486 cmp esi,best_len ; if len > best_len, go newbestlen
495 mov best_len,esi ; len become best_len
498 cmp esi,nice_match ; if best_len >= nice_match, exit
506 mov windowlen,esi ; windowlen = window + best_len-1
507 mov bx,[ecx-1] ; bx = *(scan+best_len-1) = scan_end
518 mov ecx,best_len
525 ; return min(best_len,s->lookahead)
763 ;;; int best_len = s->prev_length;
768 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
774 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
792 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
897 ;;; best_len = len;
899 ;;; scan_end = *(ushf*)(scan+best_len-1);
921 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;