Welcome to The Fiwix Project
A UNIX-like kernel for the i386 architecture
n 132 drivers/block/floppy.c int n; n 139 drivers/block/floppy.c for(n = 0; n < 10000; n++) { n 155 drivers/block/floppy.c int n; n 162 drivers/block/floppy.c for(n = 0; n < 10000; n++) { n 176 drivers/block/floppy.c int n; n 179 drivers/block/floppy.c for(n = 0; n < MAX_FDC_RESULTS; n++) { n 180 drivers/block/floppy.c fdc_results[n] = fdc_in(); n 233 drivers/block/floppy.c int n; n 241 drivers/block/floppy.c for(n = 0; n < 1000; n++) { /* recovery time */ n 263 drivers/block/floppy.c for(n = 0; n < 4; n++) { n 394 drivers/block/ide.c int n, retries, status; n 399 drivers/block/ide.c for(n = 0; n < retries; n++) { n 493 drivers/block/ide.c int n; n 495 drivers/block/ide.c for(n = 0; n < 10000; n++) { n 502 drivers/block/ide.c int n; n 505 drivers/block/ide.c for(n = 0; n < 4; n++) { n 512 drivers/block/ide.c int n, status; n 524 drivers/block/ide.c for(n = 0; n < MAX_IDE_ERR; n++) { n 538 drivers/block/ide.c for(n = 0; n < MAX_IDE_ERR; n++) { n 107 drivers/block/ide_cd.c int n, retries, status; n 135 drivers/block/ide_cd.c for(n = 0; n < retries; n++) { n 142 drivers/block/ide_cd.c if(n >= retries) { n 143 drivers/block/ide_cd.c printk("WARNING: %s(): %s: drive not ready to receive command packet (retries = %d).\n", __FUNCTION__, ide->drive[drive].dev_name, n); n 429 drivers/block/ide_cd.c int n, retries; n 455 drivers/block/ide_cd.c for(n = 0; n < sectors_to_read; n++, block++) { n 462 drivers/block/ide_cd.c if(atapi_read_data(dev, buffer, ide, blksize, n * IDE_CD_SECTSIZE)) { n 70 drivers/block/ide_hd.c int n; n 82 drivers/block/ide_hd.c for(n = 0; n < NR_PARTITIONS; n++) { n 84 drivers/block/ide_hd.c minor = (1 << ide->drive[drive].minor_shift) + n; n 87 drivers/block/ide_hd.c minor = (1 << ide->drive[drive].minor_shift) + n + 1; n 90 drivers/block/ide_hd.c if(part[n].type) { n 92 drivers/block/ide_hd.c ((unsigned int *)d->device_data)[minor] = part[n].nr_sects / 2; n 131 drivers/block/ide_hd.c int n, status, r, retries; n 160 drivers/block/ide_hd.c n = 0; n 162 drivers/block/ide_hd.c while(n < sectors_to_read) { n 244 drivers/block/ide_hd.c n++; n 259 drivers/block/ide_hd.c int n, status, r, retries; n 288 drivers/block/ide_hd.c n = 0; n 290 drivers/block/ide_hd.c while(n < sectors_to_write) { n 376 drivers/block/ide_hd.c n++; n 451 drivers/block/ide_hd.c int n; n 500 drivers/block/ide_hd.c for(n = 0; n < NR_PARTITIONS; n++) { n 502 drivers/block/ide_hd.c if(part[n].status && part[n].status != 0x80) { n 505 drivers/block/ide_hd.c if(part[n].type) { n 506 drivers/block/ide_hd.c printk("%s%d ", ide->drive[drive].dev_name, n + 1); n 182 drivers/block/ramdisk.c int n; n 186 drivers/block/ramdisk.c for(n = 0; n < RAMDISK_MINORS; n++) { n 187 drivers/block/ramdisk.c SET_MINOR(ramdisk_device.minors, n); n 188 drivers/block/ramdisk.c rd_sizes[n] = _ramdisksize; n 189 drivers/block/ramdisk.c ramdisk = get_ramdisk(n); n 190 drivers/block/ramdisk.c printk("ram%d 0x%08X-0x%08X %d RAMdisk(s) of %dKB size, %dKB blocksize\n", n, ramdisk->addr, ramdisk->addr + (_ramdisksize * 1024), RAMDISK_MINORS, _ramdisksize, BLKSIZE_1K / 1024); n 284 drivers/char/console.c int n; n 290 drivers/char/console.c for(n = 0; n < vc->nparms; n++) { n 291 drivers/char/console.c switch(vc->parms[n]) { n 323 drivers/char/console.c vc->color_attr = (vc->color_attr & 0xF8FF) | (ansi_color_table[vc->parms[n] - 30]); n 337 drivers/char/console.c vc->color_attr = (vc->color_attr & 0x8FFF) | ((ansi_color_table[vc->parms[n] - 40]) << 4); n 476 drivers/char/console.c int n; n 496 drivers/char/console.c for(n = 0; n < MAX_TAB_COLS; n++) { n 497 drivers/char/console.c if(!(n % TAB_SIZE)) { n 498 drivers/char/console.c vc->tty->tab_stop[n] = 1; n 500 drivers/char/console.c vc->tty->tab_stop[n] = 0; n 518 drivers/char/console.c int n; n 683 drivers/char/console.c for(n = 0; n < MAX_TAB_COLS; n++) n 684 drivers/char/console.c vc->tty->tab_stop[n] = 0; n 939 drivers/char/console.c int col, n; n 950 drivers/char/console.c for(n = 0; n < cb->end_off; n++) { n 951 drivers/char/console.c if(n >= cb->start_off) { n 952 drivers/char/console.c ch = cb->data[n]; n 997 drivers/char/console.c int n; n 1008 drivers/char/console.c for(n = 1; n <= NR_VCONSOLES; n++) { n 1009 drivers/char/console.c if(!register_tty(MKDEV(VCONSOLES_MAJOR, n))) { n 1010 drivers/char/console.c tty = get_tty(MKDEV(VCONSOLES_MAJOR, n)); n 1011 drivers/char/console.c tty->driver_data = (void *)&vc[n]; n 1018 drivers/char/console.c vc[n].tty = tty; n 1020 drivers/char/console.c vc[n].screen = (short int *)kmalloc(); n 1023 drivers/char/console.c vc[n].screen = vc_screen[n]; n 1025 drivers/char/console.c vc[n].vidmem = NULL; n 1026 drivers/char/console.c memset_w(vc[n].screen, BLANK_MEM, SCREEN_SIZE); n 1047 drivers/char/console.c for(n = 0; n <= NR_VCONSOLES; n++) { n 1048 drivers/char/console.c SET_MINOR(tty_device.minors, n); n 223 drivers/char/keyboard.c int n; n 225 drivers/char/keyboard.c for(n = 0; n < 1000; n++) { n 233 drivers/char/keyboard.c int n; n 235 drivers/char/keyboard.c for(n = 0; n < 500000; n++) { n 258 drivers/char/keyboard.c int n, value; n 260 drivers/char/keyboard.c for(n = 0; n < 500000; n++) { n 273 drivers/char/keyboard.c int n; n 276 drivers/char/keyboard.c for(n = 0; n < 1000; n++) { n 437 drivers/char/keyboard.c int n; n 679 drivers/char/keyboard.c for(n = 0; n < NR_DIACR; n++) { n 680 drivers/char/keyboard.c if(diacr[n].letter == c) { n 681 drivers/char/keyboard.c c = diacr[n].code; n 716 drivers/char/keyboard.c int n; n 734 drivers/char/keyboard.c for(n = 0; n < NR_VCONSOLES; n++, tty++) { n 76 drivers/char/lp.c int n; n 78 drivers/char/lp.c for(n = 0; n < 10000; n++) { n 85 drivers/char/lp.c int n; n 87 drivers/char/lp.c for(n = 0; n < LP_RDY_RETR; n++) { n 93 drivers/char/lp.c if(n == LP_RDY_RETR) { n 167 drivers/char/lp.c unsigned int n; n 177 drivers/char/lp.c for(n = 0; n < count; n++) { n 178 drivers/char/lp.c bytes_written = lp_write_data(minor, buffer[n]); n 190 drivers/char/lp.c int n; n 193 drivers/char/lp.c for(n = 0; n < LP_MINORS; n++) { n 194 drivers/char/lp.c if(!lp_probe(n)) { n 195 drivers/char/lp.c ctrl = inport_b(lp_table[n].ctrl); n 201 drivers/char/lp.c outport_b(lp_table[n].ctrl, ctrl); n 202 drivers/char/lp.c lp_table[n].flags |= LP_CTRL_SEL; n 203 drivers/char/lp.c printk("lp%d 0x%04X-0x%04X - \n", n, lp_table[n].data, lp_table[n].data + 2); n 204 drivers/char/lp.c SET_MINOR(lp_device.minors, n); n 208 drivers/char/lp.c for(n = 0; n < LP_MINORS; n++) { n 209 drivers/char/lp.c if(lp_table[n].flags & LP_CTRL_SEL) { n 431 drivers/char/memdev.c int n; n 433 drivers/char/memdev.c for(n = 0; n < count; n++) { n 206 drivers/char/serial.c unsigned short int col, n, count; n 214 drivers/char/serial.c for(n = 0; n < cb->end_off; n++) { n 215 drivers/char/serial.c if(n >= cb->start_off) { n 216 drivers/char/serial.c ch = cb->data[n]; n 506 drivers/char/serial.c int n, n2, type, found; n 510 drivers/char/serial.c for(n = 0, found = 0; n < SERIAL_MINORS; n++) { n 511 drivers/char/serial.c s = &serial_table[n]; n 513 drivers/char/serial.c printk("ttyS%d 0x%04X-0x%04X %d type=%s%s\n", n, s->addr, s->addr + 7, s->irq, serial_chip[type], s->flags & UART_HAS_FIFO ? " FIFO=yes" : ""); n 515 drivers/char/serial.c SET_MINOR(serial_device.minors, (1 << SERIAL_MSF) + n); n 523 drivers/char/serial.c if(!register_tty(MKDEV(SERIAL_MAJOR, (1 << SERIAL_MSF) + n))) { n 524 drivers/char/serial.c tty = get_tty(MKDEV(SERIAL_MAJOR, (1 << SERIAL_MSF) + n)); n 548 drivers/char/serial.c printk("WARNING: %s(): unable to register ttyS%d.\n", __FUNCTION__, n); n 38 drivers/char/tty.c int n; n 45 drivers/char/tty.c for(n = 0; n < NCC; n++) { n 46 drivers/char/tty.c termio->c_cc[n] = termios->c_cc[n]; n 52 drivers/char/tty.c int n; n 59 drivers/char/tty.c for(n = 0; n < NCC; n++) { n 60 drivers/char/tty.c termios->c_cc[n] = termio->c_cc[n]; n 184 drivers/char/tty.c int n; n 186 drivers/char/tty.c for(n = 0; n < NR_TTYS; n++) { n 187 drivers/char/tty.c if(tty_table[n].dev == dev) { n 191 drivers/char/tty.c if(!tty_table[n].dev) { n 192 drivers/char/tty.c tty_table[n].dev = dev; n 193 drivers/char/tty.c tty_table[n].count = 0; n 203 drivers/char/tty.c int n; n 227 drivers/char/tty.c for(n = 0; n < NR_TTYS; n++) { n 228 drivers/char/tty.c if(tty_table[n].dev == dev) { n 229 drivers/char/tty.c return &tty_table[n]; n 286 drivers/char/tty.c int n; n 355 drivers/char/tty.c for(n = 0; n < cb->end_off; n++) { n 356 drivers/char/tty.c if(n >= cb->start_off) { n 357 drivers/char/tty.c out_char(tty, cb->data[n]); n 497 drivers/char/tty.c int n; n 513 drivers/char/tty.c n = min = 0; n 516 drivers/char/tty.c n = 0; n 517 drivers/char/tty.c while(n < count) { n 519 drivers/char/tty.c buffer[n++] = ch; n 524 drivers/char/tty.c if(n) { n 539 drivers/char/tty.c while(n < count) { n 541 drivers/char/tty.c buffer[n++] = ch; n 569 drivers/char/tty.c while(n < count) { n 571 drivers/char/tty.c buffer[n++] = ch; n 579 drivers/char/tty.c if(n < MIN(tty->termios.c_cc[VMIN], count)) { n 581 drivers/char/tty.c buffer[n++] = ch; n 583 drivers/char/tty.c if(n >= MIN(tty->termios.c_cc[VMIN], count)) { n 592 drivers/char/tty.c n = -EAGAIN; n 596 drivers/char/tty.c n = -EINTR; n 608 drivers/char/tty.c if(n < count) { n 610 drivers/char/tty.c buffer[n++] = ch; n 624 drivers/char/tty.c n = -EAGAIN; n 628 drivers/char/tty.c n = -EINTR; n 633 drivers/char/tty.c if(n) { n 636 drivers/char/tty.c return n; n 643 drivers/char/tty.c int n; n 663 drivers/char/tty.c n = 0; n 668 drivers/char/tty.c while(count && n < count) { n 669 drivers/char/tty.c ch = *(buffer + n); n 674 drivers/char/tty.c n++; n 677 drivers/char/tty.c if(n == count) { n 681 drivers/char/tty.c n = -EAGAIN; n 686 drivers/char/tty.c n = -EINTR; n 695 drivers/char/tty.c if(n) { n 698 drivers/char/tty.c return n; n 249 drivers/char/tty_queue.c int n; n 256 drivers/char/tty_queue.c n = CB_POOL_SIZE; n 257 drivers/char/tty_queue.c while(n--) { n 258 drivers/char/tty_queue.c cb = &cblock_pool[n]; n 23 drivers/char/vt.c int n, errno; n 120 drivers/char/vt.c for(n = 1; n < NR_VCONSOLES + 1; n++) { n 121 drivers/char/vt.c tty = get_tty(MKDEV(VCONSOLES_MAJOR, n)); n 126 drivers/char/vt.c *val = (n < NR_VCONSOLES + 1 ? n : -1); n 164 drivers/char/vt.c for(n = 1; n < NR_VCONSOLES + 1; n++) { n 165 drivers/char/vt.c tty = get_tty(MKDEV(VCONSOLES_MAJOR, n)); n 167 drivers/char/vt.c vt_stat->v_state |= (1 << n); n 101 drivers/video/fbcon.c int n, b, offset; n 110 drivers/video/fbcon.c for(n = 0; n < video.fb_char_height; n++) { n 111 drivers/video/fbcon.c if(*(ch + n) == 0) { n 125 drivers/video/fbcon.c if(*(ch + n) & (1 << b)) { n 185 drivers/video/fbcon.c int n, soffset; n 193 drivers/video/fbcon.c n = vc->x; n 197 drivers/video/fbcon.c while(n < vc->columns) { n 200 drivers/video/fbcon.c draw_glyph(vidmem, n, vc->y, last_ch, vc->color_attr >> 8); n 206 drivers/video/fbcon.c n++; n 212 drivers/video/fbcon.c int n, soffset; n 220 drivers/video/fbcon.c n = vc->x; n 222 drivers/video/fbcon.c while(n < vc->columns) { n 230 drivers/video/fbcon.c draw_glyph(vidmem, n, vc->y, ch, vc->color_attr >> 8); n 234 drivers/video/fbcon.c n++; n 283 drivers/video/fbcon.c int n, n2, lines, columns, x, y; n 305 drivers/video/fbcon.c for(n = 0; n < lines; n++) { n 307 drivers/video/fbcon.c draw_glyph(vidmem, n2, y + n, ch, color >> 8); n 28 drivers/video/fonts.c int n; n 30 drivers/video/fonts.c for(n = 0; n < NR_FONTS; n++) { n 31 drivers/video/fonts.c if(fbcon_fonts[n]->height == height) { n 32 drivers/video/fonts.c return fbcon_fonts[n]; n 57 drivers/video/vgacon.c int n, offset; n 63 drivers/video/vgacon.c n = vc->x; n 66 drivers/video/vgacon.c while(n++ < vc->columns) { n 180 drivers/video/vgacon.c int n, offset, count; n 203 drivers/video/vgacon.c for(n = vc->lines - 1; n > top; n--) { n 204 drivers/video/vgacon.c memcpy_w(screen + (vc->columns * n), screen + (vc->columns * (n - 1)), count); n 206 drivers/video/vgacon.c memcpy_w(vidmem + (vc->columns * n), screen + (vc->columns * (n - 1)), count); n 384 fs/buffer.c unsigned int n; n 390 fs/buffer.c for(n = 0; n < NR_BUFFERS; n++) { n 469 fs/buffer.c unsigned int n; n 474 fs/buffer.c for(n = 0; n < NR_BUFFERS; n++) { n 475 fs/buffer.c buf = &buffer_table[n]; n 108 fs/devices.c int n, minors; n 132 fs/devices.c for(n = 0, minors = 0; n < 8; n++) { n 133 fs/devices.c minors += new_d->minors[n]; n 80 fs/elf.c unsigned int n, addr; n 84 fs/elf.c for(n = 0; n < ARG_MAX; n++) { n 85 fs/elf.c if(barg->page[n]) { n 86 fs/elf.c addr = KERNEL_BASE_ADDR - ((ARG_MAX - n) * PAGE_SIZE); n 87 fs/elf.c memcpy_b((void *)addr, (void *)barg->page[n], PAGE_SIZE); n 105 fs/elf.c for(n = 0; n < barg->argc; n++) { n 109 fs/elf.c printk("at 0x%08x -> str_ptr(%d) = 0x%08x (+ %d)\n", sp, n, str_ptr, strlen(str) + 1); n 125 fs/elf.c for(n = 0; n < barg->envc; n++) { n 129 fs/elf.c printk("at 0x%08x -> str_ptr(%d) = 0x%08x (+ %d)\n", sp, n, str_ptr, strlen(str) + 1); n 291 fs/elf.c for(n = 0; n < barg->argc; n++) { n 292 fs/elf.c printk("at 0x%08x -> argv[%d] = '%s'\n", current->argv[n], n, current->argv[n]); n 294 fs/elf.c for(n = 0; n < barg->envc; n++) { n 295 fs/elf.c printk("at 0x%08x -> envp[%d] = '%s'\n", current->envp[n], n, current->envp[n]); n 302 fs/elf.c int n, errno; n 338 fs/elf.c for(n = 0; n < elf32_h->e_phnum; n++) { n 339 fs/elf.c elf32_ph = (struct elf32_phdr *)(data + elf32_h->e_phoff + (sizeof(struct elf32_phdr) * n)); n 403 fs/elf.c int n, errno; n 432 fs/elf.c for(n = 0; n < elf32_h->e_phnum; n++) { n 433 fs/elf.c elf32_ph = (struct elf32_phdr *)(data + elf32_h->e_phoff + (sizeof(struct elf32_phdr) * n)); n 490 fs/elf.c for(n = 0; n < elf32_h->e_phnum; n++) { n 491 fs/elf.c elf32_ph = (struct elf32_phdr *)(data + elf32_h->e_phoff + (sizeof(struct elf32_phdr) * n)); n 23 fs/ext2/bitmaps.c int n, n2; n 31 fs/ext2/bitmaps.c for(n = 0; n < blksize; n++) { n 32 fs/ext2/bitmaps.c c = (unsigned char)buf->data[n]; n 36 fs/ext2/bitmaps.c return n2 + (n * 8) + 1; n 32 fs/ext2/inode.c int n; n 41 fs/ext2/inode.c for(n = offset; n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 42 fs/ext2/inode.c if(indblock[n]) { n 43 fs/ext2/inode.c ext2_bfree(i->sb, indblock[n]); n 44 fs/ext2/inode.c indblock[n] = 0; n 386 fs/ext2/inode.c int blksize, n; n 396 fs/ext2/inode.c for(n = block; n < EXT2_NDIR_BLOCKS; n++) { n 397 fs/ext2/inode.c if(i->u.ext2.i_data[n]) { n 398 fs/ext2/inode.c ext2_bfree(i->sb, i->u.ext2.i_data[n]); n 399 fs/ext2/inode.c i->u.ext2.i_data[n] = 0; n 432 fs/ext2/inode.c for(n = block / BLOCKS_PER_IND_BLOCK(i->sb); n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 433 fs/ext2/inode.c if(indblock[n]) { n 434 fs/ext2/inode.c free_indblock(i, indblock[n], dblock); n 436 fs/ext2/inode.c ext2_bfree(i->sb, indblock[n]); n 294 fs/ext2/namei.c int n; n 308 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 309 fs/ext2/namei.c if((c = name[n])) { n 310 fs/ext2/namei.c d->name[n] = c; n 377 fs/ext2/namei.c int n; n 415 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 416 fs/ext2/namei.c if((c = oldname[n])) { n 417 fs/ext2/namei.c buf2->data[n] = c; n 422 fs/ext2/namei.c buf2->data[n] = 0; n 428 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 429 fs/ext2/namei.c if((c = oldname[n])) { n 430 fs/ext2/namei.c data[n] = c; n 435 fs/ext2/namei.c data[n] = 0; n 438 fs/ext2/namei.c i->i_size = n; n 444 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 445 fs/ext2/namei.c if((c = name[n])) { n 446 fs/ext2/namei.c d->name[n] = c; n 470 fs/ext2/namei.c int n; n 511 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 512 fs/ext2/namei.c if((c = name[n])) { n 514 fs/ext2/namei.c d->name[n] = c; n 561 fs/ext2/namei.c int n; n 580 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 581 fs/ext2/namei.c if((c = name[n])) { n 582 fs/ext2/namei.c d->name[n] = c; n 634 fs/ext2/namei.c int n; n 657 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 658 fs/ext2/namei.c if((c = name[n])) { n 659 fs/ext2/namei.c d->name[n] = c; n 694 fs/ext2/namei.c int n, errno; n 754 fs/ext2/namei.c for(n = 0; n < NAME_MAX; n++) { n 755 fs/ext2/namei.c if((c = newpath[n])) { n 756 fs/ext2/namei.c d_new->name[n] = c; n 21 fs/fd.c unsigned int n; n 25 fs/fd.c for(n = 1; n < NR_OPENS; n++) { n 26 fs/fd.c if(fd_table[n].count == 0) { n 27 fs/fd.c memset_b(&fd_table[n], NULL, sizeof(struct fd)); n 28 fs/fd.c fd_table[n].inode = i; n 29 fs/fd.c fd_table[n].count = 1; n 31 fs/fd.c return n; n 20 fs/filesystems.c int n; n 23 fs/filesystems.c for(n = 0; n < NR_FILESYSTEMS; n++) { n 24 fs/filesystems.c if(filesystems_table[n].name) { n 25 fs/filesystems.c if(strcmp(filesystems_table[n].name, name) == 0) { n 30 fs/filesystems.c if(!filesystems_table[n].name) { n 31 fs/filesystems.c filesystems_table[n].name = name; n 32 fs/filesystems.c filesystems_table[n].fsop = fsop; n 35 fs/filesystems.c return kern_mount(dev, &filesystems_table[n]); n 46 fs/filesystems.c int n; n 51 fs/filesystems.c for(n = 0; n < NR_FILESYSTEMS; n++) { n 52 fs/filesystems.c if(!filesystems_table[n].name) { n 55 fs/filesystems.c if(strcmp(filesystems_table[n].name, name) == 0) { n 56 fs/filesystems.c return &filesystems_table[n]; n 50 fs/inode.c int n; n 52 fs/inode.c n = INODE_HASH(i->dev, i->inode); n 53 fs/inode.c h = &inode_hash_table[n]; n 69 fs/inode.c int n; n 75 fs/inode.c n = INODE_HASH(i->dev, i->inode); n 76 fs/inode.c h = &inode_hash_table[n]; n 86 fs/inode.c if(h == &inode_hash_table[n]) { n 202 fs/inode.c int n; n 204 fs/inode.c n = INODE_HASH(dev, inode); n 205 fs/inode.c i = inode_hash_table[n]; n 332 fs/inode.c unsigned int n; n 335 fs/inode.c for(n = 0; n < NR_INODES; n++, i = &inode_table[n]) { n 390 fs/inode.c int n; n 395 fs/inode.c for(n = 0; n < NR_INODES; n++) { n 411 fs/inode.c unsigned int n; n 417 fs/inode.c for(n = 0; n < NR_INODES; n++) { n 432 fs/inode.c unsigned int n; n 436 fs/inode.c for(n = 0; n < NR_INODES; n++) { n 437 fs/inode.c i = &inode_table[n]; n 24 fs/iso9660/inode.c int n, offset, pt_len, pt_blk; n 53 fs/iso9660/inode.c offset = n = 0; n 58 fs/iso9660/inode.c sbi->pathtable[n] = NULL; n 61 fs/iso9660/inode.c sbi->pathtable[++n] = ptr; n 64 fs/iso9660/inode.c sbi->paths = n; n 71 fs/iso9660/inode.c int n; n 75 fs/iso9660/inode.c for(n = 0; n < sb->u.iso9660.paths; n++) { n 76 fs/iso9660/inode.c ptr = (struct iso9660_pathtable_record *)sb->u.iso9660.pathtable[n]; n 24 fs/iso9660/rrip.c int n, nm_len, rootflag; n 81 fs/iso9660/rrip.c for(n = 0; n < rrip->u.er.len_id; n++) { n 82 fs/iso9660/rrip.c printk("%c", rrip->u.er.data[n]); n 130 fs/iso9660/rrip.c n = 0; n 132 fs/iso9660/rrip.c i->i_ctime = isodate(rrip->u.tf.times[n++].time); n 135 fs/iso9660/rrip.c i->i_mtime = isodate(rrip->u.tf.times[n++].time); n 138 fs/iso9660/rrip.c i->i_atime = isodate(rrip->u.tf.times[n++].time); n 141 fs/iso9660/rrip.c i->i_ctime = isodate(rrip->u.tf.times[n++].time); n 118 fs/iso9660/super.c int n; n 123 fs/iso9660/super.c for(n = 0; n < len; n++) { n 124 fs/iso9660/super.c if((len - n) == 2) { n 125 fs/iso9660/super.c if(p[n] == ';' && p[n + 1] == '1') { n 126 fs/iso9660/super.c filename[n] = NULL; n 127 fs/iso9660/super.c if(p[n - 1] == '.') { n 128 fs/iso9660/super.c filename[n - 1] = NULL; n 158 fs/iso9660/super.c int n; n 163 fs/iso9660/super.c for(n = 0; n < ISO9660_MAX_VD; n++) { n 164 fs/iso9660/super.c if(!(buf = bread(dev, ISO9660_SUPERBLOCK + n, BLKSIZE_2K))) { n 21 fs/locks.c int n; n 26 fs/locks.c for(n = 0; n < NR_FLOCKS; n++) { n 27 fs/locks.c ff = &flock_file_table[n]; n 47 fs/locks.c int n; n 53 fs/locks.c for(n = 0; n < NR_FLOCKS; n++) { n 54 fs/locks.c ff = &flock_file_table[n]; n 69 fs/locks.c int n; n 76 fs/locks.c for(n = 0; n < NR_FLOCKS; n++) { n 77 fs/locks.c ff = &flock_file_table[n]; n 120 fs/locks.c int n; n 124 fs/locks.c for(n = 0; n < NR_FLOCKS; n++) { n 125 fs/locks.c ff = &flock_file_table[n]; n 140 fs/locks.c int n; n 154 fs/locks.c for(n = 0; n < NR_FLOCKS; n++) { n 155 fs/locks.c ff = &flock_file_table[n]; n 24 fs/minix/bitmaps.c int n, n2, last, bits, count, mapb; n 35 fs/minix/bitmaps.c for(n = 0; n < last; n++) { n 36 fs/minix/bitmaps.c c = (unsigned char)buf->data[n]; n 37 fs/minix/bitmaps.c bits = n < last ? 8 : num & 8; n 46 fs/minix/bitmaps.c return n2 + ((n * 8) + (mapb * blksize * 8)); n 255 fs/minix/namei.c int n; n 267 fs/minix/namei.c for(n = 0; n < i_old->sb->u.minix.namelen; n++) { n 268 fs/minix/namei.c d->name[n] = name[n]; n 269 fs/minix/namei.c if(!name[n]) { n 273 fs/minix/namei.c for(; n < i_old->sb->u.minix.namelen; n++) { n 274 fs/minix/namei.c d->name[n] = 0; n 329 fs/minix/namei.c int n, block; n 379 fs/minix/namei.c for(n = 0; n < i->sb->u.minix.namelen; n++) { n 380 fs/minix/namei.c d->name[n] = name[n]; n 381 fs/minix/namei.c if(!name[n]) { n 385 fs/minix/namei.c for(; n < i->sb->u.minix.namelen; n++) { n 386 fs/minix/namei.c d->name[n] = 0; n 389 fs/minix/namei.c for(n = 0; n < NAME_MAX; n++) { n 390 fs/minix/namei.c if((c = oldname[n])) { n 391 fs/minix/namei.c buf_new->data[n] = c; n 396 fs/minix/namei.c buf_new->data[n] = 0; n 397 fs/minix/namei.c i->i_size = n; n 416 fs/minix/namei.c int n, block; n 464 fs/minix/namei.c for(n = 0; n < i->sb->u.minix.namelen; n++) { n 465 fs/minix/namei.c d->name[n] = name[n]; n 466 fs/minix/namei.c if(!name[n] || name[n] == '/') { n 470 fs/minix/namei.c for(; n < i->sb->u.minix.namelen; n++) { n 471 fs/minix/namei.c d->name[n] = 0; n 504 fs/minix/namei.c int n; n 521 fs/minix/namei.c for(n = 0; n < i->sb->u.minix.namelen; n++) { n 522 fs/minix/namei.c d->name[n] = name[n]; n 523 fs/minix/namei.c if(!name[n]) { n 527 fs/minix/namei.c for(; n < i->sb->u.minix.namelen; n++) { n 528 fs/minix/namei.c d->name[n] = 0; n 573 fs/minix/namei.c int n; n 594 fs/minix/namei.c for(n = 0; n < i->sb->u.minix.namelen; n++) { n 595 fs/minix/namei.c d->name[n] = name[n]; n 596 fs/minix/namei.c if(!name[n]) { n 600 fs/minix/namei.c for(; n < i->sb->u.minix.namelen; n++) { n 601 fs/minix/namei.c d->name[n] = 0; n 32 fs/minix/v1_inode.c int n; n 41 fs/minix/v1_inode.c for(n = offset; n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 42 fs/minix/v1_inode.c if(zone[n]) { n 43 fs/minix/v1_inode.c minix_bfree(i->sb, zone[n]); n 44 fs/minix/v1_inode.c zone[n] = 0; n 340 fs/minix/v1_inode.c int n; n 352 fs/minix/v1_inode.c for(n = block; n < MINIX_NDIR_BLOCKS; n++) { n 353 fs/minix/v1_inode.c if(i->u.minix.u.i1_zone[n]) { n 354 fs/minix/v1_inode.c minix_bfree(i->sb, i->u.minix.u.i1_zone[n]); n 355 fs/minix/v1_inode.c i->u.minix.u.i1_zone[n] = 0; n 385 fs/minix/v1_inode.c for(n = block / BLOCKS_PER_IND_BLOCK(i->sb); n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 386 fs/minix/v1_inode.c if(zone[n]) { n 387 fs/minix/v1_inode.c free_zone(i, zone[n], dblock); n 389 fs/minix/v1_inode.c minix_bfree(i->sb, zone[n]); n 33 fs/minix/v2_inode.c int n; n 42 fs/minix/v2_inode.c for(n = offset; n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 43 fs/minix/v2_inode.c if(zone[n]) { n 44 fs/minix/v2_inode.c minix_bfree(i->sb, zone[n]); n 45 fs/minix/v2_inode.c zone[n] = 0; n 403 fs/minix/v2_inode.c int n; n 415 fs/minix/v2_inode.c for(n = block; n < MINIX_NDIR_BLOCKS; n++) { n 416 fs/minix/v2_inode.c if(i->u.minix.u.i2_zone[n]) { n 417 fs/minix/v2_inode.c minix_bfree(i->sb, i->u.minix.u.i2_zone[n]); n 418 fs/minix/v2_inode.c i->u.minix.u.i2_zone[n] = 0; n 448 fs/minix/v2_inode.c for(n = block / BLOCKS_PER_IND_BLOCK(i->sb); n < BLOCKS_PER_IND_BLOCK(i->sb); n++) { n 449 fs/minix/v2_inode.c if(zone[n]) { n 450 fs/minix/v2_inode.c free_zone(i, zone[n], dblock); n 452 fs/minix/v2_inode.c minix_bfree(i->sb, zone[n]); n 53 fs/pipefs/pipe.c __size_t n, limit; n 69 fs/pipefs/pipe.c n = MIN(limit, count); n 70 fs/pipefs/pipe.c if(i->i_size && n) { n 72 fs/pipefs/pipe.c memcpy_b(buffer + bytes_read, data + i->u.pipefs.i_readoff, n); n 73 fs/pipefs/pipe.c bytes_read += n; n 74 fs/pipefs/pipe.c i->u.pipefs.i_readoff += n; n 75 fs/pipefs/pipe.c i->i_size -= n; n 112 fs/pipefs/pipe.c __size_t n; n 136 fs/pipefs/pipe.c n = MIN((count - bytes_written), (limit - i->u.pipefs.i_writeoff)); n 144 fs/pipefs/pipe.c if(n && n <= PIPE_BUF) { n 146 fs/pipefs/pipe.c memcpy_b(data + i->u.pipefs.i_writeoff, buffer + bytes_written, n); n 147 fs/pipefs/pipe.c bytes_written += n; n 148 fs/pipefs/pipe.c i->u.pipefs.i_writeoff += n; n 149 fs/pipefs/pipe.c i->i_size += n; n 101 fs/procfs/data.c int n, size; n 105 fs/procfs/data.c for(n = 0; n < NR_CHRDEV; n++) { n 106 fs/procfs/data.c d = chr_device_table[n]; n 114 fs/procfs/data.c for(n = 0; n < NR_BLKDEV; n++) { n 115 fs/procfs/data.c d = blk_device_table[n]; n 126 fs/procfs/data.c int n, size; n 129 fs/procfs/data.c for(n = 0; n < DMA_CHANNELS; n++) { n 130 fs/procfs/data.c if(dma_resources[n]) { n 131 fs/procfs/data.c size += sprintk(buffer + size, "%2d: %s\n", n, dma_resources[n]); n 139 fs/procfs/data.c int n, size; n 143 fs/procfs/data.c for(n = 0; n < NR_FILESYSTEMS; n++) { n 144 fs/procfs/data.c if(filesystems_table[n].name) { n 146 fs/procfs/data.c if(filesystems_table[n].fsop->flags != FSOP_REQUIRES_DEV) { n 149 fs/procfs/data.c size += sprintk(buffer + size, "%s %s\n", nodev ? "nodev" : " ", filesystems_table[n].name); n 158 fs/procfs/data.c int n, size; n 161 fs/procfs/data.c for(n = 0; n < NR_IRQS; n++) { n 162 fs/procfs/data.c if((irq = irq_table[n])) { n 163 fs/procfs/data.c size += sprintk(buffer + size, "%3d: %9u %s", n, irq->ticks, irq->name); n 200 fs/procfs/data.c int n, size; n 205 fs/procfs/data.c for(n = 0; n < NR_FLOCKS; n++) { n 206 fs/procfs/data.c ff = &flock_file_table[n]; n 208 fs/procfs/data.c size += sprintk(buffer + size, "%d: FLOCK ADVISORY %s ", n + 1, ff->type & LOCK_SH ? "READ " : "WRITE"); n 219 fs/procfs/data.c int n, size; n 222 fs/procfs/data.c for(n = 0; n < kstat.physical_pages; n++) { n 223 fs/procfs/data.c pg = &page_table[n]; n 250 fs/procfs/data.c int n, size; n 254 fs/procfs/data.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 255 fs/procfs/data.c if(mount_table[n].used) { n 256 fs/procfs/data.c if(mount_table[n].fs->fsop->flags != FSOP_KERN_MOUNT) { n 258 fs/procfs/data.c if(mount_table[n].sb.flags & MS_RDONLY) { n 261 fs/procfs/data.c size += sprintk(buffer + size, "%s %s %s %s 0 0\n", mount_table[n].devname, mount_table[n].dirname, mount_table[n].fs->name, flag); n 270 fs/procfs/data.c int n, ctrl, drv, size; n 291 fs/procfs/data.c for(n = 0; n < NR_PARTITIONS; n++) { n 292 fs/procfs/data.c if(drive->part_table[n].type) { n 293 fs/procfs/data.c blocks = drive->part_table[n].nr_sects / 2; n 294 fs/procfs/data.c size += sprintk(buffer + size, "%4d %4d %9u %s%d\n", major, (n + 1) << minor, blocks, drive->dev_name, n + 1); n 339 fs/procfs/data.c int n, size; n 350 fs/procfs/data.c for(n = 0; n < NR_IRQS; n++) { n 351 fs/procfs/data.c irq = irq_table[n]; n 391 fs/procfs/data.c int n, nr; n 394 fs/procfs/data.c for(n = 1; n < NR_OPENS; n++) { n 395 fs/procfs/data.c if(fd_table[n].count != 0) { n 439 fs/procfs/data.c int n, size; n 447 fs/procfs/data.c for(n = 0; n < p->argc && (p->argv + n); n++) { n 448 fs/procfs/data.c argv = p->argv + n; n 490 fs/procfs/data.c int n, size; n 498 fs/procfs/data.c for(n = 0; n < p->envc && (p->envp + n); n++) { n 499 fs/procfs/data.c envp = p->envp + n; n 541 fs/procfs/data.c unsigned int n; n 556 fs/procfs/data.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 599 fs/procfs/data.c int n, size; n 603 fs/procfs/data.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 604 fs/procfs/data.c if(mount_table[n].used) { n 605 fs/procfs/data.c if(mount_table[n].fs->fsop->flags != FSOP_KERN_MOUNT) { n 607 fs/procfs/data.c if(mount_table[n].sb.flags & MS_RDONLY) { n 610 fs/procfs/data.c devname = mount_table[n].devname; n 611 fs/procfs/data.c if(!strcmp(mount_table[n].devname, "/dev/root")) { n 614 fs/procfs/data.c size += sprintk(buffer + size, "%d 0 %d:%d %s %s %s - %s %s %s\n", n, MAJOR(mount_table[n].dev), MINOR(mount_table[n].dev), "/", mount_table[n].dirname, flag, mount_table[n].fs->name, devname, flag); n 643 fs/procfs/data.c int n, size, vma_start, vma_end; n 661 fs/procfs/data.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 732 fs/procfs/data.c int n, size; n 743 fs/procfs/data.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 773 fs/procfs/data.c int n, size; n 786 fs/procfs/data.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 63 fs/procfs/dir.c int n; n 78 fs/procfs/dir.c n = p->pid; n 79 fs/procfs/dir.c while(n / 10) { n 80 fs/procfs/dir.c n /= 10; n 95 fs/procfs/tree.c int n, lev; n 106 fs/procfs/tree.c for(n = 0; n < PROC_ARRAY_ENTRIES && d->inode; n++) { n 17 fs/script.c int n, noargs; n 25 fs/script.c for(n = 2; n < NAME_MAX; n++) { n 26 fs/script.c if(data[n] != ' ' && data[n] != '\t') { n 34 fs/script.c while(n < NAME_MAX) { n 35 fs/script.c if(data[n] == '\n' || data[n] == NULL) { n 39 fs/script.c if(data[n] == ' ' || data[n] == '\t') { n 42 fs/script.c *p = data[n]; n 43 fs/script.c n++; n 56 fs/script.c while(n < NAME_MAX) { n 57 fs/script.c if(data[n] != ' ' && data[n] != '\t') { n 60 fs/script.c n++; n 62 fs/script.c while(n < NAME_MAX) { n 63 fs/script.c if(data[n] == '\n' || data[n] == NULL) { n 66 fs/script.c *p = data[n]; n 67 fs/script.c n++; n 57 fs/super.c int n; n 64 fs/super.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 65 fs/super.c if(mount_table[n].dev == dev) { n 72 fs/super.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 73 fs/super.c if(!mount_table[n].used) { n 79 fs/super.c mount_table[n].dev = dev; n 80 fs/super.c mount_table[n].used = 1; n 82 fs/super.c return &mount_table[n]; n 98 fs/super.c int n; n 100 fs/super.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 101 fs/super.c if(mount_table[n].used) { n 103 fs/super.c if(mount_table[n].sb.root == i_target) { n 104 fs/super.c return &mount_table[n]; n 108 fs/super.c if(mount_table[n].dev == i_target->rdev) { n 109 fs/super.c return &mount_table[n]; n 119 fs/super.c int n; n 121 fs/super.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 122 fs/super.c if(mount_table[n].used && mount_table[n].dev == dev) { n 123 fs/super.c return &mount_table[n].sb; n 132 fs/super.c int n, errno; n 135 fs/super.c for(n = 0; n < NR_MOUNT_POINTS; n++) { n 136 fs/super.c if(mount_table[n].used && (!dev || mount_table[n].dev == dev)) { n 137 fs/super.c sb = &mount_table[n].sb; n 44 include/fiwix/sched.h #define CALC_LOAD(load,exp,n) \ n 46 include/fiwix/sched.h load += n*(FIXED_1-exp); \ n 152 kernel/cpu.c int n, maxcpuids; n 156 kernel/cpu.c for(n = 0; n < maxcpuids; n++) { n 186 kernel/cpu.c int n, size; n 190 kernel/cpu.c for(n = 0, mask = 1; n < 32; n++, mask <<= 1) { n 192 kernel/cpu.c size += sprintk(buffer + offset + size, " %s", cpu_flags[n]); n 201 kernel/cpu.c unsigned int n; n 222 kernel/cpu.c for(n = 0; n < sizeof(intel) / sizeof(struct cpu_type); n++) { n 223 kernel/cpu.c if(intel[n].cpu == _cputype) { n 224 kernel/cpu.c cpu_table.model_name = !intel[n].name[(((int)_cpusignature >> 4) & 0xF)] ? NULL : intel[n].name[(((int)_cpusignature >> 4) & 0xF)]; n 42 kernel/idt.c int n; n 45 kernel/idt.c for(n = 0; n < NR_IDT_ENTRIES; n++) { n 46 kernel/idt.c if(n < 0x20) { n 47 kernel/idt.c set_idt_entry(n, (__off_t)except_handlers[n], SD_32TRAPGATE | SD_PRESENT); n 50 kernel/idt.c if(n < 0x30) { n 51 kernel/idt.c set_idt_entry(n, (__off_t)irq_handlers[n - 0x20], SD_32INTRGATE | SD_PRESENT); n 54 kernel/idt.c set_idt_entry(n, (__off_t)&unknown_irq, SD_32INTRGATE | SD_PRESENT); n 41 kernel/init.c int n; n 92 kernel/init.c for(n = 0; n < RLIM_NLIMITS; n++) { n 93 kernel/init.c init->rlim[n].rlim_cur = init->rlim[n].rlim_max = RLIM_INFINITY; n 118 kernel/main.c int n; n 122 kernel/main.c for(n = 0; n < NR_IRQS; n++) { n 123 kernel/main.c disable_irq(n); n 28 kernel/multiboot.c int n; n 31 kernel/multiboot.c for(n = 0; parm->value[n]; n++) { n 32 kernel/multiboot.c if(!strcmp(parm->value[n], value)) { n 33 kernel/multiboot.c _rootdev = parm->sysval[n]; n 61 kernel/multiboot.c for(n = 0; parm->value[n]; n++) { n 62 kernel/multiboot.c if(!strcmp(parm->value[n], value)) { n 70 kernel/multiboot.c for(n = 0; parm->value[n]; n++) { n 71 kernel/multiboot.c if(!strcmp(parm->value[n], value)) { n 72 kernel/multiboot.c if(parm->sysval[n]) { n 73 kernel/multiboot.c _syscondev = parm->sysval[n]; n 87 kernel/multiboot.c int n; n 94 kernel/multiboot.c for(n = 0; parm_table[n].name; n++) { n 95 kernel/multiboot.c if(!strncmp(arg, parm_table[n].name, strlen(parm_table[n].name))) { n 96 kernel/multiboot.c arg += strlen(parm_table[n].name); n 97 kernel/multiboot.c if(check_parm(&parm_table[n], arg)) { n 98 kernel/multiboot.c printk("WARNING: invalid value '%s' in the '%s' parameter.\n", arg, parm_table[n].name); n 159 kernel/multiboot.c unsigned short int n; n 165 kernel/multiboot.c for(n = 0; n < hdr->num; n++) { n 166 kernel/multiboot.c shdr = (Elf32_Shdr *)(hdr->addr + (n * hdr->size)); n 185 kernel/multiboot.c for(n = 0; n < mbi->mods_count; n++, mod++) { n 226 kernel/multiboot.c int n, len; n 233 kernel/multiboot.c for(n = 0; n < len; n++) { n 248 kernel/multiboot.c int n; n 252 kernel/multiboot.c for(n = 0; n < mbi.mods_count; n++, mod++) { n 314 kernel/process.c int n; n 316 kernel/process.c for(n = fd; n < OPEN_MAX && n < current->rlim[RLIMIT_NOFILE].rlim_cur; n++) { n 317 kernel/process.c if(current->fd[n] == 0) { n 318 kernel/process.c current->fd[n] = -1; n 319 kernel/process.c current->fd_flags[n] = 0; n 320 kernel/process.c return n; n 359 kernel/process.c int n; n 385 kernel/process.c for(n = 0; n < IO_BITMAP_SIZE + 1; n++) { n 386 kernel/process.c p->io_bitmap[n] = 0; /* FIXME: change it to 1 */ n 393 kernel/process.c int n; n 400 kernel/process.c n = (proc_table_size / sizeof(struct proc)) - 1; n 402 kernel/process.c p = &proc_table[n]; n 408 kernel/process.c } while(n--); n 33 kernel/syscalls.c short int n, len; n 67 kernel/syscalls.c for(n = 0; n < len; n++) { n 91 kernel/syscalls.c int n; n 104 kernel/syscalls.c for(n = 0; n < NGROUPS_MAX; n++) { n 105 kernel/syscalls.c if(current->groups[n] == -1) { n 108 kernel/syscalls.c if(current->groups[n] == i->i_gid) { n 23 kernel/syscalls/execve.c int n, errno; n 25 kernel/syscalls/execve.c for(n = 0; n < ARG_MAX; n++) { n 26 kernel/syscalls/execve.c barg->page[n] = 0; n 30 kernel/syscalls/execve.c for(n = 0; argv[n]; n++) { n 31 kernel/syscalls/execve.c if((errno = check_user_area(VERIFY_READ, argv[n], sizeof(char *)))) { n 34 kernel/syscalls/execve.c barg->argv_len += strlen(argv[n]) + 1; n 36 kernel/syscalls/execve.c barg->argc = n; n 38 kernel/syscalls/execve.c for(n = 0; envp[n]; n++) { n 39 kernel/syscalls/execve.c if((errno = check_user_area(VERIFY_READ, envp[n], sizeof(char *)))) { n 42 kernel/syscalls/execve.c barg->envp_len += strlen(envp[n]) + 1; n 44 kernel/syscalls/execve.c barg->envc = n; n 51 kernel/syscalls/execve.c int n; n 53 kernel/syscalls/execve.c for(n = 0; n < ARG_MAX; n++) { n 54 kernel/syscalls/execve.c if(barg->page[n]) { n 55 kernel/syscalls/execve.c kfree(barg->page[n]); n 62 kernel/syscalls/execve.c int n, p, offset; n 108 kernel/syscalls/execve.c for(n = p; n < ARG_MAX; n++) { n 109 kernel/syscalls/execve.c if(!barg->page[n]) { n 110 kernel/syscalls/execve.c if(!(barg->page[n] = kmalloc())) { n 174 kernel/syscalls/execve.c int n, p, offset; n 187 kernel/syscalls/execve.c for(n = p; n < ARG_MAX; n++) { n 188 kernel/syscalls/execve.c if(!(barg->page[n] = kmalloc())) { n 193 kernel/syscalls/execve.c for(n = 0; n < barg->argc; n++) { n 194 kernel/syscalls/execve.c str = argv[n]; n 212 kernel/syscalls/execve.c for(n = 0; n < barg->envc; n++) { n 213 kernel/syscalls/execve.c str = envp[n]; n 345 kernel/syscalls/execve.c int n, errno; n 358 kernel/syscalls/execve.c for(n = 0; n < OPEN_MAX; n++) { n 359 kernel/syscalls/execve.c if(current->fd[n] && (current->fd_flags[n] & FD_CLOEXEC)) { n 360 kernel/syscalls/execve.c sys_close(n); n 368 kernel/syscalls/execve.c for(n = 0; n < NSIG; n++) { n 369 kernel/syscalls/execve.c current->sigaction[n].sa_mask = 0; n 370 kernel/syscalls/execve.c current->sigaction[n].sa_flags = 0; n 371 kernel/syscalls/execve.c if(current->sigaction[n].sa_handler != SIG_IGN) { n 372 kernel/syscalls/execve.c current->sigaction[n].sa_handler = SIG_DFL; n 20 kernel/syscalls/exit.c int n; n 64 kernel/syscalls/exit.c for(n = 0; n < OPEN_MAX; n++) { n 65 kernel/syscalls/exit.c if(current->fd[n]) { n 66 kernel/syscalls/exit.c sys_close(n); n 92 kernel/syscalls/exit.c for(n = 0; n < NSIG; n++) { n 93 kernel/syscalls/exit.c current->sigaction[n].sa_mask = 0; n 94 kernel/syscalls/exit.c current->sigaction[n].sa_flags = 0; n 95 kernel/syscalls/exit.c current->sigaction[n].sa_handler = SIG_IGN; n 24 kernel/syscalls/fork.c unsigned int n; n 83 kernel/syscalls/fork.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 131 kernel/syscalls/fork.c for(n = 0; n < OPEN_MAX; n++) { n 132 kernel/syscalls/fork.c if(current->fd[n]) { n 133 kernel/syscalls/fork.c fd_table[current->fd[n]].count++; n 19 kernel/syscalls/getgroups.c int n, errno; n 31 kernel/syscalls/getgroups.c for(n = 0; n < NGROUPS_MAX; n++) { n 32 kernel/syscalls/getgroups.c if(current->groups[n] == -1) { n 36 kernel/syscalls/getgroups.c return n; n 42 kernel/syscalls/getgroups.c for(n = 0; n < NGROUPS_MAX; n++) { n 43 kernel/syscalls/getgroups.c if(current->groups[n] == -1) { n 47 kernel/syscalls/getgroups.c if(n > size) { n 50 kernel/syscalls/getgroups.c list[n] = (__gid_t)current->groups[n]; n 53 kernel/syscalls/getgroups.c return n; n 20 kernel/syscalls/select.c int n, bit; n 23 kernel/syscalls/select.c n = bit = 0; n 25 kernel/syscalls/select.c bit = n * __NFDBITS; n 26 kernel/syscalls/select.c set = rfds->fds_bits[n] | wfds->fds_bits[n] | efds->fds_bits[n]; n 34 kernel/syscalls/select.c n++; n 53 kernel/syscalls/select.c int n, count; n 58 kernel/syscalls/select.c for(n = 0; n < nfds; n++) { n 59 kernel/syscalls/select.c if(!current->fd[n]) { n 62 kernel/syscalls/select.c i = fd_table[current->fd[n]].inode; n 63 kernel/syscalls/select.c if(__FD_ISSET(n, rfds)) { n 65 kernel/syscalls/select.c __FD_SET(n, res_rfds); n 69 kernel/syscalls/select.c if(__FD_ISSET(n, wfds)) { n 71 kernel/syscalls/select.c __FD_SET(n, res_wfds); n 75 kernel/syscalls/select.c if(__FD_ISSET(n, efds)) { n 77 kernel/syscalls/select.c __FD_SET(n, res_efds); n 19 kernel/syscalls/setgroups.c int n, errno; n 34 kernel/syscalls/setgroups.c for(n = 0; n < NGROUPS_MAX; n++) { n 35 kernel/syscalls/setgroups.c current->groups[n] = -1; n 36 kernel/syscalls/setgroups.c if(n < size) { n 37 kernel/syscalls/setgroups.c current->groups[n] = list[n]; n 257 kernel/timer.c int n, total_days; n 262 kernel/timer.c for(n = UNIX_EPOCH; n < mt->mt_year; n++) { n 263 kernel/timer.c total_days += DAYS_PER_YEAR(n); n 265 kernel/timer.c for(n = 0; n < (mt->mt_month - 1); n++) { n 266 kernel/timer.c total_days += month[n]; n 267 kernel/timer.c if(n == 1) { n 428 kernel/timer.c int n; n 440 kernel/timer.c n = NR_CALLOUTS; n 441 kernel/timer.c while(n--) { n 442 kernel/timer.c c = &callout_pool[n]; n 268 kernel/traps.c unsigned int n; n 271 kernel/traps.c for(n = 0; n < symtab->sh_size / sizeof(Elf32_Sym); n++, sym++) { n 284 kernel/traps.c int n; n 291 kernel/traps.c for(n = 1; n <= 32; n++) { n 294 kernel/traps.c if(!(n % 8)) { n 301 kernel/traps.c for(n = 0; n < 256; n++) { n 17 lib/strings.c int n, n2; n 27 lib/strings.c for(n = 0, n2 = 0; n < len; n++) { n 32 lib/strings.c for(n = len - 1; n > 0; n--) { n 33 lib/strings.c if(buf[n] == NULL || buf[n] == ' ') { n 34 lib/strings.c buf[n] = NULL; n 58 lib/strings.c int strncmp(const char *str1, const char *str2, __ssize_t n) n 60 lib/strings.c while(n > 0) { n 66 lib/strings.c n--; n 138 lib/strings.c int n; n 140 lib/strings.c n = 0; n 142 lib/strings.c n++; n 145 lib/strings.c return n; n 195 lib/strings.c int n; n 197 lib/strings.c n = 0; n 202 lib/strings.c n = (n * 10) + (*str++ - '0'); n 204 lib/strings.c return n; n 27 mm/bios_map.c int n, retval; n 33 mm/bios_map.c for(n = 0; n < NR_BIOS_MM_ENT; n++, bmm++) { n 43 mm/bios_map.c for(n = 0; n < NR_BIOS_MM_ENT; n++, bmm++) { n 56 mm/bios_map.c int n; n 58 mm/bios_map.c for(n = 0; n < NR_BIOS_MM_ENT; n++) { n 59 mm/bios_map.c if(!bios_mem_map[n].type) { n 78 mm/bios_map.c bios_mem_map[n].from = from; n 79 mm/bios_map.c bios_mem_map[n].to = to; n 80 mm/bios_map.c bios_mem_map[n].type = to_type; n 88 mm/bios_map.c int n; n 94 mm/bios_map.c n = 0; n 103 mm/bios_map.c n ? " " : "memory", n 112 mm/bios_map.c if(n < NR_BIOS_MM_ENT && bmmap->len) { n 113 mm/bios_map.c bios_mem_map[n].from = from_low; n 114 mm/bios_map.c bios_mem_map[n].to = to_low; n 115 mm/bios_map.c bios_mem_map[n].type = (int)bmmap->type; n 116 mm/bios_map.c if(bios_mem_map[n].type == MULTIBOOT_MEMORY_AVAILABLE) { n 117 mm/bios_map.c from_low = bios_mem_map[n].from & PAGE_MASK; n 118 mm/bios_map.c to_low = bios_mem_map[n].to & PAGE_MASK; n 125 mm/bios_map.c n++; n 58 mm/memory.c unsigned int n; n 62 mm/memory.c for(n = from >> PAGE_SHIFT; n < (to >> PAGE_SHIFT); n++) { n 63 mm/memory.c pde = GET_PGDIR(n << PAGE_SHIFT); n 64 mm/memory.c pte = GET_PGTBL(n << PAGE_SHIFT); n 73 mm/memory.c pgtbl[pte] = (n << PAGE_SHIFT) | flags; n 89 mm/memory.c int n; n 103 mm/memory.c for(n = 0; n < (1024 * mb4); n++) { n 104 mm/memory.c kpage_table[n] = (n << PAGE_SHIFT) | PAGE_PRESENT | PAGE_RW; n 105 mm/memory.c if(!(n % 1024)) { n 106 mm/memory.c pd = n / 1024; n 133 mm/memory.c int n, n2, pages; n 141 mm/memory.c for(n = 0, pages = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 188 mm/memory.c int n, count; n 191 mm/memory.c for(n = 0, count = 0; n < PD_ENTRIES; n++) { n 192 mm/memory.c if((pgdir[n] & (PAGE_PRESENT | PAGE_RW | PAGE_USER)) == (PAGE_PRESENT | PAGE_RW | PAGE_USER)) { n 193 mm/memory.c kfree(P2V(pgdir[n]) & PAGE_MASK); n 194 mm/memory.c pgdir[n] = NULL; n 268 mm/memory.c int n, pages; n 285 mm/memory.c for(n = 0; n < kstat.physical_pages; n++) { n 286 mm/memory.c kpage_table[n] = (n << PAGE_SHIFT) | PAGE_PRESENT | PAGE_RW; n 287 mm/memory.c if(!(n % 1024)) { n 288 mm/memory.c kpage_dir[GET_PGDIR(KERNEL_BASE_ADDR) + (n / 1024)] = (unsigned int)&kpage_table[n] | PAGE_PRESENT | PAGE_RW; n 336 mm/memory.c n = (buffer_table_size / sizeof(struct buffer) * BUFFER_HASH_PERCENTAGE) / 100; n 337 mm/memory.c n = MAX(n, 10); /* 10 buffer hashes as minimum */ n 339 mm/memory.c pages = ((n * sizeof(unsigned int)) / PAGE_SIZE) + 1; n 364 mm/memory.c n = ((inode_table_size / sizeof(struct inode)) * INODE_HASH_PERCENTAGE) / 100; n 365 mm/memory.c n = MAX(n, 10); /* 10 inode hash buckets as minimum */ n 367 mm/memory.c pages = ((n * sizeof(unsigned int)) / PAGE_SIZE) + 1; n 408 mm/memory.c n = 1; n 410 mm/memory.c n = 0; n 412 mm/memory.c for(; n < RAMDISK_MINORS; n++) { n 419 mm/memory.c ramdisk_table[n].addr = (char *)_last_data_addr; n 429 mm/memory.c for(n = 1; n <= NR_VCONSOLES; n++) { n 430 mm/memory.c vc_screen[n] = (short int *)_last_data_addr; n 26 mm/mmap.c unsigned int n; n 32 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 67 mm/mmap.c printk("[%02d] 0x%08x-0x%08x %c%c%c%c 0x%08x %02d:%02d %- 10u <%d> [%s] (%d)\n", n, vma->start, vma->end, r, w, x, f, vma->offset, major, minor, inode, vma->o_mode, section, count); n 69 mm/mmap.c if(!n) { n 76 mm/mmap.c unsigned int n; n 81 mm/mmap.c for(n = 0; n < VMA_REGIONS; n++, vma++) { n 95 mm/mmap.c unsigned int n, n2, needs_sort; n 102 mm/mmap.c for(n = 0, n2 = 1; n2 < VMA_REGIONS; n++, n2++) { n 103 mm/mmap.c if(vma[n].end && vma[n2].start) { n 104 mm/mmap.c if((vma[n].end == vma[n2].start) && n 105 mm/mmap.c (vma[n].prot == vma[n2].prot) && n 106 mm/mmap.c (vma[n].flags == vma[n2].flags) && n 107 mm/mmap.c (vma[n].offset == vma[n2].offset) && n 108 mm/mmap.c (vma[n].s_type == vma[n2].s_type) && n 109 mm/mmap.c (vma[n].inode == vma[n2].inode)) { n 110 mm/mmap.c vma[n].end = vma[n2].end; n 115 mm/mmap.c if((vma[n2].start && (vma[n].start > vma[n2].start)) || (!vma[n].start && vma[n2].start)) { n 116 mm/mmap.c memcpy_b(&tmp, &vma[n], sizeof(struct vma)); n 117 mm/mmap.c memcpy_b(&vma[n], &vma[n2], sizeof(struct vma)); n 139 mm/mmap.c unsigned int n, needs_sort; n 146 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 188 mm/mmap.c unsigned int n, addr; n 198 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 212 mm/mmap.c unsigned int n, addr; n 221 mm/mmap.c for(n = 0; n < (length / PAGE_SIZE); n++) { n 222 mm/mmap.c pde = GET_PGDIR(start + (n * PAGE_SIZE)); n 223 mm/mmap.c pte = GET_PGTBL(start + (n * PAGE_SIZE)); n 293 mm/mmap.c unsigned int n; n 298 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 309 mm/mmap.c unsigned int n; n 319 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 329 mm/mmap.c unsigned int n; n 335 mm/mmap.c for(n = 0; n < VMA_REGIONS && vma->start; n++, vma++) { n 392 mm/page.c unsigned int n, addr; n 397 mm/page.c for(n = 0; n < pages; n++) { n 398 mm/page.c pg = &page_table[n]; n 399 mm/page.c pg->page = n; n 401 mm/page.c addr = n << PAGE_SHIFT;