HomeSort by relevance Sort by last modified time
    Searched full:lastscan (Results 1 - 4 of 4) sorted by null

  /bootable/recovery/applypatch/
bsdiff.c 230 off_t lastscan,lastpos,lastoffset; local
282 lastscan=0;lastpos=0;lastoffset=0;
305 for(i=0;(lastscan+i<scan)&&(lastpos+i<oldsize);) {
306 if(old[lastpos+i]==new[lastscan+i]) s++;
314 for(i=1;(scan>=lastscan+i)&&(pos>=i);i++) {
320 if(lastscan+lenf>scan-lenb) {
321 overlap=(lastscan+lenf)-(scan-lenb);
324 if(new[lastscan+lenf-overlap+i]==
336 db[dblen+i]=new[lastscan+i]-old[lastpos+i];
337 for(i=0;i<(scan-lenb)-(lastscan+lenf);i++
    [all...]
  /external/bsdiff/
bsdiff.c 203 off_t lastscan,lastpos,lastoffset; local
273 lastscan=0;lastpos=0;lastoffset=0;
296 for(i=0;(lastscan+i<scan)&&(lastpos+i<oldsize);) {
297 if(old[lastpos+i]==new[lastscan+i]) s++;
305 for(i=1;(scan>=lastscan+i)&&(pos>=i);i++) {
311 if(lastscan+lenf>scan-lenb) {
312 overlap=(lastscan+lenf)-(scan-lenb);
315 if(new[lastscan+lenf-overlap+i]==
327 db[dblen+i]=new[lastscan+i]-old[lastpos+i];
328 for(i=0;i<(scan-lenb)-(lastscan+lenf);i++
    [all...]
  /external/chromium_org/courgette/third_party/
bsdiff_create.cc 259 // |lastscan|. We are searching for a second match that will be the 'seed' of
280 // ssssssssss Seed at |lastscan|
283 // fffffffffffffff |lenf| = scan forward from |lastscan|
287 // ssssssssssss |lastscan = scan - lenb| is new seed.
291 int lastscan = 0, lastpos = 0, lastoffset = 0; local
299 // extend the match at |lastscan|.
326 // part of the next triple. The |lastscan| match is extended forwards as
336 for (int i = 1; (scan >= lastscan + i) && (pos >= i); i++) {
342 // Extend the lastscan match forward; |lenf| is the maximal extension for
343 // which less than half of the byte positions in entire lastscan match ar
    [all...]
  /external/chromium_org/chrome/installer/mac/third_party/bsdiff/
goobsdiff.c 339 off_t lastscan,lastpos,lastoffset; local
417 lastscan=0;lastpos=0;lastoffset=0;
440 for(i=0;(lastscan+i<scan)&&(lastpos+i<oldsize);) {
441 if(old[lastpos+i]==new[lastscan+i]) s++;
449 for(i=1;(scan>=lastscan+i)&&(pos>=i);i++) {
455 if(lastscan+lenf>scan-lenb) {
456 overlap=(lastscan+lenf)-(scan-lenb);
459 if(new[lastscan+lenf-overlap+i]==
471 db[dblen+i]=new[lastscan+i]-old[lastpos+i];
472 for(i=0;i<(scan-lenb)-(lastscan+lenf);i++
    [all...]

Completed in 144 milliseconds