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