tag | line | file | source code |
i_next | 38 | fs/inode.c | inode->i_next = first_inode; |
i_next | 40 | fs/inode.c | inode->i_next->i_prev = inode; |
i_next | 41 | fs/inode.c | inode->i_prev->i_next = inode; |
i_next | 48 | fs/inode.c | first_inode = first_inode->i_next; |
i_next | 49 | fs/inode.c | if (inode->i_next) |
i_next | 50 | fs/inode.c | inode->i_next->i_prev = inode->i_prev; |
i_next | 52 | fs/inode.c | inode->i_prev->i_next = inode->i_next; |
i_next | 53 | fs/inode.c | inode->i_next = inode->i_prev = NULL; |
i_next | 86 | fs/inode.c | inode->i_prev->i_next = inode; |
i_next | 87 | fs/inode.c | inode->i_next = first_inode; |
i_next | 88 | fs/inode.c | inode->i_next->i_prev = inode; |
i_next | 104 | fs/inode.c | inode->i_next = inode->i_prev = first_inode = inode++, i--; |
i_next | 178 | fs/inode.c | next = inode->i_next; /* clear_inode() changes the queues.. */ |
i_next | 194 | fs/inode.c | for (i=0 ; i < nr_inodes ; i++, inode = inode->i_next) { |
i_next | 367 | fs/inode.c | next = inode->i_next; /* clear_inode() changes the queues.. */ |
i_next | 385 | fs/inode.c | for(i = 0; i < nr_inodes*2; i++, inode = inode->i_next) { |
i_next | 477 | fs/inode.c | for (i = 0; i<nr_inodes; inode = inode->i_next, i++) { |
i_next | 707 | fs/nfs/nfsroot.c | nfs_inode.i_next = nfs_inode.i_prev = NULL; |
i_next | 288 | include/linux/fs.h | struct inode *i_next, *i_prev; |