Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * JFFS2 -- Journalling Flash File System, Version 2. | |
3 | * | |
c00c310e | 4 | * Copyright © 2001-2007 Red Hat, Inc. |
1da177e4 LT |
5 | * |
6 | * Created by David Woodhouse <dwmw2@infradead.org> | |
7 | * | |
8 | * For licensing information, see the file 'LICENCE' in this directory. | |
9 | * | |
1da177e4 LT |
10 | */ |
11 | ||
12 | #include <linux/kernel.h> | |
737b7661 | 13 | #include <linux/sched.h> |
1da177e4 LT |
14 | #include <linux/slab.h> |
15 | #include <linux/fs.h> | |
16 | #include <linux/crc32.h> | |
17 | #include <linux/pagemap.h> | |
18 | #include <linux/mtd/mtd.h> | |
19 | #include <linux/compiler.h> | |
20 | #include "nodelist.h" | |
21 | ||
1e0da3cb | 22 | /* |
df8e96f3 DW |
23 | * Check the data CRC of the node. |
24 | * | |
25 | * Returns: 0 if the data CRC is correct; | |
26 | * 1 - if incorrect; | |
25985edc | 27 | * error code if an error occurred. |
df8e96f3 DW |
28 | */ |
29 | static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) | |
30 | { | |
31 | struct jffs2_raw_node_ref *ref = tn->fn->raw; | |
32 | int err = 0, pointed = 0; | |
33 | struct jffs2_eraseblock *jeb; | |
34 | unsigned char *buffer; | |
35 | uint32_t crc, ofs, len; | |
36 | size_t retlen; | |
37 | ||
38 | BUG_ON(tn->csize == 0); | |
39 | ||
df8e96f3 DW |
40 | /* Calculate how many bytes were already checked */ |
41 | ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode); | |
92525726 | 42 | len = tn->csize; |
df8e96f3 | 43 | |
92525726 DW |
44 | if (jffs2_is_writebuffered(c)) { |
45 | int adj = ofs % c->wbuf_pagesize; | |
46 | if (likely(adj)) | |
47 | adj = c->wbuf_pagesize - adj; | |
df8e96f3 | 48 | |
92525726 DW |
49 | if (adj >= tn->csize) { |
50 | dbg_readinode("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n", | |
51 | ref_offset(ref), tn->csize, ofs); | |
52 | goto adj_acc; | |
53 | } | |
54 | ||
55 | ofs += adj; | |
56 | len -= adj; | |
57 | } | |
df8e96f3 DW |
58 | |
59 | dbg_readinode("check node at %#08x, data length %u, partial CRC %#08x, correct CRC %#08x, data starts at %#08x, start checking from %#08x - %u bytes.\n", | |
60 | ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len); | |
61 | ||
62 | #ifndef __ECOS | |
63 | /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(), | |
64 | * adding and jffs2_flash_read_end() interface. */ | |
10934478 AB |
65 | err = mtd_point(c->mtd, ofs, len, &retlen, (void **)&buffer, NULL); |
66 | if (!err && retlen < len) { | |
67 | JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize); | |
68 | mtd_unpoint(c->mtd, ofs, retlen); | |
69 | } else if (err) { | |
70 | if (err != -EOPNOTSUPP) | |
df8e96f3 | 71 | JFFS2_WARNING("MTD point failed: error code %d.\n", err); |
10934478 AB |
72 | } else |
73 | pointed = 1; /* succefully pointed to device */ | |
df8e96f3 DW |
74 | #endif |
75 | ||
76 | if (!pointed) { | |
77 | buffer = kmalloc(len, GFP_KERNEL); | |
78 | if (unlikely(!buffer)) | |
79 | return -ENOMEM; | |
80 | ||
81 | /* TODO: this is very frequent pattern, make it a separate | |
82 | * routine */ | |
83 | err = jffs2_flash_read(c, ofs, len, &retlen, buffer); | |
84 | if (err) { | |
85 | JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err); | |
86 | goto free_out; | |
87 | } | |
88 | ||
89 | if (retlen != len) { | |
90 | JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len); | |
91 | err = -EIO; | |
92 | goto free_out; | |
93 | } | |
94 | } | |
95 | ||
96 | /* Continue calculating CRC */ | |
97 | crc = crc32(tn->partial_crc, buffer, len); | |
98 | if(!pointed) | |
99 | kfree(buffer); | |
100 | #ifndef __ECOS | |
101 | else | |
7219778a | 102 | mtd_unpoint(c->mtd, ofs, len); |
df8e96f3 DW |
103 | #endif |
104 | ||
105 | if (crc != tn->data_crc) { | |
106 | JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", | |
b2e25235 | 107 | ref_offset(ref), tn->data_crc, crc); |
df8e96f3 DW |
108 | return 1; |
109 | } | |
110 | ||
111 | adj_acc: | |
112 | jeb = &c->blocks[ref->flash_offset / c->sector_size]; | |
113 | len = ref_totlen(c, jeb, ref); | |
114 | /* If it should be REF_NORMAL, it'll get marked as such when | |
115 | we build the fragtree, shortly. No need to worry about GC | |
116 | moving it while it's marked REF_PRISTINE -- GC won't happen | |
117 | till we've finished checking every inode anyway. */ | |
118 | ref->flash_offset |= REF_PRISTINE; | |
119 | /* | |
120 | * Mark the node as having been checked and fix the | |
121 | * accounting accordingly. | |
122 | */ | |
123 | spin_lock(&c->erase_completion_lock); | |
124 | jeb->used_size += len; | |
125 | jeb->unchecked_size -= len; | |
126 | c->used_size += len; | |
127 | c->unchecked_size -= len; | |
128 | jffs2_dbg_acct_paranoia_check_nolock(c, jeb); | |
129 | spin_unlock(&c->erase_completion_lock); | |
130 | ||
131 | return 0; | |
132 | ||
133 | free_out: | |
134 | if(!pointed) | |
135 | kfree(buffer); | |
136 | #ifndef __ECOS | |
137 | else | |
7219778a | 138 | mtd_unpoint(c->mtd, ofs, len); |
df8e96f3 DW |
139 | #endif |
140 | return err; | |
141 | } | |
142 | ||
143 | /* | |
144 | * Helper function for jffs2_add_older_frag_to_fragtree(). | |
145 | * | |
146 | * Checks the node if we are in the checking stage. | |
147 | */ | |
148 | static int check_tn_node(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) | |
149 | { | |
150 | int ret; | |
151 | ||
152 | BUG_ON(ref_obsolete(tn->fn->raw)); | |
153 | ||
154 | /* We only check the data CRC of unchecked nodes */ | |
155 | if (ref_flags(tn->fn->raw) != REF_UNCHECKED) | |
156 | return 0; | |
157 | ||
158 | dbg_readinode("check node %#04x-%#04x, phys offs %#08x\n", | |
159 | tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw)); | |
160 | ||
161 | ret = check_node_data(c, tn); | |
162 | if (unlikely(ret < 0)) { | |
163 | JFFS2_ERROR("check_node_data() returned error: %d.\n", | |
164 | ret); | |
165 | } else if (unlikely(ret > 0)) { | |
166 | dbg_readinode("CRC error, mark it obsolete.\n"); | |
167 | jffs2_mark_node_obsolete(c, tn->fn->raw); | |
168 | } | |
169 | ||
170 | return ret; | |
171 | } | |
172 | ||
173 | static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) | |
174 | { | |
175 | struct rb_node *next; | |
176 | struct jffs2_tmp_dnode_info *tn = NULL; | |
177 | ||
178 | dbg_readinode("root %p, offset %d\n", tn_root, offset); | |
179 | ||
180 | next = tn_root->rb_node; | |
181 | ||
182 | while (next) { | |
183 | tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb); | |
184 | ||
185 | if (tn->fn->ofs < offset) | |
186 | next = tn->rb.rb_right; | |
187 | else if (tn->fn->ofs >= offset) | |
188 | next = tn->rb.rb_left; | |
189 | else | |
190 | break; | |
191 | } | |
192 | ||
193 | return tn; | |
194 | } | |
195 | ||
196 | ||
197 | static void jffs2_kill_tn(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) | |
198 | { | |
199 | jffs2_mark_node_obsolete(c, tn->fn->raw); | |
200 | jffs2_free_full_dnode(tn->fn); | |
201 | jffs2_free_tmp_dnode_info(tn); | |
202 | } | |
203 | /* | |
204 | * This function is used when we read an inode. Data nodes arrive in | |
205 | * arbitrary order -- they may be older or newer than the nodes which | |
206 | * are already in the tree. Where overlaps occur, the older node can | |
207 | * be discarded as long as the newer passes the CRC check. We don't | |
208 | * bother to keep track of holes in this rbtree, and neither do we deal | |
209 | * with frags -- we can have multiple entries starting at the same | |
210 | * offset, and the one with the smallest length will come first in the | |
211 | * ordering. | |
212 | * | |
14c6381e | 213 | * Returns 0 if the node was handled (including marking it obsolete) |
ef53cb02 | 214 | * < 0 an if error occurred |
1da177e4 | 215 | */ |
df8e96f3 DW |
216 | static int jffs2_add_tn_to_tree(struct jffs2_sb_info *c, |
217 | struct jffs2_readinode_info *rii, | |
218 | struct jffs2_tmp_dnode_info *tn) | |
219 | { | |
220 | uint32_t fn_end = tn->fn->ofs + tn->fn->size; | |
4c41bd0e | 221 | struct jffs2_tmp_dnode_info *this, *ptn; |
df8e96f3 | 222 | |
fcf3cafb | 223 | dbg_readinode("insert fragment %#04x-%#04x, ver %u at %08x\n", tn->fn->ofs, fn_end, tn->version, ref_offset(tn->fn->raw)); |
df8e96f3 DW |
224 | |
225 | /* If a node has zero dsize, we only have to keep if it if it might be the | |
226 | node with highest version -- i.e. the one which will end up as f->metadata. | |
227 | Note that such nodes won't be REF_UNCHECKED since there are no data to | |
228 | check anyway. */ | |
229 | if (!tn->fn->size) { | |
230 | if (rii->mdata_tn) { | |
0477d24e DW |
231 | if (rii->mdata_tn->version < tn->version) { |
232 | /* We had a candidate mdata node already */ | |
233 | dbg_readinode("kill old mdata with ver %d\n", rii->mdata_tn->version); | |
234 | jffs2_kill_tn(c, rii->mdata_tn); | |
235 | } else { | |
236 | dbg_readinode("kill new mdata with ver %d (older than existing %d\n", | |
237 | tn->version, rii->mdata_tn->version); | |
238 | jffs2_kill_tn(c, tn); | |
239 | return 0; | |
240 | } | |
df8e96f3 DW |
241 | } |
242 | rii->mdata_tn = tn; | |
243 | dbg_readinode("keep new mdata with ver %d\n", tn->version); | |
244 | return 0; | |
245 | } | |
246 | ||
247 | /* Find the earliest node which _may_ be relevant to this one */ | |
248 | this = jffs2_lookup_tn(&rii->tn_root, tn->fn->ofs); | |
1c979645 DW |
249 | if (this) { |
250 | /* If the node is coincident with another at a lower address, | |
251 | back up until the other node is found. It may be relevant */ | |
4c41bd0e TG |
252 | while (this->overlapped) { |
253 | ptn = tn_prev(this); | |
254 | if (!ptn) { | |
255 | /* | |
256 | * We killed a node which set the overlapped | |
257 | * flags during the scan. Fix it up. | |
258 | */ | |
259 | this->overlapped = 0; | |
260 | break; | |
261 | } | |
262 | this = ptn; | |
263 | } | |
1c979645 DW |
264 | dbg_readinode("'this' found %#04x-%#04x (%s)\n", this->fn->ofs, this->fn->ofs + this->fn->size, this->fn ? "data" : "hole"); |
265 | } | |
df8e96f3 DW |
266 | |
267 | while (this) { | |
268 | if (this->fn->ofs > fn_end) | |
269 | break; | |
270 | dbg_readinode("Ponder this ver %d, 0x%x-0x%x\n", | |
271 | this->version, this->fn->ofs, this->fn->size); | |
272 | ||
273 | if (this->version == tn->version) { | |
274 | /* Version number collision means REF_PRISTINE GC. Accept either of them | |
275 | as long as the CRC is correct. Check the one we have already... */ | |
276 | if (!check_tn_node(c, this)) { | |
277 | /* The one we already had was OK. Keep it and throw away the new one */ | |
278 | dbg_readinode("Like old node. Throw away new\n"); | |
279 | jffs2_kill_tn(c, tn); | |
280 | return 0; | |
281 | } else { | |
282 | /* Who cares if the new one is good; keep it for now anyway. */ | |
fcf3cafb | 283 | dbg_readinode("Like new node. Throw away old\n"); |
df8e96f3 | 284 | rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); |
df8e96f3 | 285 | jffs2_kill_tn(c, this); |
fcf3cafb DW |
286 | /* Same overlapping from in front and behind */ |
287 | return 0; | |
df8e96f3 DW |
288 | } |
289 | } | |
290 | if (this->version < tn->version && | |
291 | this->fn->ofs >= tn->fn->ofs && | |
292 | this->fn->ofs + this->fn->size <= fn_end) { | |
293 | /* New node entirely overlaps 'this' */ | |
294 | if (check_tn_node(c, tn)) { | |
295 | dbg_readinode("new node bad CRC\n"); | |
296 | jffs2_kill_tn(c, tn); | |
297 | return 0; | |
298 | } | |
fcf3cafb | 299 | /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ |
1c979645 | 300 | while (this && this->fn->ofs + this->fn->size <= fn_end) { |
df8e96f3 DW |
301 | struct jffs2_tmp_dnode_info *next = tn_next(this); |
302 | if (this->version < tn->version) { | |
303 | tn_erase(this, &rii->tn_root); | |
304 | dbg_readinode("Kill overlapped ver %d, 0x%x-0x%x\n", | |
305 | this->version, this->fn->ofs, | |
306 | this->fn->ofs+this->fn->size); | |
307 | jffs2_kill_tn(c, this); | |
308 | } | |
309 | this = next; | |
310 | } | |
fcf3cafb | 311 | dbg_readinode("Done killing overlapped nodes\n"); |
1c979645 | 312 | continue; |
df8e96f3 DW |
313 | } |
314 | if (this->version > tn->version && | |
315 | this->fn->ofs <= tn->fn->ofs && | |
316 | this->fn->ofs+this->fn->size >= fn_end) { | |
317 | /* New node entirely overlapped by 'this' */ | |
318 | if (!check_tn_node(c, this)) { | |
319 | dbg_readinode("Good CRC on old node. Kill new\n"); | |
320 | jffs2_kill_tn(c, tn); | |
321 | return 0; | |
322 | } | |
323 | /* ... but 'this' was bad. Replace it... */ | |
df8e96f3 | 324 | dbg_readinode("Bad CRC on old overlapping node. Kill it\n"); |
fcf3cafb | 325 | tn_erase(this, &rii->tn_root); |
df8e96f3 | 326 | jffs2_kill_tn(c, this); |
fcf3cafb | 327 | break; |
df8e96f3 | 328 | } |
df8e96f3 DW |
329 | |
330 | this = tn_next(this); | |
331 | } | |
96dd8d25 | 332 | |
df8e96f3 | 333 | /* We neither completely obsoleted nor were completely |
96dd8d25 | 334 | obsoleted by an earlier node. Insert into the tree */ |
df8e96f3 | 335 | { |
96dd8d25 DW |
336 | struct rb_node *parent; |
337 | struct rb_node **link = &rii->tn_root.rb_node; | |
1c979645 | 338 | struct jffs2_tmp_dnode_info *insert_point = NULL; |
df8e96f3 DW |
339 | |
340 | while (*link) { | |
341 | parent = *link; | |
342 | insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); | |
343 | if (tn->fn->ofs > insert_point->fn->ofs) | |
344 | link = &insert_point->rb.rb_right; | |
345 | else if (tn->fn->ofs < insert_point->fn->ofs || | |
346 | tn->fn->size < insert_point->fn->size) | |
347 | link = &insert_point->rb.rb_left; | |
348 | else | |
349 | link = &insert_point->rb.rb_right; | |
350 | } | |
351 | rb_link_node(&tn->rb, &insert_point->rb, link); | |
352 | rb_insert_color(&tn->rb, &rii->tn_root); | |
353 | } | |
1123e2a8 | 354 | |
df8e96f3 DW |
355 | /* If there's anything behind that overlaps us, note it */ |
356 | this = tn_prev(tn); | |
357 | if (this) { | |
358 | while (1) { | |
359 | if (this->fn->ofs + this->fn->size > tn->fn->ofs) { | |
360 | dbg_readinode("Node is overlapped by %p (v %d, 0x%x-0x%x)\n", | |
361 | this, this->version, this->fn->ofs, | |
362 | this->fn->ofs+this->fn->size); | |
363 | tn->overlapped = 1; | |
364 | break; | |
365 | } | |
366 | if (!this->overlapped) | |
367 | break; | |
4c41bd0e TG |
368 | |
369 | ptn = tn_prev(this); | |
370 | if (!ptn) { | |
371 | /* | |
372 | * We killed a node which set the overlapped | |
373 | * flags during the scan. Fix it up. | |
374 | */ | |
375 | this->overlapped = 0; | |
376 | break; | |
377 | } | |
378 | this = ptn; | |
df8e96f3 DW |
379 | } |
380 | } | |
381 | ||
382 | /* If the new node overlaps anything ahead, note it */ | |
383 | this = tn_next(tn); | |
384 | while (this && this->fn->ofs < fn_end) { | |
385 | this->overlapped = 1; | |
386 | dbg_readinode("Node ver %d, 0x%x-0x%x is overlapped\n", | |
387 | this->version, this->fn->ofs, | |
388 | this->fn->ofs+this->fn->size); | |
389 | this = tn_next(this); | |
390 | } | |
391 | return 0; | |
392 | } | |
393 | ||
394 | /* Trivial function to remove the last node in the tree. Which by definition | |
395 | has no right-hand -- so can be removed just by making its only child (if | |
396 | any) take its place under its parent. */ | |
397 | static void eat_last(struct rb_root *root, struct rb_node *node) | |
1da177e4 | 398 | { |
df8e96f3 DW |
399 | struct rb_node *parent = rb_parent(node); |
400 | struct rb_node **link; | |
401 | ||
402 | /* LAST! */ | |
403 | BUG_ON(node->rb_right); | |
404 | ||
405 | if (!parent) | |
406 | link = &root->rb_node; | |
407 | else if (node == parent->rb_left) | |
408 | link = &parent->rb_left; | |
409 | else | |
410 | link = &parent->rb_right; | |
411 | ||
412 | *link = node->rb_left; | |
413 | /* Colour doesn't matter now. Only the parent pointer. */ | |
414 | if (node->rb_left) | |
415 | node->rb_left->rb_parent_color = node->rb_parent_color; | |
416 | } | |
417 | ||
418 | /* We put this in reverse order, so we can just use eat_last */ | |
419 | static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) | |
420 | { | |
421 | struct rb_node **link = &ver_root->rb_node; | |
422 | struct rb_node *parent = NULL; | |
423 | struct jffs2_tmp_dnode_info *this_tn; | |
424 | ||
425 | while (*link) { | |
426 | parent = *link; | |
427 | this_tn = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); | |
428 | ||
429 | if (tn->version > this_tn->version) | |
430 | link = &parent->rb_left; | |
f97117d1 | 431 | else |
df8e96f3 | 432 | link = &parent->rb_right; |
1e0da3cb | 433 | } |
df8e96f3 DW |
434 | dbg_readinode("Link new node at %p (root is %p)\n", link, ver_root); |
435 | rb_link_node(&tn->rb, parent, link); | |
436 | rb_insert_color(&tn->rb, ver_root); | |
437 | } | |
f97117d1 | 438 | |
df8e96f3 DW |
439 | /* Build final, normal fragtree from tn tree. It doesn't matter which order |
440 | we add nodes to the real fragtree, as long as they don't overlap. And | |
441 | having thrown away the majority of overlapped nodes as we went, there | |
442 | really shouldn't be many sets of nodes which do overlap. If we start at | |
443 | the end, we can use the overlap markers -- we can just eat nodes which | |
444 | aren't overlapped, and when we encounter nodes which _do_ overlap we | |
445 | sort them all into a temporary tree in version order before replaying them. */ | |
446 | static int jffs2_build_inode_fragtree(struct jffs2_sb_info *c, | |
447 | struct jffs2_inode_info *f, | |
448 | struct jffs2_readinode_info *rii) | |
449 | { | |
450 | struct jffs2_tmp_dnode_info *pen, *last, *this; | |
451 | struct rb_root ver_root = RB_ROOT; | |
452 | uint32_t high_ver = 0; | |
453 | ||
454 | if (rii->mdata_tn) { | |
455 | dbg_readinode("potential mdata is ver %d at %p\n", rii->mdata_tn->version, rii->mdata_tn); | |
456 | high_ver = rii->mdata_tn->version; | |
457 | rii->latest_ref = rii->mdata_tn->fn->raw; | |
458 | } | |
459 | #ifdef JFFS2_DBG_READINODE_MESSAGES | |
460 | this = tn_last(&rii->tn_root); | |
461 | while (this) { | |
462 | dbg_readinode("tn %p ver %d range 0x%x-0x%x ov %d\n", this, this->version, this->fn->ofs, | |
96dd8d25 | 463 | this->fn->ofs+this->fn->size, this->overlapped); |
df8e96f3 DW |
464 | this = tn_prev(this); |
465 | } | |
466 | #endif | |
467 | pen = tn_last(&rii->tn_root); | |
468 | while ((last = pen)) { | |
469 | pen = tn_prev(last); | |
470 | ||
471 | eat_last(&rii->tn_root, &last->rb); | |
472 | ver_insert(&ver_root, last); | |
473 | ||
4c41bd0e TG |
474 | if (unlikely(last->overlapped)) { |
475 | if (pen) | |
476 | continue; | |
477 | /* | |
478 | * We killed a node which set the overlapped | |
479 | * flags during the scan. Fix it up. | |
480 | */ | |
481 | last->overlapped = 0; | |
482 | } | |
df8e96f3 DW |
483 | |
484 | /* Now we have a bunch of nodes in reverse version | |
485 | order, in the tree at ver_root. Most of the time, | |
486 | there'll actually be only one node in the 'tree', | |
487 | in fact. */ | |
488 | this = tn_last(&ver_root); | |
489 | ||
490 | while (this) { | |
491 | struct jffs2_tmp_dnode_info *vers_next; | |
492 | int ret; | |
493 | vers_next = tn_prev(this); | |
494 | eat_last(&ver_root, &this->rb); | |
495 | if (check_tn_node(c, this)) { | |
1123e2a8 | 496 | dbg_readinode("node ver %d, 0x%x-0x%x failed CRC\n", |
df8e96f3 DW |
497 | this->version, this->fn->ofs, |
498 | this->fn->ofs+this->fn->size); | |
499 | jffs2_kill_tn(c, this); | |
500 | } else { | |
501 | if (this->version > high_ver) { | |
502 | /* Note that this is different from the other | |
503 | highest_version, because this one is only | |
504 | counting _valid_ nodes which could give the | |
505 | latest inode metadata */ | |
506 | high_ver = this->version; | |
507 | rii->latest_ref = this->fn->raw; | |
508 | } | |
1123e2a8 | 509 | dbg_readinode("Add %p (v %d, 0x%x-0x%x, ov %d) to fragtree\n", |
df8e96f3 DW |
510 | this, this->version, this->fn->ofs, |
511 | this->fn->ofs+this->fn->size, this->overlapped); | |
512 | ||
513 | ret = jffs2_add_full_dnode_to_inode(c, f, this->fn); | |
514 | if (ret) { | |
515 | /* Free the nodes in vers_root; let the caller | |
516 | deal with the rest */ | |
517 | JFFS2_ERROR("Add node to tree failed %d\n", ret); | |
518 | while (1) { | |
519 | vers_next = tn_prev(this); | |
520 | if (check_tn_node(c, this)) | |
521 | jffs2_mark_node_obsolete(c, this->fn->raw); | |
522 | jffs2_free_full_dnode(this->fn); | |
523 | jffs2_free_tmp_dnode_info(this); | |
524 | this = vers_next; | |
525 | if (!this) | |
526 | break; | |
527 | eat_last(&ver_root, &vers_next->rb); | |
528 | } | |
529 | return ret; | |
530 | } | |
531 | jffs2_free_tmp_dnode_info(this); | |
532 | } | |
533 | this = vers_next; | |
534 | } | |
535 | } | |
536 | return 0; | |
f97117d1 | 537 | } |
1da177e4 | 538 | |
f97117d1 AB |
539 | static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) |
540 | { | |
541 | struct rb_node *this; | |
542 | struct jffs2_tmp_dnode_info *tn; | |
543 | ||
544 | this = list->rb_node; | |
545 | ||
546 | /* Now at bottom of tree */ | |
547 | while (this) { | |
548 | if (this->rb_left) | |
549 | this = this->rb_left; | |
550 | else if (this->rb_right) | |
551 | this = this->rb_right; | |
552 | else { | |
553 | tn = rb_entry(this, struct jffs2_tmp_dnode_info, rb); | |
554 | jffs2_free_full_dnode(tn->fn); | |
555 | jffs2_free_tmp_dnode_info(tn); | |
556 | ||
21f1d5fc | 557 | this = rb_parent(this); |
f97117d1 AB |
558 | if (!this) |
559 | break; | |
560 | ||
561 | if (this->rb_left == &tn->rb) | |
562 | this->rb_left = NULL; | |
563 | else if (this->rb_right == &tn->rb) | |
564 | this->rb_right = NULL; | |
565 | else BUG(); | |
566 | } | |
567 | } | |
bcc54e2a | 568 | *list = RB_ROOT; |
f97117d1 | 569 | } |
1da177e4 | 570 | |
f97117d1 AB |
571 | static void jffs2_free_full_dirent_list(struct jffs2_full_dirent *fd) |
572 | { | |
573 | struct jffs2_full_dirent *next; | |
336d2ff7 | 574 | |
f97117d1 AB |
575 | while (fd) { |
576 | next = fd->next; | |
577 | jffs2_free_full_dirent(fd); | |
578 | fd = next; | |
579 | } | |
580 | } | |
1da177e4 | 581 | |
f97117d1 AB |
582 | /* Returns first valid node after 'ref'. May return 'ref' */ |
583 | static struct jffs2_raw_node_ref *jffs2_first_valid_node(struct jffs2_raw_node_ref *ref) | |
584 | { | |
585 | while (ref && ref->next_in_ino) { | |
586 | if (!ref_obsolete(ref)) | |
587 | return ref; | |
733802d9 | 588 | dbg_noderef("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref)); |
f97117d1 AB |
589 | ref = ref->next_in_ino; |
590 | } | |
591 | return NULL; | |
592 | } | |
1da177e4 | 593 | |
f97117d1 AB |
594 | /* |
595 | * Helper function for jffs2_get_inode_nodes(). | |
596 | * It is called every time an directory entry node is found. | |
597 | * | |
14c6381e | 598 | * Returns: 0 on success; |
f97117d1 AB |
599 | * negative error code on failure. |
600 | */ | |
1e0da3cb | 601 | static inline int read_direntry(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, |
df8e96f3 DW |
602 | struct jffs2_raw_dirent *rd, size_t read, |
603 | struct jffs2_readinode_info *rii) | |
f97117d1 AB |
604 | { |
605 | struct jffs2_full_dirent *fd; | |
1046d880 | 606 | uint32_t crc; |
182ec4ee | 607 | |
f97117d1 AB |
608 | /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ |
609 | BUG_ON(ref_obsolete(ref)); | |
182ec4ee | 610 | |
1046d880 DW |
611 | crc = crc32(0, rd, sizeof(*rd) - 8); |
612 | if (unlikely(crc != je32_to_cpu(rd->node_crc))) { | |
613 | JFFS2_NOTICE("header CRC failed on dirent node at %#08x: read %#08x, calculated %#08x\n", | |
614 | ref_offset(ref), je32_to_cpu(rd->node_crc), crc); | |
df8e96f3 DW |
615 | jffs2_mark_node_obsolete(c, ref); |
616 | return 0; | |
f97117d1 | 617 | } |
182ec4ee | 618 | |
1046d880 DW |
619 | /* If we've never checked the CRCs on this node, check them now */ |
620 | if (ref_flags(ref) == REF_UNCHECKED) { | |
621 | struct jffs2_eraseblock *jeb; | |
622 | int len; | |
623 | ||
624 | /* Sanity check */ | |
625 | if (unlikely(PAD((rd->nsize + sizeof(*rd))) != PAD(je32_to_cpu(rd->totlen)))) { | |
626 | JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n", | |
627 | ref_offset(ref), rd->nsize, je32_to_cpu(rd->totlen)); | |
df8e96f3 DW |
628 | jffs2_mark_node_obsolete(c, ref); |
629 | return 0; | |
1046d880 DW |
630 | } |
631 | ||
632 | jeb = &c->blocks[ref->flash_offset / c->sector_size]; | |
633 | len = ref_totlen(c, jeb, ref); | |
634 | ||
635 | spin_lock(&c->erase_completion_lock); | |
636 | jeb->used_size += len; | |
637 | jeb->unchecked_size -= len; | |
638 | c->used_size += len; | |
639 | c->unchecked_size -= len; | |
43dfa07f | 640 | ref->flash_offset = ref_offset(ref) | dirent_node_state(rd); |
1046d880 DW |
641 | spin_unlock(&c->erase_completion_lock); |
642 | } | |
643 | ||
f97117d1 AB |
644 | fd = jffs2_alloc_full_dirent(rd->nsize + 1); |
645 | if (unlikely(!fd)) | |
646 | return -ENOMEM; | |
1da177e4 | 647 | |
f97117d1 AB |
648 | fd->raw = ref; |
649 | fd->version = je32_to_cpu(rd->version); | |
650 | fd->ino = je32_to_cpu(rd->ino); | |
651 | fd->type = rd->type; | |
1da177e4 | 652 | |
df8e96f3 DW |
653 | if (fd->version > rii->highest_version) |
654 | rii->highest_version = fd->version; | |
655 | ||
f97117d1 | 656 | /* Pick out the mctime of the latest dirent */ |
df8e96f3 DW |
657 | if(fd->version > rii->mctime_ver && je32_to_cpu(rd->mctime)) { |
658 | rii->mctime_ver = fd->version; | |
659 | rii->latest_mctime = je32_to_cpu(rd->mctime); | |
1da177e4 LT |
660 | } |
661 | ||
182ec4ee | 662 | /* |
f97117d1 AB |
663 | * Copy as much of the name as possible from the raw |
664 | * dirent we've already read from the flash. | |
665 | */ | |
666 | if (read > sizeof(*rd)) | |
667 | memcpy(&fd->name[0], &rd->name[0], | |
668 | min_t(uint32_t, rd->nsize, (read - sizeof(*rd)) )); | |
182ec4ee | 669 | |
f97117d1 AB |
670 | /* Do we need to copy any more of the name directly from the flash? */ |
671 | if (rd->nsize + sizeof(*rd) > read) { | |
672 | /* FIXME: point() */ | |
673 | int err; | |
674 | int already = read - sizeof(*rd); | |
182ec4ee TG |
675 | |
676 | err = jffs2_flash_read(c, (ref_offset(ref)) + read, | |
f97117d1 AB |
677 | rd->nsize - already, &read, &fd->name[already]); |
678 | if (unlikely(read != rd->nsize - already) && likely(!err)) | |
679 | return -EIO; | |
182ec4ee | 680 | |
f97117d1 | 681 | if (unlikely(err)) { |
e0d60137 | 682 | JFFS2_ERROR("read remainder of name: error %d\n", err); |
f97117d1 AB |
683 | jffs2_free_full_dirent(fd); |
684 | return -EIO; | |
1da177e4 LT |
685 | } |
686 | } | |
182ec4ee | 687 | |
f97117d1 AB |
688 | fd->nhash = full_name_hash(fd->name, rd->nsize); |
689 | fd->next = NULL; | |
690 | fd->name[rd->nsize] = '\0'; | |
182ec4ee | 691 | |
f97117d1 AB |
692 | /* |
693 | * Wheee. We now have a complete jffs2_full_dirent structure, with | |
182ec4ee | 694 | * the name in it and everything. Link it into the list |
f97117d1 | 695 | */ |
df8e96f3 | 696 | jffs2_add_fd_to_list(c, fd, &rii->fds); |
f97117d1 | 697 | |
1da177e4 LT |
698 | return 0; |
699 | } | |
700 | ||
f97117d1 AB |
701 | /* |
702 | * Helper function for jffs2_get_inode_nodes(). | |
703 | * It is called every time an inode node is found. | |
704 | * | |
14c6381e | 705 | * Returns: 0 on success (possibly after marking a bad node obsolete); |
f97117d1 AB |
706 | * negative error code on failure. |
707 | */ | |
1e0da3cb | 708 | static inline int read_dnode(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, |
df8e96f3 DW |
709 | struct jffs2_raw_inode *rd, int rdlen, |
710 | struct jffs2_readinode_info *rii) | |
1da177e4 | 711 | { |
f97117d1 | 712 | struct jffs2_tmp_dnode_info *tn; |
1e0da3cb | 713 | uint32_t len, csize; |
14c6381e | 714 | int ret = 0; |
1046d880 | 715 | uint32_t crc; |
182ec4ee | 716 | |
f97117d1 AB |
717 | /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ |
718 | BUG_ON(ref_obsolete(ref)); | |
719 | ||
1046d880 DW |
720 | crc = crc32(0, rd, sizeof(*rd) - 8); |
721 | if (unlikely(crc != je32_to_cpu(rd->node_crc))) { | |
722 | JFFS2_NOTICE("node CRC failed on dnode at %#08x: read %#08x, calculated %#08x\n", | |
723 | ref_offset(ref), je32_to_cpu(rd->node_crc), crc); | |
df8e96f3 DW |
724 | jffs2_mark_node_obsolete(c, ref); |
725 | return 0; | |
1046d880 DW |
726 | } |
727 | ||
1e0da3cb AB |
728 | tn = jffs2_alloc_tmp_dnode_info(); |
729 | if (!tn) { | |
fb6a82c9 | 730 | JFFS2_ERROR("failed to allocate tn (%zu bytes).\n", sizeof(*tn)); |
1e0da3cb AB |
731 | return -ENOMEM; |
732 | } | |
733 | ||
734 | tn->partial_crc = 0; | |
735 | csize = je32_to_cpu(rd->csize); | |
182ec4ee | 736 | |
f97117d1 AB |
737 | /* If we've never checked the CRCs on this node, check them now */ |
738 | if (ref_flags(ref) == REF_UNCHECKED) { | |
182ec4ee | 739 | |
f97117d1 AB |
740 | /* Sanity checks */ |
741 | if (unlikely(je32_to_cpu(rd->offset) > je32_to_cpu(rd->isize)) || | |
742 | unlikely(PAD(je32_to_cpu(rd->csize) + sizeof(*rd)) != PAD(je32_to_cpu(rd->totlen)))) { | |
14c6381e DW |
743 | JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref)); |
744 | jffs2_dbg_dump_node(c, ref_offset(ref)); | |
745 | jffs2_mark_node_obsolete(c, ref); | |
1e0da3cb | 746 | goto free_out; |
1da177e4 LT |
747 | } |
748 | ||
1e0da3cb AB |
749 | if (jffs2_is_writebuffered(c) && csize != 0) { |
750 | /* At this point we are supposed to check the data CRC | |
751 | * of our unchecked node. But thus far, we do not | |
752 | * know whether the node is valid or obsolete. To | |
753 | * figure this out, we need to walk all the nodes of | |
754 | * the inode and build the inode fragtree. We don't | |
755 | * want to spend time checking data of nodes which may | |
756 | * later be found to be obsolete. So we put off the full | |
757 | * data CRC checking until we have read all the inode | |
758 | * nodes and have started building the fragtree. | |
759 | * | |
760 | * The fragtree is being built starting with nodes | |
761 | * having the highest version number, so we'll be able | |
762 | * to detect whether a node is valid (i.e., it is not | |
763 | * overlapped by a node with higher version) or not. | |
764 | * And we'll be able to check only those nodes, which | |
765 | * are not obsolete. | |
766 | * | |
767 | * Of course, this optimization only makes sense in case | |
e1b8513d | 768 | * of NAND flashes (or other flashes with |
1e0da3cb AB |
769 | * !jffs2_can_mark_obsolete()), since on NOR flashes |
770 | * nodes are marked obsolete physically. | |
771 | * | |
772 | * Since NAND flashes (or other flashes with | |
773 | * jffs2_is_writebuffered(c)) are anyway read by | |
774 | * fractions of c->wbuf_pagesize, and we have just read | |
775 | * the node header, it is likely that the starting part | |
776 | * of the node data is also read when we read the | |
777 | * header. So we don't mind to check the CRC of the | |
778 | * starting part of the data of the node now, and check | |
779 | * the second part later (in jffs2_check_node_data()). | |
780 | * Of course, we will not need to re-read and re-check | |
781 | * the NAND page which we have just read. This is why we | |
782 | * read the whole NAND page at jffs2_get_inode_nodes(), | |
783 | * while we needed only the node header. | |
784 | */ | |
785 | unsigned char *buf; | |
786 | ||
787 | /* 'buf' will point to the start of data */ | |
788 | buf = (unsigned char *)rd + sizeof(*rd); | |
789 | /* len will be the read data length */ | |
790 | len = min_t(uint32_t, rdlen - sizeof(*rd), csize); | |
280562b2 AB |
791 | tn->partial_crc = crc32(0, buf, len); |
792 | ||
733802d9 | 793 | dbg_readinode("Calculates CRC (%#08x) for %d bytes, csize %d\n", tn->partial_crc, len, csize); |
1e0da3cb AB |
794 | |
795 | /* If we actually calculated the whole data CRC | |
796 | * and it is wrong, drop the node. */ | |
3c091337 | 797 | if (len >= csize && unlikely(tn->partial_crc != je32_to_cpu(rd->data_crc))) { |
39243508 AB |
798 | JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", |
799 | ref_offset(ref), tn->partial_crc, je32_to_cpu(rd->data_crc)); | |
14c6381e | 800 | jffs2_mark_node_obsolete(c, ref); |
1e0da3cb | 801 | goto free_out; |
39243508 | 802 | } |
1da177e4 | 803 | |
1e0da3cb AB |
804 | } else if (csize == 0) { |
805 | /* | |
806 | * We checked the header CRC. If the node has no data, adjust | |
807 | * the space accounting now. For other nodes this will be done | |
808 | * later either when the node is marked obsolete or when its | |
809 | * data is checked. | |
810 | */ | |
811 | struct jffs2_eraseblock *jeb; | |
812 | ||
733802d9 | 813 | dbg_readinode("the node has no data.\n"); |
1e0da3cb AB |
814 | jeb = &c->blocks[ref->flash_offset / c->sector_size]; |
815 | len = ref_totlen(c, jeb, ref); | |
816 | ||
817 | spin_lock(&c->erase_completion_lock); | |
818 | jeb->used_size += len; | |
819 | jeb->unchecked_size -= len; | |
820 | c->used_size += len; | |
821 | c->unchecked_size -= len; | |
f97117d1 | 822 | ref->flash_offset = ref_offset(ref) | REF_NORMAL; |
1e0da3cb | 823 | spin_unlock(&c->erase_completion_lock); |
1da177e4 | 824 | } |
1da177e4 | 825 | } |
1da177e4 | 826 | |
f97117d1 AB |
827 | tn->fn = jffs2_alloc_full_dnode(); |
828 | if (!tn->fn) { | |
e0d60137 | 829 | JFFS2_ERROR("alloc fn failed\n"); |
1e0da3cb AB |
830 | ret = -ENOMEM; |
831 | goto free_out; | |
f97117d1 | 832 | } |
182ec4ee | 833 | |
f97117d1 AB |
834 | tn->version = je32_to_cpu(rd->version); |
835 | tn->fn->ofs = je32_to_cpu(rd->offset); | |
1e0da3cb AB |
836 | tn->data_crc = je32_to_cpu(rd->data_crc); |
837 | tn->csize = csize; | |
f97117d1 | 838 | tn->fn->raw = ref; |
df8e96f3 DW |
839 | tn->overlapped = 0; |
840 | ||
841 | if (tn->version > rii->highest_version) | |
842 | rii->highest_version = tn->version; | |
182ec4ee | 843 | |
f97117d1 AB |
844 | /* There was a bug where we wrote hole nodes out with |
845 | csize/dsize swapped. Deal with it */ | |
1e0da3cb AB |
846 | if (rd->compr == JFFS2_COMPR_ZERO && !je32_to_cpu(rd->dsize) && csize) |
847 | tn->fn->size = csize; | |
f97117d1 AB |
848 | else // normal case... |
849 | tn->fn->size = je32_to_cpu(rd->dsize); | |
850 | ||
2c61cb25 DW |
851 | dbg_readinode2("dnode @%08x: ver %u, offset %#04x, dsize %#04x, csize %#04x\n", |
852 | ref_offset(ref), je32_to_cpu(rd->version), | |
853 | je32_to_cpu(rd->offset), je32_to_cpu(rd->dsize), csize); | |
182ec4ee | 854 | |
df8e96f3 | 855 | ret = jffs2_add_tn_to_tree(c, rii, tn); |
1da177e4 | 856 | |
df8e96f3 DW |
857 | if (ret) { |
858 | jffs2_free_full_dnode(tn->fn); | |
859 | free_out: | |
860 | jffs2_free_tmp_dnode_info(tn); | |
861 | return ret; | |
862 | } | |
2c61cb25 DW |
863 | #ifdef JFFS2_DBG_READINODE2_MESSAGES |
864 | dbg_readinode2("After adding ver %d:\n", je32_to_cpu(rd->version)); | |
df8e96f3 DW |
865 | tn = tn_first(&rii->tn_root); |
866 | while (tn) { | |
2c61cb25 DW |
867 | dbg_readinode2("%p: v %d r 0x%x-0x%x ov %d\n", |
868 | tn, tn->version, tn->fn->ofs, | |
869 | tn->fn->ofs+tn->fn->size, tn->overlapped); | |
df8e96f3 DW |
870 | tn = tn_next(tn); |
871 | } | |
872 | #endif | |
1da177e4 LT |
873 | return 0; |
874 | } | |
875 | ||
f97117d1 AB |
876 | /* |
877 | * Helper function for jffs2_get_inode_nodes(). | |
878 | * It is called every time an unknown node is found. | |
879 | * | |
3877f0b6 | 880 | * Returns: 0 on success; |
f97117d1 AB |
881 | * negative error code on failure. |
882 | */ | |
1e0da3cb | 883 | static inline int read_unknown(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, struct jffs2_unknown_node *un) |
1da177e4 | 884 | { |
f97117d1 | 885 | /* We don't mark unknown nodes as REF_UNCHECKED */ |
c7258a44 DW |
886 | if (ref_flags(ref) == REF_UNCHECKED) { |
887 | JFFS2_ERROR("REF_UNCHECKED but unknown node at %#08x\n", | |
888 | ref_offset(ref)); | |
889 | JFFS2_ERROR("Node is {%04x,%04x,%08x,%08x}. Please report this error.\n", | |
ef53cb02 DW |
890 | je16_to_cpu(un->magic), je16_to_cpu(un->nodetype), |
891 | je32_to_cpu(un->totlen), je32_to_cpu(un->hdr_crc)); | |
df8e96f3 DW |
892 | jffs2_mark_node_obsolete(c, ref); |
893 | return 0; | |
c7258a44 | 894 | } |
182ec4ee | 895 | |
f97117d1 | 896 | un->nodetype = cpu_to_je16(JFFS2_NODE_ACCURATE | je16_to_cpu(un->nodetype)); |
1da177e4 | 897 | |
3877f0b6 DW |
898 | switch(je16_to_cpu(un->nodetype) & JFFS2_COMPAT_MASK) { |
899 | ||
900 | case JFFS2_FEATURE_INCOMPAT: | |
901 | JFFS2_ERROR("unknown INCOMPAT nodetype %#04X at %#08x\n", | |
902 | je16_to_cpu(un->nodetype), ref_offset(ref)); | |
903 | /* EEP */ | |
904 | BUG(); | |
905 | break; | |
906 | ||
907 | case JFFS2_FEATURE_ROCOMPAT: | |
908 | JFFS2_ERROR("unknown ROCOMPAT nodetype %#04X at %#08x\n", | |
909 | je16_to_cpu(un->nodetype), ref_offset(ref)); | |
910 | BUG_ON(!(c->flags & JFFS2_SB_FLAG_RO)); | |
911 | break; | |
912 | ||
913 | case JFFS2_FEATURE_RWCOMPAT_COPY: | |
914 | JFFS2_NOTICE("unknown RWCOMPAT_COPY nodetype %#04X at %#08x\n", | |
915 | je16_to_cpu(un->nodetype), ref_offset(ref)); | |
916 | break; | |
917 | ||
918 | case JFFS2_FEATURE_RWCOMPAT_DELETE: | |
919 | JFFS2_NOTICE("unknown RWCOMPAT_DELETE nodetype %#04X at %#08x\n", | |
920 | je16_to_cpu(un->nodetype), ref_offset(ref)); | |
df8e96f3 DW |
921 | jffs2_mark_node_obsolete(c, ref); |
922 | return 0; | |
1da177e4 | 923 | } |
1da177e4 | 924 | |
f97117d1 | 925 | return 0; |
1da177e4 LT |
926 | } |
927 | ||
1e0da3cb AB |
928 | /* |
929 | * Helper function for jffs2_get_inode_nodes(). | |
930 | * The function detects whether more data should be read and reads it if yes. | |
931 | * | |
af901ca1 | 932 | * Returns: 0 on success; |
1e0da3cb AB |
933 | * negative error code on failure. |
934 | */ | |
935 | static int read_more(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, | |
10731f83 | 936 | int needed_len, int *rdlen, unsigned char *buf) |
1e0da3cb | 937 | { |
10731f83 | 938 | int err, to_read = needed_len - *rdlen; |
1e0da3cb AB |
939 | size_t retlen; |
940 | uint32_t offs; | |
941 | ||
942 | if (jffs2_is_writebuffered(c)) { | |
10731f83 | 943 | int rem = to_read % c->wbuf_pagesize; |
1e0da3cb | 944 | |
10731f83 AB |
945 | if (rem) |
946 | to_read += c->wbuf_pagesize - rem; | |
947 | } | |
1e0da3cb AB |
948 | |
949 | /* We need to read more data */ | |
950 | offs = ref_offset(ref) + *rdlen; | |
182ec4ee | 951 | |
10731f83 | 952 | dbg_readinode("read more %d bytes\n", to_read); |
1e0da3cb | 953 | |
10731f83 | 954 | err = jffs2_flash_read(c, offs, to_read, &retlen, buf + *rdlen); |
1e0da3cb AB |
955 | if (err) { |
956 | JFFS2_ERROR("can not read %d bytes from 0x%08x, " | |
10731f83 | 957 | "error code: %d.\n", to_read, offs, err); |
1e0da3cb AB |
958 | return err; |
959 | } | |
182ec4ee | 960 | |
10731f83 | 961 | if (retlen < to_read) { |
fb6a82c9 | 962 | JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", |
10731f83 | 963 | offs, retlen, to_read); |
1e0da3cb AB |
964 | return -EIO; |
965 | } | |
966 | ||
10731f83 | 967 | *rdlen += to_read; |
1e0da3cb AB |
968 | return 0; |
969 | } | |
970 | ||
f97117d1 | 971 | /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated |
df8e96f3 DW |
972 | with this ino. Perform a preliminary ordering on data nodes, throwing away |
973 | those which are completely obsoleted by newer ones. The naïve approach we | |
974 | use to take of just returning them _all_ in version order will cause us to | |
975 | run out of memory in certain degenerate cases. */ | |
f97117d1 | 976 | static int jffs2_get_inode_nodes(struct jffs2_sb_info *c, struct jffs2_inode_info *f, |
df8e96f3 | 977 | struct jffs2_readinode_info *rii) |
1da177e4 | 978 | { |
f97117d1 | 979 | struct jffs2_raw_node_ref *ref, *valid_ref; |
1e0da3cb AB |
980 | unsigned char *buf = NULL; |
981 | union jffs2_node_union *node; | |
f97117d1 | 982 | size_t retlen; |
1e0da3cb | 983 | int len, err; |
1da177e4 | 984 | |
df8e96f3 | 985 | rii->mctime_ver = 0; |
182ec4ee | 986 | |
733802d9 | 987 | dbg_readinode("ino #%u\n", f->inocache->ino); |
1da177e4 | 988 | |
1e0da3cb AB |
989 | /* FIXME: in case of NOR and available ->point() this |
990 | * needs to be fixed. */ | |
10731f83 | 991 | len = sizeof(union jffs2_node_union) + c->wbuf_pagesize; |
1e0da3cb AB |
992 | buf = kmalloc(len, GFP_KERNEL); |
993 | if (!buf) | |
994 | return -ENOMEM; | |
182ec4ee | 995 | |
1e0da3cb | 996 | spin_lock(&c->erase_completion_lock); |
f97117d1 | 997 | valid_ref = jffs2_first_valid_node(f->inocache->nodes); |
1e0da3cb AB |
998 | if (!valid_ref && f->inocache->ino != 1) |
999 | JFFS2_WARNING("Eep. No valid nodes for ino #%u.\n", f->inocache->ino); | |
f97117d1 AB |
1000 | while (valid_ref) { |
1001 | /* We can hold a pointer to a non-obsolete node without the spinlock, | |
1002 | but _obsolete_ nodes may disappear at any time, if the block | |
1003 | they're in gets erased. So if we mark 'ref' obsolete while we're | |
1004 | not holding the lock, it can go away immediately. For that reason, | |
1005 | we find the next valid node first, before processing 'ref'. | |
1006 | */ | |
1007 | ref = valid_ref; | |
1008 | valid_ref = jffs2_first_valid_node(ref->next_in_ino); | |
1009 | spin_unlock(&c->erase_completion_lock); | |
1010 | ||
1011 | cond_resched(); | |
1012 | ||
1e0da3cb AB |
1013 | /* |
1014 | * At this point we don't know the type of the node we're going | |
1015 | * to read, so we do not know the size of its header. In order | |
10731f83 AB |
1016 | * to minimize the amount of flash IO we assume the header is |
1017 | * of size = JFFS2_MIN_NODE_HEADER. | |
1e0da3cb | 1018 | */ |
10731f83 | 1019 | len = JFFS2_MIN_NODE_HEADER; |
1e0da3cb | 1020 | if (jffs2_is_writebuffered(c)) { |
10731f83 AB |
1021 | int end, rem; |
1022 | ||
182ec4ee | 1023 | /* |
10731f83 AB |
1024 | * We are about to read JFFS2_MIN_NODE_HEADER bytes, |
1025 | * but this flash has some minimal I/O unit. It is | |
1026 | * possible that we'll need to read more soon, so read | |
1027 | * up to the next min. I/O unit, in order not to | |
1028 | * re-read the same min. I/O unit twice. | |
1e0da3cb | 1029 | */ |
10731f83 AB |
1030 | end = ref_offset(ref) + len; |
1031 | rem = end % c->wbuf_pagesize; | |
1032 | if (rem) | |
1033 | end += c->wbuf_pagesize - rem; | |
1034 | len = end - ref_offset(ref); | |
1e0da3cb AB |
1035 | } |
1036 | ||
733802d9 | 1037 | dbg_readinode("read %d bytes at %#08x(%d).\n", len, ref_offset(ref), ref_flags(ref)); |
1e0da3cb | 1038 | |
f97117d1 | 1039 | /* FIXME: point() */ |
10731f83 | 1040 | err = jffs2_flash_read(c, ref_offset(ref), len, &retlen, buf); |
f97117d1 | 1041 | if (err) { |
df2e301f | 1042 | JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ref_offset(ref), err); |
1e0da3cb AB |
1043 | goto free_out; |
1044 | } | |
182ec4ee | 1045 | |
1e0da3cb | 1046 | if (retlen < len) { |
fb6a82c9 | 1047 | JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", ref_offset(ref), retlen, len); |
1e0da3cb | 1048 | err = -EIO; |
f97117d1 AB |
1049 | goto free_out; |
1050 | } | |
182ec4ee | 1051 | |
10731f83 | 1052 | node = (union jffs2_node_union *)buf; |
182ec4ee | 1053 | |
3877f0b6 DW |
1054 | /* No need to mask in the valid bit; it shouldn't be invalid */ |
1055 | if (je32_to_cpu(node->u.hdr_crc) != crc32(0, node, sizeof(node->u)-4)) { | |
1056 | JFFS2_NOTICE("Node header CRC failed at %#08x. {%04x,%04x,%08x,%08x}\n", | |
1057 | ref_offset(ref), je16_to_cpu(node->u.magic), | |
1058 | je16_to_cpu(node->u.nodetype), | |
1059 | je32_to_cpu(node->u.totlen), | |
1060 | je32_to_cpu(node->u.hdr_crc)); | |
1061 | jffs2_dbg_dump_node(c, ref_offset(ref)); | |
1062 | jffs2_mark_node_obsolete(c, ref); | |
1063 | goto cont; | |
1064 | } | |
0dec4c8b JT |
1065 | if (je16_to_cpu(node->u.magic) != JFFS2_MAGIC_BITMASK) { |
1066 | /* Not a JFFS2 node, whinge and move on */ | |
1067 | JFFS2_NOTICE("Wrong magic bitmask 0x%04x in node header at %#08x.\n", | |
1068 | je16_to_cpu(node->u.magic), ref_offset(ref)); | |
c7258a44 DW |
1069 | jffs2_mark_node_obsolete(c, ref); |
1070 | goto cont; | |
1071 | } | |
3877f0b6 | 1072 | |
1e0da3cb | 1073 | switch (je16_to_cpu(node->u.nodetype)) { |
182ec4ee | 1074 | |
f97117d1 | 1075 | case JFFS2_NODETYPE_DIRENT: |
f97117d1 | 1076 | |
ea55d307 AB |
1077 | if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_dirent) && |
1078 | len < sizeof(struct jffs2_raw_dirent)) { | |
10731f83 | 1079 | err = read_more(c, ref, sizeof(struct jffs2_raw_dirent), &len, buf); |
1e0da3cb AB |
1080 | if (unlikely(err)) |
1081 | goto free_out; | |
1082 | } | |
182ec4ee | 1083 | |
df8e96f3 DW |
1084 | err = read_direntry(c, ref, &node->d, retlen, rii); |
1085 | if (unlikely(err)) | |
f97117d1 | 1086 | goto free_out; |
182ec4ee | 1087 | |
1da177e4 LT |
1088 | break; |
1089 | ||
f97117d1 | 1090 | case JFFS2_NODETYPE_INODE: |
182ec4ee | 1091 | |
ea55d307 AB |
1092 | if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_inode) && |
1093 | len < sizeof(struct jffs2_raw_inode)) { | |
10731f83 | 1094 | err = read_more(c, ref, sizeof(struct jffs2_raw_inode), &len, buf); |
1e0da3cb AB |
1095 | if (unlikely(err)) |
1096 | goto free_out; | |
f97117d1 | 1097 | } |
1da177e4 | 1098 | |
df8e96f3 DW |
1099 | err = read_dnode(c, ref, &node->i, len, rii); |
1100 | if (unlikely(err)) | |
f97117d1 | 1101 | goto free_out; |
1da177e4 | 1102 | |
f97117d1 | 1103 | break; |
1da177e4 | 1104 | |
f97117d1 | 1105 | default: |
ea55d307 AB |
1106 | if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_unknown_node) && |
1107 | len < sizeof(struct jffs2_unknown_node)) { | |
10731f83 | 1108 | err = read_more(c, ref, sizeof(struct jffs2_unknown_node), &len, buf); |
1e0da3cb AB |
1109 | if (unlikely(err)) |
1110 | goto free_out; | |
f97117d1 | 1111 | } |
182ec4ee | 1112 | |
1e0da3cb | 1113 | err = read_unknown(c, ref, &node->u); |
14c6381e | 1114 | if (unlikely(err)) |
f97117d1 AB |
1115 | goto free_out; |
1116 | ||
1117 | } | |
3877f0b6 | 1118 | cont: |
f97117d1 | 1119 | spin_lock(&c->erase_completion_lock); |
1da177e4 | 1120 | } |
1e0da3cb | 1121 | |
f97117d1 | 1122 | spin_unlock(&c->erase_completion_lock); |
1e0da3cb | 1123 | kfree(buf); |
f97117d1 | 1124 | |
df8e96f3 DW |
1125 | f->highest_version = rii->highest_version; |
1126 | ||
733802d9 | 1127 | dbg_readinode("nodes of inode #%u were read, the highest version is %u, latest_mctime %u, mctime_ver %u.\n", |
df8e96f3 DW |
1128 | f->inocache->ino, rii->highest_version, rii->latest_mctime, |
1129 | rii->mctime_ver); | |
f97117d1 AB |
1130 | return 0; |
1131 | ||
1132 | free_out: | |
df8e96f3 DW |
1133 | jffs2_free_tmp_dnode_info_list(&rii->tn_root); |
1134 | jffs2_free_full_dirent_list(rii->fds); | |
1135 | rii->fds = NULL; | |
1e0da3cb | 1136 | kfree(buf); |
f97117d1 | 1137 | return err; |
1da177e4 LT |
1138 | } |
1139 | ||
182ec4ee | 1140 | static int jffs2_do_read_inode_internal(struct jffs2_sb_info *c, |
1da177e4 LT |
1141 | struct jffs2_inode_info *f, |
1142 | struct jffs2_raw_inode *latest_node) | |
1143 | { | |
df8e96f3 | 1144 | struct jffs2_readinode_info rii; |
61c4b237 | 1145 | uint32_t crc, new_size; |
1da177e4 LT |
1146 | size_t retlen; |
1147 | int ret; | |
1148 | ||
27c72b04 DW |
1149 | dbg_readinode("ino #%u pino/nlink is %d\n", f->inocache->ino, |
1150 | f->inocache->pino_nlink); | |
1da177e4 | 1151 | |
df8e96f3 DW |
1152 | memset(&rii, 0, sizeof(rii)); |
1153 | ||
1da177e4 | 1154 | /* Grab all nodes relevant to this ino */ |
df8e96f3 | 1155 | ret = jffs2_get_inode_nodes(c, f, &rii); |
1da177e4 LT |
1156 | |
1157 | if (ret) { | |
e0d60137 | 1158 | JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret); |
1da177e4 LT |
1159 | if (f->inocache->state == INO_STATE_READING) |
1160 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); | |
1161 | return ret; | |
1162 | } | |
1da177e4 | 1163 | |
df8e96f3 DW |
1164 | ret = jffs2_build_inode_fragtree(c, f, &rii); |
1165 | if (ret) { | |
1166 | JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n", | |
1167 | f->inocache->ino, ret); | |
1168 | if (f->inocache->state == INO_STATE_READING) | |
1169 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); | |
1170 | jffs2_free_tmp_dnode_info_list(&rii.tn_root); | |
1171 | /* FIXME: We could at least crc-check them all */ | |
1172 | if (rii.mdata_tn) { | |
1173 | jffs2_free_full_dnode(rii.mdata_tn->fn); | |
1174 | jffs2_free_tmp_dnode_info(rii.mdata_tn); | |
1175 | rii.mdata_tn = NULL; | |
1176 | } | |
1177 | return ret; | |
1178 | } | |
9dee7503 | 1179 | |
df8e96f3 DW |
1180 | if (rii.mdata_tn) { |
1181 | if (rii.mdata_tn->fn->raw == rii.latest_ref) { | |
1182 | f->metadata = rii.mdata_tn->fn; | |
1183 | jffs2_free_tmp_dnode_info(rii.mdata_tn); | |
1184 | } else { | |
1185 | jffs2_kill_tn(c, rii.mdata_tn); | |
1e0da3cb | 1186 | } |
df8e96f3 | 1187 | rii.mdata_tn = NULL; |
1da177e4 | 1188 | } |
1da177e4 | 1189 | |
df8e96f3 DW |
1190 | f->dents = rii.fds; |
1191 | ||
1192 | jffs2_dbg_fragtree_paranoia_check_nolock(f); | |
1e0da3cb | 1193 | |
df8e96f3 | 1194 | if (unlikely(!rii.latest_ref)) { |
1da177e4 LT |
1195 | /* No data nodes for this inode. */ |
1196 | if (f->inocache->ino != 1) { | |
e0d60137 | 1197 | JFFS2_WARNING("no data nodes found for ino #%u\n", f->inocache->ino); |
df8e96f3 | 1198 | if (!rii.fds) { |
1da177e4 LT |
1199 | if (f->inocache->state == INO_STATE_READING) |
1200 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); | |
1201 | return -EIO; | |
1202 | } | |
e0d60137 | 1203 | JFFS2_NOTICE("but it has children so we fake some modes for it\n"); |
1da177e4 LT |
1204 | } |
1205 | latest_node->mode = cpu_to_jemode(S_IFDIR|S_IRUGO|S_IWUSR|S_IXUGO); | |
1206 | latest_node->version = cpu_to_je32(0); | |
1207 | latest_node->atime = latest_node->ctime = latest_node->mtime = cpu_to_je32(0); | |
1208 | latest_node->isize = cpu_to_je32(0); | |
1209 | latest_node->gid = cpu_to_je16(0); | |
1210 | latest_node->uid = cpu_to_je16(0); | |
1211 | if (f->inocache->state == INO_STATE_READING) | |
1212 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); | |
1213 | return 0; | |
1214 | } | |
1215 | ||
df8e96f3 | 1216 | ret = jffs2_flash_read(c, ref_offset(rii.latest_ref), sizeof(*latest_node), &retlen, (void *)latest_node); |
1da177e4 | 1217 | if (ret || retlen != sizeof(*latest_node)) { |
e0d60137 AB |
1218 | JFFS2_ERROR("failed to read from flash: error %d, %zd of %zd bytes read\n", |
1219 | ret, retlen, sizeof(*latest_node)); | |
1da177e4 | 1220 | /* FIXME: If this fails, there seems to be a memory leak. Find it. */ |
ced22070 | 1221 | mutex_unlock(&f->sem); |
1da177e4 LT |
1222 | jffs2_do_clear_inode(c, f); |
1223 | return ret?ret:-EIO; | |
1224 | } | |
1225 | ||
1226 | crc = crc32(0, latest_node, sizeof(*latest_node)-8); | |
1227 | if (crc != je32_to_cpu(latest_node->node_crc)) { | |
e0d60137 | 1228 | JFFS2_ERROR("CRC failed for read_inode of inode %u at physical location 0x%x\n", |
df8e96f3 | 1229 | f->inocache->ino, ref_offset(rii.latest_ref)); |
ced22070 | 1230 | mutex_unlock(&f->sem); |
1da177e4 LT |
1231 | jffs2_do_clear_inode(c, f); |
1232 | return -EIO; | |
1233 | } | |
1234 | ||
1235 | switch(jemode_to_cpu(latest_node->mode) & S_IFMT) { | |
1236 | case S_IFDIR: | |
df8e96f3 | 1237 | if (rii.mctime_ver > je32_to_cpu(latest_node->version)) { |
1da177e4 LT |
1238 | /* The times in the latest_node are actually older than |
1239 | mctime in the latest dirent. Cheat. */ | |
df8e96f3 | 1240 | latest_node->ctime = latest_node->mtime = cpu_to_je32(rii.latest_mctime); |
1da177e4 LT |
1241 | } |
1242 | break; | |
1243 | ||
182ec4ee | 1244 | |
1da177e4 LT |
1245 | case S_IFREG: |
1246 | /* If it was a regular file, truncate it to the latest node's isize */ | |
61c4b237 DW |
1247 | new_size = jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); |
1248 | if (new_size != je32_to_cpu(latest_node->isize)) { | |
1249 | JFFS2_WARNING("Truncating ino #%u to %d bytes failed because it only had %d bytes to start with!\n", | |
1250 | f->inocache->ino, je32_to_cpu(latest_node->isize), new_size); | |
1251 | latest_node->isize = cpu_to_je32(new_size); | |
1252 | } | |
1da177e4 LT |
1253 | break; |
1254 | ||
1255 | case S_IFLNK: | |
1256 | /* Hack to work around broken isize in old symlink code. | |
1257 | Remove this when dwmw2 comes to his senses and stops | |
1258 | symlinks from being an entirely gratuitous special | |
1259 | case. */ | |
1260 | if (!je32_to_cpu(latest_node->isize)) | |
1261 | latest_node->isize = latest_node->dsize; | |
32f1a95d AB |
1262 | |
1263 | if (f->inocache->state != INO_STATE_CHECKING) { | |
1264 | /* Symlink's inode data is the target path. Read it and | |
2b79adcc AB |
1265 | * keep in RAM to facilitate quick follow symlink |
1266 | * operation. */ | |
1267 | f->target = kmalloc(je32_to_cpu(latest_node->csize) + 1, GFP_KERNEL); | |
1268 | if (!f->target) { | |
e0d60137 | 1269 | JFFS2_ERROR("can't allocate %d bytes of memory for the symlink target path cache\n", je32_to_cpu(latest_node->csize)); |
ced22070 | 1270 | mutex_unlock(&f->sem); |
32f1a95d AB |
1271 | jffs2_do_clear_inode(c, f); |
1272 | return -ENOMEM; | |
1273 | } | |
182ec4ee | 1274 | |
df8e96f3 | 1275 | ret = jffs2_flash_read(c, ref_offset(rii.latest_ref) + sizeof(*latest_node), |
2b79adcc | 1276 | je32_to_cpu(latest_node->csize), &retlen, (char *)f->target); |
182ec4ee | 1277 | |
32f1a95d AB |
1278 | if (ret || retlen != je32_to_cpu(latest_node->csize)) { |
1279 | if (retlen != je32_to_cpu(latest_node->csize)) | |
1280 | ret = -EIO; | |
2b79adcc AB |
1281 | kfree(f->target); |
1282 | f->target = NULL; | |
ced22070 | 1283 | mutex_unlock(&f->sem); |
32f1a95d | 1284 | jffs2_do_clear_inode(c, f); |
e670e41a | 1285 | return ret; |
32f1a95d AB |
1286 | } |
1287 | ||
2b79adcc | 1288 | f->target[je32_to_cpu(latest_node->csize)] = '\0'; |
733802d9 | 1289 | dbg_readinode("symlink's target '%s' cached\n", f->target); |
32f1a95d | 1290 | } |
182ec4ee | 1291 | |
1da177e4 LT |
1292 | /* fall through... */ |
1293 | ||
1294 | case S_IFBLK: | |
1295 | case S_IFCHR: | |
1296 | /* Certain inode types should have only one data node, and it's | |
1297 | kept as the metadata node */ | |
1298 | if (f->metadata) { | |
e0d60137 | 1299 | JFFS2_ERROR("Argh. Special inode #%u with mode 0%o had metadata node\n", |
1da177e4 | 1300 | f->inocache->ino, jemode_to_cpu(latest_node->mode)); |
ced22070 | 1301 | mutex_unlock(&f->sem); |
1da177e4 LT |
1302 | jffs2_do_clear_inode(c, f); |
1303 | return -EIO; | |
1304 | } | |
1305 | if (!frag_first(&f->fragtree)) { | |
e0d60137 | 1306 | JFFS2_ERROR("Argh. Special inode #%u with mode 0%o has no fragments\n", |
1da177e4 | 1307 | f->inocache->ino, jemode_to_cpu(latest_node->mode)); |
ced22070 | 1308 | mutex_unlock(&f->sem); |
1da177e4 LT |
1309 | jffs2_do_clear_inode(c, f); |
1310 | return -EIO; | |
1311 | } | |
1312 | /* ASSERT: f->fraglist != NULL */ | |
1313 | if (frag_next(frag_first(&f->fragtree))) { | |
e0d60137 | 1314 | JFFS2_ERROR("Argh. Special inode #%u with mode 0x%x had more than one node\n", |
1da177e4 LT |
1315 | f->inocache->ino, jemode_to_cpu(latest_node->mode)); |
1316 | /* FIXME: Deal with it - check crc32, check for duplicate node, check times and discard the older one */ | |
ced22070 | 1317 | mutex_unlock(&f->sem); |
1da177e4 LT |
1318 | jffs2_do_clear_inode(c, f); |
1319 | return -EIO; | |
1320 | } | |
1321 | /* OK. We're happy */ | |
1322 | f->metadata = frag_first(&f->fragtree)->node; | |
1323 | jffs2_free_node_frag(frag_first(&f->fragtree)); | |
1324 | f->fragtree = RB_ROOT; | |
1325 | break; | |
1326 | } | |
1327 | if (f->inocache->state == INO_STATE_READING) | |
1328 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); | |
1329 | ||
1330 | return 0; | |
1331 | } | |
1332 | ||
f97117d1 | 1333 | /* Scan the list of all nodes present for this ino, build map of versions, etc. */ |
182ec4ee | 1334 | int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, |
f97117d1 AB |
1335 | uint32_t ino, struct jffs2_raw_inode *latest_node) |
1336 | { | |
733802d9 | 1337 | dbg_readinode("read inode #%u\n", ino); |
f97117d1 AB |
1338 | |
1339 | retry_inocache: | |
1340 | spin_lock(&c->inocache_lock); | |
1341 | f->inocache = jffs2_get_ino_cache(c, ino); | |
1342 | ||
f97117d1 AB |
1343 | if (f->inocache) { |
1344 | /* Check its state. We may need to wait before we can use it */ | |
1345 | switch(f->inocache->state) { | |
1346 | case INO_STATE_UNCHECKED: | |
1347 | case INO_STATE_CHECKEDABSENT: | |
1348 | f->inocache->state = INO_STATE_READING; | |
1349 | break; | |
182ec4ee | 1350 | |
f97117d1 AB |
1351 | case INO_STATE_CHECKING: |
1352 | case INO_STATE_GC: | |
1353 | /* If it's in either of these states, we need | |
1354 | to wait for whoever's got it to finish and | |
1355 | put it back. */ | |
733802d9 | 1356 | dbg_readinode("waiting for ino #%u in state %d\n", ino, f->inocache->state); |
f97117d1 AB |
1357 | sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); |
1358 | goto retry_inocache; | |
1359 | ||
1360 | case INO_STATE_READING: | |
1361 | case INO_STATE_PRESENT: | |
1362 | /* Eep. This should never happen. It can | |
1363 | happen if Linux calls read_inode() again | |
1364 | before clear_inode() has finished though. */ | |
e0d60137 | 1365 | JFFS2_ERROR("Eep. Trying to read_inode #%u when it's already in state %d!\n", ino, f->inocache->state); |
f97117d1 AB |
1366 | /* Fail. That's probably better than allowing it to succeed */ |
1367 | f->inocache = NULL; | |
1368 | break; | |
1369 | ||
1370 | default: | |
1371 | BUG(); | |
1372 | } | |
1373 | } | |
1374 | spin_unlock(&c->inocache_lock); | |
1375 | ||
1376 | if (!f->inocache && ino == 1) { | |
1377 | /* Special case - no root inode on medium */ | |
1378 | f->inocache = jffs2_alloc_inode_cache(); | |
1379 | if (!f->inocache) { | |
e0d60137 | 1380 | JFFS2_ERROR("cannot allocate inocache for root inode\n"); |
f97117d1 AB |
1381 | return -ENOMEM; |
1382 | } | |
733802d9 | 1383 | dbg_readinode("creating inocache for root inode\n"); |
f97117d1 | 1384 | memset(f->inocache, 0, sizeof(struct jffs2_inode_cache)); |
27c72b04 | 1385 | f->inocache->ino = f->inocache->pino_nlink = 1; |
f97117d1 AB |
1386 | f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache; |
1387 | f->inocache->state = INO_STATE_READING; | |
1388 | jffs2_add_ino_cache(c, f->inocache); | |
1389 | } | |
1390 | if (!f->inocache) { | |
e0d60137 | 1391 | JFFS2_ERROR("requestied to read an nonexistent ino %u\n", ino); |
f97117d1 AB |
1392 | return -ENOENT; |
1393 | } | |
1394 | ||
1395 | return jffs2_do_read_inode_internal(c, f, latest_node); | |
1396 | } | |
1397 | ||
1398 | int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic) | |
1399 | { | |
1400 | struct jffs2_raw_inode n; | |
3d375d9e | 1401 | struct jffs2_inode_info *f = kzalloc(sizeof(*f), GFP_KERNEL); |
f97117d1 AB |
1402 | int ret; |
1403 | ||
1404 | if (!f) | |
1405 | return -ENOMEM; | |
1406 | ||
ced22070 DW |
1407 | mutex_init(&f->sem); |
1408 | mutex_lock(&f->sem); | |
f97117d1 AB |
1409 | f->inocache = ic; |
1410 | ||
1411 | ret = jffs2_do_read_inode_internal(c, f, &n); | |
1412 | if (!ret) { | |
ced22070 | 1413 | mutex_unlock(&f->sem); |
f97117d1 AB |
1414 | jffs2_do_clear_inode(c, f); |
1415 | } | |
1416 | kfree (f); | |
1417 | return ret; | |
1418 | } | |
1419 | ||
1da177e4 LT |
1420 | void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f) |
1421 | { | |
1422 | struct jffs2_full_dirent *fd, *fds; | |
1423 | int deleted; | |
1424 | ||
355ed4e1 | 1425 | jffs2_xattr_delete_inode(c, f->inocache); |
ced22070 | 1426 | mutex_lock(&f->sem); |
27c72b04 | 1427 | deleted = f->inocache && !f->inocache->pino_nlink; |
1da177e4 | 1428 | |
67e345d1 DW |
1429 | if (f->inocache && f->inocache->state != INO_STATE_CHECKING) |
1430 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_CLEARING); | |
1431 | ||
1da177e4 LT |
1432 | if (f->metadata) { |
1433 | if (deleted) | |
1434 | jffs2_mark_node_obsolete(c, f->metadata->raw); | |
1435 | jffs2_free_full_dnode(f->metadata); | |
1436 | } | |
1437 | ||
1438 | jffs2_kill_fragtree(&f->fragtree, deleted?c:NULL); | |
1439 | ||
2b79adcc AB |
1440 | if (f->target) { |
1441 | kfree(f->target); | |
1442 | f->target = NULL; | |
1443 | } | |
182ec4ee | 1444 | |
2b79adcc AB |
1445 | fds = f->dents; |
1446 | while(fds) { | |
1447 | fd = fds; | |
1448 | fds = fd->next; | |
1449 | jffs2_free_full_dirent(fd); | |
1da177e4 LT |
1450 | } |
1451 | ||
67e345d1 | 1452 | if (f->inocache && f->inocache->state != INO_STATE_CHECKING) { |
1da177e4 | 1453 | jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); |
67e345d1 DW |
1454 | if (f->inocache->nodes == (void *)f->inocache) |
1455 | jffs2_del_ino_cache(c, f->inocache); | |
1456 | } | |
1da177e4 | 1457 | |
ced22070 | 1458 | mutex_unlock(&f->sem); |
1da177e4 | 1459 | } |