Lines Matching +defs:i +defs:n

50 void delitem(char buf[PBLKSIZ], int n);
91 		(void) printf("cannot open database %s\n", file);
145 	int i;
149 	for (i = 0; ; i += 2) {
150 		item = makdatum(pagbuf, i);
154 			item = makdatum(pagbuf, i+1);
156 				(void) printf("items not in pairs\n");
165 	int i;
171 	for (i = 0; ; i += 2) {
172 		item = makdatum(pagbuf, i);
176 			delitem(pagbuf, i);
177 			delitem(pagbuf, i);
189 	int i;
202 	for (i = 0; ; i += 2) {
203 		item = makdatum(pagbuf, i);
207 			delitem(pagbuf, i);
208 			delitem(pagbuf, i);
212 	i = additem(pagbuf, key);
213 	if (i < 0)
216 		delitem(pagbuf, i);
224 		(void) printf("entry too big\n");
229 	for (i = 0; ; ) {
230 		item = makdatum(pagbuf, i);
246 			delitem(pagbuf, i);
247 			item = makdatum(pagbuf, i);
249 				(void) printf("split not paired\n");
253 			delitem(pagbuf, i);
256 		i += 2;
278 	int i;
286 	for (i = 0; ; i += 2) {
287 		item = makdatum(pagbuf, i);
308 	int i;
314 	for (i = 2; ; i += 2) {
315 		item = makdatum(pagbuf, i);
357 	long b, i, n;
361 	n = bitno % BYTESIZ;
363 	i = bn % DBLKSIZ;
374 	if (dirbuf[i] & (1<<n))
383 	long i, n, b;
391 	n = bitno % BYTESIZ;
393 	i = bn % DBLKSIZ;
395 	dirbuf[i] |= 1<<n;
403 makdatum(char buf[PBLKSIZ], int n)
410 	if (n < 0 || n >= sp[0])
413 	if (n > 0)
414 		t = sp[n+1-1];
415 	item.dptr = buf+sp[n+1];
416 	item.dsize = t - sp[n+1];
428 	int n;
431 	n = d1.dsize;
432 	if (n != d2.dsize)
433 		return (n - d2.dsize);
434 	if (n == 0)
441 	while (--n);
495 	int i, j, f;
501 	for (i = 0; i < item.dsize; i++) {
502 		f = item.dptr[i];
513 delitem(char buf[PBLKSIZ], int n)
519 	if (n < 0 || n >= sp[0])
521 	i1 = sp[n+1];
523 	if (n > 0)
524 		i2 = sp[n+1-1];
534 	for (i1 = n+1; i1 < sp[0]; i1++)
541 	(void) printf("bad delitem\n");
572 	int t, i;
576 	for (i = 0; i < sp[0]; i++) {
577 		if (sp[i+1] > t)
579 		t = sp[i+1];
586 	(void) printf("bad block\n");