k                 162 kern/test/tt3.c 	int i, j, k, m;
k                 187 kern/test/tt3.c 				for (k=0; k<DIM; k++) {
k                 188 kern/test/tt3.c 					tot += m1->m[i][k] * m2->m[k][j];
k                 149 kern/vm/kmalloc.c 	uint32_t k;
k                 156 kern/vm/kmalloc.c 		for (k=1,j=0; k!=0; k<<=1,j++) {
k                 157 kern/vm/kmalloc.c 			if ((pagerefs_inuse[i] & k)==0) {
k                 158 kern/vm/kmalloc.c 				pagerefs_inuse[i] |= k;
k                 174 kern/vm/kmalloc.c 	uint32_t k;
k                 179 kern/vm/kmalloc.c 	k = ((uint32_t)1) << (j%32);
k                 180 kern/vm/kmalloc.c 	KASSERT((pagerefs_inuse[i] & k) != 0);
k                 181 kern/vm/kmalloc.c 	pagerefs_inuse[i] &= ~k;
k                 249 user/testbin/badcall/driver.c 	int i, k;
k                 269 user/testbin/badcall/driver.c 		k = op-'0';
k                 271 user/testbin/badcall/driver.c 			if (ops[i].asst <= k) {
k                 365 user/testbin/dirseek/dirseek.c 	int valid, i, k=0;
k                 392 user/testbin/dirseek/dirseek.c 			k++;
k                 396 user/testbin/dirseek/dirseek.c 	if (k>0) {
k                 397 user/testbin/dirseek/dirseek.c 		printf("Survived %d invalid reads...\n", k);
k                  64 user/testbin/matmult/matmult-orig.c     int i, j, k, r;
k                  75 user/testbin/matmult/matmult-orig.c             for (k = 0; k < Dim; k++)
k                  76 user/testbin/matmult/matmult-orig.c 		 C[i][j] += A[i][k] * B[k][j];
k                  59 user/testbin/matmult/matmult.c     int i, j, k, r;
k                  70 user/testbin/matmult/matmult.c             for (k = 0; k < Dim; k++)
k                  71 user/testbin/matmult/matmult.c 		T[i][j][k] = A[i][k] * B[k][j];
k                  75 user/testbin/matmult/matmult.c             for (k = 0; k < Dim; k++)
k                  76 user/testbin/matmult/matmult.c 		C[i][j] += T[i][j][k];
k                 111 user/testbin/parallelvm/parallelvm.c 	int i, j, k;
k                 116 user/testbin/parallelvm/parallelvm.c 			for (k=0; k<DIM; k++) {
k                 117 user/testbin/parallelvm/parallelvm.c 				val += m1->m_data[i][k]*m2->m_data[k][j];
k                  62 user/testbin/sort/sort.c 	int pivot, i, j, k;
k                  74 user/testbin/sort/sort.c 	k = 0;
k                  77 user/testbin/sort/sort.c 			tmp[k++] = arr[i++];
k                  80 user/testbin/sort/sort.c 			tmp[k++] = arr[j++];
k                  84 user/testbin/sort/sort.c 		tmp[k++] = arr[i++];
k                  87 user/testbin/sort/sort.c 		tmp[k++] = arr[j++];
k                  72 user/testbin/zero/zero.c 	unsigned i, num, k;
k                  75 user/testbin/zero/zero.c 	for (k=i=0; i<num; i++) {
k                  76 user/testbin/zero/zero.c 		k += data_stuff[i];
k                  78 user/testbin/zero/zero.c 	if (k != SUM_OF_DATA_STUFF) {
k                  80 user/testbin/zero/zero.c 		warnx("Got: %u  Expected: %u", k, SUM_OF_DATA_STUFF);
k                  31 user/uw-testbin/conc-io/conc-io.c   int i,k;
k                  87 user/uw-testbin/conc-io/conc-io.c     for (k=0; k<(BUF_SIZE-1); k++) {
k                  88 user/uw-testbin/conc-io/conc-io.c         if (buffer[k] != buffer[k+1]) { 
k                  91 user/uw-testbin/conc-io/conc-io.c 							k, buffer[k], k+1, buffer[k+1]);
k                  52 user/uw-testbin/vm-mix2/vm-mix2.c   unsigned int k = 0;
k                  55 user/uw-testbin/vm-mix2/vm-mix2.c 	for (k=0; k<ELEMS; k += PAGE_SIZE) {
k                  56 user/uw-testbin/vm-mix2/vm-mix2.c 		end = MIN(ELEMS, (k + (LOCAL_REFS * ELEMS_PER_PAGE)));
k                  57 user/uw-testbin/vm-mix2/vm-mix2.c 		for (i=k; i<end; i++) {
k                  61 user/uw-testbin/vm-mix2/vm-mix2.c 		printf("from k = %d to i = %d end %d\n", i, k, end);