⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 496.html

📁 linux 0.11中文版 有注释
💻 HTML
📖 第 1 页 / 共 3 页
字号:
<a href='../S/16.html#L117'>i</a>                 117 fs/pipe.c        for (i = 0; j &lt; 2 &amp;&amp; i &lt; NR_FILE; i++)
<a href='../S/16.html#L118'>i</a>                 118 fs/pipe.c          if (!file_table[i].f_count)
<a href='../S/16.html#L119'>i</a>                 119 fs/pipe.c            (f[j++] = i + file_table)-&gt;f_count++;
<a href='../S/16.html#L129'>i</a>                 129 fs/pipe.c        for (i = 0; j &lt; 2 &amp;&amp; i &lt; NR_OPEN; i++)
<a href='../S/16.html#L130'>i</a>                 130 fs/pipe.c          if (!current-&gt;filp[i])
<a href='../S/16.html#L132'>i</a>                 132 fs/pipe.c      	current-&gt;filp[fd[j] = i] = f[j];
<a href='../S/18.html#L22'>i</a>                  22 fs/stat.c        int i;
<a href='../S/18.html#L39'>i</a>                  39 fs/stat.c        for (i = 0; i &lt; sizeof (tmp); i++)
<a href='../S/18.html#L40'>i</a>                  40 fs/stat.c          put_fs_byte (((char *) &amp;tmp)[i], &amp;((char *) statbuf)[i]);
<a href='../S/19.html#L112'>i</a>                 112 fs/super.c       int i;
<a href='../S/19.html#L134'>i</a>                 134 fs/super.c       for (i = 0; i &lt; I_MAP_SLOTS; i++)
<a href='../S/19.html#L135'>i</a>                 135 fs/super.c         brelse (sb-&gt;s_imap[i]);
<a href='../S/19.html#L136'>i</a>                 136 fs/super.c       for (i = 0; i &lt; Z_MAP_SLOTS; i++)
<a href='../S/19.html#L137'>i</a>                 137 fs/super.c         brelse (sb-&gt;s_zmap[i]);
<a href='../S/19.html#L150'>i</a>                 150 fs/super.c       int i, block;
<a href='../S/19.html#L198'>i</a>                 198 fs/super.c       for (i = 0; i &lt; I_MAP_SLOTS; i++)
<a href='../S/19.html#L199'>i</a>                 199 fs/super.c         s-&gt;s_imap[i] = NULL;
<a href='../S/19.html#L200'>i</a>                 200 fs/super.c       for (i = 0; i &lt; Z_MAP_SLOTS; i++)
<a href='../S/19.html#L201'>i</a>                 201 fs/super.c         s-&gt;s_zmap[i] = NULL;
<a href='../S/19.html#L204'>i</a>                 204 fs/super.c       for (i = 0; i &lt; s-&gt;s_imap_blocks; i++)
<a href='../S/19.html#L205'>i</a>                 205 fs/super.c         if (s-&gt;s_imap[i] = bread (dev, block))
<a href='../S/19.html#L209'>i</a>                 209 fs/super.c       for (i = 0; i &lt; s-&gt;s_zmap_blocks; i++)
<a href='../S/19.html#L210'>i</a>                 210 fs/super.c         if (s-&gt;s_zmap[i] = bread (dev, block))
<a href='../S/19.html#L219'>i</a>                 219 fs/super.c           for (i = 0; i &lt; I_MAP_SLOTS; i++)
<a href='../S/19.html#L220'>i</a>                 220 fs/super.c     	brelse (s-&gt;s_imap[i]);
<a href='../S/19.html#L221'>i</a>                 221 fs/super.c           for (i = 0; i &lt; Z_MAP_SLOTS; i++)
<a href='../S/19.html#L222'>i</a>                 222 fs/super.c     	brelse (s-&gt;s_zmap[i]);
<a href='../S/19.html#L356'>i</a>                 356 fs/super.c       int i, free;
<a href='../S/19.html#L365'>i</a>                 365 fs/super.c       for (i = 0; i &lt; NR_FILE; i++)
<a href='../S/19.html#L366'>i</a>                 366 fs/super.c         file_table[i].f_count = 0;
<a href='../S/19.html#L396'>i</a>                 396 fs/super.c       i = p-&gt;s_nzones;
<a href='../S/19.html#L400'>i</a>                 400 fs/super.c       while (--i &gt;= 0)
<a href='../S/19.html#L401'>i</a>                 401 fs/super.c         if (!set_bit (i &amp; 8191, p-&gt;s_zmap[i &gt;&gt; 13]-&gt;b_data))
<a href='../S/19.html#L408'>i</a>                 408 fs/super.c       i = p-&gt;s_ninodes + 1;
<a href='../S/19.html#L410'>i</a>                 410 fs/super.c       while (--i &gt;= 0)
<a href='../S/19.html#L411'>i</a>                 411 fs/super.c         if (!set_bit (i &amp; 8191, p-&gt;s_imap[i &gt;&gt; 13]-&gt;b_data))
<a href='../S/20.html#L18'>i</a>                  18 fs/truncate.c    int i;
<a href='../S/20.html#L27'>i</a>                  27 fs/truncate.c        for (i = 0; i &lt; 512; i++, p++)	// 每个逻辑块上可有512 个块号。
<a href='../S/20.html#L61'>i</a>                  61 fs/truncate.c    int i;
<a href='../S/20.html#L70'>i</a>                  70 fs/truncate.c        for (i = 0; i &lt; 512; i++, p++)	// 每个逻辑块上可连接512 个二级块。
<a href='../S/20.html#L83'>i</a>                  83 fs/truncate.c    int i;
<a href='../S/20.html#L89'>i</a>                  89 fs/truncate.c    for (i = 0; i &lt; 7; i++)
<a href='../S/20.html#L90'>i</a>                  90 fs/truncate.c      if (inode-&gt;i_zone[i])
<a href='../S/20.html#L92'>i</a>                  92 fs/truncate.c  	free_block (inode-&gt;i_dev, inode-&gt;i_zone[i]);
<a href='../S/20.html#L93'>i</a>                  93 fs/truncate.c  	inode-&gt;i_zone[i] = 0;
<a href='../S/52.html#L210'>i</a>                 210 init/main.c      int i;
<a href='../S/52.html#L213'>i</a>                 213 init/main.c        write (1, printbuf, i = vsprintf (printbuf, fmt, args));
<a href='../S/52.html#L215'>i</a>                 215 init/main.c        return i;
<a href='../S/52.html#L234'>i</a>                 234 init/main.c      int pid, i;
<a href='../S/52.html#L262'>i</a>                 262 init/main.c        while (pid != wait (&amp;i))
<a href='../S/52.html#L290'>i</a>                 290 init/main.c    	if (pid == wait (&amp;i))
<a href='../S/52.html#L292'>i</a>                 292 init/main.c          printf ("\n\rchild %d died with code %04x\n\r", pid, i);
<a href='../S/55.html#L330'>i</a>                 330 kernel/blk_drv/floppy.c   int i = 0, counter, status;
<a href='../S/55.html#L338'>i</a>                 338 kernel/blk_drv/floppy.c 	return i;
<a href='../S/55.html#L341'>i</a>                 341 kernel/blk_drv/floppy.c 	  if (i &gt;= MAX_REPLIES)
<a href='../S/55.html#L343'>i</a>                 343 kernel/blk_drv/floppy.c 	  reply_buffer[i++] = inb_p (FD_DATA);
<a href='../S/55.html#L589'>i</a>                 589 kernel/blk_drv/floppy.c   int i;
<a href='../S/55.html#L599'>i</a>                 599 kernel/blk_drv/floppy.c   for (i = 0; i &lt; 100; i++)	// 空操作,延迟。
<a href='../S/56.html#L110'>i</a>                 110 kernel/blk_drv/hd.c   int i, drive;
<a href='../S/56.html#L139'>i</a>                 139 kernel/blk_drv/hd.c   for (i = 0; i &lt; NR_HD; i++)
<a href='../S/56.html#L141'>i</a>                 141 kernel/blk_drv/hd.c       hd[i * 5].start_sect = 0;	// 硬盘起始扇区号。
<a href='../S/56.html#L142'>i</a>                 142 kernel/blk_drv/hd.c       hd[i * 5].nr_sects = hd_info[i].head * hd_info[i].sect * hd_info[i].cyl;	// 硬盘总扇区数。
<a href='../S/56.html#L188'>i</a>                 188 kernel/blk_drv/hd.c   for (i = NR_HD; i &lt; 2; i++)
<a href='../S/56.html#L190'>i</a>                 190 kernel/blk_drv/hd.c       hd[i * 5].start_sect = 0;
<a href='../S/56.html#L191'>i</a>                 191 kernel/blk_drv/hd.c       hd[i * 5].nr_sects = 0;
<a href='../S/56.html#L210'>i</a>                 210 kernel/blk_drv/hd.c       for (i = 1; i &lt; 5; i++, p++)
<a href='../S/56.html#L212'>i</a>                 212 kernel/blk_drv/hd.c 	  hd[i + 5 * drive].start_sect = p-&gt;start_sect;
<a href='../S/56.html#L213'>i</a>                 213 kernel/blk_drv/hd.c 	  hd[i + 5 * drive].nr_sects = p-&gt;nr_sects;
<a href='../S/56.html#L239'>i</a>                 239 kernel/blk_drv/hd.c   int i = inb_p (HD_STATUS);	// 取状态信息。
<a href='../S/56.html#L241'>i</a>                 241 kernel/blk_drv/hd.c   if ((i &amp; (BUSY_STAT | READY_STAT | WRERR_STAT | SEEK_STAT | ERR_STAT))
<a href='../S/56.html#L244'>i</a>                 244 kernel/blk_drv/hd.c   if (i &amp; 1)
<a href='../S/56.html#L245'>i</a>                 245 kernel/blk_drv/hd.c       i = inb (HD_ERROR);	// 若ERR_STAT 置位,则读取错误寄存器。
<a href='../S/56.html#L280'>i</a>                 280 kernel/blk_drv/hd.c   unsigned int i;
<a href='../S/56.html#L282'>i</a>                 282 kernel/blk_drv/hd.c   for (i = 0; i &lt; 10000; i++)	// 循环等待就绪标志位置位。
<a href='../S/56.html#L285'>i</a>                 285 kernel/blk_drv/hd.c     i = inb (HD_STATUS);	// 再取主控制器状态字节。
<a href='../S/56.html#L286'>i</a>                 286 kernel/blk_drv/hd.c     i &amp;= BUSY_STAT | READY_STAT | SEEK_STAT;	// 检测忙位、就绪位和寻道结束位。
<a href='../S/56.html#L287'>i</a>                 287 kernel/blk_drv/hd.c   if (i == READY_STAT | SEEK_STAT)	// 若仅有就绪或寻道结束标志,则返回0。
<a href='../S/56.html#L296'>i</a>                 296 kernel/blk_drv/hd.c   int i;
<a href='../S/56.html#L299'>i</a>                 299 kernel/blk_drv/hd.c   for (i = 0; i &lt; 100; i++)
<a href='../S/56.html#L304'>i</a>                 304 kernel/blk_drv/hd.c   if ((i = inb (HD_ERROR)) != 1)	// 取错误寄存器,若不等于1(无错误)则出错。
<a href='../S/56.html#L305'>i</a>                 305 kernel/blk_drv/hd.c       printk ("HD-controller reset failed: %02x\n\r", i);
<a href='../S/56.html#L392'>i</a>                 392 kernel/blk_drv/hd.c   int i, r;
<a href='../S/56.html#L442'>i</a>                 442 kernel/blk_drv/hd.c       for (i = 0; i &lt; 3000 &amp;&amp; !(r = inb_p (HD_STATUS) &amp; DRQ_STAT); i++)
<a href='../S/57.html#L223'>i</a>                 223 kernel/blk_drv/ll_rw_blk.c   int i;
<a href='../S/57.html#L225'>i</a>                 225 kernel/blk_drv/ll_rw_blk.c   for (i = 0; i &lt; NR_REQUEST; i++)
<a href='../S/57.html#L227'>i</a>                 227 kernel/blk_drv/ll_rw_blk.c       request[i].dev = -1;
<a href='../S/57.html#L228'>i</a>                 228 kernel/blk_drv/ll_rw_blk.c       request[i].next = NULL;
<a href='../S/59.html#L80'>i</a>                  80 kernel/blk_drv/ramdisk.c   int i;
<a href='../S/59.html#L87'>i</a>                  87 kernel/blk_drv/ramdisk.c   for (i = 0; i &lt; length; i++)
<a href='../S/59.html#L108'>i</a>                 108 kernel/blk_drv/ramdisk.c   int i = 1;
<a href='../S/59.html#L160'>i</a>                 160 kernel/blk_drv/ramdisk.c       printk ("\010\010\010\010\010%4dk", i);	// 打印加载块计数值。
<a href='../S/59.html#L164'>i</a>                 164 kernel/blk_drv/ramdisk.c       i++;
<a href='../S/60.html#L395'>i</a>                 395 kernel/chr_drv/console.c   int i;
<a href='../S/60.html#L397'>i</a>                 397 kernel/chr_drv/console.c   for (i = 0; i &lt;= npar; i++)
<a href='../S/60.html#L398'>i</a>                 398 kernel/chr_drv/console.c     switch (par[i])
<a href='../S/60.html#L455'>i</a>                 455 kernel/chr_drv/console.c   int i = x;
<a href='../S/60.html#L461'>i</a>                 461 kernel/chr_drv/console.c   while (i++ &lt; video_num_columns)
<a href='../S/60.html#L490'>i</a>                 490 kernel/chr_drv/console.c   int i;
<a href='../S/60.html#L497'>i</a>                 497 kernel/chr_drv/console.c   i = x;
<a href='../S/60.html#L498'>i</a>                 498 kernel/chr_drv/console.c   while (++i &lt; video_num_columns)
<a href='../S/65.html#L137'>i</a>                 137 kernel/chr_drv/tty_io.c   int i;
<a href='../S/65.html#L143'>i</a>                 143 kernel/chr_drv/tty_io.c   for (i = 0; i &lt; NR_TASKS; i++)
<a href='../S/65.html#L145'>i</a>                 145 kernel/chr_drv/tty_io.c     if (task[i] &amp;&amp; task[i]-&gt;pgrp == tty-&gt;pgrp)
<a href='../S/65.html#L146'>i</a>                 146 kernel/chr_drv/tty_io.c       task[i]-&gt;signal |= mask;
<a href='../S/66.html#L80'>i</a>                  80 kernel/chr_drv/tty_ioctl.c   int i;
<a href='../S/66.html#L85'>i</a>                  85 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; (sizeof (*termios)); i++)
<a href='../S/66.html#L86'>i</a>                  86 kernel/chr_drv/tty_ioctl.c     put_fs_byte (((char *) &amp;tty-&gt;termios)[i], i + (char *) termios);
<a href='../S/66.html#L96'>i</a>                  96 kernel/chr_drv/tty_ioctl.c   int i;
<a href='../S/66.html#L99'>i</a>                  99 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; (sizeof (*termios)); i++)
<a href='../S/66.html#L100'>i</a>                 100 kernel/chr_drv/tty_ioctl.c     ((char *) &amp;tty-&gt;termios)[i] = get_fs_byte (i + (char *) termios);
<a href='../S/66.html#L113'>i</a>                 113 kernel/chr_drv/tty_ioctl.c   int i;
<a href='../S/66.html#L126'>i</a>                 126 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; NCC; i++)
<a href='../S/66.html#L127'>i</a>                 127 kernel/chr_drv/tty_ioctl.c     tmp_termio.c_cc[i] = tty-&gt;termios.c_cc[i];
<a href='../S/66.html#L129'>i</a>                 129 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; (sizeof (*termio)); i++)
<a href='../S/66.html#L130'>i</a>                 130 kernel/chr_drv/tty_ioctl.c     put_fs_byte (((char *) &amp;tmp_termio)[i], i + (char *) termio);
<a href='../S/66.html#L146'>i</a>                 146 kernel/chr_drv/tty_ioctl.c   int i;
<a href='../S/66.html#L150'>i</a>                 150 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; (sizeof (*termio)); i++)
<a href='../S/66.html#L151'>i</a>                 151 kernel/chr_drv/tty_ioctl.c     ((char *) &amp;tmp_termio)[i] = get_fs_byte (i + (char *) termio);
<a href='../S/66.html#L160'>i</a>                 160 kernel/chr_drv/tty_ioctl.c   for (i = 0; i &lt; NCC; i++)
<a href='../S/66.html#L161'>i</a>                 161 kernel/chr_drv/tty_ioctl.c     tty-&gt;termios.c_cc[i] = tmp_termio.c_cc[i];
<a href='../S/67.html#L24'>i</a>                  24 kernel/exit.c    int i;
<a href='../S/67.html#L28'>i</a>                  28 kernel/exit.c    for (i = 1; i &lt; NR_TASKS; i++)	// 扫描任务数组,寻找指定任务。
<a href='../S/67.html#L29'>i</a>                  29 kernel/exit.c      if (task[i] == p)
<a href='../S/67.html#L31'>i</a>                  31 kernel/exit.c  	task[i] = NULL;		// 置空该任务项并释放相关内存页。
<a href='../S/67.html#L119'>i</a>                 119 kernel/exit.c    int i;
<a href='../S/67.html#L122'>i</a>                 122 kernel/exit.c      for (i = 0; i &lt; NR_TASKS; i++)
<a href='../S/67.html#L124'>i</a>                 124 kernel/exit.c  	if (!task[i])
<a href='../S/67.html#L126'>i</a>                 126 kernel/exit.c  	if (task[i]-&gt;pid != pid)
<a href='../S/67.html#L128'>i</a>                 128 kernel/exit.c  	task[i]-&gt;signal |= (1 &lt;&lt; (SIGCHLD - 1));

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -