62 	off_t i,j,k,x,tmp,jj,kk;  in split()  local
67 			for(i=1;k+i<start+len;i++) {  in split()
68 				if(V[I[k+i]+h]<x) {  in split()
69 					x=V[I[k+i]+h];  in split()
72 				if(V[I[k+i]+h]==x) {  in split()
73 					tmp=I[k+j];I[k+j]=I[k+i];I[k+i]=tmp;  in split()
77 			for(i=0;i<j;i++) V[I[k+i]]=k+j-1;  in split()
85 	for(i=start;i<start+len;i++) {  in split()
86 		if(V[I[i]+h]<x) jj++;  in split()
87 		if(V[I[i]+h]==x) kk++;  in split()
91 	i=start;j=0;k=0;  in split()
92 	while(i<jj) {  in split()
93 		if(V[I[i]+h]<x) {  in split()
94 			i++;  in split()
95 		} else if(V[I[i]+h]==x) {  in split()
96 			tmp=I[i];I[i]=I[jj+j];I[jj+j]=tmp;  in split()
99 			tmp=I[i];I[i]=I[kk+k];I[kk+k]=tmp;  in split()
115 	for(i=0;i<kk-jj;i++) V[I[jj+i]]=kk-1;  in split()
124 	off_t i,h,len;  in qsufsort()  local
126 	for(i=0;i<256;i++) buckets[i]=0;  in qsufsort()
127 	for(i=0;i<oldsize;i++) buckets[old[i]]++;  in qsufsort()
128 	for(i=1;i<256;i++) buckets[i]+=buckets[i-1];  in qsufsort()
129 	for(i=255;i>0;i--) buckets[i]=buckets[i-1];  in qsufsort()
132 	for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;  in qsufsort()
134 	for(i=0;i<oldsize;i++) V[i]=buckets[old[i]];  in qsufsort()
136 	for(i=1;i<256;i++) if(buckets[i]==buckets[i-1]+1) I[buckets[i]]=-1;  in qsufsort()
141 		for(i=0;i<oldsize+1;) {  in qsufsort()
142 			if(I[i]<0) {  in qsufsort()
143 				len-=I[i];  in qsufsort()
144 				i-=I[i];  in qsufsort()
146 				if(len) I[i-len]=-len;  in qsufsort()
147 				len=V[I[i]]+1-i;  in qsufsort()
148 				split(I,V,i,len,h);  in qsufsort()
149 				i+=len;  in qsufsort()
153 		if(len) I[i-len]=-len;  in qsufsort()
156 	for(i=0;i<oldsize+1;i++) I[V[i]]=i;  in qsufsort()
161 	off_t i;  in matchlen()  local
163 	for(i=0;(i<oldsize)&&(i<newsize);i++)  in matchlen()
164 		if(old[i]!=new[i]) break;  in matchlen()
166 	return i;  in matchlen()
234 	off_t i;  in bsdiff()  local
305 			for(i=0;(lastscan+i<scan)&&(lastpos+i<oldsize);) {  in bsdiff()
306 				if(old[lastpos+i]==new[lastscan+i]) s++;  in bsdiff()
307 				i++;  in bsdiff()
308 				if(s*2-i>Sf*2-lenf) { Sf=s; lenf=i; };  in bsdiff()
314 				for(i=1;(scan>=lastscan+i)&&(pos>=i);i++) {  in bsdiff()
315 					if(old[pos-i]==new[scan-i]) s++;  in bsdiff()
316 					if(s*2-i>Sb*2-lenb) { Sb=s; lenb=i; };  in bsdiff()
323 				for(i=0;i<overlap;i++) {  in bsdiff()
324 					if(new[lastscan+lenf-overlap+i]==  in bsdiff()
325 					   old[lastpos+lenf-overlap+i]) s++;  in bsdiff()
326 					if(new[scan-lenb+i]==  in bsdiff()
327 					   old[pos-lenb+i]) s--;  in bsdiff()
328 					if(s>Ss) { Ss=s; lens=i+1; };  in bsdiff()
335 			for(i=0;i<lenf;i++)  in bsdiff()
336 				db[dblen+i]=new[lastscan+i]-old[lastpos+i];  in bsdiff()
337 			for(i=0;i<(scan-lenb)-(lastscan+lenf);i++)  in bsdiff()
338 				eb[eblen+i]=new[lastscan+lenf+i];  in bsdiff()