| tag | line | file | source code |
| efi | 178 | fs/ext/freelists.c | struct ext_free_inode * efi; |
| efi | 213 | fs/ext/freelists.c | efi = ((struct ext_free_inode *) sb->u.ext_sb.s_firstfreeinodeblock->b_data) + |
| efi | 215 | fs/ext/freelists.c | if (!sb->u.ext_sb.s_firstfreeinodeblock || efi->count == 14) { |
| efi | 224 | fs/ext/freelists.c | efi = ((struct ext_free_inode *) bh->b_data) + |
| efi | 226 | fs/ext/freelists.c | efi->next = sb->u.ext_sb.s_firstfreeinodenumber; |
| efi | 227 | fs/ext/freelists.c | efi->count = 0; |
| efi | 231 | fs/ext/freelists.c | efi->free[efi->count++] = ino; |
| efi | 243 | fs/ext/freelists.c | struct ext_free_inode * efi; |
| efi | 255 | fs/ext/freelists.c | efi = ((struct ext_free_inode *) sb->u.ext_sb.s_firstfreeinodeblock->b_data) + |
| efi | 257 | fs/ext/freelists.c | if (efi->count) { |
| efi | 258 | fs/ext/freelists.c | j = efi->free[--efi->count]; |
| efi | 262 | fs/ext/freelists.c | printk("ext_free_inode: inode empty, skipping to %d\n", efi->next); |
| efi | 265 | fs/ext/freelists.c | if (efi->next > sb->u.ext_sb.s_ninodes) { |
| efi | 266 | fs/ext/freelists.c | printk ("efi->next = %ld\n", efi->next); |
| efi | 269 | fs/ext/freelists.c | sb->u.ext_sb.s_firstfreeinodenumber = efi->next; |
| efi | 270 | fs/ext/freelists.c | block = 2 + (((unsigned long) efi->next) - 1) / EXT_INODES_PER_BLOCK; |
| efi | 304 | fs/ext/freelists.c | struct ext_free_inode * efi; |
| efi | 311 | fs/ext/freelists.c | efi = ((struct ext_free_inode *) sb->u.ext_sb.s_firstfreeinodeblock->b_data) + |
| efi | 313 | fs/ext/freelists.c | count = efi->count + 1; |
| efi | 314 | fs/ext/freelists.c | ino = efi->next; |
| efi | 326 | fs/ext/freelists.c | efi = ((struct ext_free_inode *) bh->b_data) + |
| efi | 328 | fs/ext/freelists.c | count += efi->count + 1; |
| efi | 329 | fs/ext/freelists.c | ino = efi->next; |