n 75 common/gcc-millicode/qdivrem.c int m, n, d, j, i;
n 123 common/gcc-millicode/qdivrem.c for (n = 4; v[1] == 0; v++) {
n 124 common/gcc-millicode/qdivrem.c if (--n == 1) {
n 157 common/gcc-millicode/qdivrem.c for (m = 4 - n; u[1] == 0; u++)
n 173 common/gcc-millicode/qdivrem.c shl(&u[0], m + n, d); /* u <<= d */
n 174 common/gcc-millicode/qdivrem.c shl(&v[1], n - 1, d); /* v <<= d */
n 217 common/gcc-millicode/qdivrem.c for (t = 0, i = n; i > 0; i--) {
n 232 common/gcc-millicode/qdivrem.c for (t = 0, i = n; i > 0; i--) { /* D6: add back. */
n 249 common/gcc-millicode/qdivrem.c for (i = m + n; i > m; --i)
n 42 kern/lib/uio.c uiomove(void *ptr, size_t n, struct uio *uio)
n 58 kern/lib/uio.c while (n > 0 && uio->uio_resid > 0) {
n 63 kern/lib/uio.c if (size > n) {
n 64 kern/lib/uio.c size = n;
n 116 kern/lib/uio.c n -= size;
n 123 kern/lib/uio.c uiomovezeros(size_t n, struct uio *uio)
n 133 kern/lib/uio.c while (n > 0) {
n 135 kern/lib/uio.c if (amt > n) {
n 136 kern/lib/uio.c amt = n;
n 142 kern/lib/uio.c n -= amt;
n 445 kern/startup/menu.c cmd_opsmenu(int n, char **a)
n 447 kern/startup/menu.c (void)n;
n 482 kern/startup/menu.c cmd_testmenu(int n, char **a)
n 484 kern/startup/menu.c (void)n;
n 513 kern/startup/menu.c cmd_mainmenu(int n, char **a)
n 515 kern/startup/menu.c (void)n;
n 42 kern/test/arraytest.c int i, j, n, r, *p;
n 48 kern/test/arraytest.c n = array_num(a);
n 49 kern/test/arraytest.c KASSERT(n==0);
n 54 kern/test/arraytest.c n = array_num(a);
n 55 kern/test/arraytest.c KASSERT(n==i+1);
n 57 kern/test/arraytest.c n = array_num(a);
n 58 kern/test/arraytest.c KASSERT(n==TESTSIZE);
n 64 kern/test/arraytest.c n = array_num(a);
n 65 kern/test/arraytest.c KASSERT(n==TESTSIZE);
n 72 kern/test/arraytest.c n = array_num(a);
n 73 kern/test/arraytest.c KASSERT(n==TESTSIZE);
n 756 kern/thread/thread.c int i, n;
n 757 kern/thread/thread.c n = random()%161 + random()%161;
n 758 kern/thread/thread.c for (i=0; i<n; i++) {
n 1146 kern/thread/thread.c int n;
n 1150 kern/thread/thread.c n = target->c_numshootdown;
n 1151 kern/thread/thread.c if (n == TLBSHOOTDOWN_MAX) {
n 1155 kern/thread/thread.c target->c_shootdown[n] = *mapping;
n 1156 kern/thread/thread.c target->c_numshootdown = n+1;
n 289 kern/vm/kmalloc.c unsigned i, n, index;
n 304 kern/vm/kmalloc.c n = PAGE_SIZE / sizes[blktype];
n 305 kern/vm/kmalloc.c KASSERT(n <= 32*sizeof(freemap)/sizeof(freemap[0]));
n 314 kern/vm/kmalloc.c KASSERT(index<n);
n 321 kern/vm/kmalloc.c (unsigned) pr->nfree, n);
n 323 kern/vm/kmalloc.c for (i=0; i<n; i++) {
n 326 kern/vm/kmalloc.c if (i%64==63 && i<n-1) {
n 441 user/lib/libc/stdlib/malloc.c size_t i, n = size/sizeof(uint32_t);
n 442 user/lib/libc/stdlib/malloc.c for (i=0; i<n; i++) {
n 285 user/lib/libc/stdlib/random.c size_t n) /* # bytes of state info */
n 299 user/lib/libc/stdlib/random.c if (n < BREAK_0) {
n 302 user/lib/libc/stdlib/random.c } else if (n < BREAK_1) {
n 306 user/lib/libc/stdlib/random.c } else if (n < BREAK_2) {
n 310 user/lib/libc/stdlib/random.c } else if (n < BREAK_3) {
n 314 user/lib/libc/stdlib/random.c } else if (n < BREAK_4) {
n 134 user/testbin/dirseek/dirseek.c int n, i, ix;
n 144 user/testbin/dirseek/dirseek.c n = 0;
n 150 user/testbin/dirseek/dirseek.c "invalid length %d", n, len);
n 156 user/testbin/dirseek/dirseek.c "unexpected name %s", n, buf);
n 161 user/testbin/dirseek/dirseek.c "%s a second time", n, buf);
n 170 user/testbin/dirseek/dirseek.c n++;
n 173 user/testbin/dirseek/dirseek.c err(1, ".: entry %d: getdirentry", n);
n 182 user/testbin/dirseek/dirseek.c if (i!=n) {
n 190 user/testbin/dirseek/dirseek.c n, i);
n 287 user/testbin/dirseek/dirseek.c int n, i, x;
n 292 user/testbin/dirseek/dirseek.c n = i;
n 296 user/testbin/dirseek/dirseek.c x = (int)(random()%n);
n 104 user/testbin/malloctest/malloctest.c size_t n, i;
n 109 user/testbin/malloctest/malloctest.c n = size / sizeof(unsigned long);
n 111 user/testbin/malloctest/malloctest.c for (i=0; i<n; i++) {
n 130 user/testbin/malloctest/malloctest.c size_t n, i;
n 135 user/testbin/malloctest/malloctest.c n = size / sizeof(unsigned long);
n 137 user/testbin/malloctest/malloctest.c for (i=0; i<n; i++) {
n 524 user/testbin/malloctest/malloctest.c int i, n, size, failed=0;
n 535 user/testbin/malloctest/malloctest.c n = random()%32;
n 536 user/testbin/malloctest/malloctest.c if (ptrs[n] == NULL) {
n 538 user/testbin/malloctest/malloctest.c ptrs[n] = malloc(size);
n 539 user/testbin/malloctest/malloctest.c psizes[n] = size;
n 540 user/testbin/malloctest/malloctest.c if (ptrs[n] == NULL) {
n 545 user/testbin/malloctest/malloctest.c markblock(ptrs[n], size, n, 0);
n 548 user/testbin/malloctest/malloctest.c size = psizes[n];
n 549 user/testbin/malloctest/malloctest.c if (checkblock(ptrs[n], size, n, 0)) {
n 553 user/testbin/malloctest/malloctest.c free(ptrs[n]);
n 554 user/testbin/malloctest/malloctest.c ptrs[n] = NULL;
n 555 user/testbin/malloctest/malloctest.c psizes[n] = 0;
n 168 user/testbin/parallelvm/parallelvm.c compute(int n)
n 173 user/testbin/parallelvm/parallelvm.c for (i=0,j=n-1; i<j; i++,j--) {
n 175 user/testbin/parallelvm/parallelvm.c addeq(&mats[n], &tmp);
n 85 user/uw-testbin/vm-funcs/vm-funcs.c volatile int n = 12; \
n 88 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 89 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 90 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 91 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 92 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 93 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 94 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 95 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 96 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 97 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 98 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 99 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 100 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 101 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 102 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 103 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 106 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 107 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 108 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 109 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 110 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 111 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 112 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 113 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 114 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 115 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 116 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 117 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 118 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 121 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 122 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 123 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 124 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 125 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 126 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 127 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 130 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 131 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 132 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 133 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 134 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 135 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 136 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 137 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 138 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 139 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 140 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 141 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 142 user/uw-testbin/vm-funcs/vm-funcs.c n = l + m - n + i; \
n 143 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 144 user/uw-testbin/vm-funcs/vm-funcs.c l = l + m - n + i; \
n 145 user/uw-testbin/vm-funcs/vm-funcs.c m = l + m - n + i; \
n 149 user/uw-testbin/vm-funcs/vm-funcs.c return l + m + n; \