📄 496.html
字号:
<html>
<head>
<title>i</title>
<meta name='robots' content='noindex,nofollow'>
<meta name='generator' content='GLOBAL-5.4.1'>
</head>
<body text='#191970' bgcolor='#f5f5dc' vlink='gray'>
<pre>
<a href='../S/4.html#L103'>i</a> 103 fs/bitmap.c int i, j;
<a href='../S/4.html#L110'>i</a> 110 fs/bitmap.c for (i = 0; i < 8; i++)
<a href='../S/4.html#L111'>i</a> 111 fs/bitmap.c if (bh = sb->s_zmap[i])
<a href='../S/4.html#L116'>i</a> 116 fs/bitmap.c if (i >= 8 || !bh || j >= 8192)
<a href='../S/4.html#L124'>i</a> 124 fs/bitmap.c j += i * 8192 + sb->s_firstdatazone - 1;
<a href='../S/4.html#L190'>i</a> 190 fs/bitmap.c int i, j;
<a href='../S/4.html#L200'>i</a> 200 fs/bitmap.c for (i = 0; i < 8; i++)
<a href='../S/4.html#L201'>i</a> 201 fs/bitmap.c if (bh = sb->s_imap[i])
<a href='../S/4.html#L205'>i</a> 205 fs/bitmap.c if (!bh || j >= 8192 || j + i * 8192 > sb->s_ninodes)
<a href='../S/4.html#L222'>i</a> 222 fs/bitmap.c inode->i_num = j + i * 8192; // 对应设备中的i 节点号。
<a href='../S/6.html#L76'>i</a> 76 fs/buffer.c int i;
<a href='../S/6.html#L82'>i</a> 82 fs/buffer.c for (i = 0; i < NR_BUFFERS; i++, bh++)
<a href='../S/6.html#L95'>i</a> 95 fs/buffer.c int i;
<a href='../S/6.html#L99'>i</a> 99 fs/buffer.c for (i = 0; i < NR_BUFFERS; i++, bh++)
<a href='../S/6.html#L109'>i</a> 109 fs/buffer.c for (i = 0; i < NR_BUFFERS; i++, bh++)
<a href='../S/6.html#L125'>i</a> 125 fs/buffer.c int i;
<a href='../S/6.html#L129'>i</a> 129 fs/buffer.c for (i = 0; i < NR_BUFFERS; i++, bh++)
<a href='../S/6.html#L167'>i</a> 167 fs/buffer.c int i;
<a href='../S/6.html#L177'>i</a> 177 fs/buffer.c for (i = 0; i < NR_SUPER; i++)
<a href='../S/6.html#L178'>i</a> 178 fs/buffer.c if (super_block[i].s_dev == dev)
<a href='../S/6.html#L179'>i</a> 179 fs/buffer.c put_super (super_block[i].s_dev);
<a href='../S/6.html#L442'>i</a> 442 fs/buffer.c int i;
<a href='../S/6.html#L445'>i</a> 445 fs/buffer.c for (i = 0; i < 4; i++)
<a href='../S/6.html#L446'>i</a> 446 fs/buffer.c if (b[i])
<a href='../S/6.html#L449'>i</a> 449 fs/buffer.c if (bh[i] = getblk (dev, b[i]))
<a href='../S/6.html#L450'>i</a> 450 fs/buffer.c if (!bh[i]->b_uptodate)
<a href='../S/6.html#L451'>i</a> 451 fs/buffer.c ll_rw_block (READ, bh[i]);
<a href='../S/6.html#L454'>i</a> 454 fs/buffer.c bh[i] = NULL;
<a href='../S/6.html#L456'>i</a> 456 fs/buffer.c for (i = 0; i < 4; i++, address += BLOCK_SIZE)
<a href='../S/6.html#L457'>i</a> 457 fs/buffer.c if (bh[i])
<a href='../S/6.html#L459'>i</a> 459 fs/buffer.c wait_on_buffer (bh[i]); // 等待缓冲区解锁(如果已被上锁的话)。
<a href='../S/6.html#L460'>i</a> 460 fs/buffer.c if (bh[i]->b_uptodate) // 如果该缓冲区中数据有效的话，则复制。
<a href='../S/6.html#L461'>i</a> 461 fs/buffer.c COPYBLK ((unsigned long) bh[i]->b_data, address);
<a href='../S/6.html#L462'>i</a> 462 fs/buffer.c brelse (bh[i]); // 释放该缓冲区。
<a href='../S/6.html#L519'>i</a> 519 fs/buffer.c int i;
<a href='../S/6.html#L556'>i</a> 556 fs/buffer.c for (i = 0; i < NR_HASH; i++)
<a href='../S/6.html#L557'>i</a> 557 fs/buffer.c hash_table[i] = NULL;
<a href='../S/8.html#L117'>i</a> 117 fs/exec.c int i = 0;
<a href='../S/8.html#L122'>i</a> 122 fs/exec.c i++;
<a href='../S/8.html#L124'>i</a> 124 fs/exec.c return i;
<a href='../S/8.html#L251'>i</a> 251 fs/exec.c int i;
<a href='../S/8.html#L272'>i</a> 272 fs/exec.c for (i = MAX_ARG_PAGES - 1; i >= 0; i--)
<a href='../S/8.html#L275'>i</a> 275 fs/exec.c if (page[i]) // 如果该页面存在，
<a href='../S/8.html#L276'>i</a> 276 fs/exec.c put_page (page[i], data_base); // 就放置该页面。
<a href='../S/8.html#L301'>i</a> 301 fs/exec.c int i, argc, envc;
<a href='../S/8.html#L312'>i</a> 312 fs/exec.c for (i = 0; i < MAX_ARG_PAGES; i++) /* clear page-table */
<a href='../S/8.html#L313'>i</a> 313 fs/exec.c page[i] = 0;
<a href='../S/8.html#L329'>i</a> 329 fs/exec.c i = inode->i_mode;
<a href='../S/8.html#L330'>i</a> 330 fs/exec.c e_uid = (i & S_ISUID) ? inode->i_uid : current->euid;
<a href='../S/8.html#L331'>i</a> 331 fs/exec.c e_gid = (i & S_ISGID) ? inode->i_gid : current->egid;
<a href='../S/8.html#L333'>i</a> 333 fs/exec.c i >>= 6;
<a href='../S/8.html#L335'>i</a> 335 fs/exec.c i >>= 3;
<a href='../S/8.html#L336'>i</a> 336 fs/exec.c if (!(i & 1) && !((inode->i_mode & 0111) && suser ()))
<a href='../S/8.html#L501'>i</a> 501 fs/exec.c for (i = 0; i < 32; i++)
<a href='../S/8.html#L502'>i</a> 502 fs/exec.c current->sigaction[i].sa_handler = NULL;
<a href='../S/8.html#L504'>i</a> 504 fs/exec.c for (i = 0; i < NR_OPEN; i++)
<a href='../S/8.html#L505'>i</a> 505 fs/exec.c if ((current->close_on_exec >> i) & 1)
<a href='../S/8.html#L506'>i</a> 506 fs/exec.c sys_close (i);
<a href='../S/8.html#L530'>i</a> 530 fs/exec.c i = ex.a_text + ex.a_data;
<a href='../S/8.html#L531'>i</a> 531 fs/exec.c while (i & 0xfff)
<a href='../S/8.html#L532'>i</a> 532 fs/exec.c put_fs_byte (0, (char *) (i++));
<a href='../S/8.html#L542'>i</a> 542 fs/exec.c for (i = 0; i < MAX_ARG_PAGES; i++)
<a href='../S/8.html#L543'>i</a> 543 fs/exec.c free_page (page[i]);
<a href='../S/10.html#L81'>i</a> 81 fs/file_dev.c int i = 0;
<a href='../S/10.html#L97'>i</a> 97 fs/file_dev.c while (i < count)
<a href='../S/10.html#L114'>i</a> 114 fs/file_dev.c if (c > count - i)
<a href='../S/10.html#L115'>i</a> 115 fs/file_dev.c c = count - i;
<a href='../S/10.html#L126'>i</a> 126 fs/file_dev.c i += c;
<a href='../S/10.html#L141'>i</a> 141 fs/file_dev.c return (i ? i : -1);
<a href='../S/12.html#L58'>i</a> 58 fs/inode.c int i;
<a href='../S/12.html#L62'>i</a> 62 fs/inode.c for (i = 0; i < NR_INODE; i++, inode++)
<a href='../S/12.html#L79'>i</a> 79 fs/inode.c int i;
<a href='../S/12.html#L83'>i</a> 83 fs/inode.c for (i = 0; i < NR_INODE; i++, inode++)
<a href='../S/12.html#L99'>i</a> 99 fs/inode.c int i;
<a href='../S/12.html#L141'>i</a> 141 fs/inode.c i = ((unsigned short *) (bh->b_data))[block];
<a href='../S/12.html#L144'>i</a> 144 fs/inode.c if (create && !i)
<a href='../S/12.html#L145'>i</a> 145 fs/inode.c if (i = new_block (inode->i_dev))
<a href='../S/12.html#L147'>i</a> 147 fs/inode.c ((unsigned short *) (bh->b_data))[block] = i;
<a href='../S/12.html#L152'>i</a> 152 fs/inode.c return i;
<a href='../S/12.html#L172'>i</a> 172 fs/inode.c i = ((unsigned short *) bh->b_data)[block >> 9];
<a href='../S/12.html#L176'>i</a> 176 fs/inode.c if (create && !i)
<a href='../S/12.html#L177'>i</a> 177 fs/inode.c if (i = new_block (inode->i_dev))
<a href='../S/12.html#L179'>i</a> 179 fs/inode.c ((unsigned short *) (bh->b_data))[block >> 9] = i;
<a href='../S/12.html#L184'>i</a> 184 fs/inode.c if (!i)
<a href='../S/12.html#L187'>i</a> 187 fs/inode.c if (!(bh = bread (inode->i_dev, i)))
<a href='../S/12.html#L190'>i</a> 190 fs/inode.c i = ((unsigned short *) bh->b_data)[block & 511];
<a href='../S/12.html#L194'>i</a> 194 fs/inode.c if (create && !i)
<a href='../S/12.html#L195'>i</a> 195 fs/inode.c if (i = new_block (inode->i_dev))
<a href='../S/12.html#L197'>i</a> 197 fs/inode.c ((unsigned short *) (bh->b_data))[block & 511] = i;
<a href='../S/12.html#L202'>i</a> 202 fs/inode.c return i;
<a href='../S/12.html#L287'>i</a> 287 fs/inode.c int i;
<a href='../S/12.html#L293'>i</a> 293 fs/inode.c for (i = NR_INODE; i; i--)
<a href='../S/12.html#L310'>i</a> 310 fs/inode.c for (i = 0; i < NR_INODE; i++)
<a href='../S/12.html#L311'>i</a> 311 fs/inode.c printk ("%04x: %6d\t", inode_table[i].i_dev,
<a href='../S/12.html#L312'>i</a> 312 fs/inode.c inode_table[i].i_num);
<a href='../S/12.html#L386'>i</a> 386 fs/inode.c int i;
<a href='../S/12.html#L390'>i</a> 390 fs/inode.c for (i = 0; i < NR_SUPER; i++)
<a href='../S/12.html#L391'>i</a> 391 fs/inode.c if (super_block[i].s_imount == inode)
<a href='../S/12.html#L393'>i</a> 393 fs/inode.c if (i >= NR_SUPER)
<a href='../S/12.html#L403'>i</a> 403 fs/inode.c dev = super_block[i].s_dev;
<a href='../S/14.html#L145'>i</a> 145 fs/namei.c int block, i;
<a href='../S/14.html#L201'>i</a> 201 fs/namei.c i = 0;
<a href='../S/14.html#L203'>i</a> 203 fs/namei.c while (i < entries)
<a href='../S/14.html#L212'>i</a> 212 fs/namei.c if (!(block = bmap (*dir, i / DIR_ENTRIES_PER_BLOCK)) ||
<a href='../S/14.html#L215'>i</a> 215 fs/namei.c i += DIR_ENTRIES_PER_BLOCK;
<a href='../S/14.html#L228'>i</a> 228 fs/namei.c i++;
<a href='../S/14.html#L261'>i</a> 261 fs/namei.c int block, i;
<a href='../S/14.html#L286'>i</a> 286 fs/namei.c i = 0;
<a href='../S/14.html#L296'>i</a> 296 fs/namei.c block = create_block (dir, i / DIR_ENTRIES_PER_BLOCK);
<a href='../S/14.html#L302'>i</a> 302 fs/namei.c i += DIR_ENTRIES_PER_BLOCK;
<a href='../S/14.html#L312'>i</a> 312 fs/namei.c if (i * sizeof (struct dir_entry) >= dir->i_size)
<a href='../S/14.html#L315'>i</a> 315 fs/namei.c dir->i_size = (i + 1) * sizeof (struct dir_entry);
<a href='../S/14.html#L325'>i</a> 325 fs/namei.c for (i = 0; i < NAME_LEN; i++)
<a href='../S/14.html#L326'>i</a> 326 fs/namei.c de->name[i] = (i < namelen) ? get_fs_byte (name + i) : 0;
<a href='../S/14.html#L333'>i</a> 333 fs/namei.c i++;
<a href='../S/15.html#L218'>i</a> 218 fs/open.c int i, fd;
<a href='../S/15.html#L233'>i</a> 233 fs/open.c for (i = 0; i < NR_FILE; i++, f++)
<a href='../S/15.html#L236'>i</a> 236 fs/open.c if (i >= NR_FILE)
<a href='../S/15.html#L241'>i</a> 241 fs/open.c if ((i = open_namei (filename, flag, mode, &inode)) < 0)
<a href='../S/15.html#L245'>i</a> 245 fs/open.c return i;
<a href='../S/16.html#L113'>i</a> 113 fs/pipe.c int i, j;
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -