Lines Matching refs:ic
34 next_inode(int *i, struct jffs2_inode_cache *ic, struct jffs2_sb_info *c)
37 if (ic->next)
38 return ic->next;
43 #define for_each_inode(i, c, ic) \
44 for (i = 0, ic = first_inode_chain(&i, (c)); \
45 ic; \
46 ic = next_inode(&i, ic, (c)))
50 struct jffs2_inode_cache *ic)
54 dbg_fsbuild("building directory inode #%u\n", ic->ino);
57 for(fd = ic->scan_dents; fd; fd = fd->next) {
67 fd->name, fd->ino, ic->ino);
75 fd->name, fd->ino, ic->ino);
78 child_ic->pino_nlink = ic->ino;
97 struct jffs2_inode_cache *ic;
118 for_each_inode(i, c, ic) {
119 if (ic->scan_dents) {
120 jffs2_build_inode_pass1(c, ic);
134 for_each_inode(i, c, ic) {
135 if (ic->pino_nlink)
138 jffs2_build_remove_unlinked_inode(c, ic, &dead_fds);
148 ic = jffs2_get_ino_cache(c, fd->ino);
150 if (ic)
151 jffs2_build_remove_unlinked_inode(c, ic, &dead_fds);
159 for_each_inode(i, c, ic) {
160 while(ic->scan_dents) {
161 fd = ic->scan_dents;
162 ic->scan_dents = fd->next;
165 ic->scan_dents = NULL;
180 for_each_inode(i, c, ic) {
181 while(ic->scan_dents) {
182 fd = ic->scan_dents;
183 ic->scan_dents = fd->next;
194 struct jffs2_inode_cache *ic,
200 dbg_fsbuild("removing ino #%u with nlink == zero.\n", ic->ino);
202 raw = ic->nodes;
203 while (raw != (void *)ic) {
210 if (ic->scan_dents) {
212 dbg_fsbuild("inode #%u was a directory which may have children...\n", ic->ino);
214 while(ic->scan_dents) {
217 fd = ic->scan_dents;
218 ic->scan_dents = fd->next;