i 75 common/gcc-millicode/qdivrem.c int m, n, d, j, i;
i 159 common/gcc-millicode/qdivrem.c for (i = 4 - m; --i >= 0;)
i 160 common/gcc-millicode/qdivrem.c q[i] = 0;
i 217 common/gcc-millicode/qdivrem.c for (t = 0, i = n; i > 0; i--) {
i 218 common/gcc-millicode/qdivrem.c t = u[i + j] - v[i] * qhat - t;
i 219 common/gcc-millicode/qdivrem.c u[i + j] = (digit)LHALF(t);
i 232 common/gcc-millicode/qdivrem.c for (t = 0, i = n; i > 0; i--) { /* D6: add back. */
i 233 common/gcc-millicode/qdivrem.c t += u[i + j] + v[i];
i 234 common/gcc-millicode/qdivrem.c u[i + j] = (digit)LHALF(t);
i 249 common/gcc-millicode/qdivrem.c for (i = m + n; i > m; --i)
i 250 common/gcc-millicode/qdivrem.c u[i] = (digit)(((unsigned int)u[i] >> d) |
i 251 common/gcc-millicode/qdivrem.c LHALF((unsigned int)u[i - 1] <<
i 253 common/gcc-millicode/qdivrem.c u[i] = 0;
i 273 common/gcc-millicode/qdivrem.c int i;
i 275 common/gcc-millicode/qdivrem.c for (i = 0; i < len; i++)
i 276 common/gcc-millicode/qdivrem.c p[i] = (digit)(LHALF((unsigned int)p[i] << sh) |
i 277 common/gcc-millicode/qdivrem.c ((unsigned int)p[i + 1] >> (HALF_BITS - sh)));
i 278 common/gcc-millicode/qdivrem.c p[i] = (digit)(LHALF((unsigned int)p[i] << sh));
i 340 common/libc/printf/__printf.c int i;
i 341 common/libc/printf/__printf.c for (i=0; i<spc; i++) {
i 562 common/libc/printf/__printf.c int i;
i 570 common/libc/printf/__printf.c for (i=0; format[i]; i++) {
i 571 common/libc/printf/__printf.c __pf_send(&pf, format[i]);
i 78 common/libc/printf/snprintf.c unsigned i;
i 81 common/libc/printf/snprintf.c for (i=0; i<len; i++) {
i 87 common/libc/printf/snprintf.c snp->buf[snp->bufpos] = data[i];
i 52 common/libc/string/bzero.c size_t i;
i 67 common/libc/string/bzero.c for (i=0; i<len/sizeof(long); i++) {
i 68 common/libc/string/bzero.c lb[i] = 0;
i 72 common/libc/string/bzero.c for (i=0; i<len; i++) {
i 73 common/libc/string/bzero.c block[i] = 0;
i 50 common/libc/string/memcpy.c size_t i;
i 72 common/libc/string/memcpy.c for (i=0; i<len/sizeof(long); i++) {
i 73 common/libc/string/memcpy.c d[i] = s[i];
i 80 common/libc/string/memcpy.c for (i=0; i<len; i++) {
i 81 common/libc/string/memcpy.c d[i] = s[i];
i 51 common/libc/string/memmove.c size_t i;
i 103 common/libc/string/memmove.c for (i=len/sizeof(long); i>0; i--) {
i 104 common/libc/string/memmove.c d[i-1] = s[i-1];
i 111 common/libc/string/memmove.c for (i=len; i>0; i--) {
i 112 common/libc/string/memmove.c d[i-1] = s[i-1];
i 50 common/libc/string/strcmp.c size_t i;
i 66 common/libc/string/strcmp.c for (i=0; a[i]!=0 && a[i]==b[i]; i++) {
i 83 common/libc/string/strcmp.c if ((unsigned char)a[i] > (unsigned char)b[i]) {
i 86 common/libc/string/strcmp.c else if (a[i] == b[i]) {
i 48 common/libc/string/strcpy.c size_t i;
i 53 common/libc/string/strcpy.c for (i=0; src[i]; i++) {
i 54 common/libc/string/strcpy.c dest[i] = src[i];
i 60 common/libc/string/strcpy.c dest[i] = 0;
i 53 common/libc/string/strrchr.c size_t i = strlen(s)+1;
i 56 common/libc/string/strrchr.c while (i > 0) {
i 59 common/libc/string/strrchr.c i--;
i 62 common/libc/string/strrchr.c if (s[i] == ch) {
i 63 common/libc/string/strrchr.c return (char *)(s+i);
i 114 kern/arch/mips/vm/dumbvm.c int i;
i 192 kern/arch/mips/vm/dumbvm.c for (i=0; i<NUM_TLB; i++) {
i 193 kern/arch/mips/vm/dumbvm.c tlb_read(&ehi, &elo, i);
i 200 kern/arch/mips/vm/dumbvm.c tlb_write(ehi, elo, i);
i 238 kern/arch/mips/vm/dumbvm.c int i, spl;
i 252 kern/arch/mips/vm/dumbvm.c for (i=0; i<NUM_TLB; i++) {
i 253 kern/arch/mips/vm/dumbvm.c tlb_write(TLBHI_INVALID(i), TLBLO_INVALID(), i);
i 105 kern/dev/generic/console.c size_t i;
i 106 kern/dev/generic/console.c for (i=0; i<delayed_outbuf_pos; i++) {
i 107 kern/dev/generic/console.c putch(delayed_outbuf[i]);
i 471 kern/dev/lamebus/emu.c unsigned ix, i, num;
i 498 kern/dev/lamebus/emu.c for (i=0; i<num; i++) {
i 501 kern/dev/lamebus/emu.c vx = vnodearray_get(ef->ef_vnodes, i);
i 503 kern/dev/lamebus/emu.c ix = i;
i 1153 kern/dev/lamebus/emu.c unsigned i, num;
i 1160 kern/dev/lamebus/emu.c for (i=0; i<num; i++) {
i 1161 kern/dev/lamebus/emu.c v = vnodearray_get(ef->ef_vnodes, i);
i 130 kern/dev/lamebus/lamebus.c unsigned i, numcpus, bootcpu;
i 138 kern/dev/lamebus/lamebus.c for (i=0; i<32; i++) {
i 139 kern/dev/lamebus/lamebus.c bit = (uint32_t)1 << i;
i 143 kern/dev/lamebus/lamebus.c curcpu->c_hardware_number = i;
i 145 kern/dev/lamebus/lamebus.c hwnum[numcpus] = i;
i 150 kern/dev/lamebus/lamebus.c for (i=0; i<numcpus; i++) {
i 151 kern/dev/lamebus/lamebus.c if (i != bootcpu) {
i 152 kern/dev/lamebus/lamebus.c cpu_create(hwnum[i]);
i 162 kern/dev/lamebus/lamebus.c for (i=0; i<numcpus; i++) {
i 163 kern/dev/lamebus/lamebus.c if (i != bootcpu) {
i 169 kern/dev/lamebus/lamebus.c write_ctlcpu_register(lamebus, hwnum[i], CTLCPU_CIRQE, val);
i 189 kern/dev/lamebus/lamebus.c unsigned i;
i 197 kern/dev/lamebus/lamebus.c for (i=0; i<32; i++) {
i 198 kern/dev/lamebus/lamebus.c bit = (uint32_t)1 << i;
i 203 kern/dev/lamebus/lamebus.c ctlcpuoffset = LB_CTLCPU_OFFSET + i * LB_CTLCPU_SIZE;
i 610 kern/dev/lamebus/lamebus.c int i;
i 625 kern/dev/lamebus/lamebus.c for (i=0; i<LB_NSLOTS; i++) {
i 626 kern/dev/lamebus/lamebus.c lamebus->ls_devdata[i] = NULL;
i 627 kern/dev/lamebus/lamebus.c lamebus->ls_irqfuncs[i] = NULL;
i 209 kern/dev/lamebus/lhd.c uint32_t i;
i 229 kern/dev/lamebus/lhd.c for (i=0; i<len; i++) {
i 247 kern/dev/lamebus/lhd.c lhd_wreg(lh, LHD_REG_SECT, sector+i);
i 114 kern/fs/sfs/sfs_fs.c unsigned i, num;
i 153 kern/fs/sfs/sfs_fs.c for (i=0; i<num; i++) {
i 154 kern/fs/sfs/sfs_fs.c struct vnode *v = vnodearray_get(sfs->sfs_vnodes, i);
i 451 kern/fs/sfs/sfs_vnode.c uint32_t nblocks, i;
i 509 kern/fs/sfs/sfs_vnode.c for (i=0; i<nblocks; i++) {
i 653 kern/fs/sfs/sfs_vnode.c int i, result;
i 656 kern/fs/sfs/sfs_vnode.c for (i=0; i<nentries; i++) {
i 659 kern/fs/sfs/sfs_vnode.c result = sfs_readdir(sv, &tsd, i);
i 666 kern/fs/sfs/sfs_vnode.c *emptyslot = i;
i 679 kern/fs/sfs/sfs_vnode.c *slot = i;
i 893 kern/fs/sfs/sfs_vnode.c unsigned ix, i, num;
i 937 kern/fs/sfs/sfs_vnode.c for (i=0; i<num; i++) {
i 938 kern/fs/sfs/sfs_vnode.c struct vnode *v2 = vnodearray_get(sfs->sfs_vnodes, i);
i 941 kern/fs/sfs/sfs_vnode.c ix = i;
i 1145 kern/fs/sfs/sfs_vnode.c uint32_t i, j, block;
i 1158 kern/fs/sfs/sfs_vnode.c for (i=0; i<SFS_NDIRECT; i++) {
i 1159 kern/fs/sfs/sfs_vnode.c block = sv->sv_i.sfi_direct[i];
i 1160 kern/fs/sfs/sfs_vnode.c if (i >= blocklen && block != 0) {
i 1162 kern/fs/sfs/sfs_vnode.c sv->sv_i.sfi_direct[i] = 0;
i 1657 kern/fs/sfs/sfs_vnode.c unsigned i, num;
i 1664 kern/fs/sfs/sfs_vnode.c for (i=0; i<num; i++) {
i 1665 kern/fs/sfs/sfs_vnode.c v = vnodearray_get(sfs->sfs_vnodes, i);
i 81 kern/lib/kprintf.c size_t i;
i 85 kern/lib/kprintf.c for (i=0; i<len; i++) {
i 86 kern/lib/kprintf.c putch(data[i]);
i 29 kern/lib/queue.c int i, result;
i 45 kern/lib/queue.c for (i=onr; i!=onw; i = (i+1)%osize) {
i 46 kern/lib/queue.c result = q_addtail(q, olddata[i]);
i 306 kern/proc/proc.c unsigned i, num;
i 314 kern/proc/proc.c for (i=0; i<num; i++) {
i 315 kern/proc/proc.c if (threadarray_get(&proc->p_threads, i) == t) {
i 316 kern/proc/proc.c threadarray_remove(&proc->p_threads, i);
i 313 kern/startup/menu.c int i;
i 328 kern/startup/menu.c for (i=0; mounttable[i].name; i++) {
i 329 kern/startup/menu.c if (!strcmp(mounttable[i].name, fstype)) {
i 330 kern/startup/menu.c return mounttable[i].func(device);
i 407 kern/startup/menu.c int ct, half, i;
i 412 kern/startup/menu.c for (i=ct=0; x[i]; i++) {
i 417 kern/startup/menu.c for (i=0; i<half; i++) {
i 418 kern/startup/menu.c kprintf(" %-36s", x[i]);
i 419 kern/startup/menu.c if (i+half < ct) {
i 420 kern/startup/menu.c kprintf("%s", x[i+half]);
i 607 kern/startup/menu.c int i, result;
i 624 kern/startup/menu.c for (i=0; cmdtable[i].name; i++) {
i 625 kern/startup/menu.c if (*cmdtable[i].name && !strcmp(args[0], cmdtable[i].name)) {
i 626 kern/startup/menu.c KASSERT(cmdtable[i].func!=NULL);
i 630 kern/startup/menu.c result = cmdtable[i].func(nargs, args);
i 142 kern/synchprobs/catmouse.c int i;
i 151 kern/synchprobs/catmouse.c for(i=0;i<NumBowls;i++) {
i 152 kern/synchprobs/catmouse.c bowls[i] = '-';
i 437 kern/synchprobs/catmouse.c int i;
i 447 kern/synchprobs/catmouse.c for(i=0;i<NumLoops;i++) {
i 501 kern/synchprobs/catmouse.c int i;
i 510 kern/synchprobs/catmouse.c for(i=0;i<NumLoops;i++) {
i 572 kern/synchprobs/catmouse.c int i;
i 682 kern/synchprobs/catmouse.c for(i=0;i<(NumCats+NumMice);i++) {
i 76 kern/synchprobs/whalemating.c int i, j, err=0;
i 81 kern/synchprobs/whalemating.c for (i = 0; i < 3; i++) {
i 84 kern/synchprobs/whalemating.c switch(i) {
i 99 kern/synchprobs/whalemating.c switch(i) {
i 158 kern/syscall/loadelf.c int result, i;
i 220 kern/syscall/loadelf.c for (i=0; i<eh.e_phnum; i++) {
i 221 kern/syscall/loadelf.c off_t offset = eh.e_phoff + i*eh.e_phentsize;
i 265 kern/syscall/loadelf.c for (i=0; i<eh.e_phnum; i++) {
i 266 kern/syscall/loadelf.c off_t offset = eh.e_phoff + i*eh.e_phentsize;
i 42 kern/test/arraytest.c int i, j, n, r, *p;
i 44 kern/test/arraytest.c for (i=0; i<TESTSIZE; i++) {
i 45 kern/test/arraytest.c testarray[i]=i;
i 51 kern/test/arraytest.c for (i=0; i<TESTSIZE; i++) {
i 52 kern/test/arraytest.c r = array_add(a, &testarray[i], NULL);
i 55 kern/test/arraytest.c KASSERT(n==i+1);
i 60 kern/test/arraytest.c for (i=0; i<TESTSIZE; i++) {
i 61 kern/test/arraytest.c p = array_get(a, i);
i 62 kern/test/arraytest.c KASSERT(*p == i);
i 68 kern/test/arraytest.c i = random()%TESTSIZE;
i 69 kern/test/arraytest.c p = array_get(a, i);
i 70 kern/test/arraytest.c KASSERT(*p == i);
i 75 kern/test/arraytest.c for (i=0; i<TESTSIZE; i++) {
i 76 kern/test/arraytest.c array_set(a, i, &testarray[TESTSIZE-i-1]);
i 79 kern/test/arraytest.c for (i=0; i<TESTSIZE; i++) {
i 80 kern/test/arraytest.c p = array_get(a, i);
i 81 kern/test/arraytest.c KASSERT(*p == TESTSIZE-i-1);
i 87 kern/test/arraytest.c for (i=0; i<TESTSIZE/2; i++) {
i 88 kern/test/arraytest.c p = array_get(a, i);
i 89 kern/test/arraytest.c KASSERT(*p == TESTSIZE-i-1);
i 94 kern/test/arraytest.c for (i=1; i<TESTSIZE/2 - 1; i++) {
i 95 kern/test/arraytest.c p = array_get(a, i);
i 96 kern/test/arraytest.c KASSERT(*p == TESTSIZE-i-2);
i 43 kern/test/bitmaptest.c int i;
i 50 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 51 kern/test/bitmaptest.c data[i] = random()%2;
i 57 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 58 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
i 61 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 62 kern/test/bitmaptest.c if (data[i]) {
i 63 kern/test/bitmaptest.c bitmap_mark(b, i);
i 66 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 67 kern/test/bitmaptest.c if (data[i]) {
i 68 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
i 71 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
i 75 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 76 kern/test/bitmaptest.c if (data[i]) {
i 77 kern/test/bitmaptest.c bitmap_unmark(b, i);
i 80 kern/test/bitmaptest.c bitmap_mark(b, i);
i 83 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 84 kern/test/bitmaptest.c if (data[i]) {
i 85 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i)==0);
i 88 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
i 99 kern/test/bitmaptest.c for (i=0; i<TESTSIZE; i++) {
i 100 kern/test/bitmaptest.c KASSERT(bitmap_isset(b, i));
i 101 kern/test/bitmaptest.c KASSERT(data[i]==0);
i 81 kern/test/fstest.c int i, ch;
i 86 kern/test/fstest.c for (i=0; str[i]; i++) {
i 87 kern/test/fstest.c ch = str[i];
i 95 kern/test/fstest.c str[i] = ch;
i 139 kern/test/fstest.c int i;
i 167 kern/test/fstest.c for (i=0; i<NCHUNKS; i++) {
i 168 kern/test/fstest.c if (i % stridesize != stridepos) {
i 173 kern/test/fstest.c rotate(buf, i);
i 216 kern/test/fstest.c int i;
i 234 kern/test/fstest.c for (i=0; i<NCHUNKS; i++) {
i 250 kern/test/fstest.c rotate(buf, -i);
i 253 kern/test/fstest.c name, i+1, buf);
i 316 kern/test/fstest.c int i, err;
i 327 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 329 kern/test/fstest.c readstress_thread, (char *)filesys, i);
i 336 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 383 kern/test/fstest.c int i, err;
i 389 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 391 kern/test/fstest.c writestress_thread, (char *)filesys, i);
i 397 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 425 kern/test/fstest.c int i, err;
i 443 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 445 kern/test/fstest.c writestress2_thread, (char *)filesys, i);
i 452 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 476 kern/test/fstest.c int i;
i 479 kern/test/fstest.c for (i=0; i<NCREATES; i++) {
i 481 kern/test/fstest.c snprintf(numstr, sizeof(numstr), "%lu-%d", num, i);
i 484 kern/test/fstest.c kprintf("*** Thread %lu: file %d: failed\n", num, i);
i 490 kern/test/fstest.c kprintf("*** Thread %lu: file %d: failed\n", num, i);
i 496 kern/test/fstest.c kprintf("*** Thread %lu: file %d: failed\n", num, i);
i 510 kern/test/fstest.c int i, err;
i 516 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 519 kern/test/fstest.c createstress_thread, (char *)filesys, i);
i 522 kern/test/fstest.c createstress_thread, (char *)filesys, i,
i 531 kern/test/fstest.c for (i=0; i<NTHREADS; i++) {
i 62 kern/test/malloctest.c int i;
i 64 kern/test/malloctest.c for (i=0; i<NTRIES; i++) {
i 110 kern/test/malloctest.c int i, result;
i 122 kern/test/malloctest.c for (i=0; i<NTHREADS; i++) {
i 124 kern/test/malloctest.c mallocthread, sem, i);
i 131 kern/test/malloctest.c for (i=0; i<NTHREADS; i++) {
i 112 kern/test/synchtest.c int i;
i 120 kern/test/synchtest.c for (i=0; i<NSEMLOOPS; i++) {
i 133 kern/test/synchtest.c int i, result;
i 145 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 146 kern/test/synchtest.c result = thread_fork("semtest", NULL, semtestthread, NULL, i);
i 153 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 186 kern/test/synchtest.c int i;
i 189 kern/test/synchtest.c for (i=0; i<NLOCKLOOPS; i++) {
i 231 kern/test/synchtest.c int i, result;
i 239 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 241 kern/test/synchtest.c NULL, i);
i 247 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 263 kern/test/synchtest.c int i;
i 270 kern/test/synchtest.c for (i=0; i<NCVLOOPS; i++) {
i 317 kern/test/synchtest.c int i, result;
i 332 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 333 kern/test/synchtest.c result = thread_fork("synchtest", NULL, cvtestthread, NULL, i);
i 339 kern/test/synchtest.c for (i=0; i<NTHREADS; i++) {
i 60 kern/test/threadtest.c int i;
i 64 kern/test/threadtest.c for (i=0; i<120; i++) {
i 85 kern/test/threadtest.c volatile int i;
i 90 kern/test/threadtest.c for (i=0; i<200000; i++);
i 101 kern/test/threadtest.c int i, result;
i 103 kern/test/threadtest.c for (i=0; i<NTHREADS; i++) {
i 104 kern/test/threadtest.c snprintf(name, sizeof(name), "threadtest%d", i);
i 107 kern/test/threadtest.c NULL, i);
i 114 kern/test/threadtest.c for (i=0; i<NTHREADS; i++) {
i 70 kern/test/tt3.c int i;
i 75 kern/test/tt3.c for (i=0; i<NWAITCHANS; i++) {
i 76 kern/test/tt3.c snprintf(tmp, sizeof(tmp), "wc%d", i);
i 77 kern/test/tt3.c waitchans[i] = wchan_create(kstrdup(tmp));
i 87 kern/test/tt3.c int i, j;
i 91 kern/test/tt3.c for (i=0; i<SLEEPALOT_PRINTS; i++) {
i 108 kern/test/tt3.c int i, done;
i 121 kern/test/tt3.c for (i=0; i<WAKER_WAKES; i++) {
i 138 kern/test/tt3.c int i, result;
i 140 kern/test/tt3.c for (i=0; i<howmany; i++) {
i 141 kern/test/tt3.c snprintf(name, sizeof(name), "sleepalot%d", i);
i 142 kern/test/tt3.c result = thread_fork(name, NULL, sleepalot_thread, NULL, i);
i 162 kern/test/tt3.c int i, j, k, m;
i 176 kern/test/tt3.c for (i=0; i<DIM; i++) {
i 179 kern/test/tt3.c m1->m[i][j] = rand >> 16;
i 180 kern/test/tt3.c m2->m[i][j] = rand & 0xffff;
i 184 kern/test/tt3.c for (i=0; i<DIM; i++) {
i 188 kern/test/tt3.c tot += m1->m[i][k] * m2->m[k][j];
i 190 kern/test/tt3.c m3->m[i][j] = tot;
i 195 kern/test/tt3.c for (i=0; i<DIM; i++) {
i 196 kern/test/tt3.c tot += m3->m[i][i];
i 215 kern/test/tt3.c int i, result;
i 217 kern/test/tt3.c for (i=0; i<howmany; i++) {
i 218 kern/test/tt3.c snprintf(name, sizeof(name), "compute%d", i);
i 219 kern/test/tt3.c result = thread_fork(name, NULL, compute_thread, NULL, i);
i 230 kern/test/tt3.c int i;
i 231 kern/test/tt3.c for (i=0; i<howmanytotal; i++) {
i 62 kern/test/uw-tests.c int i;
i 66 kern/test/uw-tests.c for (i=0; i<NTESTLOOPS; i++) {
i 95 kern/test/uw-tests.c int i;
i 99 kern/test/uw-tests.c for (i=0; i<NTESTLOOPS; i++) {
i 126 kern/test/uw-tests.c int i, result;
i 135 kern/test/uw-tests.c for (i=0; i<NTESTTHREADS; i++) {
i 136 kern/test/uw-tests.c snprintf(name, NAME_LEN, "add_thread %d", i);
i 137 kern/test/uw-tests.c result = thread_fork(name, NULL, add_thread, NULL, i);
i 144 kern/test/uw-tests.c for (i=0; i<NTESTTHREADS; i++) {
i 145 kern/test/uw-tests.c snprintf(name, NAME_LEN, "sub_thread %d", i);
i 146 kern/test/uw-tests.c result = thread_fork(name, NULL, sub_thread, NULL, i);
i 153 kern/test/uw-tests.c for (i=0; i<NTESTTHREADS*2; i++) {
i 178 kern/test/uw-tests.c int i;
i 183 kern/test/uw-tests.c for (i=0; i<NTESTLOOPS; i++) {
i 205 kern/test/uw-tests.c if (i % 2 == 0) {
i 216 kern/test/uw-tests.c if (i % 2 == 0) {
i 223 kern/test/uw-tests.c if (i % 2 == 0) {
i 229 kern/test/uw-tests.c if (i % 4 == 0) {
i 235 kern/test/uw-tests.c if (i % 4 == 0) {
i 241 kern/test/uw-tests.c if (i % 8 == 0) {
i 260 kern/test/uw-tests.c int i, result;
i 272 kern/test/uw-tests.c for (i=0; i<NTESTTHREADS; i++) {
i 273 kern/test/uw-tests.c snprintf(name, NAME_LEN, "vmstatsthread %d", i);
i 274 kern/test/uw-tests.c result = thread_fork(name, NULL, vmstats_thread, NULL, i);
i 281 kern/test/uw-tests.c for (i=0; i<NTESTTHREADS; i++) {
i 415 kern/thread/thread.c unsigned i;
i 422 kern/thread/thread.c for (i=0; i<cpuarray_num(&allcpus) - 1; i++) {
i 756 kern/thread/thread.c int i, n;
i 758 kern/thread/thread.c for (i=0; i<n; i++) {
i 859 kern/thread/thread.c unsigned i, numcpus;
i 866 kern/thread/thread.c for (i=0; i<numcpus; i++) {
i 867 kern/thread/thread.c c = cpuarray_get(&allcpus, i);
i 884 kern/thread/thread.c for (i=0; i<to_send; i++) {
i 890 kern/thread/thread.c for (i=0; i < numcpus && to_send > 0; i++) {
i 891 kern/thread/thread.c c = cpuarray_get(&allcpus, i);
i 1132 kern/thread/thread.c unsigned i;
i 1135 kern/thread/thread.c for (i=0; i < cpuarray_num(&allcpus); i++) {
i 1136 kern/thread/thread.c c = cpuarray_get(&allcpus, i);
i 1169 kern/thread/thread.c int i;
i 1200 kern/thread/thread.c for (i=0; i<curcpu->c_numshootdown; i++) {
i 1201 kern/thread/thread.c vm_tlbshootdown(&curcpu->c_shootdown[i]);
i 155 kern/vfs/vfslist.c unsigned i, num;
i 160 kern/vfs/vfslist.c for (i=0; i<num; i++) {
i 161 kern/vfs/vfslist.c dev = knowndevarray_get(knowndevs, i);
i 180 kern/vfs/vfslist.c unsigned i, num;
i 185 kern/vfs/vfslist.c for (i=0; i<num; i++) {
i 186 kern/vfs/vfslist.c kd = knowndevarray_get(knowndevs, i);
i 260 kern/vfs/vfslist.c unsigned i, num;
i 267 kern/vfs/vfslist.c for (i=0; i<num; i++) {
i 268 kern/vfs/vfslist.c kd = knowndevarray_get(knowndevs, i);
i 338 kern/vfs/vfslist.c unsigned i, num;
i 344 kern/vfs/vfslist.c for (i=0; i<num; i++) {
i 345 kern/vfs/vfslist.c kd = knowndevarray_get(knowndevs, i);
i 480 kern/vfs/vfslist.c unsigned i, num;
i 486 kern/vfs/vfslist.c for (i=0; !found && i<num; i++) {
i 487 kern/vfs/vfslist.c dev = knowndevarray_get(knowndevs, i);
i 603 kern/vfs/vfslist.c unsigned i, num;
i 609 kern/vfs/vfslist.c for (i=0; i<num; i++) {
i 610 kern/vfs/vfslist.c dev = knowndevarray_get(knowndevs, i);
i 132 kern/vfs/vfslookup.c int slash=-1, colon=-1, i;
i 142 kern/vfs/vfslookup.c for (i=0; path[i]; i++) {
i 143 kern/vfs/vfslookup.c if (path[i]==':') {
i 144 kern/vfs/vfslookup.c colon = i;
i 147 kern/vfs/vfslookup.c if (path[i]=='/') {
i 148 kern/vfs/vfslookup.c slash = i;
i 238 kern/vm/copyinout.c size_t i;
i 240 kern/vm/copyinout.c for (i=0; i<maxlen && i<stoplen; i++) {
i 241 kern/vm/copyinout.c dest[i] = src[i];
i 242 kern/vm/copyinout.c if (src[i] == 0) {
i 244 kern/vm/copyinout.c *gotlen = i+1;
i 45 kern/vm/kmalloc.c size_t i;
i 47 kern/vm/kmalloc.c for (i=0; i<len/sizeof(uint32_t); i++) {
i 48 kern/vm/kmalloc.c ptr[i] = 0xdeadbeef;
i 148 kern/vm/kmalloc.c unsigned i,j;
i 151 kern/vm/kmalloc.c for (i=0; i<INUSE_WORDS; i++) {
i 152 kern/vm/kmalloc.c if (pagerefs_inuse[i]==0xffffffff) {
i 157 kern/vm/kmalloc.c if ((pagerefs_inuse[i] & k)==0) {
i 158 kern/vm/kmalloc.c pagerefs_inuse[i] |= k;
i 159 kern/vm/kmalloc.c return &pagerefs[i*32 + j];
i 173 kern/vm/kmalloc.c size_t i, j;
i 178 kern/vm/kmalloc.c i = j/32;
i 180 kern/vm/kmalloc.c KASSERT((pagerefs_inuse[i] & k) != 0);
i 181 kern/vm/kmalloc.c pagerefs_inuse[i] &= ~k;
i 255 kern/vm/kmalloc.c int i;
i 260 kern/vm/kmalloc.c for (i=0; i<NSIZES; i++) {
i 261 kern/vm/kmalloc.c for (pr = sizebases[i]; pr != NULL; pr = pr->next_samesize) {
i 289 kern/vm/kmalloc.c unsigned i, n, index;
i 296 kern/vm/kmalloc.c for (i=0; i<sizeof(freemap)/sizeof(freemap[0]); i++) {
i 297 kern/vm/kmalloc.c freemap[i] = 0;
i 323 kern/vm/kmalloc.c for (i=0; i<n; i++) {
i 324 kern/vm/kmalloc.c int val = (freemap[i/32] & (1<<(i%32)))!=0;
i 326 kern/vm/kmalloc.c if (i%64==63 && i<n-1) {
i 381 kern/vm/kmalloc.c unsigned i;
i 382 kern/vm/kmalloc.c for (i=0; i<NSIZES; i++) {
i 383 kern/vm/kmalloc.c if (sz <= sizes[i]) {
i 384 kern/vm/kmalloc.c return i;
i 406 kern/vm/kmalloc.c volatile int i;
i 492 kern/vm/kmalloc.c for (i=1; i<pr->nfree; i++) {
i 493 kern/vm/kmalloc.c fl = (struct freelist *)(fla + i*sizes[blktype]);
i 494 kern/vm/kmalloc.c fl->next = (struct freelist *)(fla + (i-1)*sizes[blktype]);
i 75 kern/vm/uw-vmstats.c int i = 0;
i 83 kern/vm/uw-vmstats.c for (i=0; i<VMSTAT_COUNT; i++) {
i 84 kern/vm/uw-vmstats.c stats_counts[i] = 0;
i 99 kern/vm/uw-vmstats.c int i = 0;
i 107 kern/vm/uw-vmstats.c for (i=0; i<VMSTAT_COUNT; i++) {
i 108 kern/vm/uw-vmstats.c kprintf("VMSTAT %25s = %10d\n", stats_names[i], stats_counts[i]);
i 114 user/bin/cat/cat.c int i;
i 115 user/bin/cat/cat.c for (i=1; i<argc; i++) {
i 116 user/bin/cat/cat.c cat(argv[i]);
i 304 user/bin/ls/ls.c int i,j, items=0;
i 309 user/bin/ls/ls.c for (i=1; i<argc; i++) {
i 310 user/bin/ls/ls.c if (argv[i][0]!='-') {
i 318 user/bin/ls/ls.c for (i=1; i<argc; i++) {
i 319 user/bin/ls/ls.c if (argv[i][0]=='-') {
i 324 user/bin/ls/ls.c for (j=1; argv[i][j]; j++) {
i 325 user/bin/ls/ls.c option(argv[i][j]);
i 332 user/bin/ls/ls.c listitem(argv[i], items>1);
i 51 user/bin/rm/rm.c int i;
i 59 user/bin/rm/rm.c for (i=1; i<argc; i++) {
i 60 user/bin/rm/rm.c doremove(argv[i]);
i 80 user/bin/sh/sh.c int i;
i 82 user/bin/sh/sh.c for (i = 0; i < MAXBG; i++) {
i 83 user/bin/sh/sh.c if (bgpids[i] == 0) {
i 100 user/bin/sh/sh.c int i;
i 101 user/bin/sh/sh.c for (i = 0; i < MAXBG; i++) {
i 102 user/bin/sh/sh.c if (bgpids[i] == 0) {
i 103 user/bin/sh/sh.c bgpids[i] = pid;
i 186 user/bin/sh/sh.c int i;
i 187 user/bin/sh/sh.c for (i=0; i < MAXBG; i++) {
i 188 user/bin/sh/sh.c if (bgpids[i] != 0) {
i 189 user/bin/sh/sh.c if (dowaitpoll(bgpids[i])) {
i 190 user/bin/sh/sh.c bgpids[i] = 0;
i 207 user/bin/sh/sh.c int i;
i 213 user/bin/sh/sh.c for (i = 0; i < MAXBG; i++) {
i 214 user/bin/sh/sh.c if (bgpids[i]==pid) {
i 215 user/bin/sh/sh.c bgpids[i] = 0;
i 221 user/bin/sh/sh.c for (i=0; i < MAXBG; i++) {
i 222 user/bin/sh/sh.c if (bgpids[i] != 0) {
i 223 user/bin/sh/sh.c dowait(bgpids[i]);
i 224 user/bin/sh/sh.c bgpids[i] = 0;
i 307 user/bin/sh/sh.c int nargs, i;
i 332 user/bin/sh/sh.c for (i=0; builtins[i].name; i++) {
i 333 user/bin/sh/sh.c if (!strcmp(builtins[i].name, args[0])) {
i 334 user/bin/sh/sh.c return builtins[i].func(nargs, args);
i 45 user/lib/libc/stdio/printf.c unsigned i;
i 48 user/lib/libc/stdio/printf.c for (i=0; i<len; i++) {
i 49 user/lib/libc/stdio/printf.c putchar(data[i]);
i 217 user/lib/libc/stdlib/malloc.c uintptr_t i;
i 223 user/lib/libc/stdlib/malloc.c for (i=__heapbase; i<__heaptop; i += M_NEXTOFF(mh)) {
i 224 user/lib/libc/stdlib/malloc.c mh = (struct mheader *) i;
i 228 user/lib/libc/stdlib/malloc.c (unsigned long) i);
i 234 user/lib/libc/stdlib/malloc.c (unsigned long) i,
i 241 user/lib/libc/stdlib/malloc.c (unsigned long) i + MBLOCKSIZE,
i 243 user/lib/libc/stdlib/malloc.c (unsigned long) (i+M_NEXTOFF(mh)),
i 246 user/lib/libc/stdlib/malloc.c if (i!=__heaptop) {
i 336 user/lib/libc/stdlib/malloc.c uintptr_t i;
i 362 user/lib/libc/stdlib/malloc.c for (i=__heapbase; i<__heaptop; i += M_NEXTOFF(mh)) {
i 363 user/lib/libc/stdlib/malloc.c mh = (struct mheader *) i;
i 367 user/lib/libc/stdlib/malloc.c (unsigned long) i);
i 373 user/lib/libc/stdlib/malloc.c (unsigned long) i,
i 403 user/lib/libc/stdlib/malloc.c if (i!=__heaptop) {
i 441 user/lib/libc/stdlib/malloc.c size_t i, n = size/sizeof(uint32_t);
i 442 user/lib/libc/stdlib/malloc.c for (i=0; i<n; i++) {
i 443 user/lib/libc/stdlib/malloc.c x[i] = 0xdeadbeef;
i 234 user/lib/libc/stdlib/random.c int i;
i 240 user/lib/libc/stdlib/random.c for (i = 1; i < rand_deg; i++)
i 241 user/lib/libc/stdlib/random.c state[i] = 1103515245L * state[i - 1] + 12345L;
i 244 user/lib/libc/stdlib/random.c for (i = 0; i < 10 * rand_deg; i++)
i 417 user/lib/libc/stdlib/random.c long i;
i 421 user/lib/libc/stdlib/random.c i = state[0];
i 422 user/lib/libc/stdlib/random.c state[0] = i = (i * 1103515245L + 12345L) & 0x7fffffff;
i 430 user/lib/libc/stdlib/random.c i = ((unsigned long)*f >> 1) & 0x7fffffff;
i 441 user/lib/libc/stdlib/random.c return(i);
i 42 user/lib/libc/string/memcmp.c size_t i;
i 44 user/lib/libc/string/memcmp.c for (i=0; i<len; i++) {
i 45 user/lib/libc/string/memcmp.c if (a[i] != b[i]) {
i 46 user/lib/libc/string/memcmp.c return (int)(a[i] - b[i]);
i 40 user/lib/libc/string/memset.c size_t i;
i 42 user/lib/libc/string/memset.c for (i=0; i<len; i++) {
i 43 user/lib/libc/string/memset.c p[i] = ch;
i 81 user/sbin/dumpsfs/dumpsfs.c int i;
i 86 user/sbin/dumpsfs/dumpsfs.c for (i=0; i<nsds; i++) {
i 87 user/sbin/dumpsfs/dumpsfs.c uint32_t ino = SWAPL(sds[i].sfd_ino);
i 92 user/sbin/dumpsfs/dumpsfs.c sds[i].sfd_name[SFS_NAMELEN-1] = 0; /* just in case */
i 93 user/sbin/dumpsfs/dumpsfs.c printf(" %u %s\n", ino, sds[i].sfd_name);
i 104 user/sbin/dumpsfs/dumpsfs.c int nentries, i;
i 115 user/sbin/dumpsfs/dumpsfs.c for (i=0; i<SFS_NDIRECT; i++) {
i 116 user/sbin/dumpsfs/dumpsfs.c block = SWAPL(sfi.sfi_direct[i]);
i 124 user/sbin/dumpsfs/dumpsfs.c for (i=0; i<SFS_DBPERIDB; i++) {
i 125 user/sbin/dumpsfs/dumpsfs.c block = SWAPL(ib[i]);
i 140 user/sbin/dumpsfs/dumpsfs.c uint32_t i, j;
i 145 user/sbin/dumpsfs/dumpsfs.c for (i=0; i<nblocks; i++) {
i 146 user/sbin/dumpsfs/dumpsfs.c diskread(data, SFS_MAP_LOCATION+i);
i 124 user/sbin/mksfs/mksfs.c uint32_t i;
i 133 user/sbin/mksfs/mksfs.c for (i=0; i<nblocks; i++) {
i 134 user/sbin/mksfs/mksfs.c doallocbit(SFS_MAP_LOCATION+i);
i 136 user/sbin/mksfs/mksfs.c for (i=fsblocks; i<nbits; i++) {
i 137 user/sbin/mksfs/mksfs.c doallocbit(i);
i 140 user/sbin/mksfs/mksfs.c for (i=0; i<nblocks; i++) {
i 141 user/sbin/mksfs/mksfs.c ptr = bitbuf + i*SFS_BLOCKSIZE;
i 142 user/sbin/mksfs/mksfs.c diskwrite(ptr, SFS_MAP_LOCATION+i);
i 92 user/sbin/sfsck/sfsck.c int i;
i 98 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NDIRECT; i++) {
i 99 user/sbin/sfsck/sfsck.c sfi->sfi_direct[i] = SWAPL(sfi->sfi_direct[i]);
i 103 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NIDIRECT; i++) {
i 104 user/sbin/sfsck/sfsck.c sfi->sfi_indirect[i] = SWAPL(sfi->sfi_indirect[i]);
i 111 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NDIDIRECT; i++) {
i 112 user/sbin/sfsck/sfsck.c sfi->sfi_dindirect[i] = SWAPL(sfi->sfi_dindirect[i]);
i 121 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NTIDIRECT; i++) {
i 122 user/sbin/sfsck/sfsck.c sfi->sfi_tindirect[i] = SWAPL(sfi->sfi_tindirect[i]);
i 142 user/sbin/sfsck/sfsck.c int i;
i 143 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_DBPERIDB; i++) {
i 144 user/sbin/sfsck/sfsck.c entries[i] = SWAPL(entries[i]);
i 197 user/sbin/sfsck/sfsck.c size_t i, mapsize = bitblocks * SFS_BLOCKSIZE;
i 200 user/sbin/sfsck/sfsck.c for (i=0; i<mapsize; i++) {
i 201 user/sbin/sfsck/sfsck.c bitmapdata[i] = tofreedata[i] = 0;
i 307 user/sbin/sfsck/sfsck.c uint32_t alloccount=0, freecount=0, i, j;
i 310 user/sbin/sfsck/sfsck.c for (i=0; i<bitblocks; i++) {
i 311 user/sbin/sfsck/sfsck.c diskread(bits, SFS_MAP_LOCATION+i);
i 313 user/sbin/sfsck/sfsck.c found = bitmapdata + i*SFS_BLOCKSIZE;
i 314 user/sbin/sfsck/sfsck.c tofree = tofreedata + i*SFS_BLOCKSIZE;
i 339 user/sbin/sfsck/sfsck.c reportbits(i, j, tmp, "free");
i 348 user/sbin/sfsck/sfsck.c reportbits(i, j, tmp, "allocated");
i 358 user/sbin/sfsck/sfsck.c diskwrite(bits, SFS_MAP_LOCATION+i);
i 415 user/sbin/sfsck/sfsck.c int i;
i 420 user/sbin/sfsck/sfsck.c for (i=0; i<ninodes; i++) {
i 421 user/sbin/sfsck/sfsck.c if (inodes[i].ino==ino) {
i 422 user/sbin/sfsck/sfsck.c assert(inodes[i].linkcount==0);
i 436 user/sbin/sfsck/sfsck.c int i;
i 437 user/sbin/sfsck/sfsck.c for (i=0; i<ninodes; i++) {
i 438 user/sbin/sfsck/sfsck.c if (inodes[i].ino==ino) {
i 439 user/sbin/sfsck/sfsck.c assert(inodes[i].linkcount>0);
i 440 user/sbin/sfsck/sfsck.c inodes[i].linkcount++;
i 453 user/sbin/sfsck/sfsck.c int i;
i 455 user/sbin/sfsck/sfsck.c for (i=0; i<ninodes; i++) {
i 456 user/sbin/sfsck/sfsck.c if (inodes[i].linkcount==0) {
i 460 user/sbin/sfsck/sfsck.c diskread(&sfi, inodes[i].ino);
i 463 user/sbin/sfsck/sfsck.c if (sfi.sfi_linkcount != inodes[i].linkcount) {
i 465 user/sbin/sfsck/sfsck.c (unsigned long) inodes[i].ino,
i 467 user/sbin/sfsck/sfsck.c (unsigned long) inodes[i].linkcount);
i 468 user/sbin/sfsck/sfsck.c sfi.sfi_linkcount = inodes[i].linkcount;
i 471 user/sbin/sfsck/sfsck.c diskwrite(&sfi, inodes[i].ino);
i 483 user/sbin/sfsck/sfsck.c size_t i;
i 484 user/sbin/sfsck/sfsck.c for (i=0; i<maxlen; i++) {
i 485 user/sbin/sfsck/sfsck.c if (buf[i]==0) {
i 497 user/sbin/sfsck/sfsck.c size_t i;
i 500 user/sbin/sfsck/sfsck.c for (i=0; buf[i]; i++) {
i 501 user/sbin/sfsck/sfsck.c if (buf[i]==':' || buf[i]=='/') {
i 502 user/sbin/sfsck/sfsck.c buf[i] = '_';
i 516 user/sbin/sfsck/sfsck.c uint32_t i;
i 533 user/sbin/sfsck/sfsck.c for (i=nblocks; i<bitblocks*SFS_BLOCKBITS; i++) {
i 534 user/sbin/sfsck/sfsck.c bitmap_mark(i, B_PASTEND, 0);
i 554 user/sbin/sfsck/sfsck.c for (i=0; i<bitblocks; i++) {
i 555 user/sbin/sfsck/sfsck.c bitmap_mark(SFS_MAP_LOCATION+i, B_BITBLOCK, i);
i 568 user/sbin/sfsck/sfsck.c uint32_t i, ct;
i 576 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_DBPERIDB; i++) {
i 577 user/sbin/sfsck/sfsck.c entries[i] = 0;
i 582 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_DBPERIDB; i++) {
i 583 user/sbin/sfsck/sfsck.c check_indirect_block(ino, &entries[i],
i 593 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_DBPERIDB; i++) {
i 595 user/sbin/sfsck/sfsck.c if (entries[i] != 0) {
i 596 user/sbin/sfsck/sfsck.c bitmap_mark(entries[i],
i 602 user/sbin/sfsck/sfsck.c if (entries[i] != 0) {
i 604 user/sbin/sfsck/sfsck.c bitmap_mark(entries[i],
i 607 user/sbin/sfsck/sfsck.c entries[i] = 0;
i 615 user/sbin/sfsck/sfsck.c for (i=ct=0; i<SFS_DBPERIDB; i++) {
i 616 user/sbin/sfsck/sfsck.c if (entries[i]!=0) ct++;
i 663 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NIDIRECT; i++) {
i 664 user/sbin/sfsck/sfsck.c check_indirect_block(ino, &sfi->sfi_indirect[i],
i 673 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NDIDIRECT; i++) {
i 674 user/sbin/sfsck/sfsck.c check_indirect_block(ino, &sfi->sfi_dindirect[i],
i 685 user/sbin/sfsck/sfsck.c for (i=0; i<SFS_NTIDIRECT; i++) {
i 686 user/sbin/sfsck/sfsck.c check_indirect_block(ino, &sfi->sfi_tindirect[i],
i 812 user/sbin/sfsck/sfsck.c unsigned i, j;
i 814 user/sbin/sfsck/sfsck.c for (i=0; i<nblocks; i++) {
i 815 user/sbin/sfsck/sfsck.c uint32_t block = dobmap(sfi, i);
i 817 user/sbin/sfsck/sfsck.c diskread(d + i*atonce, block);
i 819 user/sbin/sfsck/sfsck.c swapdir(&d[i*atonce+j]);
i 824 user/sbin/sfsck/sfsck.c bzero(d + i*atonce, SFS_BLOCKSIZE);
i 835 user/sbin/sfsck/sfsck.c unsigned i, j, bad;
i 837 user/sbin/sfsck/sfsck.c for (i=0; i<nblocks; i++) {
i 838 user/sbin/sfsck/sfsck.c uint32_t block = dobmap(sfi, i);
i 841 user/sbin/sfsck/sfsck.c swapdir(&d[i*atonce+j]);
i 843 user/sbin/sfsck/sfsck.c diskwrite(d + i*atonce, block);
i 847 user/sbin/sfsck/sfsck.c if (d[i*atonce+j].sfd_ino != SFS_NOINO ||
i 848 user/sbin/sfsck/sfsck.c d[i*atonce+j].sfd_name[0] != 0) {
i 880 user/sbin/sfsck/sfsck.c int i, j;
i 884 user/sbin/sfsck/sfsck.c for (i=0; i<num-1; i++) {
i 885 user/sbin/sfsck/sfsck.c for (j=i+1; j<num; j++) {
i 886 user/sbin/sfsck/sfsck.c if (f(&data[i], &data[j]) < 0) {
i 887 user/sbin/sfsck/sfsck.c int tmp = data[i];
i 888 user/sbin/sfsck/sfsck.c data[i] = data[j];
i 909 user/sbin/sfsck/sfsck.c int i;
i 910 user/sbin/sfsck/sfsck.c for (i=0; i<nd; i++) {
i 911 user/sbin/sfsck/sfsck.c if (d[i].sfd_ino==SFS_NOINO) {
i 912 user/sbin/sfsck/sfsck.c d[i].sfd_ino = ino;
i 913 user/sbin/sfsck/sfsck.c assert(strlen(name) < sizeof(d[i].sfd_name));
i 914 user/sbin/sfsck/sfsck.c strcpy(d[i].sfd_name, name);
i 976 user/sbin/sfsck/sfsck.c uint32_t dirsize, ndirentries, maxdirentries, subdircount, i;
i 1011 user/sbin/sfsck/sfsck.c for (i=ndirentries; i<maxdirentries; i++) {
i 1012 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino = SFS_NOINO;
i 1013 user/sbin/sfsck/sfsck.c bzero(direntries[i].sfd_name, sizeof(direntries[i].sfd_name));
i 1016 user/sbin/sfsck/sfsck.c for (i=0; i<ndirentries; i++) {
i 1017 user/sbin/sfsck/sfsck.c if (check_dir_entry(pathsofar, i, &direntries[i])) {
i 1020 user/sbin/sfsck/sfsck.c sortvector[i] = i;
i 1026 user/sbin/sfsck/sfsck.c for (i=0; i+1<ndirentries; i++) {
i 1027 user/sbin/sfsck/sfsck.c struct sfs_dir *d1 = &direntries[sortvector[i]];
i 1028 user/sbin/sfsck/sfsck.c struct sfs_dir *d2 = &direntries[sortvector[i+1]];
i 1058 user/sbin/sfsck/sfsck.c for (i=0; i<ndirentries; i++) {
i 1059 user/sbin/sfsck/sfsck.c if (!strcmp(direntries[i].sfd_name, ".")) {
i 1060 user/sbin/sfsck/sfsck.c if (direntries[i].sfd_ino != ino) {
i 1064 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino = ino;
i 1070 user/sbin/sfsck/sfsck.c else if (!strcmp(direntries[i].sfd_name, "..")) {
i 1071 user/sbin/sfsck/sfsck.c if (direntries[i].sfd_ino != parentino) {
i 1075 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino = parentino;
i 1131 user/sbin/sfsck/sfsck.c for (i=0; i<ndirentries; i++) {
i 1132 user/sbin/sfsck/sfsck.c if (!strcmp(direntries[i].sfd_name, ".")) {
i 1135 user/sbin/sfsck/sfsck.c else if (!strcmp(direntries[i].sfd_name, "..")) {
i 1138 user/sbin/sfsck/sfsck.c else if (direntries[i].sfd_ino == SFS_NOINO) {
i 1145 user/sbin/sfsck/sfsck.c diskread(&subsfi, direntries[i].sfd_ino);
i 1148 user/sbin/sfsck/sfsck.c pathsofar, direntries[i].sfd_name);
i 1152 user/sbin/sfsck/sfsck.c if (check_inode_blocks(direntries[i].sfd_ino,
i 1156 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino);
i 1158 user/sbin/sfsck/sfsck.c observe_filelink(direntries[i].sfd_ino);
i 1161 user/sbin/sfsck/sfsck.c if (check_dir(direntries[i].sfd_ino,
i 1168 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino = SFS_NOINO;
i 1169 user/sbin/sfsck/sfsck.c direntries[i].sfd_name[0] = 0;
i 1180 user/sbin/sfsck/sfsck.c direntries[i].sfd_ino = SFS_NOINO;
i 1181 user/sbin/sfsck/sfsck.c direntries[i].sfd_name[0] = 0;
i 45 user/testbin/add/add.c int i, j;
i 51 user/testbin/add/add.c i = atoi(argv[1]);
i 54 user/testbin/add/add.c printf("Answer: %d\n", i+j);
i 44 user/testbin/argtest/argtest.c int i;
i 48 user/testbin/argtest/argtest.c for (i=0; i<=argc; i++) {
i 49 user/testbin/argtest/argtest.c tmp = argv[i];
i 53 user/testbin/argtest/argtest.c printf("argv[%d]: %s\n", i, tmp);
i 227 user/testbin/badcall/driver.c int i;
i 228 user/testbin/badcall/driver.c for (i=0; ops[i].name; i++) {
i 229 user/testbin/badcall/driver.c printf("[%c] %-24s", ops[i].ch, ops[i].name);
i 230 user/testbin/badcall/driver.c if (i%2==1) {
i 234 user/testbin/badcall/driver.c if (i%2==1) {
i 249 user/testbin/badcall/driver.c int i, k;
i 261 user/testbin/badcall/driver.c for (i=0; ops[i].name; i++) {
i 262 user/testbin/badcall/driver.c printf("[%s]\n", ops[i].name);
i 263 user/testbin/badcall/driver.c ops[i].f();
i 270 user/testbin/badcall/driver.c for (i=0; ops[i].name; i++) {
i 271 user/testbin/badcall/driver.c if (ops[i].asst <= k) {
i 272 user/testbin/badcall/driver.c printf("[%s]\n", ops[i].name);
i 273 user/testbin/badcall/driver.c ops[i].f();
i 290 user/testbin/badcall/driver.c int op, i, j;
i 295 user/testbin/badcall/driver.c for (i=1; i<argc; i++) {
i 296 user/testbin/badcall/driver.c for (j=0; argv[i][j]; j++) {
i 298 user/testbin/badcall/driver.c argv[i][j]);
i 299 user/testbin/badcall/driver.c runit(argv[i][j]);
i 51 user/testbin/bigfile/bigfile.c int i, size;
i 69 user/testbin/bigfile/bigfile.c i=0;
i 70 user/testbin/bigfile/bigfile.c while (i<size) {
i 71 user/testbin/bigfile/bigfile.c snprintf(buffer, sizeof(buffer), "%-10d", i);
i 76 user/testbin/bigfile/bigfile.c i += len;
i 227 user/testbin/crash/crash.c int op, i, status;
i 234 user/testbin/crash/crash.c for (i=0; ops[i].name; i++) {
i 235 user/testbin/crash/crash.c printf("[%c] %s\n", ops[i].ch, ops[i].name);
i 246 user/testbin/crash/crash.c for (i=0; ops[i].name; i++) {
i 247 user/testbin/crash/crash.c printf("Running: [%c] %s\n", ops[i].ch, ops[i].name);
i 255 user/testbin/crash/crash.c ops[i].f();
i 60 user/testbin/ctest/ctest.c unsigned i, stride;
i 81 user/testbin/ctest/ctest.c for (i=0; i<SIZE; i++) {
i 82 user/testbin/ctest/ctest.c array[i].e = &array[(i+stride) % SIZE];
i 92 user/testbin/ctest/ctest.c for (i=0; i<SIZE; i++) {
i 93 user/testbin/ctest/ctest.c if (i % stride == 0) {
i 245 user/testbin/dirconc/dirconc.c int i, status;
i 247 user/testbin/dirconc/dirconc.c for (i=0; i<NPROCS; i++) {
i 248 user/testbin/dirconc/dirconc.c pids[i*4] = dofork(mkdir_proc);
i 249 user/testbin/dirconc/dirconc.c pids[i*4+1] = dofork(mkdir_proc);
i 250 user/testbin/dirconc/dirconc.c pids[i*4+2] = dofork(rename_proc);
i 251 user/testbin/dirconc/dirconc.c pids[i*4+3] = dofork(rmdir_proc);
i 254 user/testbin/dirconc/dirconc.c for (i=0; i<NPROCS*4; i++) {
i 255 user/testbin/dirconc/dirconc.c if (pids[i]>=0) {
i 256 user/testbin/dirconc/dirconc.c wp = waitpid(pids[i], &status, 0);
i 258 user/testbin/dirconc/dirconc.c say("waitpid %d: %s\n", (int) pids[i],
i 262 user/testbin/dirconc/dirconc.c say("pid %d: signal %d\n", (int) pids[i],
i 266 user/testbin/dirconc/dirconc.c say("pid %d: exit %d\n", (int) pids[i],
i 298 user/testbin/dirconc/dirconc.c int i;
i 300 user/testbin/dirconc/dirconc.c for (i=0; i<NNAMES; i++) {
i 301 user/testbin/dirconc/dirconc.c snprintf(buf, sizeof(buf), "%s/%s", sofar, names[i]);
i 97 user/testbin/dirseek/dirseek.c int i;
i 99 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 100 user/testbin/dirseek/dirseek.c if (!strcmp(testfiles[i].name, name)) {
i 101 user/testbin/dirseek/dirseek.c return i;
i 134 user/testbin/dirseek/dirseek.c int n, i, ix;
i 136 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 137 user/testbin/dirseek/dirseek.c testfiles[i].pos = -1;
i 176 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 177 user/testbin/dirseek/dirseek.c if (testfiles[i].pos < 0) {
i 179 user/testbin/dirseek/dirseek.c testfiles[i].name);
i 182 user/testbin/dirseek/dirseek.c if (i!=n) {
i 190 user/testbin/dirseek/dirseek.c n, i);
i 275 user/testbin/dirseek/dirseek.c int i;
i 278 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 279 user/testbin/dirseek/dirseek.c doreadone(i);
i 287 user/testbin/dirseek/dirseek.c int n, i, x;
i 291 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++);
i 292 user/testbin/dirseek/dirseek.c n = i;
i 295 user/testbin/dirseek/dirseek.c for (i=0; i<512; i++) {
i 328 user/testbin/dirseek/dirseek.c int i;
i 337 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 338 user/testbin/dirseek/dirseek.c if (pos <= testfiles[i].pos) {
i 340 user/testbin/dirseek/dirseek.c pos, testfiles[i].pos, testfiles[i].name);
i 365 user/testbin/dirseek/dirseek.c int valid, i, k=0;
i 376 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 377 user/testbin/dirseek/dirseek.c if (pos==testfiles[i].pos) {
i 458 user/testbin/dirseek/dirseek.c int fd, i, r;
i 463 user/testbin/dirseek/dirseek.c for (i=0; i<32; i++) {
i 490 user/testbin/dirseek/dirseek.c int i;
i 507 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 508 user/testbin/dirseek/dirseek.c if (testfiles[i].make_it) {
i 509 user/testbin/dirseek/dirseek.c mkfile(testfiles[i].name);
i 511 user/testbin/dirseek/dirseek.c testfiles[i].pos = -1;
i 519 user/testbin/dirseek/dirseek.c int i;
i 524 user/testbin/dirseek/dirseek.c for (i=0; testfiles[i].name; i++) {
i 525 user/testbin/dirseek/dirseek.c if (testfiles[i].make_it) {
i 526 user/testbin/dirseek/dirseek.c if (remove(testfiles[i].name)<0) {
i 527 user/testbin/dirseek/dirseek.c err(1, "%s: remove", testfiles[i].name);
i 54 user/testbin/dirtest/dirtest.c int i;
i 60 user/testbin/dirtest/dirtest.c for (i=0; i<MAXLEVELS; i++) {
i 73 user/testbin/dirtest/dirtest.c for (i=0; i<MAXLEVELS; i++) {
i 64 user/testbin/f_test/f_read.c int i;
i 67 user/testbin/f_test/f_read.c for (i = 1; i < SectorSize + 1; i++) {
i 68 user/testbin/f_test/f_read.c if (buffer[i] != ch) {
i 80 user/testbin/f_test/f_read.c int i, res;
i 89 user/testbin/f_test/f_read.c for (i=0; i<TMULT; i++) {
i 125 user/testbin/f_test/f_test.c int i, j, fileid;
i 135 user/testbin/f_test/f_test.c for(i = 0; i < BUFFER_SIZE; i++) {
i 136 user/testbin/f_test/f_test.c fbuffer[i] = LETTER(i);
i 140 user/testbin/f_test/f_test.c for (i = 0; i < size; i += BUFFER_SIZE) {
i 143 user/testbin/f_test/f_test.c if (!(i % (10 * BUFFER_SIZE))) {
i 144 user/testbin/f_test/f_test.c printf("\rBW : %d", i);
i 156 user/testbin/f_test/f_test.c for (i = 0; i < size; i += BUFFER_SIZE) {
i 166 user/testbin/f_test/f_test.c if (!(i % (10 * BUFFER_SIZE))) {
i 167 user/testbin/f_test/f_test.c printf("\rBR : %d", i);
i 174 user/testbin/f_test/f_test.c "inconsistent data read: %d", i+j);
i 195 user/testbin/f_test/f_test.c int i, fd;
i 208 user/testbin/f_test/f_test.c for (i = 0; i < SECTOR_SIZE + 1; i++) {
i 209 user/testbin/f_test/f_test.c cbuffer[i] = READCHAR;
i 212 user/testbin/f_test/f_test.c for (i = 0; i < TMULT; i++) {
i 246 user/testbin/f_test/f_test.c int i, fd;
i 253 user/testbin/f_test/f_test.c for (i = 0; i < depth; i++) {
i 275 user/testbin/f_test/f_test.c for (i = 0; i < depth; i++) {
i 64 user/testbin/f_test/f_write.c int i;
i 66 user/testbin/f_test/f_write.c for (i=0; i < SectorSize + 1; i++) {
i 67 user/testbin/f_test/f_write.c buffer[i] = WRITECHAR;
i 77 user/testbin/f_test/f_write.c for (i=0; i<TMULT; i++) {
i 72 user/testbin/farm/farm.c int i, status;
i 73 user/testbin/farm/farm.c for (i=0; i<npids; i++) {
i 74 user/testbin/farm/farm.c if (waitpid(pids[i], &status, 0)<0) {
i 75 user/testbin/farm/farm.c warn("waitpid for %d", pids[i]);
i 78 user/testbin/farm/farm.c warnx("pid %d: signal %d", pids[i], WTERMSIG(status));
i 81 user/testbin/farm/farm.c warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status));
i 46 user/testbin/faulter/faulter.c volatile int i;
i 49 user/testbin/faulter/faulter.c i = *(int *)REALLY_BIG_ADDRESS;
i 58 user/testbin/forkbomb/forkbomb.c int i;
i 66 user/testbin/forkbomb/forkbomb.c for (i=0; i<300; i++) {
i 75 user/testbin/forktest/forktest.c int i;
i 80 user/testbin/forktest/forktest.c for (i=0; i<800; i++) {
i 48 user/testbin/guzzle/guzzle.c volatile int i;
i 55 user/testbin/guzzle/guzzle.c for (i=0; i<TOP; i++) { /* tight loop */
i 57 user/testbin/guzzle/guzzle.c if ( (i%10000) == 0) {
i 40 user/testbin/hog/hog.c volatile int i;
i 42 user/testbin/hog/hog.c for (i=0; i<50000; i++)
i 51 user/testbin/huge/huge.c int i,j;
i 56 user/testbin/huge/huge.c for (i=0; i<NumPages; i++) {
i 57 user/testbin/huge/huge.c sparse[i][0]=i;
i 64 user/testbin/huge/huge.c for (i=0; i<NumPages; i++) {
i 65 user/testbin/huge/huge.c sparse[i][0]++;
i 73 user/testbin/huge/huge.c for (i=NumPages-1; i>=0; i--) {
i 74 user/testbin/huge/huge.c if (sparse[i][0]!=i+5) {
i 69 user/testbin/kitchen/kitchen.c int i, status;
i 70 user/testbin/kitchen/kitchen.c for (i=0; i<npids; i++) {
i 71 user/testbin/kitchen/kitchen.c if (waitpid(pids[i], &status, 0)<0) {
i 72 user/testbin/kitchen/kitchen.c warn("waitpid for %d", pids[i]);
i 75 user/testbin/kitchen/kitchen.c warnx("pid %d: signal %d", pids[i], WTERMSIG(status));
i 78 user/testbin/kitchen/kitchen.c warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status));
i 104 user/testbin/malloctest/malloctest.c size_t n, i;
i 111 user/testbin/malloctest/malloctest.c for (i=0; i<n; i++) {
i 112 user/testbin/malloctest/malloctest.c val = ((unsigned long)i ^ (unsigned long)bias);
i 113 user/testbin/malloctest/malloctest.c pl[i] = val;
i 114 user/testbin/malloctest/malloctest.c if (doprint && (i%64==63)) {
i 130 user/testbin/malloctest/malloctest.c size_t n, i;
i 137 user/testbin/malloctest/malloctest.c for (i=0; i<n; i++) {
i 138 user/testbin/malloctest/malloctest.c val = ((unsigned long)i ^ (unsigned long)bias);
i 139 user/testbin/malloctest/malloctest.c if (pl[i] != val) {
i 145 user/testbin/malloctest/malloctest.c (unsigned long) (i*sizeof(unsigned long)),
i 147 user/testbin/malloctest/malloctest.c pl[i], val);
i 150 user/testbin/malloctest/malloctest.c if (doprint && (i%64==63)) {
i 524 user/testbin/malloctest/malloctest.c int i, n, size, failed=0;
i 529 user/testbin/malloctest/malloctest.c for (i=0; i<32; i++) {
i 530 user/testbin/malloctest/malloctest.c ptrs[i] = NULL;
i 531 user/testbin/malloctest/malloctest.c psizes[i] = 0;
i 534 user/testbin/malloctest/malloctest.c for (i=0; i<100000; i++) {
i 557 user/testbin/malloctest/malloctest.c if (i%256==0) {
i 563 user/testbin/malloctest/malloctest.c for (i=0; i<32; i++) {
i 564 user/testbin/malloctest/malloctest.c if (ptrs[i] != NULL) {
i 565 user/testbin/malloctest/malloctest.c free(ptrs[i]);
i 645 user/testbin/malloctest/malloctest.c int i;
i 646 user/testbin/malloctest/malloctest.c for (i=0; tests[i].num>=0; i++) {
i 647 user/testbin/malloctest/malloctest.c if (tests[i].num == tn) {
i 648 user/testbin/malloctest/malloctest.c tests[i].func();
i 658 user/testbin/malloctest/malloctest.c int i, tn, menu=1;
i 661 user/testbin/malloctest/malloctest.c for (i=1; i<argc; i++) {
i 662 user/testbin/malloctest/malloctest.c dotest(atoi(argv[i]));
i 669 user/testbin/malloctest/malloctest.c for (i=0; tests[i].num>=0; i++) {
i 670 user/testbin/malloctest/malloctest.c printf(" %2d %s\n", tests[i].num,
i 671 user/testbin/malloctest/malloctest.c tests[i].desc);
i 64 user/testbin/matmult/matmult-orig.c int i, j, k, r;
i 66 user/testbin/matmult/matmult-orig.c for (i = 0; i < Dim; i++) /* first initialize the matrices */
i 68 user/testbin/matmult/matmult-orig.c A[i][j] = i;
i 69 user/testbin/matmult/matmult-orig.c B[i][j] = j;
i 70 user/testbin/matmult/matmult-orig.c C[i][j] = 0;
i 73 user/testbin/matmult/matmult-orig.c for (i = 0; i < Dim; i++) /* then multiply them together */
i 76 user/testbin/matmult/matmult-orig.c C[i][j] += A[i][k] * B[k][j];
i 59 user/testbin/matmult/matmult.c int i, j, k, r;
i 61 user/testbin/matmult/matmult.c for (i = 0; i < Dim; i++) /* first initialize the matrices */
i 63 user/testbin/matmult/matmult.c A[i][j] = i;
i 64 user/testbin/matmult/matmult.c B[i][j] = j;
i 65 user/testbin/matmult/matmult.c C[i][j] = 0;
i 68 user/testbin/matmult/matmult.c for (i = 0; i < Dim; i++) /* then multiply them together */
i 71 user/testbin/matmult/matmult.c T[i][j][k] = A[i][k] * B[k][j];
i 73 user/testbin/matmult/matmult.c for (i = 0; i < Dim; i++)
i 76 user/testbin/matmult/matmult.c C[i][j] += T[i][j][k];
i 79 user/testbin/matmult/matmult.c for (i = 0; i < Dim; i++)
i 80 user/testbin/matmult/matmult.c r += C[i][i];
i 111 user/testbin/parallelvm/parallelvm.c int i, j, k;
i 113 user/testbin/parallelvm/parallelvm.c for (i=0; i<DIM; i++) {
i 117 user/testbin/parallelvm/parallelvm.c val += m1->m_data[i][k]*m2->m_data[k][j];
i 119 user/testbin/parallelvm/parallelvm.c res->m_data[i][j] = val;
i 128 user/testbin/parallelvm/parallelvm.c int i, j;
i 129 user/testbin/parallelvm/parallelvm.c for (i=0; i<DIM; i++) {
i 131 user/testbin/parallelvm/parallelvm.c m1->m_data[i][j] += m2->m_data[i][j];
i 140 user/testbin/parallelvm/parallelvm.c int i, t=0;
i 141 user/testbin/parallelvm/parallelvm.c for (i=0; i<DIM; i++) {
i 142 user/testbin/parallelvm/parallelvm.c t += m1->m_data[i][i];
i 155 user/testbin/parallelvm/parallelvm.c int i,j;
i 157 user/testbin/parallelvm/parallelvm.c for (i=0; i<DIM; i++) {
i 159 user/testbin/parallelvm/parallelvm.c m->m_data[i][j] = mynum+i-2*j;
i 171 user/testbin/parallelvm/parallelvm.c int i, j;
i 173 user/testbin/parallelvm/parallelvm.c for (i=0,j=n-1; i<j; i++,j--) {
i 174 user/testbin/parallelvm/parallelvm.c multiply(&tmp, &mats[i], &mats[j]);
i 183 user/testbin/parallelvm/parallelvm.c int i;
i 185 user/testbin/parallelvm/parallelvm.c for (i=2; i<NMATS; i++) {
i 186 user/testbin/parallelvm/parallelvm.c compute(i);
i 240 user/testbin/parallelvm/parallelvm.c int i, status, failcount;
i 247 user/testbin/parallelvm/parallelvm.c for (i=0; i<NJOBS; i++) {
i 248 user/testbin/parallelvm/parallelvm.c pids[i] = fork();
i 249 user/testbin/parallelvm/parallelvm.c if (pids[i]<0) {
i 252 user/testbin/parallelvm/parallelvm.c if (pids[i]==0) {
i 254 user/testbin/parallelvm/parallelvm.c go(i);
i 259 user/testbin/parallelvm/parallelvm.c for (i=0; i<NJOBS; i++) {
i 260 user/testbin/parallelvm/parallelvm.c if (pids[i]<0) {
i 264 user/testbin/parallelvm/parallelvm.c if (waitpid(pids[i], &status, 0)<0) {
i 85 user/testbin/psort/psort.c int frontpos, readpos, endpos, i, j;
i 116 user/testbin/psort/psort.c for (i=frontpos; i<endpos; i++) {
i 117 user/testbin/psort/psort.c v[i] = pivotval;
i 120 user/testbin/psort/psort.c for (i=endpos, j=num-1; i<j; i++,j--) {
i 121 user/testbin/psort/psort.c tmp = v[i];
i 122 user/testbin/psort/psort.c v[i] = v[j];
i 436 user/testbin/psort/psort.c int i, bad = 0;
i 439 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 440 user/testbin/psort/psort.c pids[i] = dofork();
i 441 user/testbin/psort/psort.c if (pids[i] < 0) {
i 444 user/testbin/psort/psort.c else if (pids[i] == 0) {
i 446 user/testbin/psort/psort.c me = i;
i 452 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 453 user/testbin/psort/psort.c if (pids[i] > 0 && dowait(i, pids[i])) {
i 499 user/testbin/psort/psort.c size_t count, i;
i 505 user/testbin/psort/psort.c for (i=0; i<count; i++) {
i 506 user/testbin/psort/psort.c sum += (unsigned char) buf[i];
i 523 user/testbin/psort/psort.c int fd, i, mykeys, keys_done, keys_to_do, value;
i 538 user/testbin/psort/psort.c for (i=0; i<keys_to_do; i++) {
i 550 user/testbin/psort/psort.c workspace[i] = value;
i 565 user/testbin/psort/psort.c int i;
i 572 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 573 user/testbin/psort/psort.c seedspace[i] = random();
i 618 user/testbin/psort/psort.c int i, mykeys, keys_done, keys_to_do;
i 626 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 627 user/testbin/psort/psort.c name = binname(me, i);
i 628 user/testbin/psort/psort.c outfds[i] = doopen(name, O_WRONLY|O_CREAT|O_TRUNC, 0664);
i 643 user/testbin/psort/psort.c for (i=0; i<keys_to_do; i++) {
i 644 user/testbin/psort/psort.c key = workspace[i];
i 660 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 661 user/testbin/psort/psort.c doclose(binname(me, i), outfds[i]);
i 670 user/testbin/psort/psort.c int i, fd;
i 673 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 674 user/testbin/psort/psort.c name = binname(me, i);
i 704 user/testbin/psort/psort.c int i, result;
i 710 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 711 user/testbin/psort/psort.c name = binname(i, me);
i 712 user/testbin/psort/psort.c infds[i] = doopen(name, O_RDONLY, 0);
i 713 user/testbin/psort/psort.c values[i] = 0;
i 714 user/testbin/psort/psort.c ready[i] = 0;
i 721 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 722 user/testbin/psort/psort.c if (infds[i] < 0) {
i 726 user/testbin/psort/psort.c if (!ready[i]) {
i 727 user/testbin/psort/psort.c result = doread("bin", infds[i],
i 730 user/testbin/psort/psort.c doclose("bin", infds[i]);
i 731 user/testbin/psort/psort.c infds[i] = -1;
i 736 user/testbin/psort/psort.c binname(i, me));
i 739 user/testbin/psort/psort.c values[i] = val;
i 740 user/testbin/psort/psort.c ready[i] = 1;
i 750 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 751 user/testbin/psort/psort.c if (!ready[i]) {
i 754 user/testbin/psort/psort.c if (place < 0 || values[i] < val) {
i 755 user/testbin/psort/psort.c val = values[i];
i 756 user/testbin/psort/psort.c place = i;
i 774 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 775 user/testbin/psort/psort.c assert(infds[i] < 0);
i 784 user/testbin/psort/psort.c int i, fd;
i 788 user/testbin/psort/psort.c for (i=0; i<me; i++) {
i 789 user/testbin/psort/psort.c mypos += getsize(mergedname(i));
i 815 user/testbin/psort/psort.c int i, j;
i 818 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 820 user/testbin/psort/psort.c totsize += getsize(binname(i, j));
i 835 user/testbin/psort/psort.c int i;
i 838 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 839 user/testbin/psort/psort.c totsize += getsize(mergedname(i));
i 853 user/testbin/psort/psort.c int i, j;
i 871 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 873 user/testbin/psort/psort.c doremove(binname(i, j));
i 886 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 887 user/testbin/psort/psort.c doremove(mergedname(i));
i 916 user/testbin/psort/psort.c int i;
i 921 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 922 user/testbin/psort/psort.c totvsize += getsize(validname(i));
i 937 user/testbin/psort/psort.c int fd, i, mykeys, keys_done, keys_to_do;
i 958 user/testbin/psort/psort.c for (i=0; i<keys_to_do; i++) {
i 959 user/testbin/psort/psort.c key = workspace[i];
i 998 user/testbin/psort/psort.c int i, fd;
i 1006 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 1007 user/testbin/psort/psort.c name = validname(i);
i 1014 user/testbin/psort/psort.c complainx("Validation: block %d: bad SMALLEST", i);
i 1018 user/testbin/psort/psort.c complainx("Validation: block %d: bad LARGEST", i);
i 1023 user/testbin/psort/psort.c i);
i 1029 user/testbin/psort/psort.c i, smallest);
i 1038 user/testbin/psort/psort.c for (i=0; i<numprocs; i++) {
i 1039 user/testbin/psort/psort.c doremove(validname(i));
i 1096 user/testbin/psort/psort.c int i, ch, val, arg;
i 1098 user/testbin/psort/psort.c for (i=1; i<argc; i++) {
i 1099 user/testbin/psort/psort.c if (argv[i][0] != '-') {
i 1103 user/testbin/psort/psort.c ch = argv[i][1];
i 1112 user/testbin/psort/psort.c if (argv[i][2]) {
i 1113 user/testbin/psort/psort.c val = atoi(argv[i]+2);
i 1116 user/testbin/psort/psort.c i++;
i 1117 user/testbin/psort/psort.c if (!argv[i]) {
i 1122 user/testbin/psort/psort.c val = atoi(argv[i]);
i 73 user/testbin/randcall/main.c size_t i;
i 75 user/testbin/randcall/main.c for (i=0; i<len; i++) {
i 76 user/testbin/randcall/main.c randchar(&cp[i]);
i 127 user/testbin/randcall/main.c int an, i;
i 129 user/testbin/randcall/main.c for (i=1; i<argc; i++) {
i 130 user/testbin/randcall/main.c if (!strcmp(argv[i], "-f")) {
i 133 user/testbin/randcall/main.c else if (!strcmp(argv[i], "-c") && i<argc-1) {
i 134 user/testbin/randcall/main.c count = atoi(argv[++i]);
i 136 user/testbin/randcall/main.c else if (!strcmp(argv[i], "-r") && i<argc-1) {
i 137 user/testbin/randcall/main.c seed = atoi(argv[++i]);
i 139 user/testbin/randcall/main.c else if (argv[i][0] == '-') {
i 146 user/testbin/randcall/main.c if (i != argc-1) {
i 150 user/testbin/randcall/main.c if (!strcmp(argv[i], "all")) {
i 154 user/testbin/randcall/main.c an = atoi(argv[i]);
i 62 user/testbin/sort/sort.c int pivot, i, j, k;
i 72 user/testbin/sort/sort.c i = 0;
i 75 user/testbin/sort/sort.c while (i<pivot && j<size) {
i 76 user/testbin/sort/sort.c if (arr[i] < arr[j]) {
i 77 user/testbin/sort/sort.c tmp[k++] = arr[i++];
i 83 user/testbin/sort/sort.c while (i<pivot) {
i 84 user/testbin/sort/sort.c tmp[k++] = arr[i++];
i 101 user/testbin/sort/sort.c int i;
i 108 user/testbin/sort/sort.c for (i = 0; i < SIZE; i++) {
i 109 user/testbin/sort/sort.c A[i] = random();
i 117 user/testbin/sort/sort.c int i;
i 119 user/testbin/sort/sort.c for (i=0; i<SIZE-1; i++) {
i 120 user/testbin/sort/sort.c if (A[i] > A[i+1]) {
i 122 user/testbin/sort/sort.c i, A[i], i+1, A[i+1]);
i 70 user/testbin/sty/sty.c int i, status;
i 71 user/testbin/sty/sty.c for (i=0; i<npids; i++) {
i 72 user/testbin/sty/sty.c if (waitpid(pids[i], &status, 0)<0) {
i 73 user/testbin/sty/sty.c warn("waitpid for %d", pids[i]);
i 76 user/testbin/sty/sty.c warnx("pid %d: signal %d", pids[i], WTERMSIG(status));
i 79 user/testbin/sty/sty.c warnx("pid %d: exit %d", pids[i], WEXITSTATUS(status));
i 142 user/testbin/tictac/tictac.c int i, j;
i 147 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++) {
i 149 user/testbin/tictac/tictac.c printf(" %d ", i);
i 151 user/testbin/tictac/tictac.c switch (board[i][j]) {
i 302 user/testbin/tictac/tictac.c int i;
i 303 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++)
i 304 user/testbin/tictac/tictac.c if (board[i][y] != marker)
i 312 user/testbin/tictac/tictac.c int i;
i 313 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++)
i 314 user/testbin/tictac/tictac.c if (board[x][i] != marker)
i 322 user/testbin/tictac/tictac.c int i;
i 328 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++)
i 329 user/testbin/tictac/tictac.c if (board[i][i] != marker)
i 337 user/testbin/tictac/tictac.c int i;
i 342 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++)
i 343 user/testbin/tictac/tictac.c if (board[i][DIM - 1 - i] != marker)
i 351 user/testbin/tictac/tictac.c int i, j;
i 353 user/testbin/tictac/tictac.c for (i = 0; i < DIM; i++)
i 355 user/testbin/tictac/tictac.c board[i][j] = EMPTY;
i 362 user/testbin/tictac/tictac.c int i;
i 364 user/testbin/tictac/tictac.c i = 0;
i 366 user/testbin/tictac/tictac.c i < length) {
i 367 user/testbin/tictac/tictac.c buf[i] = (char) char_read;
i 368 user/testbin/tictac/tictac.c i++;
i 379 user/testbin/tictac/tictac.c if (i >= length)
i 380 user/testbin/tictac/tictac.c i--;
i 381 user/testbin/tictac/tictac.c buf[i] = 0;
i 382 user/testbin/tictac/tictac.c return(i);
i 87 user/testbin/triplehuge/triple.c int i, failures = 0;
i 96 user/testbin/triplehuge/triple.c for (i=0; i<3; i++) {
i 97 user/testbin/triplehuge/triple.c pids[i]=spawnv(args[0], args);
i 100 user/testbin/triplehuge/triple.c for (i=0; i<3; i++) {
i 101 user/testbin/triplehuge/triple.c failures += dowait(i, pids[i]);
i 87 user/testbin/triplemat/triple.c int i, failures = 0;
i 96 user/testbin/triplemat/triple.c for (i=0; i<3; i++) {
i 97 user/testbin/triplemat/triple.c pids[i]=spawnv(args[0], args);
i 100 user/testbin/triplemat/triple.c for (i=0; i<3; i++) {
i 101 user/testbin/triplemat/triple.c failures += dowait(i, pids[i]);
i 87 user/testbin/triplesort/triple.c int i, failures = 0;
i 96 user/testbin/triplesort/triple.c for (i=0; i<3; i++) {
i 97 user/testbin/triplesort/triple.c pids[i]=spawnv(args[0], args);
i 100 user/testbin/triplesort/triple.c for (i=0; i<3; i++) {
i 101 user/testbin/triplesort/triple.c failures += dowait(i, pids[i]);
i 70 user/testbin/userthreads/userthreads.c int i;
i 75 user/testbin/userthreads/userthreads.c for (i=0; i<NTHREADS; i++) {
i 76 user/testbin/userthreads/userthreads.c if (i)
i 72 user/testbin/zero/zero.c unsigned i, num, k;
i 75 user/testbin/zero/zero.c for (k=i=0; i<num; i++) {
i 76 user/testbin/zero/zero.c k += data_stuff[i];
i 89 user/testbin/zero/zero.c unsigned i, num;
i 92 user/testbin/zero/zero.c for (i=0; i<num; i++) {
i 93 user/testbin/zero/zero.c if (bss_stuff[i] != 0) {
i 95 user/testbin/zero/zero.c i, &bss_stuff[i]);
i 96 user/testbin/zero/zero.c warnx("Found: 0x%x", bss_stuff[i]);
i 107 user/testbin/zero/zero.c unsigned i;
i 121 user/testbin/zero/zero.c for (i=0; i<SBRK_SIZE; i++) {
i 122 user/testbin/zero/zero.c if (base[i] != 0) {
i 124 user/testbin/zero/zero.c i, &base[i]);
i 125 user/testbin/zero/zero.c warnx("Got: 0x%x", (unsigned char)base[i]);
i 15 user/uw-testbin/argtest/argtest.c int i;
i 19 user/uw-testbin/argtest/argtest.c printf("&i : %p\n", &i);
i 25 user/uw-testbin/argtest/argtest.c for (i=0; i<=argc; i++) {
i 26 user/uw-testbin/argtest/argtest.c printf("&argv[%d] : %p\n", i, &argv[i]);
i 30 user/uw-testbin/argtest/argtest.c for (i=0; i<=argc; i++) {
i 31 user/uw-testbin/argtest/argtest.c printf("argv[%d] : %p\n", i, argv[i]);
i 35 user/uw-testbin/argtest/argtest.c for (i=0; i<=argc; i++) {
i 36 user/uw-testbin/argtest/argtest.c tmp = argv[i];
i 40 user/uw-testbin/argtest/argtest.c printf("argv[%d] -> %s\n", i, tmp);
i 31 user/uw-testbin/conc-io/conc-io.c int i,k;
i 43 user/uw-testbin/conc-io/conc-io.c for (i=0; i<PROCS; i++) {
i 44 user/uw-testbin/conc-io/conc-io.c pid[i] = fork();
i 45 user/uw-testbin/conc-io/conc-io.c if (pid[i] < 0) {
i 46 user/uw-testbin/conc-io/conc-io.c printf("Fork %d failed\n", i);
i 51 user/uw-testbin/conc-io/conc-io.c if (pid[i] == 0) {
i 52 user/uw-testbin/conc-io/conc-io.c do_writes(to_write[i]);
i 53 user/uw-testbin/conc-io/conc-io.c printf("Process number %d is done\n", i);
i 59 user/uw-testbin/conc-io/conc-io.c for (i=0; i<PROCS; i++) {
i 60 user/uw-testbin/conc-io/conc-io.c if (pid[i] < 0) {
i 66 user/uw-testbin/conc-io/conc-io.c for (i=0; i<PROCS; i++) {
i 67 user/uw-testbin/conc-io/conc-io.c rc[i] = waitpid(pid[i], &status, 0);
i 68 user/uw-testbin/conc-io/conc-io.c if (rc[i] != pid[i]) {
i 71 user/uw-testbin/conc-io/conc-io.c printf("Done waiting for process number %d\n", i);
i 83 user/uw-testbin/conc-io/conc-io.c for (i=0; i<TOTAL_WRITES; i++)
i 115 user/uw-testbin/conc-io/conc-io.c int i = 0;
i 131 user/uw-testbin/conc-io/conc-io.c for (i = 0; i < NUM_WRITES; i++) {
i 24 user/uw-testbin/files1/files1.c int i = 42;
i 44 user/uw-testbin/files1/files1.c rc = write(f1, (char *) &i, sizeof(i));
i 45 user/uw-testbin/files1/files1.c TEST_EQUAL(rc, sizeof(i), "write to f1 does not write/return proper value");
i 73 user/uw-testbin/files1/files1.c TEST_EQUAL(intbuf, i,
i 41 user/uw-testbin/files2/files2.c int i = 42;
i 80 user/uw-testbin/files2/files2.c rc = write(f1, (char *) &i, sizeof(i));
i 126 user/uw-testbin/files2/files2.c rc = read(f2, &i, 1);
i 161 user/uw-testbin/files2/files2.c for (i=0; i<count; i++) {
i 162 user/uw-testbin/files2/files2.c rc = close(fd_array[i]);
i 26 user/uw-testbin/pidcheck/pidcheck.c int i;
i 41 user/uw-testbin/pidcheck/pidcheck.c for(i=0;i<1000000;i++) {
i 30 user/uw-testbin/sparse/sparse.c int i,j;
i 36 user/uw-testbin/sparse/sparse.c for (i=0; i<ArraySize; i+=(10*PageSize)) {
i 37 user/uw-testbin/sparse/sparse.c sparse[i]= 'a';
i 44 user/uw-testbin/sparse/sparse.c for (i=0; i<ArraySize; i+=(10*PageSize)) {
i 45 user/uw-testbin/sparse/sparse.c sparse[i] += 1;
i 53 user/uw-testbin/sparse/sparse.c for (i=0; i<ArraySize; i+=(10*PageSize)) {
i 54 user/uw-testbin/sparse/sparse.c if (sparse[i] != ('a'+5)) {
i 55 user/uw-testbin/sparse/sparse.c printf("Test failed! Unexpected value at array position %d\n", i);
i 34 user/uw-testbin/tlbfaulter/tlbfaulter.c int i,j;
i 39 user/uw-testbin/tlbfaulter/tlbfaulter.c for (i=0; i<ArraySize; i++) {
i 40 user/uw-testbin/tlbfaulter/tlbfaulter.c tlbtest[i]= 'a';
i 47 user/uw-testbin/tlbfaulter/tlbfaulter.c for (i=0; i<ArraySize; i+=PageSize) {
i 48 user/uw-testbin/tlbfaulter/tlbfaulter.c tlbtest[i] += 1;
i 55 user/uw-testbin/tlbfaulter/tlbfaulter.c for (i=0; i<ArraySize; i+=PageSize) {
i 56 user/uw-testbin/tlbfaulter/tlbfaulter.c if (tlbtest[i] != ('a'+5)) {
i 57 user/uw-testbin/tlbfaulter/tlbfaulter.c printf("Test failed! Unexpected value at array position %d\n", i);
i 40 user/uw-testbin/vm-crash3/vm-crash3.c unsigned int i = 0;
i 43 user/uw-testbin/vm-crash3/vm-crash3.c for (i=0; i<SIZE; i+= PAGE_SIZE) {
i 44 user/uw-testbin/vm-crash3/vm-crash3.c array[i] = i;
i 52 user/uw-testbin/vm-crash3/vm-crash3.c unsigned int i = 0;
i 54 user/uw-testbin/vm-crash3/vm-crash3.c for (i=0; i<SIZE; i+= PAGE_SIZE) {
i 55 user/uw-testbin/vm-crash3/vm-crash3.c if (array[i] != i) {
i 56 user/uw-testbin/vm-crash3/vm-crash3.c printf("FAILED array[%d] = %u != %d\n", i, array[i], i);
i 66 user/uw-testbin/vm-crash3/vm-crash3.c unsigned int i = 0;
i 68 user/uw-testbin/vm-crash3/vm-crash3.c for (i=0; i<5; i++) {
i 15 user/uw-testbin/vm-data1/vm-data1.c unsigned int i = 0;
i 19 user/uw-testbin/vm-data1/vm-data1.c for (i=0; i<SIZE; i++) {
i 20 user/uw-testbin/vm-data1/vm-data1.c array[i] = i;
i 24 user/uw-testbin/vm-data1/vm-data1.c for (i=0; i<SIZE; i++) {
i 25 user/uw-testbin/vm-data1/vm-data1.c if (array[i] != i) {
i 26 user/uw-testbin/vm-data1/vm-data1.c printf("FAILED array[%d] = %u != %d\n", i, array[i], i);
i 16 user/uw-testbin/vm-data2/vm-data2.c unsigned int i = 0;
i 21 user/uw-testbin/vm-data2/vm-data2.c for (i=0; i<PAGES_TO_TOUCH; i++) {
i 22 user/uw-testbin/vm-data2/vm-data2.c index = i * PAGE_SIZE / sizeof(int);
i 23 user/uw-testbin/vm-data2/vm-data2.c array[index] = i;
i 27 user/uw-testbin/vm-data2/vm-data2.c for (i=0; i<PAGES_TO_TOUCH; i++) {
i 28 user/uw-testbin/vm-data2/vm-data2.c index = i * PAGE_SIZE / sizeof(int);
i 29 user/uw-testbin/vm-data2/vm-data2.c if (array[index] != i) {
i 30 user/uw-testbin/vm-data2/vm-data2.c printf("FAILED array[%d] = %u != %d\n", i, array[index], i);
i 25 user/uw-testbin/vm-data3/vm-data3.c unsigned int i = 0;
i 28 user/uw-testbin/vm-data3/vm-data3.c for (i=0; i<SIZE; i+= PAGE_SIZE) {
i 29 user/uw-testbin/vm-data3/vm-data3.c array[i] = i;
i 37 user/uw-testbin/vm-data3/vm-data3.c unsigned int i = 0;
i 39 user/uw-testbin/vm-data3/vm-data3.c for (i=0; i<SIZE; i+= PAGE_SIZE) {
i 40 user/uw-testbin/vm-data3/vm-data3.c if (array[i] != i) {
i 41 user/uw-testbin/vm-data3/vm-data3.c printf("FAILED array[%d] = %u != %d\n", i, array[i], i);
i 51 user/uw-testbin/vm-data3/vm-data3.c unsigned int i = 0;
i 53 user/uw-testbin/vm-data3/vm-data3.c for (i=0; i<5; i++) {
i 82 user/uw-testbin/vm-funcs/vm-funcs.c int i; \
i 87 user/uw-testbin/vm-funcs/vm-funcs.c for (i=0; i<FUNCTION_LOOP; i++) { \
i 88 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 89 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 90 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 91 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 92 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 93 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 94 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 95 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 96 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 97 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 98 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 99 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 100 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 101 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 102 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 103 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 105 user/uw-testbin/vm-funcs/vm-funcs.c for (i=0; i<FUNCTION_LOOP; i++) { \
i 106 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 107 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 108 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 109 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 110 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 111 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 112 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 113 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 114 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 115 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 116 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 117 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 118 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 120 user/uw-testbin/vm-funcs/vm-funcs.c for (i=0; i<FUNCTION_LOOP; i++) { \
i 121 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 122 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 123 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 124 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 125 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 126 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 127 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 129 user/uw-testbin/vm-funcs/vm-funcs.c for (i=0; i<FUNCTION_LOOP; i++) { \
i 130 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 131 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 132 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 133 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 134 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 135 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 136 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 137 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 138 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 139 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 140 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 141 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 142 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
i 143 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 144 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
i 145 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
i 215 user/uw-testbin/vm-funcs/vm-funcs.c #define CALLFUNC(i) \
i 216 user/uw-testbin/vm-funcs/vm-funcs.c func_##i()
i 286 user/uw-testbin/vm-funcs/vm-funcs.c int i = 0;
i 287 user/uw-testbin/vm-funcs/vm-funcs.c for (i=0; i<count; i++) {
i 50 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c unsigned int i = 0;
i 53 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i++) {
i 54 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c array[i] = start + (i / ELEMS_PER_PAGE);
i 63 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c unsigned int i = 0;
i 66 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i++) {
i 67 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (array[i] != (start + (i / ELEMS_PER_PAGE))) {
i 69 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c __FILE__, __LINE__, array_name, i, array[i], i, ref+1);
i 79 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c unsigned int i = 0;
i 82 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i+= (ELEMS_PER_PAGE)) {
i 83 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("[%10u] = %10u ", i, array[i]);
i 96 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c unsigned int i = 0;
i 102 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i++) {
i 103 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (array1[i] != 0) {
i 104 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: array1[%d] = %u != %d\n", __FILE__, __LINE__, i, array1[i], 0);
i 111 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i++) {
i 112 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (array2[i] != 0) {
i 113 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 118 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 119 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c stack_array[i] = i * 1000;
i 122 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<2; i++) {
i 132 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<ELEMS; i++) {
i 133 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (array2[i] != 0) {
i 134 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 140 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 141 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (stack_array[i] != i * 1000) {
i 142 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 149 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 150 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (init[i] != i) {
i 151 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 156 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<2; i++) {
i 165 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 166 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (stack_array[i] != i * 1000) {
i 167 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 174 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 175 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c if (init[i] != i) {
i 176 user/uw-testbin/vm-mix1-fork/vm-mix1-fork.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 48 user/uw-testbin/vm-mix1/vm-mix1.c unsigned int i = 0;
i 51 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i++) {
i 52 user/uw-testbin/vm-mix1/vm-mix1.c array[i] = start + (i / ELEMS_PER_PAGE);
i 61 user/uw-testbin/vm-mix1/vm-mix1.c unsigned int i = 0;
i 64 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i++) {
i 65 user/uw-testbin/vm-mix1/vm-mix1.c if (array[i] != (start + (i / ELEMS_PER_PAGE))) {
i 67 user/uw-testbin/vm-mix1/vm-mix1.c __FILE__, __LINE__, array_name, i, array[i], i, ref+1);
i 77 user/uw-testbin/vm-mix1/vm-mix1.c unsigned int i = 0;
i 80 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i+= (ELEMS_PER_PAGE)) {
i 81 user/uw-testbin/vm-mix1/vm-mix1.c printf("[%10u] = %10u ", i, array[i]);
i 94 user/uw-testbin/vm-mix1/vm-mix1.c unsigned int i = 0;
i 100 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i++) {
i 101 user/uw-testbin/vm-mix1/vm-mix1.c if (array1[i] != 0) {
i 102 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: array1[%d] = %u != %d\n", __FILE__, __LINE__, i, array1[i], 0);
i 109 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i++) {
i 110 user/uw-testbin/vm-mix1/vm-mix1.c if (array2[i] != 0) {
i 111 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 116 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 117 user/uw-testbin/vm-mix1/vm-mix1.c stack_array[i] = i * 1000;
i 120 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<2; i++) {
i 130 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<ELEMS; i++) {
i 131 user/uw-testbin/vm-mix1/vm-mix1.c if (array2[i] != 0) {
i 132 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 138 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 139 user/uw-testbin/vm-mix1/vm-mix1.c if (stack_array[i] != i * 1000) {
i 140 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 147 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 148 user/uw-testbin/vm-mix1/vm-mix1.c if (init[i] != i) {
i 149 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 154 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<2; i++) {
i 163 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 164 user/uw-testbin/vm-mix1/vm-mix1.c if (stack_array[i] != i * 1000) {
i 165 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 172 user/uw-testbin/vm-mix1/vm-mix1.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 173 user/uw-testbin/vm-mix1/vm-mix1.c if (init[i] != i) {
i 174 user/uw-testbin/vm-mix1/vm-mix1.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 51 user/uw-testbin/vm-mix2/vm-mix2.c unsigned int i = 0;
i 57 user/uw-testbin/vm-mix2/vm-mix2.c for (i=k; i<end; i++) {
i 58 user/uw-testbin/vm-mix2/vm-mix2.c array[i] = start + (i / ELEMS_PER_PAGE);
i 61 user/uw-testbin/vm-mix2/vm-mix2.c printf("from k = %d to i = %d end %d\n", i, k, end);
i 69 user/uw-testbin/vm-mix2/vm-mix2.c unsigned int i = 0;
i 73 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<ELEMS; i++) {
i 74 user/uw-testbin/vm-mix2/vm-mix2.c if (array[i] != (start + (i / ELEMS_PER_PAGE))) {
i 76 user/uw-testbin/vm-mix2/vm-mix2.c __FILE__, __LINE__, array_name, i, array[i], i);
i 85 user/uw-testbin/vm-mix2/vm-mix2.c unsigned int i = 0;
i 88 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<ELEMS; i+= (ELEMS_PER_PAGE)) {
i 89 user/uw-testbin/vm-mix2/vm-mix2.c printf("[%10u] = %10u ", i, array[i]);
i 102 user/uw-testbin/vm-mix2/vm-mix2.c unsigned int i = 0;
i 108 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<ELEMS; i++) {
i 109 user/uw-testbin/vm-mix2/vm-mix2.c if (array1[i] != 0) {
i 110 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: array1[%d] = %u != %d\n", __FILE__, __LINE__, i, array1[i], 0);
i 117 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<ELEMS; i++) {
i 118 user/uw-testbin/vm-mix2/vm-mix2.c if (array2[i] != 0) {
i 119 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 124 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 125 user/uw-testbin/vm-mix2/vm-mix2.c stack_array[i] = i * 1000;
i 128 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<2; i++) {
i 138 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<ELEMS; i++) {
i 139 user/uw-testbin/vm-mix2/vm-mix2.c if (array2[i] != 0) {
i 140 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: array2[%d] = %u != %d\n", __FILE__, __LINE__, i, array2[i], 0);
i 146 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 147 user/uw-testbin/vm-mix2/vm-mix2.c if (stack_array[i] != i * 1000) {
i 148 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 155 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 156 user/uw-testbin/vm-mix2/vm-mix2.c if (init[i] != i) {
i 157 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 162 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<2; i++) {
i 171 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 172 user/uw-testbin/vm-mix2/vm-mix2.c if (stack_array[i] != i * 1000) {
i 173 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: stack_array[%d] = %u != %d\n", __FILE__, __LINE__, i, stack_array[i], i);
i 180 user/uw-testbin/vm-mix2/vm-mix2.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 181 user/uw-testbin/vm-mix2/vm-mix2.c if (init[i] != i) {
i 182 user/uw-testbin/vm-mix2/vm-mix2.c printf("FAILED in file %s at line %d: init[%d] = %u != %d\n", __FILE__, __LINE__, i, init[i], i);
i 12 user/uw-testbin/vm-stack1/vm-stack1.c unsigned int i = 0;
i 14 user/uw-testbin/vm-stack1/vm-stack1.c for (i=0; i<SIZE; i++) {
i 15 user/uw-testbin/vm-stack1/vm-stack1.c array[i] = i;
i 18 user/uw-testbin/vm-stack1/vm-stack1.c for (i=0; i<SIZE; i++) {
i 19 user/uw-testbin/vm-stack1/vm-stack1.c if (array[i] != i) {
i 20 user/uw-testbin/vm-stack1/vm-stack1.c printf("FAILED array[%d] = %u != %d\n", i, array[i], i);
i 26 user/uw-testbin/vm-stack2/vm-stack2.c unsigned int i = 0;
i 29 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<UNINIT_ARRAY_ELEMS; i++) {
i 30 user/uw-testbin/vm-stack2/vm-stack2.c if (uninit[i] != 0) {
i 31 user/uw-testbin/vm-stack2/vm-stack2.c printf("FAILED uninit[%d] = %u != %d\n", i, uninit[i], 0);
i 37 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<UNINIT_ARRAY_ELEMS; i++) {
i 38 user/uw-testbin/vm-stack2/vm-stack2.c uninit[i] = i * 100;
i 42 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 43 user/uw-testbin/vm-stack2/vm-stack2.c array[i] = i * 1000;
i 47 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<STACK_ARRAY_ELEMS; i++) {
i 48 user/uw-testbin/vm-stack2/vm-stack2.c if (array[i] != i * 1000) {
i 49 user/uw-testbin/vm-stack2/vm-stack2.c printf("FAILED array[%d] = %u != %d\n", i, array[i], i);
i 55 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<UNINIT_ARRAY_ELEMS; i++) {
i 56 user/uw-testbin/vm-stack2/vm-stack2.c if (uninit[i] != i * 100) {
i 57 user/uw-testbin/vm-stack2/vm-stack2.c printf("FAILED uninit[%d] = %u != %d\n", i, uninit[i], i);
i 63 user/uw-testbin/vm-stack2/vm-stack2.c for (i=0; i<INIT_ARRAY_ELEMS; i++) {
i 64 user/uw-testbin/vm-stack2/vm-stack2.c if (init[i] != i) {
i 65 user/uw-testbin/vm-stack2/vm-stack2.c printf("FAILED init[%d] = %u != %d\n", i, init[i], i);
i 19 user/uw-testbin/writeread/writeread.c int i, rc, fd;
i 27 user/uw-testbin/writeread/writeread.c for (i=0; i<NUM_INTS; i++) {
i 28 user/uw-testbin/writeread/writeread.c write_array[i] = i;
i 35 user/uw-testbin/writeread/writeread.c for (i=0; i<NUM_TIMES; i++) {
i 46 user/uw-testbin/writeread/writeread.c for (i=0; i<NUM_TIMES; i++) {
i 49 user/uw-testbin/writeread/writeread.c for (i=0; i<NUM_INTS; i++) {
i 50 user/uw-testbin/writeread/writeread.c TEST_EQUAL(read_array[i], write_array[i], "Value read not equal to value written");
i 40 user/uw-testbin/xhog/xhog.c volatile int i;
i 42 user/uw-testbin/xhog/xhog.c for (i=0; i<50000; i++) {
i 43 user/uw-testbin/xhog/xhog.c if (i%10000 == 0) {
i 40 user/uw-testbin/yhog/yhog.c volatile int i;
i 42 user/uw-testbin/yhog/yhog.c for (i=0; i<50000; i++) {
i 43 user/uw-testbin/yhog/yhog.c if (i%10000 == 0) {
i 40 user/uw-testbin/zhog/zhog.c volatile int i;
i 42 user/uw-testbin/zhog/zhog.c for (i=0; i<50000; i++) {
i 43 user/uw-testbin/zhog/zhog.c if (i%10000 == 0) {