Lines Matching refs:old
104 static void qsufsort(off_t *I,off_t *V,u_char *old,off_t oldsize)
110 for(i=0;i<oldsize;i++) buckets[old[i]]++;
115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
117 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]];
142 static off_t matchlen(u_char *old,off_t oldsize,u_char *new,off_t newsize)
147 if(old[i]!=new[i]) break;
152 static off_t search(off_t *I,u_char *old,off_t oldsize,
158 x=matchlen(old+I[st],oldsize-I[st],new,newsize);
159 y=matchlen(old+I[en],oldsize-I[en],new,newsize);
171 if(memcmp(old+I[x],new,MIN(oldsize-I[x],newsize))<0) {
172 return search(I,old,oldsize,new,newsize,x,en,pos);
174 return search(I,old,oldsize,new,newsize,st,x,pos);
199 u_char *old,*new;
222 ((old=malloc(oldsize+1))==NULL) ||
224 (read(fd,old,oldsize)!=oldsize) ||
230 qsufsort(I,V,old,oldsize);
278 len=search(I,old,oldsize,new+scan,newsize-scan,
283 (old[scsc+lastoffset] == new[scsc]))
290 (old[scan+lastoffset] == new[scan]))
297 if(old[lastpos+i]==new[lastscan+i]) s++;
306 if(old[pos-i]==new[scan-i]) s++;
316 old[lastpos+lenf-overlap+i]) s++;
318 old[pos-lenb+i]) s--;
327 db[dblen+i]=new[lastscan+i]-old[lastpos+i];
400 free(old);