tag | line | file | source code |
i | 46 | fs/buffer.c | int i; |
i | 50 | fs/buffer.c | for (i=0 ; i<NR_BUFFERS ; i++,bh = bh->b_next_free) { |
i | 82 | fs/buffer.c | int i; |
i | 86 | fs/buffer.c | for (i=0 ; i<NR_BUFFERS ; i++,bh++) { |
i | 111 | fs/buffer.c | int i; |
i | 118 | fs/buffer.c | i = floppy_change(bh); |
i | 120 | fs/buffer.c | if (!i) |
i | 122 | fs/buffer.c | for (i=0 ; i<NR_SUPER ; i++) |
i | 123 | fs/buffer.c | if (super_block[i].s_dev == dev) |
i | 124 | fs/buffer.c | put_super(super_block[i].s_dev); |
i | 350 | fs/buffer.c | int i; |
i | 352 | fs/buffer.c | for (i=0 ; i<4 ; i++) |
i | 353 | fs/buffer.c | if (b[i]) { |
i | 354 | fs/buffer.c | if (bh[i] = getblk(dev,b[i])) |
i | 355 | fs/buffer.c | if (!bh[i]->b_uptodate) |
i | 356 | fs/buffer.c | ll_rw_block(READ,bh[i]); |
i | 358 | fs/buffer.c | bh[i] = NULL; |
i | 359 | fs/buffer.c | for (i=0 ; i<4 ; i++,address += BLOCK_SIZE) |
i | 360 | fs/buffer.c | if (bh[i]) { |
i | 361 | fs/buffer.c | wait_on_buffer(bh[i]); |
i | 362 | fs/buffer.c | if (bh[i]->b_uptodate) |
i | 363 | fs/buffer.c | COPYBLK((unsigned long) bh[i]->b_data,address); |
i | 364 | fs/buffer.c | brelse(bh[i]); |
i | 403 | fs/buffer.c | int i; |
i | 434 | fs/buffer.c | for (i=0;i<NR_HASH;i++) |
i | 435 | fs/buffer.c | hash_table[i] = NULL; |
i | 131 | fs/exec.c | int i=0; |
i | 136 | fs/exec.c | i++; |
i | 138 | fs/exec.c | return i; |
i | 211 | fs/exec.c | int i; |
i | 224 | fs/exec.c | for (i=MAX_ARG_PAGES-1 ; i>=0 ; i--) { |
i | 226 | fs/exec.c | if (page[i]) |
i | 227 | fs/exec.c | put_dirty_page(page[i],data_base); |
i | 245 | fs/exec.c | int i,argc,envc; |
i | 254 | fs/exec.c | for (i=0 ; i<MAX_ARG_PAGES ; i++) /* clear page-table */ |
i | 255 | fs/exec.c | page[i]=0; |
i | 266 | fs/exec.c | i = inode->i_mode; |
i | 272 | fs/exec.c | e_uid = (i & S_ISUID) ? inode->i_uid : current->euid; |
i | 273 | fs/exec.c | e_gid = (i & S_ISGID) ? inode->i_gid : current->egid; |
i | 276 | fs/exec.c | i >>= 6; |
i | 278 | fs/exec.c | i >>= 3; |
i | 279 | fs/exec.c | if (!(i & 1) && |
i | 382 | fs/exec.c | for (i=0; (ch = get_fs_byte(filename++)) != '\0';) |
i | 384 | fs/exec.c | i = 0; |
i | 386 | fs/exec.c | if (i < 8) |
i | 387 | fs/exec.c | current->comm[i++] = ch; |
i | 388 | fs/exec.c | if (i < 8) |
i | 389 | fs/exec.c | current->comm[i] = '\0'; |
i | 392 | fs/exec.c | i = current->numlibraries; |
i | 393 | fs/exec.c | while (i-- > 0) { |
i | 394 | fs/exec.c | iput(current->libraries[i].library); |
i | 395 | fs/exec.c | current->libraries[i].library = NULL; |
i | 400 | fs/exec.c | for (i=0 ; i<32 ; i++) { |
i | 401 | fs/exec.c | current->sigaction[i].sa_mask = 0; |
i | 402 | fs/exec.c | current->sigaction[i].sa_flags = 0; |
i | 403 | fs/exec.c | if (current->sigaction[i].sa_handler != SIG_IGN) |
i | 404 | fs/exec.c | current->sigaction[i].sa_handler = NULL; |
i | 406 | fs/exec.c | for (i=0 ; i<NR_OPEN ; i++) |
i | 407 | fs/exec.c | if ((current->close_on_exec>>i)&1) |
i | 408 | fs/exec.c | sys_close(i); |
i | 433 | fs/exec.c | for (i=0 ; i<MAX_ARG_PAGES ; i++) |
i | 434 | fs/exec.c | free_page(page[i]); |
i | 79 | fs/inode.c | int i; |
i | 83 | fs/inode.c | for(i=0 ; i<NR_INODE ; i++,inode++) { |
i | 97 | fs/inode.c | int i; |
i | 101 | fs/inode.c | for(i=0 ; i<NR_INODE ; i++,inode++) { |
i | 157 | fs/inode.c | int i; |
i | 161 | fs/inode.c | for (i = NR_INODE; i ; i--) { |
i | 171 | fs/inode.c | for (i=0 ; i<NR_INODE ; i++) |
i | 172 | fs/inode.c | printk("(%04x: %d (%o)) ",inode_table[i].i_dev, |
i | 173 | fs/inode.c | inode_table[i].i_ino,inode_table[i].i_mode); |
i | 223 | fs/inode.c | int i; |
i | 225 | fs/inode.c | for (i = 0 ; i<NR_SUPER ; i++) |
i | 226 | fs/inode.c | if (super_block[i].s_covered==inode) |
i | 228 | fs/inode.c | if (i >= NR_SUPER) { |
i | 235 | fs/inode.c | if (!(inode = super_block[i].s_mounted)) |
i | 82 | fs/minix/bitmap.c | int i,j; |
i | 87 | fs/minix/bitmap.c | for (i=0 ; i<8 ; i++) |
i | 88 | fs/minix/bitmap.c | if (bh=sb->s_zmap[i]) |
i | 91 | fs/minix/bitmap.c | if (i>=8 || !bh || j>=8192) |
i | 96 | fs/minix/bitmap.c | j += i*8192 + sb->s_firstdatazone-1; |
i | 150 | fs/minix/bitmap.c | int i,j; |
i | 160 | fs/minix/bitmap.c | for (i=0 ; i<8 ; i++) |
i | 161 | fs/minix/bitmap.c | if (bh=inode->i_sb->s_imap[i]) |
i | 164 | fs/minix/bitmap.c | if (!bh || j >= 8192 || j+i*8192 > inode->i_sb->s_ninodes) { |
i | 180 | fs/minix/bitmap.c | inode->i_ino = j + i*8192; |
i | 22 | fs/minix/file_dev.c | unsigned int block,offset,i; |
i | 43 | fs/minix/file_dev.c | for (i = 0; i < MINIX_NAME_LEN; i++) |
i | 44 | fs/minix/file_dev.c | if (c = de->name[i]) |
i | 45 | fs/minix/file_dev.c | put_fs_byte(c,i+dirent->d_name); |
i | 48 | fs/minix/file_dev.c | if (i) { |
i | 50 | fs/minix/file_dev.c | put_fs_byte(0,i+dirent->d_name); |
i | 51 | fs/minix/file_dev.c | put_fs_word(i,&dirent->d_reclen); |
i | 53 | fs/minix/file_dev.c | return i; |
i | 20 | fs/minix/inode.c | int i; |
i | 24 | fs/minix/inode.c | for(i = 0 ; i < MINIX_I_MAP_SLOTS ; i++) |
i | 25 | fs/minix/inode.c | brelse(sb->s_imap[i]); |
i | 26 | fs/minix/inode.c | for(i = 0 ; i < MINIX_Z_MAP_SLOTS ; i++) |
i | 27 | fs/minix/inode.c | brelse(sb->s_zmap[i]); |
i | 40 | fs/minix/inode.c | int i,dev=s->s_dev,block; |
i | 58 | fs/minix/inode.c | for (i=0;i < MINIX_I_MAP_SLOTS;i++) |
i | 59 | fs/minix/inode.c | s->s_imap[i] = NULL; |
i | 60 | fs/minix/inode.c | for (i=0;i < MINIX_Z_MAP_SLOTS;i++) |
i | 61 | fs/minix/inode.c | s->s_zmap[i] = NULL; |
i | 63 | fs/minix/inode.c | for (i=0 ; i < s->s_imap_blocks ; i++) |
i | 64 | fs/minix/inode.c | if (s->s_imap[i]=bread(dev,block)) |
i | 68 | fs/minix/inode.c | for (i=0 ; i < s->s_zmap_blocks ; i++) |
i | 69 | fs/minix/inode.c | if (s->s_zmap[i]=bread(dev,block)) |
i | 74 | fs/minix/inode.c | for(i=0;i<MINIX_I_MAP_SLOTS;i++) |
i | 75 | fs/minix/inode.c | brelse(s->s_imap[i]); |
i | 76 | fs/minix/inode.c | for(i=0;i<MINIX_Z_MAP_SLOTS;i++) |
i | 77 | fs/minix/inode.c | brelse(s->s_zmap[i]); |
i | 100 | fs/minix/inode.c | int i; |
i | 129 | fs/minix/inode.c | i = ((unsigned short *) (bh->b_data))[block]; |
i | 130 | fs/minix/inode.c | if (create && !i) |
i | 131 | fs/minix/inode.c | if (i=minix_new_block(inode->i_dev)) { |
i | 132 | fs/minix/inode.c | ((unsigned short *) (bh->b_data))[block]=i; |
i | 136 | fs/minix/inode.c | return i; |
i | 148 | fs/minix/inode.c | i = ((unsigned short *)bh->b_data)[block>>9]; |
i | 149 | fs/minix/inode.c | if (create && !i) |
i | 150 | fs/minix/inode.c | if (i=minix_new_block(inode->i_dev)) { |
i | 151 | fs/minix/inode.c | ((unsigned short *) (bh->b_data))[block>>9]=i; |
i | 155 | fs/minix/inode.c | if (!i) |
i | 157 | fs/minix/inode.c | if (!(bh=bread(inode->i_dev,i))) |
i | 159 | fs/minix/inode.c | i = ((unsigned short *)bh->b_data)[block&511]; |
i | 160 | fs/minix/inode.c | if (create && !i) |
i | 161 | fs/minix/inode.c | if (i=minix_new_block(inode->i_dev)) { |
i | 162 | fs/minix/inode.c | ((unsigned short *) (bh->b_data))[block&511]=i; |
i | 166 | fs/minix/inode.c | return i; |
i | 63 | fs/minix/namei.c | int block,i; |
i | 82 | fs/minix/namei.c | i = 0; |
i | 84 | fs/minix/namei.c | while (i < entries) { |
i | 88 | fs/minix/namei.c | if (!(block = minix_bmap(dir,i/MINIX_DIR_ENTRIES_PER_BLOCK)) || |
i | 90 | fs/minix/namei.c | i += MINIX_DIR_ENTRIES_PER_BLOCK; |
i | 100 | fs/minix/namei.c | i++; |
i | 181 | fs/minix/namei.c | int block,i; |
i | 201 | fs/minix/namei.c | i = 0; |
i | 207 | fs/minix/namei.c | block = minix_create_block(dir,i/MINIX_DIR_ENTRIES_PER_BLOCK); |
i | 211 | fs/minix/namei.c | i += MINIX_DIR_ENTRIES_PER_BLOCK; |
i | 216 | fs/minix/namei.c | if (i*sizeof(struct minix_dir_entry) >= dir->i_size) { |
i | 218 | fs/minix/namei.c | dir->i_size = (i+1)*sizeof(struct minix_dir_entry); |
i | 224 | fs/minix/namei.c | for (i=0; i < MINIX_NAME_LEN ; i++) |
i | 225 | fs/minix/namei.c | de->name[i]=(i<namelen)?get_fs_byte(name+i):0; |
i | 231 | fs/minix/namei.c | i++; |
i | 512 | fs/minix/namei.c | int i; |
i | 534 | fs/minix/namei.c | i = 0; |
i | 535 | fs/minix/namei.c | while (i < 1023 && (c=get_fs_byte(symname++))) |
i | 536 | fs/minix/namei.c | name_block->b_data[i++] = c; |
i | 537 | fs/minix/namei.c | name_block->b_data[i] = 0; |
i | 540 | fs/minix/namei.c | inode->i_size = i; |
i | 768 | fs/minix/namei.c | int i; |
i | 784 | fs/minix/namei.c | i = 0; |
i | 785 | fs/minix/namei.c | while (i<buflen && (c = bh->b_data[i])) { |
i | 786 | fs/minix/namei.c | i++; |
i | 790 | fs/minix/namei.c | return i; |
i | 30 | fs/minix/truncate.c | int i; |
i | 35 | fs/minix/truncate.c | for (i = DIRECT_BLOCK ; i < 7 ; i++) { |
i | 36 | fs/minix/truncate.c | if (i < DIRECT_BLOCK) |
i | 38 | fs/minix/truncate.c | if (!inode->i_data[i]) |
i | 41 | fs/minix/truncate.c | if (minix_free_block(inode->i_dev,inode->i_data[i])) |
i | 42 | fs/minix/truncate.c | inode->i_data[i] = 0; |
i | 49 | fs/minix/truncate.c | int i; |
i | 60 | fs/minix/truncate.c | for (i = INDIRECT_BLOCK ; i < 512 ; i++) { |
i | 61 | fs/minix/truncate.c | if (i < 0) |
i | 62 | fs/minix/truncate.c | i = 0; |
i | 63 | fs/minix/truncate.c | if (i < INDIRECT_BLOCK) |
i | 65 | fs/minix/truncate.c | ind = i+(unsigned short *) bh->b_data; |
i | 73 | fs/minix/truncate.c | for (i = 0; i < 512; i++) |
i | 77 | fs/minix/truncate.c | if (i >= 512) { |
i | 87 | fs/minix/truncate.c | int i; |
i | 98 | fs/minix/truncate.c | for (i = DINDIRECT_BLOCK ; i < 512 ; i ++) { |
i | 99 | fs/minix/truncate.c | if (i < 0) |
i | 100 | fs/minix/truncate.c | i = 0; |
i | 101 | fs/minix/truncate.c | if (i < DINDIRECT_BLOCK) |
i | 103 | fs/minix/truncate.c | dind = i+(unsigned short *) bh->b_data; |
i | 106 | fs/minix/truncate.c | result |= trunc_indirect(inode,7+512+(i<<9),dind); |
i | 109 | fs/minix/truncate.c | for (i = 0; i < 512; i++) |
i | 113 | fs/minix/truncate.c | if (i >= 512) { |
i | 240 | fs/open.c | int i,fd; |
i | 249 | fs/open.c | for (i=0 ; i<NR_FILE ; i++,f++) |
i | 251 | fs/open.c | if (i>=NR_FILE) |
i | 254 | fs/open.c | if ((i = open_namei(filename,flag,mode,&inode))<0) { |
i | 257 | fs/open.c | return i; |
i | 262 | fs/open.c | i = MAJOR(inode->i_rdev); |
i | 263 | fs/open.c | if (i < MAX_CHRDEV) |
i | 264 | fs/open.c | f->f_op = chrdev_fops[i]; |
i | 266 | fs/open.c | i = MAJOR(inode->i_rdev); |
i | 267 | fs/open.c | if (i < MAX_CHRDEV) |
i | 268 | fs/open.c | f->f_op = blkdev_fops[i]; |
i | 276 | fs/open.c | if (i = inode->i_op->open(inode,f)) { |
i | 280 | fs/open.c | return i; |
i | 133 | fs/pipe.c | int i,j; |
i | 136 | fs/pipe.c | for(i=0;j<2 && i<NR_FILE;i++) |
i | 137 | fs/pipe.c | if (!file_table[i].f_count) |
i | 138 | fs/pipe.c | (f[j++]=i+file_table)->f_count++; |
i | 144 | fs/pipe.c | for(i=0;j<2 && i<NR_OPEN;i++) |
i | 145 | fs/pipe.c | if (!current->filp[i]) { |
i | 146 | fs/pipe.c | current->filp[ fd[j]=i ] = f[j]; |
i | 42 | fs/select.c | int i; |
i | 46 | fs/select.c | for (i = 0 ; i < p->nr ; i++) |
i | 47 | fs/select.c | if (p->entry[i].wait_address == wait_address) |
i | 62 | fs/select.c | int i; |
i | 70 | fs/select.c | for (i = 0; i < p->nr ; i++) { |
i | 71 | fs/select.c | wake_up(p->entry[i].wait_address); |
i | 72 | fs/select.c | wake_up(&p->entry[i].old_task); |
i | 172 | fs/select.c | int i; |
i | 176 | fs/select.c | for (i = 0 ; i < NR_OPEN ; i++,mask >>= 1) { |
i | 179 | fs/select.c | if (!current->filp[i]) |
i | 181 | fs/select.c | if (!current->filp[i]->f_inode) |
i | 183 | fs/select.c | if (current->filp[i]->f_inode->i_pipe) |
i | 185 | fs/select.c | if (S_ISCHR(current->filp[i]->f_inode->i_mode)) |
i | 187 | fs/select.c | if (S_ISFIFO(current->filp[i]->f_inode->i_mode)) |
i | 200 | fs/select.c | for (i = 0 ; i < NR_OPEN ; i++, mask += mask) { |
i | 202 | fs/select.c | if (check_in(&wait_table,current->filp[i]->f_inode)) { |
i | 207 | fs/select.c | if (check_out(&wait_table,current->filp[i]->f_inode)) { |
i | 212 | fs/select.c | if (check_ex(&wait_table,current->filp[i]->f_inode)) { |
i | 238 | fs/select.c | int i; |
i | 270 | fs/select.c | i = do_select(in, out, ex, &res_in, &res_out, &res_ex); |
i | 277 | fs/select.c | if (i < 0) |
i | 278 | fs/select.c | return i; |
i | 298 | fs/select.c | if (i) |
i | 299 | fs/select.c | return i; |
i | 18 | fs/stat.c | int i; |
i | 32 | fs/stat.c | for (i=0 ; i<sizeof (tmp) ; i++) |
i | 33 | fs/stat.c | put_fs_byte(((char *) &tmp)[i],i + (char *) statbuf); |
i | 188 | fs/super.c | int i; |
i | 215 | fs/super.c | i = 0; |
i | 216 | fs/super.c | while (i < 100 && (tmp[i] = get_fs_byte(type++))) |
i | 217 | fs/super.c | i++; |
i | 237 | fs/super.c | int i,free; |
i | 243 | fs/super.c | for(i=0;i<NR_FILE;i++) |
i | 244 | fs/super.c | file_table[i].f_count=0; |
i | 266 | fs/super.c | i=p->s_nzones; |
i | 267 | fs/super.c | while (-- i >= 0) |
i | 268 | fs/super.c | if (!set_bit(i&8191,p->s_zmap[i>>13]->b_data)) |
i | 272 | fs/super.c | i=p->s_ninodes+1; |
i | 273 | fs/super.c | while (-- i >= 0) |
i | 274 | fs/super.c | if (!set_bit(i&8191,p->s_imap[i>>13]->b_data)) |
i | 58 | init/main.c | int i; |
i | 61 | init/main.c | i = vsprintf(str, fmt, args); |
i | 63 | init/main.c | return i; |
i | 183 | init/main.c | int i; |
i | 186 | init/main.c | write(1,printbuf,i=vsprintf(printbuf, fmt, args)); |
i | 188 | init/main.c | return i; |
i | 193 | init/main.c | int pid,i; |
i | 215 | init/main.c | while (pid != wait(&i)) |
i | 231 | init/main.c | if (pid == wait(&i)) |
i | 233 | init/main.c | printf("\n\rchild %d died with code %04x\n\r",pid,i); |
i | 254 | kernel/blk_drv/floppy.c | int i = 0, counter, status; |
i | 261 | kernel/blk_drv/floppy.c | return i; |
i | 263 | kernel/blk_drv/floppy.c | if (i >= MAX_REPLIES) |
i | 265 | kernel/blk_drv/floppy.c | reply_buffer[i++] = inb_p(FD_DATA); |
i | 453 | kernel/blk_drv/floppy.c | int i; |
i | 464 | kernel/blk_drv/floppy.c | for (i=0 ; i<1000 ; i++) |
i | 154 | kernel/blk_drv/hd.c | int i, minor = current_minor; |
i | 168 | kernel/blk_drv/hd.c | for (i=1 ; i<=4 ; minor++,i++,p++) { |
i | 172 | kernel/blk_drv/hd.c | printk(" part %d start %d size %d end %d \n\r", i, |
i | 186 | kernel/blk_drv/hd.c | for (i = 4 ; i < 16 ; i++, current_minor++) { |
i | 211 | kernel/blk_drv/hd.c | int i,drive; |
i | 258 | kernel/blk_drv/hd.c | for (i = 0 ; i < (MAX_HD<<6) ; i++) { |
i | 259 | kernel/blk_drv/hd.c | hd[i].start_sect = 0; |
i | 260 | kernel/blk_drv/hd.c | hd[i].nr_sects = 0; |
i | 262 | kernel/blk_drv/hd.c | for (i = 0 ; i < NR_HD ; i++) |
i | 263 | kernel/blk_drv/hd.c | hd[i<<6].nr_sects = hd_info[i].head* |
i | 264 | kernel/blk_drv/hd.c | hd_info[i].sect*hd_info[i].cyl; |
i | 269 | kernel/blk_drv/hd.c | for (i=0 ; i<(MAX_HD<<6) ; i++) |
i | 270 | kernel/blk_drv/hd.c | hd_sizes[i] = hd[i].nr_sects>>1 ; |
i | 293 | kernel/blk_drv/hd.c | int i=inb_p(HD_STATUS); |
i | 295 | kernel/blk_drv/hd.c | if ((i & (BUSY_STAT | READY_STAT | WRERR_STAT | SEEK_STAT | ERR_STAT)) |
i | 298 | kernel/blk_drv/hd.c | if (i&1) |
i | 299 | kernel/blk_drv/hd.c | i=inb(HD_ERROR); |
i | 329 | kernel/blk_drv/hd.c | unsigned int i; |
i | 332 | kernel/blk_drv/hd.c | for (i = 0; i < 500000 ; i++) { |
i | 344 | kernel/blk_drv/hd.c | int i; |
i | 347 | kernel/blk_drv/hd.c | for(i = 0; i < 1000; i++) nop(); |
i | 351 | kernel/blk_drv/hd.c | if ((i = inb(HD_ERROR)) != 1) |
i | 352 | kernel/blk_drv/hd.c | printk("HD-controller reset failed: %02x\n\r",i); |
i | 357 | kernel/blk_drv/hd.c | static int i; |
i | 362 | kernel/blk_drv/hd.c | i = -1; |
i | 369 | kernel/blk_drv/hd.c | i++; |
i | 370 | kernel/blk_drv/hd.c | if (i < NR_HD) { |
i | 371 | kernel/blk_drv/hd.c | hd_out(i,hd_info[i].sect,hd_info[i].sect,hd_info[i].head-1, |
i | 372 | kernel/blk_drv/hd.c | hd_info[i].cyl,WIN_SPECIFY,&reset_hd); |
i | 470 | kernel/blk_drv/hd.c | int i,r; |
i | 507 | kernel/blk_drv/hd.c | for(i=0 ; i<10000 && !(r=inb_p(HD_STATUS)&DRQ_STAT) ; i++) |
i | 219 | kernel/blk_drv/ll_rw_blk.c | int i; |
i | 221 | kernel/blk_drv/ll_rw_blk.c | for (i=0 ; i<NR_REQUEST ; i++) { |
i | 222 | kernel/blk_drv/ll_rw_blk.c | request[i].dev = -1; |
i | 223 | kernel/blk_drv/ll_rw_blk.c | request[i].next = NULL; |
i | 229 | kernel/blk_drv/ll_rw_blk.c | int i; |
i | 243 | kernel/blk_drv/ll_rw_blk.c | for (i=0; i<nb; i++, buf += BLOCK_SIZE) |
i | 258 | kernel/blk_drv/ll_rw_blk.c | req->sector = b[i] << 1; |
i | 65 | kernel/blk_drv/ramdisk.c | int i; |
i | 73 | kernel/blk_drv/ramdisk.c | for (i=0; i < length; i++) |
i | 88 | kernel/blk_drv/ramdisk.c | int i = 1; |
i | 129 | kernel/blk_drv/ramdisk.c | printk("\010\010\010\010\010%4dk",i); |
i | 133 | kernel/blk_drv/ramdisk.c | i++; |
i | 408 | kernel/chr_drv/console.c | int i; |
i | 411 | kernel/chr_drv/console.c | for (i=0;i<=npar;i++) |
i | 412 | kernel/chr_drv/console.c | switch (par[i]) { |
i | 444 | kernel/chr_drv/console.c | if ((par[i]>=30) && (par[i]<=37)) |
i | 445 | kernel/chr_drv/console.c | attr = (attr & 0xf8) | conv_table[par[i]-30]; |
i | 447 | kernel/chr_drv/console.c | if ((par[i]>=40) && (par[i]<=47)) |
i | 448 | kernel/chr_drv/console.c | attr = (attr & 0x8f) | (conv_table[par[i]-40]<<4); |
i | 489 | kernel/chr_drv/console.c | unsigned int i = x; |
i | 493 | kernel/chr_drv/console.c | while (i++ < video_num_columns) { |
i | 508 | kernel/chr_drv/console.c | unsigned int i = x; |
i | 513 | kernel/chr_drv/console.c | while (++i < video_num_columns) { |
i | 32 | kernel/chr_drv/mem.c | int i; |
i | 52 | kernel/chr_drv/mem.c | i = 4096-(addr & 0xfff); |
i | 53 | kernel/chr_drv/mem.c | if (i > count) |
i | 54 | kernel/chr_drv/mem.c | i = count; |
i | 55 | kernel/chr_drv/mem.c | memcpy_tofs(tmp,(void *) page,i); |
i | 56 | kernel/chr_drv/mem.c | addr += i; |
i | 57 | kernel/chr_drv/mem.c | tmp += i; |
i | 58 | kernel/chr_drv/mem.c | count -= i; |
i | 69 | kernel/chr_drv/mem.c | int i; |
i | 87 | kernel/chr_drv/mem.c | i = 4096-(addr & 0xfff); |
i | 88 | kernel/chr_drv/mem.c | if (i > count) |
i | 89 | kernel/chr_drv/mem.c | i = count; |
i | 90 | kernel/chr_drv/mem.c | memcpy_fromfs((void *) page,tmp,i); |
i | 91 | kernel/chr_drv/mem.c | addr += i; |
i | 92 | kernel/chr_drv/mem.c | tmp += i; |
i | 93 | kernel/chr_drv/mem.c | count -= i; |
i | 131 | kernel/chr_drv/mem.c | unsigned int i = file->f_pos; |
i | 134 | kernel/chr_drv/mem.c | while (count-- > 0 && i < 65536) { |
i | 135 | kernel/chr_drv/mem.c | put_fs_byte(inb(i),tmp); |
i | 136 | kernel/chr_drv/mem.c | i++; |
i | 139 | kernel/chr_drv/mem.c | file->f_pos = i; |
i | 145 | kernel/chr_drv/mem.c | unsigned int i = file->f_pos; |
i | 148 | kernel/chr_drv/mem.c | while (count-- > 0 && i < 65536) { |
i | 149 | kernel/chr_drv/mem.c | outb(get_fs_byte(tmp),i); |
i | 150 | kernel/chr_drv/mem.c | i++; |
i | 153 | kernel/chr_drv/mem.c | file->f_pos = i; |
i | 467 | kernel/chr_drv/tty_io.c | int i; |
i | 471 | kernel/chr_drv/tty_io.c | for (i=0 ; i < QUEUES ; i++) |
i | 472 | kernel/chr_drv/tty_io.c | tty_queues[i] = (struct tty_queue) {0,0,0,0,""}; |
i | 481 | kernel/chr_drv/tty_io.c | for (i=0 ; i<256 ; i++) { |
i | 482 | kernel/chr_drv/tty_io.c | tty_table[i] = (struct tty_struct) { |
i | 489 | kernel/chr_drv/tty_io.c | for (i = 0 ; i<NR_CONSOLES ; i++) { |
i | 490 | kernel/chr_drv/tty_io.c | con_table[i] = (struct tty_struct) { |
i | 503 | kernel/chr_drv/tty_io.c | con_queues+0+i*3,con_queues+1+i*3,con_queues+2+i*3 |
i | 506 | kernel/chr_drv/tty_io.c | for (i = 0 ; i<NR_SERIALS ; i++) { |
i | 507 | kernel/chr_drv/tty_io.c | rs_table[i] = (struct tty_struct) { |
i | 520 | kernel/chr_drv/tty_io.c | rs_queues+0+i*3,rs_queues+1+i*3,rs_queues+2+i*3 |
i | 523 | kernel/chr_drv/tty_io.c | for (i = 0 ; i<NR_PTYS ; i++) { |
i | 524 | kernel/chr_drv/tty_io.c | mpty_table[i] = (struct tty_struct) { |
i | 537 | kernel/chr_drv/tty_io.c | mpty_queues+0+i*3,mpty_queues+1+i*3,mpty_queues+2+i*3 |
i | 539 | kernel/chr_drv/tty_io.c | spty_table[i] = (struct tty_struct) { |
i | 552 | kernel/chr_drv/tty_io.c | spty_queues+0+i*3,spty_queues+1+i*3,spty_queues+2+i*3 |
i | 81 | kernel/chr_drv/tty_ioctl.c | int i, n = 0; |
i | 90 | kernel/chr_drv/tty_ioctl.c | for (i=0 ; i<sizeof(struct task_struct) ; i++) |
i | 101 | kernel/chr_drv/tty_ioctl.c | int i; |
i | 104 | kernel/chr_drv/tty_ioctl.c | for (i=0 ; i< (sizeof (*termios)) ; i++) |
i | 105 | kernel/chr_drv/tty_ioctl.c | put_fs_byte( ((char *)&tty->termios)[i] , i+(char *)termios ); |
i | 112 | kernel/chr_drv/tty_ioctl.c | int i, retsig; |
i | 122 | kernel/chr_drv/tty_ioctl.c | for (i=0 ; i< (sizeof (*termios)) ; i++) |
i | 123 | kernel/chr_drv/tty_ioctl.c | ((char *)&tty->termios)[i]=get_fs_byte(i+(char *)termios); |
i | 130 | kernel/chr_drv/tty_ioctl.c | int i; |
i | 139 | kernel/chr_drv/tty_ioctl.c | for(i=0 ; i < NCC ; i++) |
i | 140 | kernel/chr_drv/tty_ioctl.c | tmp_termio.c_cc[i] = tty->termios.c_cc[i]; |
i | 141 | kernel/chr_drv/tty_ioctl.c | for (i=0 ; i< (sizeof (*termio)) ; i++) |
i | 142 | kernel/chr_drv/tty_ioctl.c | put_fs_byte( ((char *)&tmp_termio)[i] , i+(char *)termio ); |
i | 152 | kernel/chr_drv/tty_ioctl.c | int i, retsig; |
i | 160 | kernel/chr_drv/tty_ioctl.c | for (i=0 ; i< (sizeof (*termio)) ; i++) |
i | 161 | kernel/chr_drv/tty_ioctl.c | ((char *)&tmp_termio)[i]=get_fs_byte(i+(char *)termio); |
i | 167 | kernel/chr_drv/tty_ioctl.c | for(i=0 ; i < NCC ; i++) |
i | 168 | kernel/chr_drv/tty_ioctl.c | tty->termios.c_cc[i] = tmp_termio.c_cc[i]; |
i | 175 | kernel/chr_drv/tty_ioctl.c | int i,changed; |
i | 182 | kernel/chr_drv/tty_ioctl.c | for (i = 0; i < sizeof (*ws) ; i++,tmp++) { |
i | 183 | kernel/chr_drv/tty_ioctl.c | c = get_fs_byte(i + (char *) ws); |
i | 196 | kernel/chr_drv/tty_ioctl.c | int i; |
i | 203 | kernel/chr_drv/tty_ioctl.c | for (i = 0; i < sizeof (struct winsize) ; i++,tmp++) |
i | 204 | kernel/chr_drv/tty_ioctl.c | put_fs_byte(((char *) &tty->winsize)[i], tmp); |
i | 165 | kernel/chr_drv/vt.c | int i; |
i | 167 | kernel/chr_drv/vt.c | for (i = 0; i < NR_CONSOLES; ++i) { |
i | 168 | kernel/chr_drv/vt.c | vt_info[i].mode = KD_TEXT; |
i | 57 | kernel/exit.c | int i; |
i | 65 | kernel/exit.c | for (i=1 ; i<NR_TASKS ; i++) |
i | 66 | kernel/exit.c | if (task[i] == p) { |
i | 67 | kernel/exit.c | task[i] = NULL; |
i | 88 | kernel/exit.c | int i; |
i | 92 | kernel/exit.c | for (i=0 ; i<NR_TASKS ; i++) |
i | 93 | kernel/exit.c | if (task[i] == p) |
i | 109 | kernel/exit.c | int i; |
i | 111 | kernel/exit.c | for (i=1 ; i<NR_TASKS ; i++) { |
i | 112 | kernel/exit.c | if (!task[i]) |
i | 114 | kernel/exit.c | if (bad_task_ptr(task[i]->p_pptr)) |
i | 116 | kernel/exit.c | task[i]->pid); |
i | 117 | kernel/exit.c | if (bad_task_ptr(task[i]->p_cptr)) |
i | 119 | kernel/exit.c | task[i]->pid); |
i | 120 | kernel/exit.c | if (bad_task_ptr(task[i]->p_ysptr)) |
i | 122 | kernel/exit.c | task[i]->pid); |
i | 123 | kernel/exit.c | if (bad_task_ptr(task[i]->p_osptr)) |
i | 125 | kernel/exit.c | task[i]->pid); |
i | 126 | kernel/exit.c | if (task[i]->p_pptr == task[i]) |
i | 128 | kernel/exit.c | if (task[i]->p_cptr == task[i]) |
i | 130 | kernel/exit.c | if (task[i]->p_ysptr == task[i]) |
i | 132 | kernel/exit.c | if (task[i]->p_osptr == task[i]) |
i | 134 | kernel/exit.c | if (task[i]->p_osptr) { |
i | 135 | kernel/exit.c | if (task[i]->p_pptr != task[i]->p_osptr->p_pptr) |
i | 138 | kernel/exit.c | task[i]->pid, task[i]->p_osptr->pid, |
i | 139 | kernel/exit.c | task[i]->p_osptr->p_pptr->pid); |
i | 140 | kernel/exit.c | if (task[i]->p_osptr->p_ysptr != task[i]) |
i | 143 | kernel/exit.c | task[i]->pid, task[i]->p_osptr->pid); |
i | 145 | kernel/exit.c | if (task[i]->p_ysptr) { |
i | 146 | kernel/exit.c | if (task[i]->p_pptr != task[i]->p_ysptr->p_pptr) |
i | 149 | kernel/exit.c | task[i]->pid, task[i]->p_osptr->pid, |
i | 150 | kernel/exit.c | task[i]->p_osptr->p_pptr->pid); |
i | 151 | kernel/exit.c | if (task[i]->p_ysptr->p_osptr != task[i]) |
i | 154 | kernel/exit.c | task[i]->pid, task[i]->p_ysptr->pid); |
i | 156 | kernel/exit.c | if (task[i]->p_cptr) { |
i | 157 | kernel/exit.c | if (task[i]->p_cptr->p_pptr != task[i]) |
i | 160 | kernel/exit.c | task[i]->pid, task[i]->p_cptr->pid); |
i | 161 | kernel/exit.c | if (task[i]->p_cptr->p_ysptr) |
i | 164 | kernel/exit.c | task[i]->pid, task[i]->p_cptr->pid); |
i | 277 | kernel/exit.c | int i; |
i | 281 | kernel/exit.c | for (i=0 ; i<NR_OPEN ; i++) |
i | 282 | kernel/exit.c | if (current->filp[i]) |
i | 283 | kernel/exit.c | sys_close(i); |
i | 290 | kernel/exit.c | for (i=0; i<current->numlibraries; i++) { |
i | 291 | kernel/exit.c | iput(current->libraries[i].library); |
i | 292 | kernel/exit.c | current->libraries[i].library = NULL; |
i | 70 | kernel/fork.c | int i; |
i | 74 | kernel/fork.c | for(i=0 ; i<NR_TASKS ; i++) |
i | 75 | kernel/fork.c | if (task[i] && ((task[i]->pid == last_pid) || |
i | 76 | kernel/fork.c | (task[i]->pgrp == last_pid))) |
i | 78 | kernel/fork.c | for(i=1 ; i<NR_TASKS ; i++) |
i | 79 | kernel/fork.c | if (!task[i]) |
i | 80 | kernel/fork.c | return i; |
i | 95 | kernel/fork.c | int i,nr; |
i | 146 | kernel/fork.c | for (i = 0; i<IO_BITMAP_SIZE ; i++) |
i | 147 | kernel/fork.c | p->tss.io_bitmap[i] = ~0; |
i | 161 | kernel/fork.c | for (i=0; i<NR_OPEN;i++) |
i | 162 | kernel/fork.c | if (f=p->filp[i]) |
i | 170 | kernel/fork.c | for (i=0; i < current->numlibraries ; i++) |
i | 171 | kernel/fork.c | if (current->libraries[i].library) |
i | 172 | kernel/fork.c | current->libraries[i].library->i_count++; |
i | 20 | kernel/ioport.c | int i; |
i | 23 | kernel/ioport.c | for (i = 0, mask = 0x80000000; i < 32; ++i, mask >>= 1) |
i | 24 | kernel/ioport.c | str[i] = (l & mask) ? '1' : '0'; |
i | 30 | kernel/ioport.c | int i, j; |
i | 33 | kernel/ioport.c | for (i = j = 0; j < numl; ++i) |
i | 35 | kernel/ioport.c | printk("%4d [%3x]: ", 64*i, 64*i); |
i | 17 | kernel/math/compare.c | int i = a->exponent & 0x7fff; |
i | 24 | kernel/math/compare.c | while (i && a->b >= 0) { |
i | 25 | kernel/math/compare.c | i--; |
i | 30 | kernel/math/compare.c | a->exponent = i | sign; |
i | 43 | kernel/math/div.c | int i; |
i | 47 | kernel/math/div.c | for (i = 0 ; i<64 ; i++) { |
i | 65 | kernel/math/div.c | int i,sign; |
i | 73 | kernel/math/div.c | i = (src1->exponent & 0x7fff) - (src2->exponent & 0x7fff) + 16383; |
i | 74 | kernel/math/div.c | if (i<0) { |
i | 87 | kernel/math/div.c | i++; |
i | 92 | kernel/math/div.c | while (i && tmp[3] >= 0) { |
i | 93 | kernel/math/div.c | i--; |
i | 99 | kernel/math/div.c | i = 0; |
i | 100 | kernel/math/div.c | if (i>0x7fff) { |
i | 106 | kernel/math/div.c | result->exponent = i | sign; |
i | 52 | kernel/math/emulate.c | static temp_real_unaligned * __st(int i); |
i | 527 | kernel/math/emulate.c | static temp_real_unaligned * __st(int i) |
i | 529 | kernel/math/emulate.c | i += I387.swd >> 11; |
i | 530 | kernel/math/emulate.c | i &= 7; |
i | 531 | kernel/math/emulate.c | return (temp_real_unaligned *) (i*10 + (char *)(I387.st_space)); |
i | 114 | kernel/math/get_put.c | temp_int i; |
i | 119 | kernel/math/get_put.c | i.sign = 0x80 & get_fs_byte(addr--); |
i | 120 | kernel/math/get_put.c | i.a = i.b = 0; |
i | 123 | kernel/math/get_put.c | MUL10(i.a, i.b); |
i | 124 | kernel/math/get_put.c | ADD64((c>>4), i.a, i.b); |
i | 125 | kernel/math/get_put.c | MUL10(i.a, i.b); |
i | 126 | kernel/math/get_put.c | ADD64((c&0xf), i.a, i.b); |
i | 128 | kernel/math/get_put.c | int_to_real(&i,tmp); |
i | 223 | kernel/math/get_put.c | temp_int i; |
i | 228 | kernel/math/get_put.c | real_to_int(tmp,&i); |
i | 229 | kernel/math/get_put.c | if (i.sign) |
i | 234 | kernel/math/get_put.c | DIV10(i.a,i.b,rem); |
i | 236 | kernel/math/get_put.c | DIV10(i.a,i.b,rem); |
i | 48 | kernel/math/mul.c | int i,sign; |
i | 52 | kernel/math/mul.c | i = (src1->exponent & 0x7fff) + (src2->exponent & 0x7fff) - 16383 + 1; |
i | 53 | kernel/math/mul.c | if (i<0) { |
i | 58 | kernel/math/mul.c | if (i>0x7fff) { |
i | 64 | kernel/math/mul.c | while (i && tmp[3] >= 0) { |
i | 65 | kernel/math/mul.c | i--; |
i | 69 | kernel/math/mul.c | i = 0; |
i | 70 | kernel/math/mul.c | result->exponent = i | sign; |
i | 24 | kernel/printk.c | int i; |
i | 27 | kernel/printk.c | i=vsprintf(buf,fmt,args); |
i | 30 | kernel/printk.c | return i; |
i | 38 | kernel/ptrace.c | int i; |
i | 40 | kernel/ptrace.c | for (i = 0; i < NR_TASKS; i++) { |
i | 41 | kernel/ptrace.c | if (task[i] != NULL && (task[i]->pid == pid)) |
i | 42 | kernel/ptrace.c | return i; |
i | 30 | kernel/sched.c | int i,j = 4096-sizeof(struct task_struct); |
i | 34 | kernel/sched.c | i=0; |
i | 35 | kernel/sched.c | while (i<j && !((char *)(p+1))[i]) |
i | 36 | kernel/sched.c | i++; |
i | 37 | kernel/sched.c | printk("%d/%d chars free in kstack\n\r",i,j); |
i | 49 | kernel/sched.c | int i; |
i | 52 | kernel/sched.c | for (i=0 ; i<NR_TASKS ; i++) |
i | 53 | kernel/sched.c | if (task[i]) |
i | 54 | kernel/sched.c | show_task(i,task[i]); |
i | 122 | kernel/sched.c | int i,next,c; |
i | 148 | kernel/sched.c | i = NR_TASKS; |
i | 150 | kernel/sched.c | while (--i) { |
i | 154 | kernel/sched.c | c = (*p)->counter, next = i; |
i | 276 | kernel/sched.c | int i; |
i | 279 | kernel/sched.c | for (i=0 ; i<4 ; i++,mask <<= 1) { |
i | 282 | kernel/sched.c | if (mon_timer[i]) { |
i | 283 | kernel/sched.c | if (!--mon_timer[i]) |
i | 284 | kernel/sched.c | wake_up(i+wait_motor); |
i | 285 | kernel/sched.c | } else if (!moff_timer[i]) { |
i | 289 | kernel/sched.c | moff_timer[i]--; |
i | 431 | kernel/sched.c | int i; |
i | 439 | kernel/sched.c | for(i=1 ; i<NR_TASKS ; i++) { |
i | 440 | kernel/sched.c | task[i] = NULL; |
i | 70 | kernel/signal.c | int i; |
i | 73 | kernel/signal.c | for (i=0 ; i< sizeof(struct sigaction) ; i++) { |
i | 82 | kernel/signal.c | int i; |
i | 84 | kernel/signal.c | for (i=0 ; i< sizeof(struct sigaction) ; i++) |
i | 185 | kernel/sys.c | int i; |
i | 187 | kernel/sys.c | i = CURRENT_TIME; |
i | 190 | kernel/sys.c | put_fs_long(i,(unsigned long *)tloc); |
i | 192 | kernel/sys.c | return i; |
i | 296 | kernel/sys.c | int i; |
i | 304 | kernel/sys.c | for (i=0 ; i<NR_TASKS ; i++) |
i | 305 | kernel/sys.c | if (task[i] && (task[i]->pid == pid) && |
i | 306 | kernel/sys.c | ((task[i]->p_pptr == current) || |
i | 307 | kernel/sys.c | (task[i] == current))) { |
i | 308 | kernel/sys.c | if (task[i]->leader) |
i | 310 | kernel/sys.c | if ((task[i]->session != current->session) || |
i | 314 | kernel/sys.c | task[i]->pgrp = pgid; |
i | 340 | kernel/sys.c | int i; |
i | 345 | kernel/sys.c | for (i = 0; (i < NGROUPS) && (current->groups[i] != NOGROUP); |
i | 346 | kernel/sys.c | i++, grouplist++) { |
i | 348 | kernel/sys.c | if (i >= gidsetsize) |
i | 350 | kernel/sys.c | put_fs_word(current->groups[i], (short *) grouplist); |
i | 353 | kernel/sys.c | return(i); |
i | 358 | kernel/sys.c | int i; |
i | 364 | kernel/sys.c | for (i = 0; i < gidsetsize; i++, grouplist++) { |
i | 365 | kernel/sys.c | current->groups[i] = get_fs_word((unsigned short *) grouplist); |
i | 367 | kernel/sys.c | if (i < NGROUPS) |
i | 368 | kernel/sys.c | current->groups[i] = NOGROUP; |
i | 374 | kernel/sys.c | int i; |
i | 379 | kernel/sys.c | for (i = 0; i < NGROUPS; i++) { |
i | 380 | kernel/sys.c | if (current->groups[i] == NOGROUP) |
i | 382 | kernel/sys.c | if (current->groups[i] == grp) |
i | 394 | kernel/sys.c | int i; |
i | 399 | kernel/sys.c | for(i=0;i<sizeof *name;i++) |
i | 400 | kernel/sys.c | put_fs_byte(((char *) &thisname)[i],i+(char *) name); |
i | 409 | kernel/sys.c | int i; |
i | 415 | kernel/sys.c | for (i=0; i < len; i++) { |
i | 416 | kernel/sys.c | if ((thisname.nodename[i] = get_fs_byte(name+i)) == 0) |
i | 419 | kernel/sys.c | if (thisname.nodename[i]) { |
i | 420 | kernel/sys.c | thisname.nodename[i>MAXHOSTNAMELEN ? MAXHOSTNAMELEN : i] = 0; |
i | 68 | kernel/traps.c | int i; |
i | 78 | kernel/traps.c | for (i=0;i<4;i++) |
i | 79 | kernel/traps.c | printk("%p ",get_seg_long(0x17,i+(long *)esp[3])); |
i | 82 | kernel/traps.c | str(i); |
i | 83 | kernel/traps.c | printk("Pid: %d, process nr: %d\n\r",current->pid,0xffff & i); |
i | 84 | kernel/traps.c | for(i=0;i<10;i++) |
i | 85 | kernel/traps.c | printk("%02x ",0xff & get_seg_byte(esp[1],(i+(char *)esp[0]))); |
i | 179 | kernel/traps.c | int i; |
i | 199 | kernel/traps.c | for (i=18;i<48;i++) |
i | 200 | kernel/traps.c | set_trap_gate(i,&reserved); |
i | 20 | kernel/vsprintf.c | int i=0; |
i | 23 | kernel/vsprintf.c | i = i*10 + *((*s)++) - '0'; |
i | 24 | kernel/vsprintf.c | return i; |
i | 45 | kernel/vsprintf.c | int i; |
i | 61 | kernel/vsprintf.c | i=0; |
i | 63 | kernel/vsprintf.c | tmp[i++]='0'; |
i | 65 | kernel/vsprintf.c | tmp[i++]=digits[do_div(num,base)]; |
i | 66 | kernel/vsprintf.c | if (i>precision) precision=i; |
i | 83 | kernel/vsprintf.c | while(i<precision--) |
i | 85 | kernel/vsprintf.c | while(i-->0) |
i | 86 | kernel/vsprintf.c | *str++ = tmp[i]; |
i | 95 | kernel/vsprintf.c | int i; |
i | 180 | kernel/vsprintf.c | for (i = 0; i < len; ++i) |
i | 100 | lib/malloc.c | int i; |
i | 105 | lib/malloc.c | for (i = PAGE_SIZE/sizeof(struct bucket_desc); i > 1; i--) { |
i | 148 | lib/malloc.c | int i; |
i | 160 | lib/malloc.c | for (i=PAGE_SIZE/bdir->size; i > 1; i--) { |
i | 566 | mm/memory.c | int i; |
i | 579 | mm/memory.c | for (i=0; i < (*p)->numlibraries; i++) |
i | 580 | mm/memory.c | if (inode == (*p)->libraries[i].library) |
i | 582 | mm/memory.c | if (i >= (*p)->numlibraries) |
i | 598 | mm/memory.c | int block,i; |
i | 602 | mm/memory.c | for (i = 0; i < CHECK_LAST_NR; i++) |
i | 603 | mm/memory.c | if ((address & 0xfffff000) == last_pages[i]) { |
i | 644 | mm/memory.c | i = tsk->numlibraries; |
i | 645 | mm/memory.c | while (i-- > 0) { |
i | 646 | mm/memory.c | if (tmp < (tsk->libraries[i].start + |
i | 647 | mm/memory.c | tsk->libraries[i].length)) { |
i | 648 | mm/memory.c | inode = tsk->libraries[i].library; |
i | 649 | mm/memory.c | block = 1 + (tmp - tsk->libraries[i].start) / |
i | 678 | mm/memory.c | for (i=0 ; i<4 ; block++,i++) |
i | 679 | mm/memory.c | nr[i] = bmap(inode,block); |
i | 681 | mm/memory.c | i = tmp + 4096 - tsk->end_data; |
i | 682 | mm/memory.c | if (i>4095) |
i | 683 | mm/memory.c | i = 0; |
i | 685 | mm/memory.c | while (i-- > 0) { |
i | 697 | mm/memory.c | int i; |
i | 702 | mm/memory.c | for (i=0 ; i<PAGING_PAGES ; i++) |
i | 703 | mm/memory.c | mem_map[i] = USED; |
i | 704 | mm/memory.c | i = MAP_NR(start_mem); |
i | 708 | mm/memory.c | mem_map[i++]=0; |
i | 713 | mm/memory.c | int i,j,k,free=0,total=0; |
i | 718 | mm/memory.c | for(i=0 ; i<PAGING_PAGES ; i++) { |
i | 719 | mm/memory.c | if (mem_map[i] == USED) |
i | 722 | mm/memory.c | if (!mem_map[i]) |
i | 725 | mm/memory.c | shared += mem_map[i]-1; |
i | 730 | mm/memory.c | for(i=4 ; i<1024 ;) { |
i | 731 | mm/memory.c | if (1&pg_dir[i]) { |
i | 732 | mm/memory.c | if (pg_dir[i]>HIGH_MEMORY) { |
i | 734 | mm/memory.c | i,pg_dir[i]); |
i | 735 | mm/memory.c | i++; |
i | 738 | mm/memory.c | if (pg_dir[i]>LOW_MEM) |
i | 740 | mm/memory.c | pg_tbl=(unsigned long *) (0xfffff000 & pg_dir[i]); |
i | 745 | mm/memory.c | i,j, pg_tbl[j]); |
i | 749 | mm/memory.c | i++; |
i | 750 | mm/memory.c | if (!(i&15) && k) { |
i | 752 | mm/memory.c | printk("Process %d: %d pages\n\r",(i>>4)-1,k); |
i | 44 | mm/swap.c | int i; |
i | 52 | mm/swap.c | for (i = 0; i < 4; i++) |
i | 53 | mm/swap.c | if (!(zones[i] = bmap(swap_file,nr++))) { |
i | 252 | mm/swap.c | int i,j; |
i | 291 | mm/swap.c | for (i = 1 ; i < SWAP_BITS ; i++) |
i | 292 | mm/swap.c | if (bit(swap_bitmap,i)) |
i | 59 | tools/build.c | int i,c,id; |
i | 89 | tools/build.c | for (i=0;i<sizeof buf; i++) buf[i]=0; |
i | 106 | tools/build.c | i=read(id,buf,sizeof buf); |
i | 107 | tools/build.c | fprintf(stderr,"Boot sector %d bytes.\n",i); |
i | 108 | tools/build.c | if (i != 512) |
i | 114 | tools/build.c | i=write(1,buf,512); |
i | 115 | tools/build.c | if (i!=512) |
i | 135 | tools/build.c | for (i=0 ; (c=read(id,buf,sizeof buf))>0 ; i+=c ) |
i | 139 | tools/build.c | if (i > SETUP_SECTS*512) |
i | 142 | tools/build.c | fprintf(stderr,"Setup is %d bytes.\n",i); |
i | 145 | tools/build.c | while (i<SETUP_SECTS*512) { |
i | 146 | tools/build.c | c = SETUP_SECTS*512-i; |
i | 151 | tools/build.c | i += c; |
i | 160 | tools/build.c | for (i=0 ; (c=read(id,buf,sizeof buf))>0 ; i+=c ) |
i | 164 | tools/build.c | fprintf(stderr,"System is %d bytes.\n",i); |
i | 165 | tools/build.c | if (i > SYS_SIZE*16) |