Lines Matching +defs:i +defs:n

142 	int i;
146 for (i = 0; ; i += 2) {
147 item = makdatum(pagbuf, i);
152 item = makdatum(pagbuf, i+1);
154 (void) printf("items not in pairs\n");
163 int i;
169 for (i = 0; ; i += 2) {
170 item = makdatum(pagbuf, i);
174 delitem(pagbuf, i);
175 delitem(pagbuf, i);
187 int i;
195 for (i = 0; ; i += 2) {
196 item = makdatum(pagbuf, i);
200 delitem(pagbuf, i);
201 delitem(pagbuf, i);
205 i = additem(pagbuf, key);
206 if (i < 0)
209 delitem(pagbuf, i);
218 (void) printf("entry too big\n");
222 for (i = 0; ; ) {
223 item = makdatum(pagbuf, i);
228 delitem(pagbuf, i);
229 item = makdatum(pagbuf, i);
231 (void) printf("split not paired\n");
235 delitem(pagbuf, i);
238 i += 2;
263 int i;
275 for (i = 0; ; i += 2) {
276 item = makdatum(pagbuf, i);
297 int i;
303 for (i = 2; ; i += 2) {
304 item = makdatum(pagbuf, i);
347 long b, i, n;
351 n = bitno % BYTESIZ;
353 i = bn % DBLKSIZ;
365 if (dirbuf[i] & (1<<n))
374 long i, n, b;
382 n = bitno % BYTESIZ;
384 i = bn % DBLKSIZ;
386 dirbuf[i] |= 1<<n;
394 makdatum(char buf[PBLKSIZ], int n)
402 if (n < 0 || n >= sp[0])
405 if (n > 0)
406 t = sp[n+1-1];
407 item.dptr = buf+sp[n+1];
408 item.dsize = t - sp[n+1];
420 int n;
423 n = d1.dsize;
424 if (n != d2.dsize)
425 return (n - d2.dsize);
426 if (n == 0)
433 while (--n);
488 int i, j, f;
494 for (i = 0; i < item.dsize; i++) {
495 f = item.dptr[i];
506 delitem(char buf[PBLKSIZ], int n)
513 if (n < 0 || n >= sp[0])
515 i1 = sp[n+1];
517 if (n > 0)
518 i2 = sp[n+1-1];
528 for (i1 = n + 1; i1 < sp[0]; i1++)
535 (void) printf("bad delitem\n");
567 int t, i;
572 for (i = 0; i < sp[0]; i++) {
573 if (sp[i+1] > t)
575 t = sp[i+1];
582 (void) printf("bad block\n");