Searched refs:lenb (Results 1 – 3 of 3) sorted by relevance
205 off_t s,Sf,lenf,Sb,lenb; in main() local302 lenb=0; in main()307 if(s*2-i>Sb*2-lenb) { Sb=s; lenb=i; }; in main()311 if(lastscan+lenf>scan-lenb) { in main()312 overlap=(lastscan+lenf)-(scan-lenb); in main()317 if(new[scan-lenb+i]== in main()318 old[pos-lenb+i]) s--; in main()323 lenb-=lens; in main()328 for(i=0;i<(scan-lenb)-(lastscan+lenf);i++) in main()332 eblen+=(scan-lenb)-(lastscan+lenf); in main()[all …]
341 off_t s,Sf,lenf,Sb,lenb; in main() local446 lenb=0; in main()451 if(s*2-i>Sb*2-lenb) { Sb=s; lenb=i; }; in main()455 if(lastscan+lenf>scan-lenb) { in main()456 overlap=(lastscan+lenf)-(scan-lenb); in main()461 if(new[scan-lenb+i]== in main()462 old[pos-lenb+i]) s--; in main()467 lenb-=lens; in main()472 for(i=0;i<(scan-lenb)-(lastscan+lenf);i++) in main()476 eblen+=(scan-lenb)-(lastscan+lenf); in main()[all …]
333 int lenb = 0; in CreateBinaryPatch() local338 if (score*2 - i > Sb*2 - lenb) { Sb = score; lenb = i; } in CreateBinaryPatch()360 if (lastscan + lenf > scan - lenb) { in CreateBinaryPatch()361 int overlap = (lastscan + lenf) - (scan - lenb); in CreateBinaryPatch()367 if (newbuf[scan - lenb + i] == old[pos - lenb + i]) score--; in CreateBinaryPatch()372 lenb -= lens; in CreateBinaryPatch()388 int gap = (scan - lenb) - (lastscan + lenf); in CreateBinaryPatch()399 int32 seek_adjustment = ((pos - lenb) - (lastpos + lenf)); in CreateBinaryPatch()414 lastscan = scan - lenb; // Include the backward extension in seed. in CreateBinaryPatch()415 lastpos = pos - lenb; // ditto. in CreateBinaryPatch()