Lines Matching refs:we
167 ; we increment chain_length because in the asm, the --chain_lenght is in the beginning of the loop
357 ; if we are here, we know that *(match+best_len-1) == scan_end
361 ; calculate the good chain_length, and we'll compare scan and match string
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
437 ; we will determine the unmatch byte and calculate len (in esi)
458 ; here we now scan and match begin same
465 ; we determine the unmatch byte
485 ; here we have finised compare, and esi contain len of equal string
488 ; now we restore edx, ecx and esi, for the big loop
509 ; now we restore ecx and esi, for the big loop :
829 ;;; Point edi to the string under scrutiny, and esi to the string we
883 ;;; If the length of the match is not longer than the best match we
933 ;;; Restore the stack and return from whence we came.