Blame view
fs/jffs2/build.c
10.1 KB
1da177e4c
|
1 2 3 |
/* * JFFS2 -- Journalling Flash File System, Version 2. * |
c00c310ea
|
4 |
* Copyright © 2001-2007 Red Hat, Inc. |
1da177e4c
|
5 6 7 8 9 |
* * Created by David Woodhouse <dwmw2@infradead.org> * * For licensing information, see the file 'LICENCE' in this directory. * |
1da177e4c
|
10 11 12 13 14 15 16 17 |
*/ #include <linux/kernel.h> #include <linux/sched.h> #include <linux/slab.h> #include <linux/vmalloc.h> #include <linux/mtd/mtd.h> #include "nodelist.h" |
733802d97
|
18 19 |
static void jffs2_build_remove_unlinked_inode(struct jffs2_sb_info *, struct jffs2_inode_cache *, struct jffs2_full_dirent **); |
1da177e4c
|
20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 |
static inline struct jffs2_inode_cache * first_inode_chain(int *i, struct jffs2_sb_info *c) { for (; *i < INOCACHE_HASHSIZE; (*i)++) { if (c->inocache_list[*i]) return c->inocache_list[*i]; } return NULL; } static inline struct jffs2_inode_cache * next_inode(int *i, struct jffs2_inode_cache *ic, struct jffs2_sb_info *c) { /* More in this chain? */ if (ic->next) return ic->next; (*i)++; return first_inode_chain(i, c); } #define for_each_inode(i, c, ic) \ for (i = 0, ic = first_inode_chain(&i, (c)); \ ic; \ ic = next_inode(&i, ic, (c))) |
858119e15
|
45 |
static void jffs2_build_inode_pass1(struct jffs2_sb_info *c, |
733802d97
|
46 |
struct jffs2_inode_cache *ic) |
1da177e4c
|
47 48 |
{ struct jffs2_full_dirent *fd; |
733802d97
|
49 50 |
dbg_fsbuild("building directory inode #%u ", ic->ino); |
1da177e4c
|
51 52 53 54 55 56 |
/* For each child, increase nlink */ for(fd = ic->scan_dents; fd; fd = fd->next) { struct jffs2_inode_cache *child_ic; if (!fd->ino) continue; |
733802d97
|
57 |
/* we can get high latency here with huge directories */ |
1da177e4c
|
58 59 60 |
child_ic = jffs2_get_ino_cache(c, fd->ino); if (!child_ic) { |
733802d97
|
61 62 |
dbg_fsbuild("child \"%s\" (ino #%u) of dir ino #%u doesn't exist! ", |
1da177e4c
|
63 64 65 66 67 68 |
fd->name, fd->ino, ic->ino); jffs2_mark_node_obsolete(c, fd->raw); continue; } if (child_ic->nlink++ && fd->type == DT_DIR) { |
733802d97
|
69 70 71 72 |
JFFS2_ERROR("child dir \"%s\" (ino #%u) of dir ino #%u appears to be a hard link ", fd->name, fd->ino, ic->ino); /* TODO: What do we do about it? */ |
1da177e4c
|
73 |
} |
733802d97
|
74 75 76 |
dbg_fsbuild("increased nlink for child \"%s\" (ino #%u) ", fd->name, fd->ino); /* Can't free scan_dents so far. We might need them in pass 2 */ |
1da177e4c
|
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 |
} } /* Scan plan: - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go - Scan directory tree from top down, setting nlink in inocaches - Scan inocaches for inodes with nlink==0 */ static int jffs2_build_filesystem(struct jffs2_sb_info *c) { int ret; int i; struct jffs2_inode_cache *ic; struct jffs2_full_dirent *fd; struct jffs2_full_dirent *dead_fds = NULL; |
733802d97
|
92 93 |
dbg_fsbuild("build FS data structures "); |
1da177e4c
|
94 95 |
/* First, scan the medium and build all the inode caches with lists of physical nodes */ |
31fbdf7aa
|
96 |
c->flags |= JFFS2_SB_FLAG_SCANNING; |
1da177e4c
|
97 |
ret = jffs2_scan_medium(c); |
31fbdf7aa
|
98 |
c->flags &= ~JFFS2_SB_FLAG_SCANNING; |
1da177e4c
|
99 100 |
if (ret) goto exit; |
733802d97
|
101 102 |
dbg_fsbuild("scanned flash completely "); |
e0c8e42f8
|
103 |
jffs2_dbg_dump_block_lists_nolock(c); |
1da177e4c
|
104 |
|
733802d97
|
105 106 |
dbg_fsbuild("pass 1 starting "); |
31fbdf7aa
|
107 |
c->flags |= JFFS2_SB_FLAG_BUILDING; |
1da177e4c
|
108 109 |
/* Now scan the directory tree, increasing nlink according to every dirent found. */ for_each_inode(i, c, ic) { |
1da177e4c
|
110 111 112 113 114 |
if (ic->scan_dents) { jffs2_build_inode_pass1(c, ic); cond_resched(); } } |
1da177e4c
|
115 |
|
733802d97
|
116 117 |
dbg_fsbuild("pass 1 complete "); |
1da177e4c
|
118 119 120 121 122 123 |
/* Next, scan for inodes with nlink == 0 and remove them. If they were directories, then decrement the nlink of their children too, and repeat the scan. As that's going to be a fairly uncommon occurrence, it's not so evil to do it this way. Recursion bad. */ |
733802d97
|
124 125 |
dbg_fsbuild("pass 2 starting "); |
1da177e4c
|
126 127 |
for_each_inode(i, c, ic) { |
1da177e4c
|
128 129 |
if (ic->nlink) continue; |
182ec4eee
|
130 |
|
1da177e4c
|
131 132 |
jffs2_build_remove_unlinked_inode(c, ic, &dead_fds); cond_resched(); |
182ec4eee
|
133 |
} |
1da177e4c
|
134 |
|
733802d97
|
135 136 |
dbg_fsbuild("pass 2a starting "); |
1da177e4c
|
137 138 139 140 141 142 |
while (dead_fds) { fd = dead_fds; dead_fds = fd->next; ic = jffs2_get_ino_cache(c, fd->ino); |
1da177e4c
|
143 144 145 146 147 |
if (ic) jffs2_build_remove_unlinked_inode(c, ic, &dead_fds); jffs2_free_full_dirent(fd); } |
733802d97
|
148 149 150 151 |
dbg_fsbuild("pass 2a complete "); dbg_fsbuild("freeing temporary data structures "); |
182ec4eee
|
152 |
|
1da177e4c
|
153 154 |
/* Finally, we can scan again and free the dirent structs */ for_each_inode(i, c, ic) { |
1da177e4c
|
155 156 157 158 159 160 161 162 |
while(ic->scan_dents) { fd = ic->scan_dents; ic->scan_dents = fd->next; jffs2_free_full_dirent(fd); } ic->scan_dents = NULL; cond_resched(); } |
aa98d7cf5
|
163 |
jffs2_build_xattr_subsystem(c); |
31fbdf7aa
|
164 |
c->flags &= ~JFFS2_SB_FLAG_BUILDING; |
182ec4eee
|
165 |
|
733802d97
|
166 167 |
dbg_fsbuild("FS build complete "); |
1da177e4c
|
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 |
/* Rotate the lists by some number to ensure wear levelling */ jffs2_rotate_lists(c); ret = 0; exit: if (ret) { for_each_inode(i, c, ic) { while(ic->scan_dents) { fd = ic->scan_dents; ic->scan_dents = fd->next; jffs2_free_full_dirent(fd); } } |
aa98d7cf5
|
183 |
jffs2_clear_xattr_subsystem(c); |
1da177e4c
|
184 185 186 187 |
} return ret; } |
733802d97
|
188 189 190 |
static void jffs2_build_remove_unlinked_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, struct jffs2_full_dirent **dead_fds) |
1da177e4c
|
191 192 193 |
{ struct jffs2_raw_node_ref *raw; struct jffs2_full_dirent *fd; |
733802d97
|
194 195 |
dbg_fsbuild("removing ino #%u with nlink == zero. ", ic->ino); |
182ec4eee
|
196 |
|
1da177e4c
|
197 198 199 |
raw = ic->nodes; while (raw != (void *)ic) { struct jffs2_raw_node_ref *next = raw->next_in_ino; |
733802d97
|
200 201 |
dbg_fsbuild("obsoleting node at 0x%08x ", ref_offset(raw)); |
1da177e4c
|
202 203 204 205 206 207 |
jffs2_mark_node_obsolete(c, raw); raw = next; } if (ic->scan_dents) { int whinged = 0; |
733802d97
|
208 209 |
dbg_fsbuild("inode #%u was a directory which may have children... ", ic->ino); |
1da177e4c
|
210 211 212 213 214 215 216 217 218 |
while(ic->scan_dents) { struct jffs2_inode_cache *child_ic; fd = ic->scan_dents; ic->scan_dents = fd->next; if (!fd->ino) { /* It's a deletion dirent. Ignore it */ |
733802d97
|
219 220 |
dbg_fsbuild("child \"%s\" is a deletion dirent, skipping... ", fd->name); |
1da177e4c
|
221 222 223 |
jffs2_free_full_dirent(fd); continue; } |
733802d97
|
224 |
if (!whinged) |
1da177e4c
|
225 |
whinged = 1; |
1da177e4c
|
226 |
|
733802d97
|
227 228 |
dbg_fsbuild("removing child \"%s\", ino #%u ", fd->name, fd->ino); |
182ec4eee
|
229 |
|
1da177e4c
|
230 231 |
child_ic = jffs2_get_ino_cache(c, fd->ino); if (!child_ic) { |
733802d97
|
232 233 234 |
dbg_fsbuild("cannot remove child \"%s\", ino #%u, because it doesn't exist ", fd->name, fd->ino); |
1da177e4c
|
235 236 237 |
jffs2_free_full_dirent(fd); continue; } |
182ec4eee
|
238 |
/* Reduce nlink of the child. If it's now zero, stick it on the |
1da177e4c
|
239 240 241 |
dead_fds list to be cleaned up later. Else just free the fd */ child_ic->nlink--; |
182ec4eee
|
242 |
|
1da177e4c
|
243 |
if (!child_ic->nlink) { |
733802d97
|
244 245 246 |
dbg_fsbuild("inode #%u (\"%s\") has now got zero nlink, adding to dead_fds list. ", fd->ino, fd->name); |
1da177e4c
|
247 248 249 |
fd->next = *dead_fds; *dead_fds = fd; } else { |
733802d97
|
250 251 252 |
dbg_fsbuild("inode #%u (\"%s\") has now got nlink %d. Ignoring. ", fd->ino, fd->name, child_ic->nlink); |
1da177e4c
|
253 254 255 256 257 258 |
jffs2_free_full_dirent(fd); } } } /* |
182ec4eee
|
259 |
We don't delete the inocache from the hash list and free it yet. |
1da177e4c
|
260 261 262 263 264 265 266 267 268 269 270 271 |
The erase code will do that, when all the nodes are completely gone. */ } static void jffs2_calc_trigger_levels(struct jffs2_sb_info *c) { uint32_t size; /* Deletion should almost _always_ be allowed. We're fairly buggered once we stop allowing people to delete stuff because there's not enough free space... */ c->resv_blocks_deletion = 2; |
182ec4eee
|
272 |
/* Be conservative about how much space we need before we allow writes. |
1da177e4c
|
273 274 275 276 277 278 279 280 281 282 283 284 285 |
On top of that which is required for deletia, require an extra 2% of the medium to be available, for overhead caused by nodes being split across blocks, etc. */ size = c->flash_size / 50; /* 2% of flash size */ size += c->nr_blocks * 100; /* And 100 bytes per eraseblock */ size += c->sector_size - 1; /* ... and round up */ c->resv_blocks_write = c->resv_blocks_deletion + (size / c->sector_size); /* When do we let the GC thread run in the background */ c->resv_blocks_gctrigger = c->resv_blocks_write + 1; |
182ec4eee
|
286 |
/* When do we allow garbage collection to merge nodes to make |
1da177e4c
|
287 288 289 290 291 292 293 294 295 296 |
long-term progress at the expense of short-term space exhaustion? */ c->resv_blocks_gcmerge = c->resv_blocks_deletion + 1; /* When do we allow garbage collection to eat from bad blocks rather than actually making progress? */ c->resv_blocks_gcbad = 0;//c->resv_blocks_deletion + 2; /* If there's less than this amount of dirty space, don't bother trying to GC to make more space. It'll be a fruitless task */ c->nospc_dirty_size = c->sector_size + (c->flash_size / 100); |
733802d97
|
297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 |
dbg_fsbuild("JFFS2 trigger levels (size %d KiB, block size %d KiB, %d blocks) ", c->flash_size / 1024, c->sector_size / 1024, c->nr_blocks); dbg_fsbuild("Blocks required to allow deletion: %d (%d KiB) ", c->resv_blocks_deletion, c->resv_blocks_deletion*c->sector_size/1024); dbg_fsbuild("Blocks required to allow writes: %d (%d KiB) ", c->resv_blocks_write, c->resv_blocks_write*c->sector_size/1024); dbg_fsbuild("Blocks required to quiesce GC thread: %d (%d KiB) ", c->resv_blocks_gctrigger, c->resv_blocks_gctrigger*c->sector_size/1024); dbg_fsbuild("Blocks required to allow GC merges: %d (%d KiB) ", c->resv_blocks_gcmerge, c->resv_blocks_gcmerge*c->sector_size/1024); dbg_fsbuild("Blocks required to GC bad blocks: %d (%d KiB) ", c->resv_blocks_gcbad, c->resv_blocks_gcbad*c->sector_size/1024); dbg_fsbuild("Amount of dirty space required to GC: %d bytes ", c->nospc_dirty_size); |
182ec4eee
|
318 |
} |
1da177e4c
|
319 320 321 |
int jffs2_do_mount_fs(struct jffs2_sb_info *c) { |
c617e8424
|
322 |
int ret; |
1da177e4c
|
323 |
int i; |
d55849aa4
|
324 |
int size; |
1da177e4c
|
325 326 327 |
c->free_size = c->flash_size; c->nr_blocks = c->flash_size / c->sector_size; |
d55849aa4
|
328 |
size = sizeof(struct jffs2_eraseblock) * c->nr_blocks; |
737b7661e
|
329 |
#ifndef __ECOS |
4ce1f5621
|
330 |
if (jffs2_blocks_use_vmalloc(c)) |
d55849aa4
|
331 |
c->blocks = vmalloc(size); |
1da177e4c
|
332 |
else |
737b7661e
|
333 |
#endif |
d55849aa4
|
334 |
c->blocks = kmalloc(size, GFP_KERNEL); |
1da177e4c
|
335 336 |
if (!c->blocks) return -ENOMEM; |
d55849aa4
|
337 338 |
memset(c->blocks, 0, size); |
1da177e4c
|
339 340 341 342 |
for (i=0; i<c->nr_blocks; i++) { INIT_LIST_HEAD(&c->blocks[i].list); c->blocks[i].offset = i * c->sector_size; c->blocks[i].free_size = c->sector_size; |
1da177e4c
|
343 |
} |
1da177e4c
|
344 345 346 347 348 349 350 351 352 353 354 355 |
INIT_LIST_HEAD(&c->clean_list); INIT_LIST_HEAD(&c->very_dirty_list); INIT_LIST_HEAD(&c->dirty_list); INIT_LIST_HEAD(&c->erasable_list); INIT_LIST_HEAD(&c->erasing_list); INIT_LIST_HEAD(&c->erase_pending_list); INIT_LIST_HEAD(&c->erasable_pending_wbuf_list); INIT_LIST_HEAD(&c->erase_complete_list); INIT_LIST_HEAD(&c->free_list); INIT_LIST_HEAD(&c->bad_list); INIT_LIST_HEAD(&c->bad_used_list); c->highest_ino = 1; |
e631ddba5
|
356 |
c->summary = NULL; |
c617e8424
|
357 358 |
ret = jffs2_sum_init(c); if (ret) |
cfa72397c
|
359 |
goto out_free; |
1da177e4c
|
360 361 |
if (jffs2_build_filesystem(c)) { |
733802d97
|
362 363 |
dbg_fsbuild("build_fs failed "); |
1da177e4c
|
364 365 |
jffs2_free_ino_caches(c); jffs2_free_raw_node_refs(c); |
cfa72397c
|
366 367 |
ret = -EIO; goto out_free; |
1da177e4c
|
368 369 370 371 372 |
} jffs2_calc_trigger_levels(c); return 0; |
cfa72397c
|
373 374 375 376 377 378 379 380 381 382 |
out_free: #ifndef __ECOS if (jffs2_blocks_use_vmalloc(c)) vfree(c->blocks); else #endif kfree(c->blocks); return ret; |
1da177e4c
|
383 |
} |