j 75 common/gcc-millicode/qdivrem.c int m, n, d, j, i;
j 179 common/gcc-millicode/qdivrem.c j = 0;
j 193 common/gcc-millicode/qdivrem.c uj0 = u[j + 0]; /* for D3 only -- note that u[j+...] change */
j 194 common/gcc-millicode/qdivrem.c uj1 = u[j + 1]; /* for D3 only */
j 195 common/gcc-millicode/qdivrem.c uj2 = u[j + 2]; /* for D3 only */
j 218 common/gcc-millicode/qdivrem.c t = u[i + j] - v[i] * qhat - t;
j 219 common/gcc-millicode/qdivrem.c u[i + j] = (digit)LHALF(t);
j 222 common/gcc-millicode/qdivrem.c t = u[j] - t;
j 223 common/gcc-millicode/qdivrem.c u[j] = (digit)LHALF(t);
j 233 common/gcc-millicode/qdivrem.c t += u[i + j] + v[i];
j 234 common/gcc-millicode/qdivrem.c u[i + j] = (digit)LHALF(t);
j 237 common/gcc-millicode/qdivrem.c u[j] = (digit)LHALF(u[j] + t);
j 239 common/gcc-millicode/qdivrem.c q[j] = (digit)qhat;
j 240 common/gcc-millicode/qdivrem.c } while (++j <= m); /* D7: loop on j. */
j 72 kern/fs/sfs/sfs_fs.c uint32_t j, mapsize;
j 83 kern/fs/sfs/sfs_fs.c for (j=0; j<mapsize; j++) {
j 86 kern/fs/sfs/sfs_fs.c void *ptr = bitdata + j*SFS_BLOCKSIZE;
j 90 kern/fs/sfs/sfs_fs.c result = sfs_rblock(sfs, ptr, SFS_MAP_LOCATION+j);
j 93 kern/fs/sfs/sfs_fs.c result = sfs_wblock(sfs, ptr, SFS_MAP_LOCATION+j);
j 1145 kern/fs/sfs/sfs_vnode.c uint32_t i, j, block;
j 1188 kern/fs/sfs/sfs_vnode.c for (j=0; j<SFS_DBPERIDB; j++) {
j 1190 kern/fs/sfs/sfs_vnode.c if (blocklen < baseblock+j && idbuf[j] != 0) {
j 1191 kern/fs/sfs/sfs_vnode.c sfs_bfree(sfs, idbuf[j]);
j 1192 kern/fs/sfs/sfs_vnode.c idbuf[j] = 0;
j 1196 kern/fs/sfs/sfs_vnode.c if (idbuf[j]!=0) {
j 78 kern/lib/bitmap.c unsigned j, ix = words-1;
j 84 kern/lib/bitmap.c for (j=overbits; j<BITS_PER_WORD; j++) {
j 85 kern/lib/bitmap.c b->v[ix] |= ((WORD_TYPE)1 << j);
j 76 kern/synchprobs/whalemating.c int i, j, err=0;
j 82 kern/synchprobs/whalemating.c for (j = 0; j < NMATING; j++) {
j 87 kern/synchprobs/whalemating.c male, NULL, j);
j 91 kern/synchprobs/whalemating.c female, NULL, j);
j 95 kern/synchprobs/whalemating.c matchmaker, NULL, j);
j 102 kern/synchprobs/whalemating.c male, NULL, j, NULL);
j 106 kern/synchprobs/whalemating.c female, NULL, j, NULL);
j 110 kern/synchprobs/whalemating.c matchmaker, NULL, j, NULL);
j 42 kern/test/arraytest.c int i, j, n, r, *p;
j 67 kern/test/arraytest.c for (j=0; j<TESTSIZE*4; j++) {
j 264 kern/test/synchtest.c volatile int j;
j 302 kern/test/synchtest.c for (j=0; j<3000; j++);
j 87 kern/test/tt3.c int i, j;
j 92 kern/test/tt3.c for (j=0; j<SLEEPALOT_ITERS; j++) {
j 162 kern/test/tt3.c int i, j, k, m;
j 177 kern/test/tt3.c for (j=0; j<DIM; j++) {
j 179 kern/test/tt3.c m1->m[i][j] = rand >> 16;
j 180 kern/test/tt3.c m2->m[i][j] = rand & 0xffff;
j 185 kern/test/tt3.c for (j=0; j<DIM; j++) {
j 188 kern/test/tt3.c tot += m1->m[i][k] * m2->m[k][j];
j 190 kern/test/tt3.c m3->m[i][j] = tot;
j 179 kern/test/uw-tests.c int j;
j 184 kern/test/uw-tests.c for (j=0; j<VMSTAT_COUNT; j++) {
j 188 kern/test/uw-tests.c switch(j) {
j 191 kern/test/uw-tests.c vmstats_inc(j);
j 192 kern/test/uw-tests.c vmstats_inc(j);
j 196 kern/test/uw-tests.c vmstats_inc(j);
j 200 kern/test/uw-tests.c vmstats_inc(j);
j 206 kern/test/uw-tests.c vmstats_inc(j);
j 211 kern/test/uw-tests.c vmstats_inc(j);
j 217 kern/test/uw-tests.c vmstats_inc(j);
j 224 kern/test/uw-tests.c vmstats_inc(j);
j 230 kern/test/uw-tests.c vmstats_inc(j);
j 236 kern/test/uw-tests.c vmstats_inc(j);
j 242 kern/test/uw-tests.c vmstats_inc(j);
j 247 kern/test/uw-tests.c kprintf("Unknown stat %d\n", j);
j 148 kern/vm/kmalloc.c unsigned i,j;
j 156 kern/vm/kmalloc.c for (k=1,j=0; k!=0; k<<=1,j++) {
j 159 kern/vm/kmalloc.c return &pagerefs[i*32 + j];
j 173 kern/vm/kmalloc.c size_t i, j;
j 176 kern/vm/kmalloc.c j = p-pagerefs;
j 177 kern/vm/kmalloc.c KASSERT(j < NPAGEREFS); /* note: j is unsigned, don't test < 0 */
j 178 kern/vm/kmalloc.c i = j/32;
j 179 kern/vm/kmalloc.c k = ((uint32_t)1) << (j%32);
j 304 user/bin/ls/ls.c int i,j, items=0;
j 324 user/bin/ls/ls.c for (j=1; argv[i][j]; j++) {
j 325 user/bin/ls/ls.c option(argv[i][j]);
j 140 user/sbin/dumpsfs/dumpsfs.c uint32_t i, j;
j 147 user/sbin/dumpsfs/dumpsfs.c for (j=0; j<SFS_BLOCKSIZE; j++) {
j 148 user/sbin/dumpsfs/dumpsfs.c printf("%02x", (unsigned char)data[j]);
j 149 user/sbin/dumpsfs/dumpsfs.c if (j%32==31) {
j 307 user/sbin/sfsck/sfsck.c uint32_t alloccount=0, freecount=0, i, j;
j 317 user/sbin/sfsck/sfsck.c for (j=0; j<SFS_BLOCKSIZE; j++) {
j 319 user/sbin/sfsck/sfsck.c assert((found[j] & tofree[j])==0);
j 321 user/sbin/sfsck/sfsck.c if (bits[j]==found[j]) {
j 325 user/sbin/sfsck/sfsck.c if (bits[j]==(found[j] | tofree[j])) {
j 326 user/sbin/sfsck/sfsck.c bits[j] = found[j];
j 332 user/sbin/sfsck/sfsck.c bits[j] &= ~tofree[j];
j 335 user/sbin/sfsck/sfsck.c if ((bits[j] & found[j]) != found[j]) {
j 336 user/sbin/sfsck/sfsck.c tmp = found[j] & ~bits[j];
j 339 user/sbin/sfsck/sfsck.c reportbits(i, j, tmp, "free");
j 344 user/sbin/sfsck/sfsck.c if ((bits[j] & found[j]) != bits[j]) {
j 345 user/sbin/sfsck/sfsck.c tmp = bits[j] & ~found[j];
j 348 user/sbin/sfsck/sfsck.c reportbits(i, j, tmp, "allocated");
j 352 user/sbin/sfsck/sfsck.c bits[j] = found[j];
j 812 user/sbin/sfsck/sfsck.c unsigned i, j;
j 818 user/sbin/sfsck/sfsck.c for (j=0; j<atonce; j++) {
j 819 user/sbin/sfsck/sfsck.c swapdir(&d[i*atonce+j]);
j 835 user/sbin/sfsck/sfsck.c unsigned i, j, bad;
j 840 user/sbin/sfsck/sfsck.c for (j=0; j<atonce; j++) {
j 841 user/sbin/sfsck/sfsck.c swapdir(&d[i*atonce+j]);
j 846 user/sbin/sfsck/sfsck.c for (j=bad=0; j<atonce; j++) {
j 847 user/sbin/sfsck/sfsck.c if (d[i*atonce+j].sfd_ino != SFS_NOINO ||
j 848 user/sbin/sfsck/sfsck.c d[i*atonce+j].sfd_name[0] != 0) {
j 880 user/sbin/sfsck/sfsck.c int i, j;
j 885 user/sbin/sfsck/sfsck.c for (j=i+1; j<num; j++) {
j 886 user/sbin/sfsck/sfsck.c if (f(&data[i], &data[j]) < 0) {
j 888 user/sbin/sfsck/sfsck.c data[i] = data[j];
j 889 user/sbin/sfsck/sfsck.c data[j] = tmp;
j 45 user/testbin/add/add.c int i, j;
j 52 user/testbin/add/add.c j = atoi(argv[2]);
j 54 user/testbin/add/add.c printf("Answer: %d\n", i+j);
j 290 user/testbin/badcall/driver.c int op, i, j;
j 296 user/testbin/badcall/driver.c for (j=0; argv[i][j]; j++) {
j 298 user/testbin/badcall/driver.c argv[i][j]);
j 299 user/testbin/badcall/driver.c runit(argv[i][j]);
j 163 user/testbin/crash/crash.c volatile int j;
j 164 user/testbin/crash/crash.c j = *badptr;
j 125 user/testbin/f_test/f_test.c int i, j, fileid;
j 157 user/testbin/f_test/f_test.c j = read(fileid, fbuffer, BUFFER_SIZE);
j 158 user/testbin/f_test/f_test.c if (j<0) {
j 161 user/testbin/f_test/f_test.c if (j != BUFFER_SIZE) {
j 162 user/testbin/f_test/f_test.c errx(1, "[BIGFILE]: read: only %d bytes", j);
j 171 user/testbin/f_test/f_test.c for (j = 0; j < BUFFER_SIZE; j++) {
j 172 user/testbin/f_test/f_test.c if (fbuffer[j] != LETTER(j)) {
j 174 user/testbin/f_test/f_test.c "inconsistent data read: %d", i+j);
j 57 user/testbin/hash/hash.c int j = 0;
j 75 user/testbin/hash/hash.c j = ((j*8) + (int) readbuf[0]) % HASHP;
j 80 user/testbin/hash/hash.c printf("Hash : %d\n", j);
j 51 user/testbin/huge/huge.c int i,j;
j 63 user/testbin/huge/huge.c for (j=0; j<5; j++) {
j 67 user/testbin/huge/huge.c printf("stage [2.%d] done\n", j);
j 64 user/testbin/matmult/matmult-orig.c int i, j, k, r;
j 67 user/testbin/matmult/matmult-orig.c for (j = 0; j < Dim; j++) {
j 68 user/testbin/matmult/matmult-orig.c A[i][j] = i;
j 69 user/testbin/matmult/matmult-orig.c B[i][j] = j;
j 70 user/testbin/matmult/matmult-orig.c C[i][j] = 0;
j 74 user/testbin/matmult/matmult-orig.c for (j = 0; j < Dim; j++)
j 76 user/testbin/matmult/matmult-orig.c C[i][j] += A[i][k] * B[k][j];
j 59 user/testbin/matmult/matmult.c int i, j, k, r;
j 62 user/testbin/matmult/matmult.c for (j = 0; j < Dim; j++) {
j 63 user/testbin/matmult/matmult.c A[i][j] = i;
j 64 user/testbin/matmult/matmult.c B[i][j] = j;
j 65 user/testbin/matmult/matmult.c C[i][j] = 0;
j 69 user/testbin/matmult/matmult.c for (j = 0; j < Dim; j++)
j 71 user/testbin/matmult/matmult.c T[i][j][k] = A[i][k] * B[k][j];
j 74 user/testbin/matmult/matmult.c for (j = 0; j < Dim; j++)
j 76 user/testbin/matmult/matmult.c C[i][j] += T[i][j][k];
j 111 user/testbin/parallelvm/parallelvm.c int i, j, k;
j 114 user/testbin/parallelvm/parallelvm.c for (j=0; j<DIM; j++) {
j 117 user/testbin/parallelvm/parallelvm.c val += m1->m_data[i][k]*m2->m_data[k][j];
j 119 user/testbin/parallelvm/parallelvm.c res->m_data[i][j] = val;
j 128 user/testbin/parallelvm/parallelvm.c int i, j;
j 130 user/testbin/parallelvm/parallelvm.c for (j=0; j<DIM; j++) {
j 131 user/testbin/parallelvm/parallelvm.c m1->m_data[i][j] += m2->m_data[i][j];
j 155 user/testbin/parallelvm/parallelvm.c int i,j;
j 158 user/testbin/parallelvm/parallelvm.c for (j=0; j<DIM; j++) {
j 159 user/testbin/parallelvm/parallelvm.c m->m_data[i][j] = mynum+i-2*j;
j 171 user/testbin/parallelvm/parallelvm.c int i, j;
j 173 user/testbin/parallelvm/parallelvm.c for (i=0,j=n-1; i<j; i++,j--) {
j 174 user/testbin/parallelvm/parallelvm.c multiply(&tmp, &mats[i], &mats[j]);
j 85 user/testbin/psort/psort.c int frontpos, readpos, endpos, i, j;
j 120 user/testbin/psort/psort.c for (i=endpos, j=num-1; i<j; i++,j--) {
j 122 user/testbin/psort/psort.c v[i] = v[j];
j 123 user/testbin/psort/psort.c v[j] = tmp;
j 815 user/testbin/psort/psort.c int i, j;
j 819 user/testbin/psort/psort.c for (j=0; j<numprocs; j++) {
j 820 user/testbin/psort/psort.c totsize += getsize(binname(i, j));
j 853 user/testbin/psort/psort.c int i, j;
j 872 user/testbin/psort/psort.c for (j=0; j<numprocs; j++) {
j 873 user/testbin/psort/psort.c doremove(binname(i, j));
j 62 user/testbin/sort/sort.c int pivot, i, j, k;
j 73 user/testbin/sort/sort.c j = pivot;
j 75 user/testbin/sort/sort.c while (i<pivot && j<size) {
j 76 user/testbin/sort/sort.c if (arr[i] < arr[j]) {
j 80 user/testbin/sort/sort.c tmp[k++] = arr[j++];
j 86 user/testbin/sort/sort.c while (j<size) {
j 87 user/testbin/sort/sort.c tmp[k++] = arr[j++];
j 142 user/testbin/tictac/tictac.c int i, j;
j 150 user/testbin/tictac/tictac.c for (j = 0; j < DIM; j++) {
j 151 user/testbin/tictac/tictac.c switch (board[i][j]) {
j 351 user/testbin/tictac/tictac.c int i, j;
j 354 user/testbin/tictac/tictac.c for (j = 0; j < DIM; j++)
j 355 user/testbin/tictac/tictac.c board[i][j] = EMPTY;
j 116 user/uw-testbin/conc-io/conc-io.c int j = 0;
j 120 user/uw-testbin/conc-io/conc-io.c for (j=0; j<BUF_SIZE; j++) {
j 121 user/uw-testbin/conc-io/conc-io.c buffer[j] = c;
j 141 user/uw-testbin/conc-io/conc-io.c for (j=0; j<BUF_SIZE; j++) {
j 142 user/uw-testbin/conc-io/conc-io.c buffer[j] = c;
j 143 user/uw-testbin/conc-io/conc-io.c total += j;
j 25 user/uw-testbin/files1/files1.c int j = -999;
j 48 user/uw-testbin/files1/files1.c rc = write(f2, (char *) &j, sizeof(j));
j 49 user/uw-testbin/files1/files1.c TEST_EQUAL(rc, sizeof(j), "write to f2 does not write/return proper value");
j 77 user/uw-testbin/files1/files1.c TEST_EQUAL(rc, sizeof(j), "read from f2 does not read/return proper value");
j 78 user/uw-testbin/files1/files1.c TEST_EQUAL(intbuf, j, "read from f2 did not get correct value");
j 42 user/uw-testbin/files2/files2.c int j = -999;
j 88 user/uw-testbin/files2/files2.c rc = read(f2, (char *) &j, sizeof(j));
j 30 user/uw-testbin/sparse/sparse.c int i,j;
j 43 user/uw-testbin/sparse/sparse.c for(j=0; j<5; j++) {
j 34 user/uw-testbin/tlbfaulter/tlbfaulter.c int i,j;
j 46 user/uw-testbin/tlbfaulter/tlbfaulter.c for(j=0; j<5; j++) {
j 70 user/uw-testbin/vm-mix2/vm-mix2.c unsigned int j = start;
j 72 user/uw-testbin/vm-mix2/vm-mix2.c j = start;