i 66 kernel/console.c int i = 0; i 68 kernel/console.c while (i < n) { i 70 kernel/console.c if (nn > n - i) i 71 kernel/console.c nn = n - i; i 72 kernel/console.c if (either_copyin(buf, user_src, src + i, nn) == -1) i 75 kernel/console.c i += nn; i 78 kernel/console.c return i; i 31 kernel/exec.c int i, off; i 60 kernel/exec.c for (i = 0, off = elf.phoff; i < elf.phnum; i++, off += sizeof(ph)) { i 160 kernel/exec.c uint i, n; i 163 kernel/exec.c for (i = 0; i < sz; i += PGSIZE) { i 164 kernel/exec.c pa = walkaddr(pagetable, va + i); i 167 kernel/exec.c if (sz - i < PGSIZE) i 168 kernel/exec.c n = sz - i; i 171 kernel/exec.c if (readi(ip, 0, (uint64)pa, offset + i, n) != n) i 154 kernel/file.c int i = 0; i 155 kernel/file.c while (i < n) { i 156 kernel/file.c int n1 = n - i; i 162 kernel/file.c if ((r = writei(f->ip, 1, addr + i, f->off, n1)) > 0) i 171 kernel/file.c i += r; i 173 kernel/file.c ret = (i == n ? n : -1); i 186 kernel/fs.c int i = 0; i 189 kernel/fs.c for (i = 0; i < NINODE; i++) { i 190 kernel/fs.c initsleeplock(&itable.inode[i].lock, "inode"); i 466 kernel/fs.c int i, j; i 470 kernel/fs.c for (i = 0; i < NDIRECT; i++) { i 471 kernel/fs.c if (ip->addrs[i]) { i 472 kernel/fs.c bfree(ip->dev, ip->addrs[i]); i 473 kernel/fs.c ip->addrs[i] = 0; i 45 kernel/fs.h #define IBLOCK(i, sb) ((i) / IPB + sb.inodestart) i 93 kernel/log.c int i; i 95 kernel/log.c for (i = 0; i < log.lh.n; i++) { i 96 kernel/log.c log.lh.block[i] = lh->block[i]; i 109 kernel/log.c int i; i 111 kernel/log.c for (i = 0; i < log.lh.n; i++) { i 112 kernel/log.c hb->block[i] = log.lh.block[i]; i 226 kernel/log.c int i; i 234 kernel/log.c for (i = 0; i < log.lh.n; i++) { i 235 kernel/log.c if (log.lh.block[i] == b->blockno) // log absorption i 238 kernel/log.c log.lh.block[i] = b->blockno; i 239 kernel/log.c if (i == log.lh.n) { // Add new block to log? i 79 kernel/pipe.c int i = 0; i 83 kernel/pipe.c while (i < n) { i 96 kernel/pipe.c if (copyin(pr->pagetable, pr->sz, &ch, addr + i, 1) == -1) { i 97 kernel/pipe.c if (i == 0) i 98 kernel/pipe.c i = -1; i 102 kernel/pipe.c i++; i 108 kernel/pipe.c return i; i 114 kernel/pipe.c int i; i 129 kernel/pipe.c for (i = 0; i < n; i++) { //DOC: piperead-copy i 133 kernel/pipe.c if (copyout(pr->pagetable, pr->sz, addr + i, &ch, 1) == -1) { i 134 kernel/pipe.c if (i == 0) i 135 kernel/pipe.c i = -1; i 142 kernel/pipe.c return i; i 32 kernel/printk.c int i; i 40 kernel/printk.c i = 0; i 42 kernel/printk.c buf[i++] = digits[x % base]; i 46 kernel/printk.c buf[i++] = '-'; i 48 kernel/printk.c while (--i >= 0) i 49 kernel/printk.c consputc(buf[i]); i 55 kernel/printk.c int i; i 58 kernel/printk.c for (i = 0; i < (sizeof(uint64) * 2); i++, x <<= 4) i 67 kernel/printk.c int i, cx, c0, c1, c2; i 74 kernel/printk.c for (i = 0; (cx = fmt[i] & 0xff) != 0; i++) { i 79 kernel/printk.c i++; i 80 kernel/printk.c c0 = fmt[i + 0] & 0xff; i 83 kernel/printk.c c1 = fmt[i + 1] & 0xff; i 85 kernel/printk.c c2 = fmt[i + 2] & 0xff; i 90 kernel/printk.c i += 1; i 93 kernel/printk.c i += 2; i 98 kernel/printk.c i += 1; i 101 kernel/printk.c i += 2; i 106 kernel/printk.c i += 1; i 109 kernel/printk.c i += 2; i 261 kernel/proc.c int i, pid; i 285 kernel/proc.c for (i = 0; i < NOFILE; i++) i 286 kernel/proc.c if (p->ofile[i]) i 287 kernel/proc.c np->ofile[i] = filedup(p->ofile[i]); i 7 kernel/string.c int i; i 8 kernel/string.c for (i = 0; i < n; i++) { i 9 kernel/string.c cdst[i] = c; i 462 kernel/sysfile.c int i; i 470 kernel/sysfile.c for (i = 0;; i++) { i 471 kernel/sysfile.c if (i >= NELEM(argv)) { i 474 kernel/sysfile.c if (fetchaddr(uargv + sizeof(uint64) * i, (uint64 *)&uarg) < 0) { i 478 kernel/sysfile.c argv[i] = 0; i 481 kernel/sysfile.c argv[i] = kalloc(); i 482 kernel/sysfile.c if (argv[i] == 0) i 484 kernel/sysfile.c if (fetchstr(uarg, argv[i], PGSIZE) < 0) i 490 kernel/sysfile.c for (i = 0; i < NELEM(argv) && argv[i] != 0; i++) i 491 kernel/sysfile.c kfree(argv[i]); i 496 kernel/sysfile.c for (i = 0; i < NELEM(argv) && argv[i] != 0; i++) i 497 kernel/sysfile.c kfree(argv[i]); i 84 kernel/uart.c int i = 0; i 85 kernel/uart.c while (i < n) { i 88 kernel/uart.c WriteReg(THR, buf[i]); i 89 kernel/uart.c i += 1; i 145 kernel/virtio_disk.c for (int i = 0; i < NUM; i++) i 146 kernel/virtio_disk.c disk.free[i] = 1; i 159 kernel/virtio_disk.c for (int i = 0; i < NUM; i++) { i 160 kernel/virtio_disk.c if (disk.free[i]) { i 161 kernel/virtio_disk.c disk.free[i] = 0; i 162 kernel/virtio_disk.c return i; i 170 kernel/virtio_disk.c free_desc(int i) i 172 kernel/virtio_disk.c if (i >= NUM) i 174 kernel/virtio_disk.c if (disk.free[i]) i 176 kernel/virtio_disk.c disk.desc[i].addr = 0; i 177 kernel/virtio_disk.c disk.desc[i].len = 0; i 178 kernel/virtio_disk.c disk.desc[i].flags = 0; i 179 kernel/virtio_disk.c disk.desc[i].next = 0; i 180 kernel/virtio_disk.c disk.free[i] = 1; i 186 kernel/virtio_disk.c free_chain(int i) i 189 kernel/virtio_disk.c int flag = disk.desc[i].flags; i 190 kernel/virtio_disk.c int nxt = disk.desc[i].next; i 191 kernel/virtio_disk.c free_desc(i); i 193 kernel/virtio_disk.c i = nxt; i 204 kernel/virtio_disk.c for (int i = 0; i < 3; i++) { i 205 kernel/virtio_disk.c idx[i] = alloc_desc(); i 206 kernel/virtio_disk.c if (idx[i] < 0) { i 207 kernel/virtio_disk.c for (int j = 0; j < i; j++) i 268 kernel/vm.c for (int i = 0; i < 512; i++) { i 269 kernel/vm.c pte_t pte = pagetable[i]; i 274 kernel/vm.c pagetable[i] = 0; i 302 kernel/vm.c uint64 pa, i; i 306 kernel/vm.c for (i = 0; i < sz; i += PGSIZE) { i 307 kernel/vm.c if ((pte = walk(old, i, 0)) == 0) i 316 kernel/vm.c if (mappages(new, i, PGSIZE, (uint64)mem, flags) != 0) { i 324 kernel/vm.c uvmunmap(new, 0, i / PGSIZE, 1); i 75 mkfs/mkfs.c int i, cc, fd; i 114 mkfs/mkfs.c for (i = 0; i < FSSIZE; i++) i 115 mkfs/mkfs.c wsect(i, zeroes); i 134 mkfs/mkfs.c for (i = 2; i < argc; i++) { i 137 mkfs/mkfs.c if (strncmp(argv[i], "user/", 5) == 0) i 138 mkfs/mkfs.c shortname = argv[i] + 5; i 140 mkfs/mkfs.c shortname = argv[i]; i 144 mkfs/mkfs.c if ((fd = open(argv[i], 0)) < 0) i 145 mkfs/mkfs.c die(argv[i]); i 244 mkfs/mkfs.c int i; i 249 mkfs/mkfs.c for (i = 0; i < used; i++) { i 250 mkfs/mkfs.c buf[i / 8] = buf[i / 8] | (0x1 << (i % 8)); i 27 user/cat.c int fd, i; i 34 user/cat.c for (i = 1; i < argc; i++) { i 35 user/cat.c if ((fd = open(argv[i], O_RDONLY)) < 0) { i 36 user/cat.c fprintf(2, "cat: cannot open %s\n", argv[i]); i 8 user/echo.c int i; i 10 user/echo.c for (i = 1; i < argc; i++) { i 11 user/echo.c write(1, argv[i], strlen(argv[i])); i 12 user/echo.c if (i + 1 < argc) { i 40 user/grep.c int fd, i; i 54 user/grep.c for (i = 2; i < argc; i++) { i 55 user/grep.c if ((fd = open(argv[i], O_RDONLY)) < 0) { i 56 user/grep.c printf("grep: cannot open %s\n", argv[i]); i 8 user/kill.c int i; i 14 user/kill.c for (i = 1; i < argc; i++) i 15 user/kill.c kill(atoi(argv[i])); i 19 user/logstress.c for (int i = 1; i < argc; i++) { i 26 user/logstress.c fd = open(argv[i], O_CREATE | O_RDWR); i 28 user/logstress.c printf("%s: create %s failed\n", argv[0], argv[i]); i 31 user/logstress.c memset(buf, '0' + i, SZ); i 32 user/logstress.c for (i = 0; i < N; i++) { i 42 user/logstress.c for (int i = 1; i < argc; i++) { i 79 user/ls.c int i; i 85 user/ls.c for (i = 1; i < argc; i++) i 86 user/ls.c ls(argv[i]); i 8 user/mkdir.c int i; i 15 user/mkdir.c for (i = 1; i < argc; i++) { i 16 user/mkdir.c if (mkdir(argv[i]) < 0) { i 17 user/mkdir.c fprintf(2, "mkdir: %s failed to create\n", argv[i]); i 19 user/printf.c int i, neg; i 30 user/printf.c i = 0; i 32 user/printf.c buf[i++] = digits[x % base]; i 35 user/printf.c buf[i++] = '-'; i 37 user/printf.c while (--i >= 0) i 38 user/printf.c putc(fd, buf[i]); i 44 user/printf.c int i; i 47 user/printf.c for (i = 0; i < (sizeof(uint64) * 2); i++, x <<= 4) i 56 user/printf.c int c0, c1, c2, i, state; i 59 user/printf.c for (i = 0; fmt[i]; i++) { i 60 user/printf.c c0 = fmt[i] & 0xff; i 70 user/printf.c c1 = fmt[i + 1] & 0xff; i 72 user/printf.c c2 = fmt[i + 2] & 0xff; i 77 user/printf.c i += 1; i 80 user/printf.c i += 2; i 85 user/printf.c i += 1; i 88 user/printf.c i += 2; i 93 user/printf.c i += 1; i 96 user/printf.c i += 2; i 8 user/rm.c int i; i 15 user/rm.c for (i = 1; i < argc; i++) { i 16 user/rm.c if (unlink(argv[i]) < 0) { i 17 user/rm.c fprintf(2, "rm: %s failed to delete\n", argv[i]); i 458 user/sh.c int i; i 471 user/sh.c for (i = 0; ecmd->argv[i]; i++) i 472 user/sh.c *ecmd->eargv[i] = 0; i 19 user/stressfs.c int fd, i; i 26 user/stressfs.c for (i = 0; i < 4; i++) i 30 user/stressfs.c printf("write %d\n", i); i 32 user/stressfs.c path[8] += i; i 34 user/stressfs.c for (i = 0; i < 20; i++) { i 43 user/stressfs.c for (i = 0; i < 20; i++) i 53 user/ulib.c int i; i 54 user/ulib.c for (i = 0; i < n; i++) { i 55 user/ulib.c cdst[i] = c; i 72 user/ulib.c int i, cc; i 75 user/ulib.c for (i = 0; i + 1 < max;) { i 79 user/ulib.c buf[i++] = c; i 83 user/ulib.c buf[i] = '\0'; i 146 user/usertests.c for (int i = 0; i < MAXPATH; i++) i 147 user/usertests.c b[i] = 'x'; i 182 user/usertests.c for (int i = 0; i < PGSIZE; i++) i 183 user/usertests.c big[i] = 'x'; i 388 user/usertests.c for (int i = 0; i < 100; i++) { i 408 user/usertests.c for (int i = 0; i < 150; i++) { i 545 user/usertests.c int i; i 553 user/usertests.c for (i = 0; i < N; i++) { i 555 user/usertests.c printf("%s: error: write aa %d new file failed\n", s, i); i 559 user/usertests.c printf("%s: error: write bb %d new file failed\n", s, i); i 569 user/usertests.c i = read(fd, buf, N * SZ * 2); i 570 user/usertests.c if (i != N * SZ * 2) { i 585 user/usertests.c int i, fd, n; i 593 user/usertests.c for (i = 0; i < MAXFILE; i++) { i 594 user/usertests.c ((int *)buf)[0] = i; i 596 user/usertests.c printf("%s: error: write big file failed i=%d\n", s, i); i 611 user/usertests.c i = read(fd, buf, BSIZE); i 612 user/usertests.c if (i == 0) { i 618 user/usertests.c } else if (i != BSIZE) { i 619 user/usertests.c printf("%s: read failed %d\n", s, i); i 639 user/usertests.c int i, fd; i 645 user/usertests.c for (i = 0; i < N; i++) { i 646 user/usertests.c name[1] = '0' + i; i 652 user/usertests.c for (i = 0; i < N; i++) { i 653 user/usertests.c name[1] = '0' + i; i 749 user/usertests.c int seq, i, n, cc, total; i 761 user/usertests.c for (i = 0; i < SZ; i++) i 762 user/usertests.c buf[i] = seq++; i 774 user/usertests.c for (i = 0; i < n; i++) { i 775 user/usertests.c if ((buf[i] & 0xff) != (seq++ & 0xff)) { i 804 user/usertests.c for (int i = 0; i < 100; i++) { i 914 user/usertests.c int i, pid; i 916 user/usertests.c for (i = 0; i < 100; i++) { i 928 user/usertests.c if (i != xstate) { i 933 user/usertests.c exit(i); i 945 user/usertests.c for (int i = 0; i < 200; i++) { i 972 user/usertests.c for (int i = 0; i < 1000; i++) { i 1002 user/usertests.c for (int i = 0; i < N; i++) { i 1024 user/usertests.c for (int i = 0; i < N; i++) { i 1071 user/usertests.c for (int i = 0; i < 800; i++) { i 1132 user/usertests.c int fd, pid, i, n, nc, np; i 1144 user/usertests.c for (i = 0; i < N; i++) { i 1167 user/usertests.c for (i = 0; i < sizeof(buf); i++) { i 1168 user/usertests.c if (buf[i] == 'c') i 1170 user/usertests.c if (buf[i] == 'p') i 1189 user/usertests.c int fd, pid, i, j, n, total, pi; i 1212 user/usertests.c for (i = 0; i < N; i++) { i 1229 user/usertests.c for (i = 0; i < NCHILD; i++) { i 1230 user/usertests.c fname = names[i]; i 1235 user/usertests.c if (buf[j] != '0' + i) { i 1256 user/usertests.c int pid, i, fd, pi; i 1269 user/usertests.c for (i = 0; i < N; i++) { i 1270 user/usertests.c name[1] = '0' + i; i 1277 user/usertests.c if (i > 0 && (i % 2) == 0) { i 1278 user/usertests.c name[1] = '0' + (i / 2); i 1297 user/usertests.c for (i = 0; i < N; i++) { i 1300 user/usertests.c name[1] = '0' + i; i 1302 user/usertests.c if ((i == 0 || i >= N / 2) && fd < 0) { i 1305 user/usertests.c } else if ((i >= 1 && i < N / 2) && fd >= 0) { i 1314 user/usertests.c for (i = 0; i < N; i++) { i 1317 user/usertests.c name[1] = '0' + i; i 1433 user/usertests.c int i, pid, n, fd; i 1442 user/usertests.c for (i = 0; i < N; i++) { i 1443 user/usertests.c file[1] = '0' + i; i 1446 user/usertests.c if (pid && (i % 3) == 1) { i 1448 user/usertests.c } else if (pid == 0 && (i % 5) == 1) { i 1475 user/usertests.c i = de.name[1] - '0'; i 1476 user/usertests.c if (i < 0 || i >= sizeof(fa)) { i 1480 user/usertests.c if (fa[i]) { i 1484 user/usertests.c fa[i] = 1; i 1495 user/usertests.c for (i = 0; i < N; i++) { i 1496 user/usertests.c file[1] = '0' + i; i 1502 user/usertests.c if (((i % 3) == 0 && pid == 0) || ((i % 3) == 1 && pid != 0)) { i 1529 user/usertests.c int pid, i; i 1539 user/usertests.c for (i = 0; i < 100; i++) { i 1748 user/usertests.c int i; i 1749 user/usertests.c for (i = 0; i < 2; i++) { i 1765 user/usertests.c int fd, i, total, cc; i 1773 user/usertests.c for (i = 0; i < N; i++) { i 1774 user/usertests.c memset(buf, i, SZ); i 1788 user/usertests.c for (i = 0;; i++) { i 1800 user/usertests.c if (buf[0] != i / 2 || buf[SZ / 2 - 1] != i / 2) { i 1958 user/usertests.c int i, fd; i 1960 user/usertests.c for (i = 0; i < NINODE + 1; i++) { i 1982 user/usertests.c for (i = 0; i < NINODE + 1; i++) { i 2034 user/usertests.c int i, pid, xstatus; i 2068 user/usertests.c for (i = 0; i < 5000; i++) { i 2071 user/usertests.c printf("%s: sbrk test failed %d %p %p\n", s, i, a, b); i 2205 user/usertests.c int i, xstatus; i 2218 user/usertests.c for (i = 0; i < sizeof(pids) / sizeof(pids[0]); i++) { i 2219 user/usertests.c if ((pids[i] = fork()) == 0) { i 2229 user/usertests.c if (pids[i] != -1) { i 2242 user/usertests.c for (i = 0; i < sizeof(pids) / sizeof(pids[0]); i++) { i 2243 user/usertests.c if (pids[i] == -1) i 2245 user/usertests.c kill(pids[i]); i 2322 user/usertests.c int i; i 2324 user/usertests.c for (i = 0; i < sizeof(uninit); i++) { i 2325 user/usertests.c if (uninit[i] != '\0') { i 2344 user/usertests.c int i; i 2348 user/usertests.c for (i = 0; i < MAXARG - 1; i++) i 2349 user/usertests.c args[i] = big; i 2613 user/usertests.c for (int i = 0; i < 50000; i++) { i 2630 user/usertests.c char *i, *prev_end, *new_end; i 2639 user/usertests.c for (i = prev_end + PGSIZE; i < new_end; i += 64 * PGSIZE) i 2640 user/usertests.c *(char **)i = i; i 2642 user/usertests.c for (i = prev_end + PGSIZE; i < new_end; i += 64 * PGSIZE) { i 2643 user/usertests.c if (*(char **)i != i) { i 2659 user/usertests.c char *i, *prev_end, *new_end; i 2668 user/usertests.c for (i = prev_end + PGSIZE; i < new_end; i += PGSIZE * PGSIZE) i 2669 user/usertests.c *(char **)i = i; i 2671 user/usertests.c for (i = prev_end + PGSIZE; i < new_end; i += PGSIZE * PGSIZE) { i 2678 user/usertests.c *(char **)i = i; i 2717 user/usertests.c for (int i = 0; i < sizeof(bad) / sizeof(bad[0]); i++) { i 2723 user/usertests.c if (read(fd, (char *)bad[i], 512) >= 0) { i 2733 user/usertests.c if (write(fd, (char *)bad[i], 512) >= 0) { i 2898 user/usertests.c for (int i = 0; i < 64; i++) { i 3048 user/usertests.c int i, fd; i 3060 user/usertests.c for (i = 0; i < N; i++) { i 3062 user/usertests.c name[1] = '0' + (i / 64); i 3063 user/usertests.c name[2] = '0' + (i % 64); i 3066 user/usertests.c printf("%s: bigdir i=%d link(bd, %s) failed\n", s, i, name); i 3072 user/usertests.c for (i = 0; i < N; i++) { i 3074 user/usertests.c name[1] = '0' + (i / 64); i 3075 user/usertests.c name[2] = '0' + (i % 64); i 3107 user/usertests.c for (int i = 0; i < ci + 1; i++) { i 3149 user/usertests.c for (int i = 0; i < assumed_free; i++) { i 3197 user/usertests.c for (int i = 0; i < avail; i++) i 3236 user/usertests.c for (int i = 0; i < MAXFILE; i++) { i 3252 user/usertests.c for (int i = 0; i < nzz; i++) { i 3256 user/usertests.c name[2] = '0' + (i / 32); i 3257 user/usertests.c name[3] = '0' + (i % 32); i 3272 user/usertests.c for (int i = 0; i < nzz; i++) { i 3276 user/usertests.c name[2] = '0' + (i / 32); i 3277 user/usertests.c name[3] = '0' + (i % 32); i 3282 user/usertests.c for (int i = 0; '0' + i < 0177; i++) { i 3287 user/usertests.c name[3] = '0' + i; i 3297 user/usertests.c for (int i = 0; i < nzz; i++) { i 3301 user/usertests.c name[2] = '0' + (i / 32); i 3302 user/usertests.c name[3] = '0' + (i % 32); i 3313 user/usertests.c for (int i = 0; i < nzz; i++) { i 3317 user/usertests.c name[2] = '0' + (i / 32); i 3318 user/usertests.c name[3] = '0' + (i % 32); i 3330 user/usertests.c int i; i 3340 user/usertests.c for (i = 0; i < TARGET; i++) { i 3341 user/usertests.c int d = i % DIRS; i 3342 user/usertests.c int f = i / DIRS; i 3372 user/usertests.c printf("%s: link failed after %d links (nlink=%d)\n", s, i, st.nlink); i 3376 user/usertests.c if (i % 100 == 0) { i 3377 user/usertests.c printf("%s: i=%d, pn=%s\n", s, i, pn); i 11 user/wc.c int i, n; i 17 user/wc.c for (i = 0; i < n; i++) { i 19 user/wc.c if (buf[i] == '\n') i 21 user/wc.c if (strchr(" \r\t\n\v", buf[i])) i 39 user/wc.c int fd, i; i 46 user/wc.c for (i = 1; i < argc; i++) { i 47 user/wc.c if ((fd = open(argv[i], O_RDONLY)) < 0) { i 48 user/wc.c printf("wc: cannot open %s\n", argv[i]); i 51 user/wc.c wc(fd, argv[i]);