11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 4c00c310eSDavid Woodhouse * Copyright © 2001-2007 Red Hat, Inc. 51da177e4SLinus Torvalds * 61da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 71da177e4SLinus Torvalds * 81da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 91da177e4SLinus Torvalds * 101da177e4SLinus Torvalds */ 111da177e4SLinus Torvalds 121da177e4SLinus Torvalds #include <linux/kernel.h> 13737b7661SAndrew Lunn #include <linux/sched.h> 141da177e4SLinus Torvalds #include <linux/slab.h> 151da177e4SLinus Torvalds #include <linux/fs.h> 161da177e4SLinus Torvalds #include <linux/crc32.h> 171da177e4SLinus Torvalds #include <linux/pagemap.h> 181da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 191da177e4SLinus Torvalds #include <linux/compiler.h> 201da177e4SLinus Torvalds #include "nodelist.h" 211da177e4SLinus Torvalds 22f97117d1SArtem B. Bityutskiy /* 23df8e96f3SDavid Woodhouse * Check the data CRC of the node. 24df8e96f3SDavid Woodhouse * 25df8e96f3SDavid Woodhouse * Returns: 0 if the data CRC is correct; 26df8e96f3SDavid Woodhouse * 1 - if incorrect; 27df8e96f3SDavid Woodhouse * error code if an error occured. 28f97117d1SArtem B. Bityutskiy */ 29df8e96f3SDavid Woodhouse static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 301da177e4SLinus Torvalds { 31df8e96f3SDavid Woodhouse struct jffs2_raw_node_ref *ref = tn->fn->raw; 32df8e96f3SDavid Woodhouse int err = 0, pointed = 0; 33df8e96f3SDavid Woodhouse struct jffs2_eraseblock *jeb; 34df8e96f3SDavid Woodhouse unsigned char *buffer; 35df8e96f3SDavid Woodhouse uint32_t crc, ofs, len; 36df8e96f3SDavid Woodhouse size_t retlen; 371da177e4SLinus Torvalds 38df8e96f3SDavid Woodhouse BUG_ON(tn->csize == 0); 391da177e4SLinus Torvalds 40df8e96f3SDavid Woodhouse if (!jffs2_is_writebuffered(c)) 41df8e96f3SDavid Woodhouse goto adj_acc; 42df8e96f3SDavid Woodhouse 43df8e96f3SDavid Woodhouse /* Calculate how many bytes were already checked */ 44df8e96f3SDavid Woodhouse ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode); 45df8e96f3SDavid Woodhouse len = ofs % c->wbuf_pagesize; 46df8e96f3SDavid Woodhouse if (likely(len)) 47df8e96f3SDavid Woodhouse len = c->wbuf_pagesize - len; 48df8e96f3SDavid Woodhouse 49df8e96f3SDavid Woodhouse if (len >= tn->csize) { 50df8e96f3SDavid Woodhouse dbg_readinode("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n", 51df8e96f3SDavid Woodhouse ref_offset(ref), tn->csize, ofs); 52df8e96f3SDavid Woodhouse goto adj_acc; 53f97117d1SArtem B. Bityutskiy } 541da177e4SLinus Torvalds 55df8e96f3SDavid Woodhouse ofs += len; 56df8e96f3SDavid Woodhouse len = tn->csize - len; 57df8e96f3SDavid Woodhouse 58df8e96f3SDavid Woodhouse 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", 59df8e96f3SDavid Woodhouse ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len); 60df8e96f3SDavid Woodhouse 61df8e96f3SDavid Woodhouse #ifndef __ECOS 62df8e96f3SDavid Woodhouse /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(), 63df8e96f3SDavid Woodhouse * adding and jffs2_flash_read_end() interface. */ 64df8e96f3SDavid Woodhouse if (c->mtd->point) { 65df8e96f3SDavid Woodhouse err = c->mtd->point(c->mtd, ofs, len, &retlen, &buffer); 66df8e96f3SDavid Woodhouse if (!err && retlen < tn->csize) { 67df8e96f3SDavid Woodhouse JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize); 68df8e96f3SDavid Woodhouse c->mtd->unpoint(c->mtd, buffer, ofs, len); 69df8e96f3SDavid Woodhouse } else if (err) 70df8e96f3SDavid Woodhouse JFFS2_WARNING("MTD point failed: error code %d.\n", err); 71df8e96f3SDavid Woodhouse else 72df8e96f3SDavid Woodhouse pointed = 1; /* succefully pointed to device */ 73df8e96f3SDavid Woodhouse } 74df8e96f3SDavid Woodhouse #endif 75df8e96f3SDavid Woodhouse 76df8e96f3SDavid Woodhouse if (!pointed) { 77df8e96f3SDavid Woodhouse buffer = kmalloc(len, GFP_KERNEL); 78df8e96f3SDavid Woodhouse if (unlikely(!buffer)) 79df8e96f3SDavid Woodhouse return -ENOMEM; 80df8e96f3SDavid Woodhouse 81df8e96f3SDavid Woodhouse /* TODO: this is very frequent pattern, make it a separate 82df8e96f3SDavid Woodhouse * routine */ 83df8e96f3SDavid Woodhouse err = jffs2_flash_read(c, ofs, len, &retlen, buffer); 84df8e96f3SDavid Woodhouse if (err) { 85df8e96f3SDavid Woodhouse JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err); 86df8e96f3SDavid Woodhouse goto free_out; 87df8e96f3SDavid Woodhouse } 88df8e96f3SDavid Woodhouse 89df8e96f3SDavid Woodhouse if (retlen != len) { 90df8e96f3SDavid Woodhouse JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len); 91df8e96f3SDavid Woodhouse err = -EIO; 92df8e96f3SDavid Woodhouse goto free_out; 93df8e96f3SDavid Woodhouse } 94df8e96f3SDavid Woodhouse } 95df8e96f3SDavid Woodhouse 96df8e96f3SDavid Woodhouse /* Continue calculating CRC */ 97df8e96f3SDavid Woodhouse crc = crc32(tn->partial_crc, buffer, len); 98df8e96f3SDavid Woodhouse if(!pointed) 99df8e96f3SDavid Woodhouse kfree(buffer); 100df8e96f3SDavid Woodhouse #ifndef __ECOS 101df8e96f3SDavid Woodhouse else 102df8e96f3SDavid Woodhouse c->mtd->unpoint(c->mtd, buffer, ofs, len); 103df8e96f3SDavid Woodhouse #endif 104df8e96f3SDavid Woodhouse 105df8e96f3SDavid Woodhouse if (crc != tn->data_crc) { 106df8e96f3SDavid Woodhouse JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 107df8e96f3SDavid Woodhouse ofs, tn->data_crc, crc); 108df8e96f3SDavid Woodhouse return 1; 109df8e96f3SDavid Woodhouse } 110df8e96f3SDavid Woodhouse 111df8e96f3SDavid Woodhouse adj_acc: 112df8e96f3SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 113df8e96f3SDavid Woodhouse len = ref_totlen(c, jeb, ref); 114df8e96f3SDavid Woodhouse /* If it should be REF_NORMAL, it'll get marked as such when 115df8e96f3SDavid Woodhouse we build the fragtree, shortly. No need to worry about GC 116df8e96f3SDavid Woodhouse moving it while it's marked REF_PRISTINE -- GC won't happen 117df8e96f3SDavid Woodhouse till we've finished checking every inode anyway. */ 118df8e96f3SDavid Woodhouse ref->flash_offset |= REF_PRISTINE; 119df8e96f3SDavid Woodhouse /* 120df8e96f3SDavid Woodhouse * Mark the node as having been checked and fix the 121df8e96f3SDavid Woodhouse * accounting accordingly. 122df8e96f3SDavid Woodhouse */ 123df8e96f3SDavid Woodhouse spin_lock(&c->erase_completion_lock); 124df8e96f3SDavid Woodhouse jeb->used_size += len; 125df8e96f3SDavid Woodhouse jeb->unchecked_size -= len; 126df8e96f3SDavid Woodhouse c->used_size += len; 127df8e96f3SDavid Woodhouse c->unchecked_size -= len; 128df8e96f3SDavid Woodhouse jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 129df8e96f3SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 130df8e96f3SDavid Woodhouse 131df8e96f3SDavid Woodhouse return 0; 132df8e96f3SDavid Woodhouse 133df8e96f3SDavid Woodhouse free_out: 134df8e96f3SDavid Woodhouse if(!pointed) 135df8e96f3SDavid Woodhouse kfree(buffer); 136df8e96f3SDavid Woodhouse #ifndef __ECOS 137df8e96f3SDavid Woodhouse else 138df8e96f3SDavid Woodhouse c->mtd->unpoint(c->mtd, buffer, ofs, len); 139df8e96f3SDavid Woodhouse #endif 140df8e96f3SDavid Woodhouse return err; 141df8e96f3SDavid Woodhouse } 142df8e96f3SDavid Woodhouse 143df8e96f3SDavid Woodhouse /* 144df8e96f3SDavid Woodhouse * Helper function for jffs2_add_older_frag_to_fragtree(). 145df8e96f3SDavid Woodhouse * 146df8e96f3SDavid Woodhouse * Checks the node if we are in the checking stage. 147df8e96f3SDavid Woodhouse */ 148df8e96f3SDavid Woodhouse static int check_tn_node(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 149df8e96f3SDavid Woodhouse { 150df8e96f3SDavid Woodhouse int ret; 151df8e96f3SDavid Woodhouse 152df8e96f3SDavid Woodhouse BUG_ON(ref_obsolete(tn->fn->raw)); 153df8e96f3SDavid Woodhouse 154df8e96f3SDavid Woodhouse /* We only check the data CRC of unchecked nodes */ 155df8e96f3SDavid Woodhouse if (ref_flags(tn->fn->raw) != REF_UNCHECKED) 156df8e96f3SDavid Woodhouse return 0; 157df8e96f3SDavid Woodhouse 158df8e96f3SDavid Woodhouse dbg_readinode("check node %#04x-%#04x, phys offs %#08x\n", 159df8e96f3SDavid Woodhouse tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw)); 160df8e96f3SDavid Woodhouse 161df8e96f3SDavid Woodhouse ret = check_node_data(c, tn); 162df8e96f3SDavid Woodhouse if (unlikely(ret < 0)) { 163df8e96f3SDavid Woodhouse JFFS2_ERROR("check_node_data() returned error: %d.\n", 164df8e96f3SDavid Woodhouse ret); 165df8e96f3SDavid Woodhouse } else if (unlikely(ret > 0)) { 166df8e96f3SDavid Woodhouse dbg_readinode("CRC error, mark it obsolete.\n"); 167df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, tn->fn->raw); 168df8e96f3SDavid Woodhouse } 169df8e96f3SDavid Woodhouse 170df8e96f3SDavid Woodhouse return ret; 171df8e96f3SDavid Woodhouse } 172df8e96f3SDavid Woodhouse 173df8e96f3SDavid Woodhouse static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) 174df8e96f3SDavid Woodhouse { 175df8e96f3SDavid Woodhouse struct rb_node *next; 176df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *tn = NULL; 177df8e96f3SDavid Woodhouse 178df8e96f3SDavid Woodhouse dbg_readinode("root %p, offset %d\n", tn_root, offset); 179df8e96f3SDavid Woodhouse 180df8e96f3SDavid Woodhouse next = tn_root->rb_node; 181df8e96f3SDavid Woodhouse 182df8e96f3SDavid Woodhouse while (next) { 183df8e96f3SDavid Woodhouse tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb); 184df8e96f3SDavid Woodhouse 185df8e96f3SDavid Woodhouse if (tn->fn->ofs < offset) 186df8e96f3SDavid Woodhouse next = tn->rb.rb_right; 187df8e96f3SDavid Woodhouse else if (tn->fn->ofs >= offset) 188df8e96f3SDavid Woodhouse next = tn->rb.rb_left; 189df8e96f3SDavid Woodhouse else 190df8e96f3SDavid Woodhouse break; 191df8e96f3SDavid Woodhouse } 192df8e96f3SDavid Woodhouse 193df8e96f3SDavid Woodhouse return tn; 194df8e96f3SDavid Woodhouse } 195df8e96f3SDavid Woodhouse 196df8e96f3SDavid Woodhouse 197df8e96f3SDavid Woodhouse static void jffs2_kill_tn(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 198df8e96f3SDavid Woodhouse { 199df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, tn->fn->raw); 200df8e96f3SDavid Woodhouse jffs2_free_full_dnode(tn->fn); 201df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(tn); 202df8e96f3SDavid Woodhouse } 203df8e96f3SDavid Woodhouse /* 204df8e96f3SDavid Woodhouse * This function is used when we read an inode. Data nodes arrive in 205df8e96f3SDavid Woodhouse * arbitrary order -- they may be older or newer than the nodes which 206df8e96f3SDavid Woodhouse * are already in the tree. Where overlaps occur, the older node can 207df8e96f3SDavid Woodhouse * be discarded as long as the newer passes the CRC check. We don't 208df8e96f3SDavid Woodhouse * bother to keep track of holes in this rbtree, and neither do we deal 209df8e96f3SDavid Woodhouse * with frags -- we can have multiple entries starting at the same 210df8e96f3SDavid Woodhouse * offset, and the one with the smallest length will come first in the 211df8e96f3SDavid Woodhouse * ordering. 212df8e96f3SDavid Woodhouse * 213df8e96f3SDavid Woodhouse * Returns 0 if the node was inserted 214df8e96f3SDavid Woodhouse * 1 if the node is obsolete (because we can't mark it so yet) 215df8e96f3SDavid Woodhouse * < 0 an if error occurred 216df8e96f3SDavid Woodhouse */ 217df8e96f3SDavid Woodhouse static int jffs2_add_tn_to_tree(struct jffs2_sb_info *c, 218df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii, 219df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *tn) 220df8e96f3SDavid Woodhouse { 221df8e96f3SDavid Woodhouse uint32_t fn_end = tn->fn->ofs + tn->fn->size; 222df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *insert_point = NULL, *this; 223df8e96f3SDavid Woodhouse 224df8e96f3SDavid Woodhouse dbg_readinode("insert fragment %#04x-%#04x, ver %u\n", tn->fn->ofs, fn_end, tn->version); 225df8e96f3SDavid Woodhouse 226df8e96f3SDavid Woodhouse /* If a node has zero dsize, we only have to keep if it if it might be the 227df8e96f3SDavid Woodhouse node with highest version -- i.e. the one which will end up as f->metadata. 228df8e96f3SDavid Woodhouse Note that such nodes won't be REF_UNCHECKED since there are no data to 229df8e96f3SDavid Woodhouse check anyway. */ 230df8e96f3SDavid Woodhouse if (!tn->fn->size) { 231df8e96f3SDavid Woodhouse if (rii->mdata_tn) { 232df8e96f3SDavid Woodhouse /* We had a candidate mdata node already */ 233df8e96f3SDavid Woodhouse dbg_readinode("kill old mdata with ver %d\n", rii->mdata_tn->version); 234df8e96f3SDavid Woodhouse jffs2_kill_tn(c, rii->mdata_tn); 235df8e96f3SDavid Woodhouse } 236df8e96f3SDavid Woodhouse rii->mdata_tn = tn; 237df8e96f3SDavid Woodhouse dbg_readinode("keep new mdata with ver %d\n", tn->version); 238df8e96f3SDavid Woodhouse return 0; 239df8e96f3SDavid Woodhouse } 240df8e96f3SDavid Woodhouse 241df8e96f3SDavid Woodhouse /* Find the earliest node which _may_ be relevant to this one */ 242df8e96f3SDavid Woodhouse this = jffs2_lookup_tn(&rii->tn_root, tn->fn->ofs); 243df8e96f3SDavid Woodhouse if (!this) { 244df8e96f3SDavid Woodhouse /* First addition to empty tree. $DEITY how I love the easy cases */ 245df8e96f3SDavid Woodhouse rb_link_node(&tn->rb, NULL, &rii->tn_root.rb_node); 246df8e96f3SDavid Woodhouse rb_insert_color(&tn->rb, &rii->tn_root); 247df8e96f3SDavid Woodhouse dbg_readinode("keep new frag\n"); 248df8e96f3SDavid Woodhouse return 0; 249df8e96f3SDavid Woodhouse } 250df8e96f3SDavid Woodhouse 251df8e96f3SDavid Woodhouse /* If we add a new node it'll be somewhere under here. */ 252df8e96f3SDavid Woodhouse insert_point = this; 253df8e96f3SDavid Woodhouse 254df8e96f3SDavid Woodhouse /* If the node is coincident with another at a lower address, 255df8e96f3SDavid Woodhouse back up until the other node is found. It may be relevant */ 256df8e96f3SDavid Woodhouse while (tn->overlapped) 257df8e96f3SDavid Woodhouse tn = tn_prev(tn); 258df8e96f3SDavid Woodhouse 259df8e96f3SDavid Woodhouse dbg_readinode("'this' found %#04x-%#04x (%s)\n", this->fn->ofs, this->fn->ofs + this->fn->size, this->fn ? "data" : "hole"); 260df8e96f3SDavid Woodhouse 261df8e96f3SDavid Woodhouse while (this) { 262df8e96f3SDavid Woodhouse if (this->fn->ofs > fn_end) 263df8e96f3SDavid Woodhouse break; 264df8e96f3SDavid Woodhouse dbg_readinode("Ponder this ver %d, 0x%x-0x%x\n", 265df8e96f3SDavid Woodhouse this->version, this->fn->ofs, this->fn->size); 266df8e96f3SDavid Woodhouse 267df8e96f3SDavid Woodhouse if (this->version == tn->version) { 268df8e96f3SDavid Woodhouse /* Version number collision means REF_PRISTINE GC. Accept either of them 269df8e96f3SDavid Woodhouse as long as the CRC is correct. Check the one we have already... */ 270df8e96f3SDavid Woodhouse if (!check_tn_node(c, this)) { 271df8e96f3SDavid Woodhouse /* The one we already had was OK. Keep it and throw away the new one */ 272df8e96f3SDavid Woodhouse dbg_readinode("Like old node. Throw away new\n"); 273df8e96f3SDavid Woodhouse jffs2_kill_tn(c, tn); 274df8e96f3SDavid Woodhouse return 0; 275df8e96f3SDavid Woodhouse } else { 276df8e96f3SDavid Woodhouse /* Who cares if the new one is good; keep it for now anyway. */ 277df8e96f3SDavid Woodhouse rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); 278df8e96f3SDavid Woodhouse /* Same overlapping from in front and behind */ 279df8e96f3SDavid Woodhouse tn->overlapped = this->overlapped; 280df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 281df8e96f3SDavid Woodhouse dbg_readinode("Like new node. Throw away old\n"); 282df8e96f3SDavid Woodhouse return 0; 283df8e96f3SDavid Woodhouse } 284df8e96f3SDavid Woodhouse } 285df8e96f3SDavid Woodhouse if (this->version < tn->version && 286df8e96f3SDavid Woodhouse this->fn->ofs >= tn->fn->ofs && 287df8e96f3SDavid Woodhouse this->fn->ofs + this->fn->size <= fn_end) { 288df8e96f3SDavid Woodhouse /* New node entirely overlaps 'this' */ 289df8e96f3SDavid Woodhouse if (check_tn_node(c, tn)) { 290df8e96f3SDavid Woodhouse dbg_readinode("new node bad CRC\n"); 291df8e96f3SDavid Woodhouse jffs2_kill_tn(c, tn); 292df8e96f3SDavid Woodhouse return 0; 293df8e96f3SDavid Woodhouse } 294df8e96f3SDavid Woodhouse /* ... and is good. Kill 'this'... */ 295df8e96f3SDavid Woodhouse rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); 296df8e96f3SDavid Woodhouse tn->overlapped = this->overlapped; 297df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 298df8e96f3SDavid Woodhouse /* ... and any subsequent nodes which are also overlapped */ 299df8e96f3SDavid Woodhouse this = tn_next(tn); 300df8e96f3SDavid Woodhouse while (this && this->fn->ofs + this->fn->size < fn_end) { 301df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *next = tn_next(this); 302df8e96f3SDavid Woodhouse if (this->version < tn->version) { 303df8e96f3SDavid Woodhouse tn_erase(this, &rii->tn_root); 304df8e96f3SDavid Woodhouse dbg_readinode("Kill overlapped ver %d, 0x%x-0x%x\n", 305df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 306df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 307df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 308df8e96f3SDavid Woodhouse } 309df8e96f3SDavid Woodhouse this = next; 310df8e96f3SDavid Woodhouse } 311df8e96f3SDavid Woodhouse dbg_readinode("Done inserting new\n"); 312df8e96f3SDavid Woodhouse return 0; 313df8e96f3SDavid Woodhouse } 314df8e96f3SDavid Woodhouse if (this->version > tn->version && 315df8e96f3SDavid Woodhouse this->fn->ofs <= tn->fn->ofs && 316df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size >= fn_end) { 317df8e96f3SDavid Woodhouse /* New node entirely overlapped by 'this' */ 318df8e96f3SDavid Woodhouse if (!check_tn_node(c, this)) { 319df8e96f3SDavid Woodhouse dbg_readinode("Good CRC on old node. Kill new\n"); 320df8e96f3SDavid Woodhouse jffs2_kill_tn(c, tn); 321df8e96f3SDavid Woodhouse return 0; 322df8e96f3SDavid Woodhouse } 323df8e96f3SDavid Woodhouse /* ... but 'this' was bad. Replace it... */ 324df8e96f3SDavid Woodhouse rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); 325df8e96f3SDavid Woodhouse dbg_readinode("Bad CRC on old overlapping node. Kill it\n"); 326df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 327df8e96f3SDavid Woodhouse return 0; 328df8e96f3SDavid Woodhouse } 329df8e96f3SDavid Woodhouse /* We want to be inserted under the last node which is 330df8e96f3SDavid Woodhouse either at a lower offset _or_ has a smaller range */ 331df8e96f3SDavid Woodhouse if (this->fn->ofs < tn->fn->ofs || 332df8e96f3SDavid Woodhouse (this->fn->ofs == tn->fn->ofs && 333df8e96f3SDavid Woodhouse this->fn->size <= tn->fn->size)) 334df8e96f3SDavid Woodhouse insert_point = this; 335df8e96f3SDavid Woodhouse 336df8e96f3SDavid Woodhouse this = tn_next(this); 337df8e96f3SDavid Woodhouse } 338df8e96f3SDavid Woodhouse dbg_readinode("insert_point %p, ver %d, 0x%x-0x%x, ov %d\n", 339df8e96f3SDavid Woodhouse insert_point, insert_point->version, insert_point->fn->ofs, 340df8e96f3SDavid Woodhouse insert_point->fn->ofs+insert_point->fn->size, 341df8e96f3SDavid Woodhouse insert_point->overlapped); 342df8e96f3SDavid Woodhouse /* We neither completely obsoleted nor were completely 343df8e96f3SDavid Woodhouse obsoleted by an earlier node. Insert under insert_point */ 344df8e96f3SDavid Woodhouse { 345df8e96f3SDavid Woodhouse struct rb_node *parent = &insert_point->rb; 346df8e96f3SDavid Woodhouse struct rb_node **link = &parent; 347df8e96f3SDavid Woodhouse 348df8e96f3SDavid Woodhouse while (*link) { 349df8e96f3SDavid Woodhouse parent = *link; 350df8e96f3SDavid Woodhouse insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); 351df8e96f3SDavid Woodhouse if (tn->fn->ofs > insert_point->fn->ofs) 352df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_right; 353df8e96f3SDavid Woodhouse else if (tn->fn->ofs < insert_point->fn->ofs || 354df8e96f3SDavid Woodhouse tn->fn->size < insert_point->fn->size) 355df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_left; 356df8e96f3SDavid Woodhouse else 357df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_right; 358df8e96f3SDavid Woodhouse } 359df8e96f3SDavid Woodhouse rb_link_node(&tn->rb, &insert_point->rb, link); 360df8e96f3SDavid Woodhouse rb_insert_color(&tn->rb, &rii->tn_root); 361df8e96f3SDavid Woodhouse } 362df8e96f3SDavid Woodhouse /* If there's anything behind that overlaps us, note it */ 363df8e96f3SDavid Woodhouse this = tn_prev(tn); 364df8e96f3SDavid Woodhouse if (this) { 365df8e96f3SDavid Woodhouse while (1) { 366df8e96f3SDavid Woodhouse if (this->fn->ofs + this->fn->size > tn->fn->ofs) { 367df8e96f3SDavid Woodhouse dbg_readinode("Node is overlapped by %p (v %d, 0x%x-0x%x)\n", 368df8e96f3SDavid Woodhouse this, this->version, this->fn->ofs, 369df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 370df8e96f3SDavid Woodhouse tn->overlapped = 1; 371df8e96f3SDavid Woodhouse break; 372df8e96f3SDavid Woodhouse } 373df8e96f3SDavid Woodhouse if (!this->overlapped) 374df8e96f3SDavid Woodhouse break; 375df8e96f3SDavid Woodhouse this = tn_prev(this); 376df8e96f3SDavid Woodhouse } 377df8e96f3SDavid Woodhouse } 378df8e96f3SDavid Woodhouse 379df8e96f3SDavid Woodhouse /* If the new node overlaps anything ahead, note it */ 380df8e96f3SDavid Woodhouse this = tn_next(tn); 381df8e96f3SDavid Woodhouse while (this && this->fn->ofs < fn_end) { 382df8e96f3SDavid Woodhouse this->overlapped = 1; 383df8e96f3SDavid Woodhouse dbg_readinode("Node ver %d, 0x%x-0x%x is overlapped\n", 384df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 385df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 386df8e96f3SDavid Woodhouse this = tn_next(this); 387df8e96f3SDavid Woodhouse } 388df8e96f3SDavid Woodhouse return 0; 389df8e96f3SDavid Woodhouse } 390df8e96f3SDavid Woodhouse 391df8e96f3SDavid Woodhouse /* Trivial function to remove the last node in the tree. Which by definition 392df8e96f3SDavid Woodhouse has no right-hand -- so can be removed just by making its only child (if 393df8e96f3SDavid Woodhouse any) take its place under its parent. */ 394df8e96f3SDavid Woodhouse static void eat_last(struct rb_root *root, struct rb_node *node) 395df8e96f3SDavid Woodhouse { 396df8e96f3SDavid Woodhouse struct rb_node *parent = rb_parent(node); 397df8e96f3SDavid Woodhouse struct rb_node **link; 398df8e96f3SDavid Woodhouse 399df8e96f3SDavid Woodhouse /* LAST! */ 400df8e96f3SDavid Woodhouse BUG_ON(node->rb_right); 401df8e96f3SDavid Woodhouse 402df8e96f3SDavid Woodhouse if (!parent) 403df8e96f3SDavid Woodhouse link = &root->rb_node; 404df8e96f3SDavid Woodhouse else if (node == parent->rb_left) 405df8e96f3SDavid Woodhouse link = &parent->rb_left; 406df8e96f3SDavid Woodhouse else 407df8e96f3SDavid Woodhouse link = &parent->rb_right; 408df8e96f3SDavid Woodhouse 409df8e96f3SDavid Woodhouse *link = node->rb_left; 410df8e96f3SDavid Woodhouse /* Colour doesn't matter now. Only the parent pointer. */ 411df8e96f3SDavid Woodhouse if (node->rb_left) 412df8e96f3SDavid Woodhouse node->rb_left->rb_parent_color = node->rb_parent_color; 413df8e96f3SDavid Woodhouse } 414df8e96f3SDavid Woodhouse 415df8e96f3SDavid Woodhouse /* We put this in reverse order, so we can just use eat_last */ 416df8e96f3SDavid Woodhouse static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) 417df8e96f3SDavid Woodhouse { 418df8e96f3SDavid Woodhouse struct rb_node **link = &ver_root->rb_node; 419df8e96f3SDavid Woodhouse struct rb_node *parent = NULL; 420df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *this_tn; 421df8e96f3SDavid Woodhouse 422df8e96f3SDavid Woodhouse while (*link) { 423df8e96f3SDavid Woodhouse parent = *link; 424df8e96f3SDavid Woodhouse this_tn = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); 425df8e96f3SDavid Woodhouse 426df8e96f3SDavid Woodhouse if (tn->version > this_tn->version) 427df8e96f3SDavid Woodhouse link = &parent->rb_left; 428df8e96f3SDavid Woodhouse else 429df8e96f3SDavid Woodhouse link = &parent->rb_right; 430df8e96f3SDavid Woodhouse } 431df8e96f3SDavid Woodhouse dbg_readinode("Link new node at %p (root is %p)\n", link, ver_root); 432df8e96f3SDavid Woodhouse rb_link_node(&tn->rb, parent, link); 433df8e96f3SDavid Woodhouse rb_insert_color(&tn->rb, ver_root); 434df8e96f3SDavid Woodhouse } 435df8e96f3SDavid Woodhouse 436df8e96f3SDavid Woodhouse /* Build final, normal fragtree from tn tree. It doesn't matter which order 437df8e96f3SDavid Woodhouse we add nodes to the real fragtree, as long as they don't overlap. And 438df8e96f3SDavid Woodhouse having thrown away the majority of overlapped nodes as we went, there 439df8e96f3SDavid Woodhouse really shouldn't be many sets of nodes which do overlap. If we start at 440df8e96f3SDavid Woodhouse the end, we can use the overlap markers -- we can just eat nodes which 441df8e96f3SDavid Woodhouse aren't overlapped, and when we encounter nodes which _do_ overlap we 442df8e96f3SDavid Woodhouse sort them all into a temporary tree in version order before replaying them. */ 443df8e96f3SDavid Woodhouse static int jffs2_build_inode_fragtree(struct jffs2_sb_info *c, 444df8e96f3SDavid Woodhouse struct jffs2_inode_info *f, 445df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 446df8e96f3SDavid Woodhouse { 447df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *pen, *last, *this; 448df8e96f3SDavid Woodhouse struct rb_root ver_root = RB_ROOT; 449df8e96f3SDavid Woodhouse uint32_t high_ver = 0; 450df8e96f3SDavid Woodhouse 451df8e96f3SDavid Woodhouse if (rii->mdata_tn) { 452df8e96f3SDavid Woodhouse dbg_readinode("potential mdata is ver %d at %p\n", rii->mdata_tn->version, rii->mdata_tn); 453df8e96f3SDavid Woodhouse high_ver = rii->mdata_tn->version; 454df8e96f3SDavid Woodhouse rii->latest_ref = rii->mdata_tn->fn->raw; 455df8e96f3SDavid Woodhouse } 456df8e96f3SDavid Woodhouse #ifdef JFFS2_DBG_READINODE_MESSAGES 457df8e96f3SDavid Woodhouse this = tn_last(&rii->tn_root); 458df8e96f3SDavid Woodhouse while (this) { 459df8e96f3SDavid Woodhouse dbg_readinode("tn %p ver %d range 0x%x-0x%x ov %d\n", this, this->version, this->fn->ofs, 460df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size, this->overlapped); 461df8e96f3SDavid Woodhouse this = tn_prev(this); 462df8e96f3SDavid Woodhouse } 463df8e96f3SDavid Woodhouse #endif 464df8e96f3SDavid Woodhouse pen = tn_last(&rii->tn_root); 465df8e96f3SDavid Woodhouse while ((last = pen)) { 466df8e96f3SDavid Woodhouse pen = tn_prev(last); 467df8e96f3SDavid Woodhouse 468df8e96f3SDavid Woodhouse eat_last(&rii->tn_root, &last->rb); 469df8e96f3SDavid Woodhouse ver_insert(&ver_root, last); 470df8e96f3SDavid Woodhouse 471df8e96f3SDavid Woodhouse if (unlikely(last->overlapped)) 472df8e96f3SDavid Woodhouse continue; 473df8e96f3SDavid Woodhouse 474df8e96f3SDavid Woodhouse /* Now we have a bunch of nodes in reverse version 475df8e96f3SDavid Woodhouse order, in the tree at ver_root. Most of the time, 476df8e96f3SDavid Woodhouse there'll actually be only one node in the 'tree', 477df8e96f3SDavid Woodhouse in fact. */ 478df8e96f3SDavid Woodhouse this = tn_last(&ver_root); 479df8e96f3SDavid Woodhouse 480df8e96f3SDavid Woodhouse while (this) { 481df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *vers_next; 482df8e96f3SDavid Woodhouse int ret; 483df8e96f3SDavid Woodhouse vers_next = tn_prev(this); 484df8e96f3SDavid Woodhouse eat_last(&ver_root, &this->rb); 485df8e96f3SDavid Woodhouse if (check_tn_node(c, this)) { 486df8e96f3SDavid Woodhouse dbg_readinode("node ver %x, 0x%x-0x%x failed CRC\n", 487df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 488df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 489df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 490df8e96f3SDavid Woodhouse } else { 491df8e96f3SDavid Woodhouse if (this->version > high_ver) { 492df8e96f3SDavid Woodhouse /* Note that this is different from the other 493df8e96f3SDavid Woodhouse highest_version, because this one is only 494df8e96f3SDavid Woodhouse counting _valid_ nodes which could give the 495df8e96f3SDavid Woodhouse latest inode metadata */ 496df8e96f3SDavid Woodhouse high_ver = this->version; 497df8e96f3SDavid Woodhouse rii->latest_ref = this->fn->raw; 498df8e96f3SDavid Woodhouse } 499df8e96f3SDavid Woodhouse dbg_readinode("Add %p (v %x, 0x%x-0x%x, ov %d) to fragtree\n", 500df8e96f3SDavid Woodhouse this, this->version, this->fn->ofs, 501df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size, this->overlapped); 502df8e96f3SDavid Woodhouse 503df8e96f3SDavid Woodhouse ret = jffs2_add_full_dnode_to_inode(c, f, this->fn); 504df8e96f3SDavid Woodhouse if (ret) { 505df8e96f3SDavid Woodhouse /* Free the nodes in vers_root; let the caller 506df8e96f3SDavid Woodhouse deal with the rest */ 507df8e96f3SDavid Woodhouse JFFS2_ERROR("Add node to tree failed %d\n", ret); 508df8e96f3SDavid Woodhouse while (1) { 509df8e96f3SDavid Woodhouse vers_next = tn_prev(this); 510df8e96f3SDavid Woodhouse if (check_tn_node(c, this)) 511df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, this->fn->raw); 512df8e96f3SDavid Woodhouse jffs2_free_full_dnode(this->fn); 513df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(this); 514df8e96f3SDavid Woodhouse this = vers_next; 515df8e96f3SDavid Woodhouse if (!this) 516df8e96f3SDavid Woodhouse break; 517df8e96f3SDavid Woodhouse eat_last(&ver_root, &vers_next->rb); 518df8e96f3SDavid Woodhouse } 519df8e96f3SDavid Woodhouse return ret; 520df8e96f3SDavid Woodhouse } 521df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(this); 522df8e96f3SDavid Woodhouse } 523df8e96f3SDavid Woodhouse this = vers_next; 524df8e96f3SDavid Woodhouse } 525df8e96f3SDavid Woodhouse } 526df8e96f3SDavid Woodhouse return 0; 527f97117d1SArtem B. Bityutskiy } 528f97117d1SArtem B. Bityutskiy 529f97117d1SArtem B. Bityutskiy static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) 530f97117d1SArtem B. Bityutskiy { 531f97117d1SArtem B. Bityutskiy struct rb_node *this; 532f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 533f97117d1SArtem B. Bityutskiy 534f97117d1SArtem B. Bityutskiy this = list->rb_node; 535f97117d1SArtem B. Bityutskiy 536f97117d1SArtem B. Bityutskiy /* Now at bottom of tree */ 537f97117d1SArtem B. Bityutskiy while (this) { 538f97117d1SArtem B. Bityutskiy if (this->rb_left) 539f97117d1SArtem B. Bityutskiy this = this->rb_left; 540f97117d1SArtem B. Bityutskiy else if (this->rb_right) 541f97117d1SArtem B. Bityutskiy this = this->rb_right; 542f97117d1SArtem B. Bityutskiy else { 543f97117d1SArtem B. Bityutskiy tn = rb_entry(this, struct jffs2_tmp_dnode_info, rb); 544f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(tn->fn); 545f97117d1SArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 546f97117d1SArtem B. Bityutskiy 54721f1d5fcSDavid Woodhouse this = rb_parent(this); 548f97117d1SArtem B. Bityutskiy if (!this) 5491da177e4SLinus Torvalds break; 5501da177e4SLinus Torvalds 551f97117d1SArtem B. Bityutskiy if (this->rb_left == &tn->rb) 552f97117d1SArtem B. Bityutskiy this->rb_left = NULL; 553f97117d1SArtem B. Bityutskiy else if (this->rb_right == &tn->rb) 554f97117d1SArtem B. Bityutskiy this->rb_right = NULL; 555f97117d1SArtem B. Bityutskiy else BUG(); 556f97117d1SArtem B. Bityutskiy } 557f97117d1SArtem B. Bityutskiy } 558f97117d1SArtem B. Bityutskiy list->rb_node = NULL; 559f97117d1SArtem B. Bityutskiy } 5601da177e4SLinus Torvalds 561f97117d1SArtem B. Bityutskiy static void jffs2_free_full_dirent_list(struct jffs2_full_dirent *fd) 562f97117d1SArtem B. Bityutskiy { 563f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *next; 564f97117d1SArtem B. Bityutskiy 565f97117d1SArtem B. Bityutskiy while (fd) { 566f97117d1SArtem B. Bityutskiy next = fd->next; 567f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 568f97117d1SArtem B. Bityutskiy fd = next; 569f97117d1SArtem B. Bityutskiy } 570f97117d1SArtem B. Bityutskiy } 571f97117d1SArtem B. Bityutskiy 572f97117d1SArtem B. Bityutskiy /* Returns first valid node after 'ref'. May return 'ref' */ 573f97117d1SArtem B. Bityutskiy static struct jffs2_raw_node_ref *jffs2_first_valid_node(struct jffs2_raw_node_ref *ref) 574f97117d1SArtem B. Bityutskiy { 575f97117d1SArtem B. Bityutskiy while (ref && ref->next_in_ino) { 576f97117d1SArtem B. Bityutskiy if (!ref_obsolete(ref)) 577f97117d1SArtem B. Bityutskiy return ref; 578733802d9SArtem B. Bityutskiy dbg_noderef("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref)); 579f97117d1SArtem B. Bityutskiy ref = ref->next_in_ino; 580f97117d1SArtem B. Bityutskiy } 581f97117d1SArtem B. Bityutskiy return NULL; 582f97117d1SArtem B. Bityutskiy } 583f97117d1SArtem B. Bityutskiy 584f97117d1SArtem B. Bityutskiy /* 585f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 586f97117d1SArtem B. Bityutskiy * It is called every time an directory entry node is found. 587f97117d1SArtem B. Bityutskiy * 588f97117d1SArtem B. Bityutskiy * Returns: 0 on succes; 589f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 590f97117d1SArtem B. Bityutskiy * negative error code on failure. 591f97117d1SArtem B. Bityutskiy */ 5921e0da3cbSArtem B. Bityutskiy static inline int read_direntry(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 593df8e96f3SDavid Woodhouse struct jffs2_raw_dirent *rd, size_t read, 594df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 595f97117d1SArtem B. Bityutskiy { 596f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *fd; 5971046d880SDavid Woodhouse uint32_t crc; 598f97117d1SArtem B. Bityutskiy 599f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 600f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 601f97117d1SArtem B. Bityutskiy 6021046d880SDavid Woodhouse crc = crc32(0, rd, sizeof(*rd) - 8); 6031046d880SDavid Woodhouse if (unlikely(crc != je32_to_cpu(rd->node_crc))) { 6041046d880SDavid Woodhouse JFFS2_NOTICE("header CRC failed on dirent node at %#08x: read %#08x, calculated %#08x\n", 6051046d880SDavid Woodhouse ref_offset(ref), je32_to_cpu(rd->node_crc), crc); 606df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 607df8e96f3SDavid Woodhouse return 0; 6081046d880SDavid Woodhouse } 6091046d880SDavid Woodhouse 6101046d880SDavid Woodhouse /* If we've never checked the CRCs on this node, check them now */ 6111046d880SDavid Woodhouse if (ref_flags(ref) == REF_UNCHECKED) { 6121046d880SDavid Woodhouse struct jffs2_eraseblock *jeb; 6131046d880SDavid Woodhouse int len; 6141046d880SDavid Woodhouse 615f97117d1SArtem B. Bityutskiy /* Sanity check */ 616f97117d1SArtem B. Bityutskiy if (unlikely(PAD((rd->nsize + sizeof(*rd))) != PAD(je32_to_cpu(rd->totlen)))) { 617e0d60137SArtem B. Bityutskiy JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n", 618f97117d1SArtem B. Bityutskiy ref_offset(ref), rd->nsize, je32_to_cpu(rd->totlen)); 619df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 620df8e96f3SDavid Woodhouse return 0; 621f97117d1SArtem B. Bityutskiy } 622f97117d1SArtem B. Bityutskiy 6231046d880SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 6241046d880SDavid Woodhouse len = ref_totlen(c, jeb, ref); 6251046d880SDavid Woodhouse 6261046d880SDavid Woodhouse spin_lock(&c->erase_completion_lock); 6271046d880SDavid Woodhouse jeb->used_size += len; 6281046d880SDavid Woodhouse jeb->unchecked_size -= len; 6291046d880SDavid Woodhouse c->used_size += len; 6301046d880SDavid Woodhouse c->unchecked_size -= len; 6311046d880SDavid Woodhouse ref->flash_offset = ref_offset(ref) | REF_PRISTINE; 6321046d880SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 6331046d880SDavid Woodhouse } 6341046d880SDavid Woodhouse 635f97117d1SArtem B. Bityutskiy fd = jffs2_alloc_full_dirent(rd->nsize + 1); 636f97117d1SArtem B. Bityutskiy if (unlikely(!fd)) 637f97117d1SArtem B. Bityutskiy return -ENOMEM; 638f97117d1SArtem B. Bityutskiy 639f97117d1SArtem B. Bityutskiy fd->raw = ref; 640f97117d1SArtem B. Bityutskiy fd->version = je32_to_cpu(rd->version); 641f97117d1SArtem B. Bityutskiy fd->ino = je32_to_cpu(rd->ino); 642f97117d1SArtem B. Bityutskiy fd->type = rd->type; 643f97117d1SArtem B. Bityutskiy 644df8e96f3SDavid Woodhouse if (fd->version > rii->highest_version) 645df8e96f3SDavid Woodhouse rii->highest_version = fd->version; 646df8e96f3SDavid Woodhouse 647f97117d1SArtem B. Bityutskiy /* Pick out the mctime of the latest dirent */ 648df8e96f3SDavid Woodhouse if(fd->version > rii->mctime_ver && je32_to_cpu(rd->mctime)) { 649df8e96f3SDavid Woodhouse rii->mctime_ver = fd->version; 650df8e96f3SDavid Woodhouse rii->latest_mctime = je32_to_cpu(rd->mctime); 651f97117d1SArtem B. Bityutskiy } 652f97117d1SArtem B. Bityutskiy 653f97117d1SArtem B. Bityutskiy /* 654f97117d1SArtem B. Bityutskiy * Copy as much of the name as possible from the raw 655f97117d1SArtem B. Bityutskiy * dirent we've already read from the flash. 656f97117d1SArtem B. Bityutskiy */ 657f97117d1SArtem B. Bityutskiy if (read > sizeof(*rd)) 658f97117d1SArtem B. Bityutskiy memcpy(&fd->name[0], &rd->name[0], 659f97117d1SArtem B. Bityutskiy min_t(uint32_t, rd->nsize, (read - sizeof(*rd)) )); 660f97117d1SArtem B. Bityutskiy 661f97117d1SArtem B. Bityutskiy /* Do we need to copy any more of the name directly from the flash? */ 662f97117d1SArtem B. Bityutskiy if (rd->nsize + sizeof(*rd) > read) { 663f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 664f97117d1SArtem B. Bityutskiy int err; 665f97117d1SArtem B. Bityutskiy int already = read - sizeof(*rd); 666f97117d1SArtem B. Bityutskiy 667f97117d1SArtem B. Bityutskiy err = jffs2_flash_read(c, (ref_offset(ref)) + read, 668f97117d1SArtem B. Bityutskiy rd->nsize - already, &read, &fd->name[already]); 669f97117d1SArtem B. Bityutskiy if (unlikely(read != rd->nsize - already) && likely(!err)) 670f97117d1SArtem B. Bityutskiy return -EIO; 671f97117d1SArtem B. Bityutskiy 672f97117d1SArtem B. Bityutskiy if (unlikely(err)) { 673e0d60137SArtem B. Bityutskiy JFFS2_ERROR("read remainder of name: error %d\n", err); 674f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 675f97117d1SArtem B. Bityutskiy return -EIO; 676f97117d1SArtem B. Bityutskiy } 677f97117d1SArtem B. Bityutskiy } 678f97117d1SArtem B. Bityutskiy 679f97117d1SArtem B. Bityutskiy fd->nhash = full_name_hash(fd->name, rd->nsize); 680f97117d1SArtem B. Bityutskiy fd->next = NULL; 681f97117d1SArtem B. Bityutskiy fd->name[rd->nsize] = '\0'; 682f97117d1SArtem B. Bityutskiy 683f97117d1SArtem B. Bityutskiy /* 684f97117d1SArtem B. Bityutskiy * Wheee. We now have a complete jffs2_full_dirent structure, with 685f97117d1SArtem B. Bityutskiy * the name in it and everything. Link it into the list 686f97117d1SArtem B. Bityutskiy */ 687df8e96f3SDavid Woodhouse jffs2_add_fd_to_list(c, fd, &rii->fds); 688f97117d1SArtem B. Bityutskiy 689f97117d1SArtem B. Bityutskiy return 0; 690f97117d1SArtem B. Bityutskiy } 691f97117d1SArtem B. Bityutskiy 692f97117d1SArtem B. Bityutskiy /* 693f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 694f97117d1SArtem B. Bityutskiy * It is called every time an inode node is found. 695f97117d1SArtem B. Bityutskiy * 696df8e96f3SDavid Woodhouse * Returns: 0 on success; 697f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 698f97117d1SArtem B. Bityutskiy * negative error code on failure. 699f97117d1SArtem B. Bityutskiy */ 7001e0da3cbSArtem B. Bityutskiy static inline int read_dnode(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 701df8e96f3SDavid Woodhouse struct jffs2_raw_inode *rd, int rdlen, 702df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 703f97117d1SArtem B. Bityutskiy { 704f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 7051e0da3cbSArtem B. Bityutskiy uint32_t len, csize; 7061e0da3cbSArtem B. Bityutskiy int ret = 1; 7071046d880SDavid Woodhouse uint32_t crc; 708f97117d1SArtem B. Bityutskiy 709f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 710f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 711f97117d1SArtem B. Bityutskiy 7121046d880SDavid Woodhouse crc = crc32(0, rd, sizeof(*rd) - 8); 7131046d880SDavid Woodhouse if (unlikely(crc != je32_to_cpu(rd->node_crc))) { 7141046d880SDavid Woodhouse JFFS2_NOTICE("node CRC failed on dnode at %#08x: read %#08x, calculated %#08x\n", 7151046d880SDavid Woodhouse ref_offset(ref), je32_to_cpu(rd->node_crc), crc); 716df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 717df8e96f3SDavid Woodhouse return 0; 7181046d880SDavid Woodhouse } 7191046d880SDavid Woodhouse 7201e0da3cbSArtem B. Bityutskiy tn = jffs2_alloc_tmp_dnode_info(); 7211e0da3cbSArtem B. Bityutskiy if (!tn) { 722fb6a82c9SRandy Dunlap JFFS2_ERROR("failed to allocate tn (%zu bytes).\n", sizeof(*tn)); 7231e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7241e0da3cbSArtem B. Bityutskiy } 7251e0da3cbSArtem B. Bityutskiy 7261e0da3cbSArtem B. Bityutskiy tn->partial_crc = 0; 7271e0da3cbSArtem B. Bityutskiy csize = je32_to_cpu(rd->csize); 7281e0da3cbSArtem B. Bityutskiy 729f97117d1SArtem B. Bityutskiy /* If we've never checked the CRCs on this node, check them now */ 730f97117d1SArtem B. Bityutskiy if (ref_flags(ref) == REF_UNCHECKED) { 731f97117d1SArtem B. Bityutskiy 732f97117d1SArtem B. Bityutskiy /* Sanity checks */ 733f97117d1SArtem B. Bityutskiy if (unlikely(je32_to_cpu(rd->offset) > je32_to_cpu(rd->isize)) || 734f97117d1SArtem B. Bityutskiy unlikely(PAD(je32_to_cpu(rd->csize) + sizeof(*rd)) != PAD(je32_to_cpu(rd->totlen)))) { 735e0d60137SArtem B. Bityutskiy JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref)); 736737b7661SAndrew Lunn jffs2_dbg_dump_node(c, ref_offset(ref)); 7371e0da3cbSArtem B. Bityutskiy goto free_out; 738f97117d1SArtem B. Bityutskiy } 739f97117d1SArtem B. Bityutskiy 7401e0da3cbSArtem B. Bityutskiy if (jffs2_is_writebuffered(c) && csize != 0) { 7411e0da3cbSArtem B. Bityutskiy /* At this point we are supposed to check the data CRC 7421e0da3cbSArtem B. Bityutskiy * of our unchecked node. But thus far, we do not 7431e0da3cbSArtem B. Bityutskiy * know whether the node is valid or obsolete. To 7441e0da3cbSArtem B. Bityutskiy * figure this out, we need to walk all the nodes of 7451e0da3cbSArtem B. Bityutskiy * the inode and build the inode fragtree. We don't 7461e0da3cbSArtem B. Bityutskiy * want to spend time checking data of nodes which may 7471e0da3cbSArtem B. Bityutskiy * later be found to be obsolete. So we put off the full 7481e0da3cbSArtem B. Bityutskiy * data CRC checking until we have read all the inode 7491e0da3cbSArtem B. Bityutskiy * nodes and have started building the fragtree. 7501e0da3cbSArtem B. Bityutskiy * 7511e0da3cbSArtem B. Bityutskiy * The fragtree is being built starting with nodes 7521e0da3cbSArtem B. Bityutskiy * having the highest version number, so we'll be able 7531e0da3cbSArtem B. Bityutskiy * to detect whether a node is valid (i.e., it is not 7541e0da3cbSArtem B. Bityutskiy * overlapped by a node with higher version) or not. 7551e0da3cbSArtem B. Bityutskiy * And we'll be able to check only those nodes, which 7561e0da3cbSArtem B. Bityutskiy * are not obsolete. 7571e0da3cbSArtem B. Bityutskiy * 7581e0da3cbSArtem B. Bityutskiy * Of course, this optimization only makes sense in case 7591e0da3cbSArtem B. Bityutskiy * of NAND flashes (or other flashes whith 7601e0da3cbSArtem B. Bityutskiy * !jffs2_can_mark_obsolete()), since on NOR flashes 7611e0da3cbSArtem B. Bityutskiy * nodes are marked obsolete physically. 7621e0da3cbSArtem B. Bityutskiy * 7631e0da3cbSArtem B. Bityutskiy * Since NAND flashes (or other flashes with 7641e0da3cbSArtem B. Bityutskiy * jffs2_is_writebuffered(c)) are anyway read by 7651e0da3cbSArtem B. Bityutskiy * fractions of c->wbuf_pagesize, and we have just read 7661e0da3cbSArtem B. Bityutskiy * the node header, it is likely that the starting part 7671e0da3cbSArtem B. Bityutskiy * of the node data is also read when we read the 7681e0da3cbSArtem B. Bityutskiy * header. So we don't mind to check the CRC of the 7691e0da3cbSArtem B. Bityutskiy * starting part of the data of the node now, and check 7701e0da3cbSArtem B. Bityutskiy * the second part later (in jffs2_check_node_data()). 7711e0da3cbSArtem B. Bityutskiy * Of course, we will not need to re-read and re-check 7721e0da3cbSArtem B. Bityutskiy * the NAND page which we have just read. This is why we 7731e0da3cbSArtem B. Bityutskiy * read the whole NAND page at jffs2_get_inode_nodes(), 7741e0da3cbSArtem B. Bityutskiy * while we needed only the node header. 7751e0da3cbSArtem B. Bityutskiy */ 7761e0da3cbSArtem B. Bityutskiy unsigned char *buf; 777f97117d1SArtem B. Bityutskiy 7781e0da3cbSArtem B. Bityutskiy /* 'buf' will point to the start of data */ 7791e0da3cbSArtem B. Bityutskiy buf = (unsigned char *)rd + sizeof(*rd); 7801e0da3cbSArtem B. Bityutskiy /* len will be the read data length */ 7811e0da3cbSArtem B. Bityutskiy len = min_t(uint32_t, rdlen - sizeof(*rd), csize); 782280562b2SArtem B. Bityutskiy tn->partial_crc = crc32(0, buf, len); 783f97117d1SArtem B. Bityutskiy 784733802d9SArtem B. Bityutskiy dbg_readinode("Calculates CRC (%#08x) for %d bytes, csize %d\n", tn->partial_crc, len, csize); 785f97117d1SArtem B. Bityutskiy 7861e0da3cbSArtem B. Bityutskiy /* If we actually calculated the whole data CRC 7871e0da3cbSArtem B. Bityutskiy * and it is wrong, drop the node. */ 7883c091337SArtem B. Bityutskiy if (len >= csize && unlikely(tn->partial_crc != je32_to_cpu(rd->data_crc))) { 78939243508SArtem B. Bityutskiy JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 79039243508SArtem B. Bityutskiy ref_offset(ref), tn->partial_crc, je32_to_cpu(rd->data_crc)); 7911e0da3cbSArtem B. Bityutskiy goto free_out; 79239243508SArtem B. Bityutskiy } 793f97117d1SArtem B. Bityutskiy 7941e0da3cbSArtem B. Bityutskiy } else if (csize == 0) { 7951e0da3cbSArtem B. Bityutskiy /* 7961e0da3cbSArtem B. Bityutskiy * We checked the header CRC. If the node has no data, adjust 7971e0da3cbSArtem B. Bityutskiy * the space accounting now. For other nodes this will be done 7981e0da3cbSArtem B. Bityutskiy * later either when the node is marked obsolete or when its 7991e0da3cbSArtem B. Bityutskiy * data is checked. 8001e0da3cbSArtem B. Bityutskiy */ 8011e0da3cbSArtem B. Bityutskiy struct jffs2_eraseblock *jeb; 8021e0da3cbSArtem B. Bityutskiy 803733802d9SArtem B. Bityutskiy dbg_readinode("the node has no data.\n"); 804f97117d1SArtem B. Bityutskiy jeb = &c->blocks[ref->flash_offset / c->sector_size]; 805f97117d1SArtem B. Bityutskiy len = ref_totlen(c, jeb, ref); 806f97117d1SArtem B. Bityutskiy 807f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 808f97117d1SArtem B. Bityutskiy jeb->used_size += len; 809f97117d1SArtem B. Bityutskiy jeb->unchecked_size -= len; 810f97117d1SArtem B. Bityutskiy c->used_size += len; 811f97117d1SArtem B. Bityutskiy c->unchecked_size -= len; 812f97117d1SArtem B. Bityutskiy ref->flash_offset = ref_offset(ref) | REF_NORMAL; 813f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 814f97117d1SArtem B. Bityutskiy } 815f97117d1SArtem B. Bityutskiy } 816f97117d1SArtem B. Bityutskiy 817f97117d1SArtem B. Bityutskiy tn->fn = jffs2_alloc_full_dnode(); 818f97117d1SArtem B. Bityutskiy if (!tn->fn) { 819e0d60137SArtem B. Bityutskiy JFFS2_ERROR("alloc fn failed\n"); 8201e0da3cbSArtem B. Bityutskiy ret = -ENOMEM; 8211e0da3cbSArtem B. Bityutskiy goto free_out; 822f97117d1SArtem B. Bityutskiy } 823f97117d1SArtem B. Bityutskiy 824f97117d1SArtem B. Bityutskiy tn->version = je32_to_cpu(rd->version); 825f97117d1SArtem B. Bityutskiy tn->fn->ofs = je32_to_cpu(rd->offset); 8261e0da3cbSArtem B. Bityutskiy tn->data_crc = je32_to_cpu(rd->data_crc); 8271e0da3cbSArtem B. Bityutskiy tn->csize = csize; 828f97117d1SArtem B. Bityutskiy tn->fn->raw = ref; 829df8e96f3SDavid Woodhouse tn->overlapped = 0; 830df8e96f3SDavid Woodhouse 831df8e96f3SDavid Woodhouse if (tn->version > rii->highest_version) 832df8e96f3SDavid Woodhouse rii->highest_version = tn->version; 833f97117d1SArtem B. Bityutskiy 834f97117d1SArtem B. Bityutskiy /* There was a bug where we wrote hole nodes out with 835f97117d1SArtem B. Bityutskiy csize/dsize swapped. Deal with it */ 8361e0da3cbSArtem B. Bityutskiy if (rd->compr == JFFS2_COMPR_ZERO && !je32_to_cpu(rd->dsize) && csize) 8371e0da3cbSArtem B. Bityutskiy tn->fn->size = csize; 838f97117d1SArtem B. Bityutskiy else // normal case... 839f97117d1SArtem B. Bityutskiy tn->fn->size = je32_to_cpu(rd->dsize); 840f97117d1SArtem B. Bityutskiy 841733802d9SArtem B. Bityutskiy dbg_readinode("dnode @%08x: ver %u, offset %#04x, dsize %#04x, csize %#04x\n", 842280562b2SArtem B. Bityutskiy ref_offset(ref), je32_to_cpu(rd->version), je32_to_cpu(rd->offset), je32_to_cpu(rd->dsize), csize); 843f97117d1SArtem B. Bityutskiy 844df8e96f3SDavid Woodhouse ret = jffs2_add_tn_to_tree(c, rii, tn); 845f97117d1SArtem B. Bityutskiy 846df8e96f3SDavid Woodhouse if (ret) { 847df8e96f3SDavid Woodhouse jffs2_free_full_dnode(tn->fn); 8481e0da3cbSArtem B. Bityutskiy free_out: 8491e0da3cbSArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 8501e0da3cbSArtem B. Bityutskiy return ret; 851f97117d1SArtem B. Bityutskiy } 852df8e96f3SDavid Woodhouse #ifdef JFFS2_DBG_READINODE_MESSAGES 853df8e96f3SDavid Woodhouse dbg_readinode("After adding ver %d:\n", tn->version); 854df8e96f3SDavid Woodhouse tn = tn_first(&rii->tn_root); 855df8e96f3SDavid Woodhouse while (tn) { 856df8e96f3SDavid Woodhouse dbg_readinode("%p: v %d r 0x%x-0x%x ov %d\n", 857df8e96f3SDavid Woodhouse tn, tn->version, tn->fn->ofs, 858df8e96f3SDavid Woodhouse tn->fn->ofs+tn->fn->size, tn->overlapped); 859df8e96f3SDavid Woodhouse tn = tn_next(tn); 860df8e96f3SDavid Woodhouse } 861df8e96f3SDavid Woodhouse #endif 862df8e96f3SDavid Woodhouse return 0; 863df8e96f3SDavid Woodhouse } 864f97117d1SArtem B. Bityutskiy 865f97117d1SArtem B. Bityutskiy /* 866f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 867f97117d1SArtem B. Bityutskiy * It is called every time an unknown node is found. 868f97117d1SArtem B. Bityutskiy * 8693877f0b6SDavid Woodhouse * Returns: 0 on success; 870f97117d1SArtem B. Bityutskiy * 1 if the node should be marked obsolete; 871f97117d1SArtem B. Bityutskiy * negative error code on failure. 872f97117d1SArtem B. Bityutskiy */ 8731e0da3cbSArtem B. Bityutskiy static inline int read_unknown(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, struct jffs2_unknown_node *un) 874f97117d1SArtem B. Bityutskiy { 875f97117d1SArtem B. Bityutskiy /* We don't mark unknown nodes as REF_UNCHECKED */ 876c7258a44SDavid Woodhouse if (ref_flags(ref) == REF_UNCHECKED) { 877c7258a44SDavid Woodhouse JFFS2_ERROR("REF_UNCHECKED but unknown node at %#08x\n", 878c7258a44SDavid Woodhouse ref_offset(ref)); 879c7258a44SDavid Woodhouse JFFS2_ERROR("Node is {%04x,%04x,%08x,%08x}. Please report this error.\n", 880c7258a44SDavid Woodhouse je16_to_cpu(un->magic), je16_to_cpu(un->nodetype), 881c7258a44SDavid Woodhouse je32_to_cpu(un->totlen), je32_to_cpu(un->hdr_crc)); 882df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 883df8e96f3SDavid Woodhouse return 0; 884c7258a44SDavid Woodhouse } 885f97117d1SArtem B. Bityutskiy 886f97117d1SArtem B. Bityutskiy un->nodetype = cpu_to_je16(JFFS2_NODE_ACCURATE | je16_to_cpu(un->nodetype)); 887f97117d1SArtem B. Bityutskiy 888f97117d1SArtem B. Bityutskiy switch(je16_to_cpu(un->nodetype) & JFFS2_COMPAT_MASK) { 889f97117d1SArtem B. Bityutskiy 890f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_INCOMPAT: 891e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown INCOMPAT nodetype %#04X at %#08x\n", 892f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 893f97117d1SArtem B. Bityutskiy /* EEP */ 894f97117d1SArtem B. Bityutskiy BUG(); 895f97117d1SArtem B. Bityutskiy break; 896f97117d1SArtem B. Bityutskiy 897f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_ROCOMPAT: 898e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown ROCOMPAT nodetype %#04X at %#08x\n", 899f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 900f97117d1SArtem B. Bityutskiy BUG_ON(!(c->flags & JFFS2_SB_FLAG_RO)); 901f97117d1SArtem B. Bityutskiy break; 902f97117d1SArtem B. Bityutskiy 903f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_COPY: 904e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_COPY nodetype %#04X at %#08x\n", 905f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 906f97117d1SArtem B. Bityutskiy break; 907f97117d1SArtem B. Bityutskiy 908f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_DELETE: 909e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_DELETE nodetype %#04X at %#08x\n", 910f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 911df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 912df8e96f3SDavid Woodhouse return 0; 913f97117d1SArtem B. Bityutskiy } 914f97117d1SArtem B. Bityutskiy 915f97117d1SArtem B. Bityutskiy return 0; 916f97117d1SArtem B. Bityutskiy } 917f97117d1SArtem B. Bityutskiy 9181e0da3cbSArtem B. Bityutskiy /* 9191e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 9201e0da3cbSArtem B. Bityutskiy * The function detects whether more data should be read and reads it if yes. 9211e0da3cbSArtem B. Bityutskiy * 9221e0da3cbSArtem B. Bityutskiy * Returns: 0 on succes; 9231e0da3cbSArtem B. Bityutskiy * negative error code on failure. 9241e0da3cbSArtem B. Bityutskiy */ 9251e0da3cbSArtem B. Bityutskiy static int read_more(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 92610731f83SArtem Bityutskiy int needed_len, int *rdlen, unsigned char *buf) 9271e0da3cbSArtem B. Bityutskiy { 92810731f83SArtem Bityutskiy int err, to_read = needed_len - *rdlen; 9291e0da3cbSArtem B. Bityutskiy size_t retlen; 9301e0da3cbSArtem B. Bityutskiy uint32_t offs; 9311e0da3cbSArtem B. Bityutskiy 9321e0da3cbSArtem B. Bityutskiy if (jffs2_is_writebuffered(c)) { 93310731f83SArtem Bityutskiy int rem = to_read % c->wbuf_pagesize; 9341e0da3cbSArtem B. Bityutskiy 93510731f83SArtem Bityutskiy if (rem) 93610731f83SArtem Bityutskiy to_read += c->wbuf_pagesize - rem; 93710731f83SArtem Bityutskiy } 9381e0da3cbSArtem B. Bityutskiy 9391e0da3cbSArtem B. Bityutskiy /* We need to read more data */ 9401e0da3cbSArtem B. Bityutskiy offs = ref_offset(ref) + *rdlen; 9411e0da3cbSArtem B. Bityutskiy 94210731f83SArtem Bityutskiy dbg_readinode("read more %d bytes\n", to_read); 9431e0da3cbSArtem B. Bityutskiy 94410731f83SArtem Bityutskiy err = jffs2_flash_read(c, offs, to_read, &retlen, buf + *rdlen); 9451e0da3cbSArtem B. Bityutskiy if (err) { 9461e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, " 94710731f83SArtem Bityutskiy "error code: %d.\n", to_read, offs, err); 9481e0da3cbSArtem B. Bityutskiy return err; 9491e0da3cbSArtem B. Bityutskiy } 9501e0da3cbSArtem B. Bityutskiy 95110731f83SArtem Bityutskiy if (retlen < to_read) { 952fb6a82c9SRandy Dunlap JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", 95310731f83SArtem Bityutskiy offs, retlen, to_read); 9541e0da3cbSArtem B. Bityutskiy return -EIO; 9551e0da3cbSArtem B. Bityutskiy } 9561e0da3cbSArtem B. Bityutskiy 95710731f83SArtem Bityutskiy *rdlen += to_read; 9581e0da3cbSArtem B. Bityutskiy return 0; 9591e0da3cbSArtem B. Bityutskiy } 9601e0da3cbSArtem B. Bityutskiy 961f97117d1SArtem B. Bityutskiy /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated 962df8e96f3SDavid Woodhouse with this ino. Perform a preliminary ordering on data nodes, throwing away 963df8e96f3SDavid Woodhouse those which are completely obsoleted by newer ones. The naïve approach we 964df8e96f3SDavid Woodhouse use to take of just returning them _all_ in version order will cause us to 965df8e96f3SDavid Woodhouse run out of memory in certain degenerate cases. */ 966f97117d1SArtem B. Bityutskiy static int jffs2_get_inode_nodes(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 967df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 968f97117d1SArtem B. Bityutskiy { 969f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, *valid_ref; 9701e0da3cbSArtem B. Bityutskiy unsigned char *buf = NULL; 9711e0da3cbSArtem B. Bityutskiy union jffs2_node_union *node; 972f97117d1SArtem B. Bityutskiy size_t retlen; 9731e0da3cbSArtem B. Bityutskiy int len, err; 974f97117d1SArtem B. Bityutskiy 975df8e96f3SDavid Woodhouse rii->mctime_ver = 0; 976f97117d1SArtem B. Bityutskiy 977733802d9SArtem B. Bityutskiy dbg_readinode("ino #%u\n", f->inocache->ino); 978f97117d1SArtem B. Bityutskiy 9791e0da3cbSArtem B. Bityutskiy /* FIXME: in case of NOR and available ->point() this 9801e0da3cbSArtem B. Bityutskiy * needs to be fixed. */ 98110731f83SArtem Bityutskiy len = sizeof(union jffs2_node_union) + c->wbuf_pagesize; 9821e0da3cbSArtem B. Bityutskiy buf = kmalloc(len, GFP_KERNEL); 9831e0da3cbSArtem B. Bityutskiy if (!buf) 9841e0da3cbSArtem B. Bityutskiy return -ENOMEM; 9851e0da3cbSArtem B. Bityutskiy 986f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 987f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(f->inocache->nodes); 9881e0da3cbSArtem B. Bityutskiy if (!valid_ref && f->inocache->ino != 1) 9891e0da3cbSArtem B. Bityutskiy JFFS2_WARNING("Eep. No valid nodes for ino #%u.\n", f->inocache->ino); 990f97117d1SArtem B. Bityutskiy while (valid_ref) { 991f97117d1SArtem B. Bityutskiy /* We can hold a pointer to a non-obsolete node without the spinlock, 992f97117d1SArtem B. Bityutskiy but _obsolete_ nodes may disappear at any time, if the block 993f97117d1SArtem B. Bityutskiy they're in gets erased. So if we mark 'ref' obsolete while we're 994f97117d1SArtem B. Bityutskiy not holding the lock, it can go away immediately. For that reason, 995f97117d1SArtem B. Bityutskiy we find the next valid node first, before processing 'ref'. 996f97117d1SArtem B. Bityutskiy */ 997f97117d1SArtem B. Bityutskiy ref = valid_ref; 998f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(ref->next_in_ino); 999f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 1000f97117d1SArtem B. Bityutskiy 1001f97117d1SArtem B. Bityutskiy cond_resched(); 1002f97117d1SArtem B. Bityutskiy 10031e0da3cbSArtem B. Bityutskiy /* 10041e0da3cbSArtem B. Bityutskiy * At this point we don't know the type of the node we're going 10051e0da3cbSArtem B. Bityutskiy * to read, so we do not know the size of its header. In order 100610731f83SArtem Bityutskiy * to minimize the amount of flash IO we assume the header is 100710731f83SArtem Bityutskiy * of size = JFFS2_MIN_NODE_HEADER. 10081e0da3cbSArtem B. Bityutskiy */ 10091e0da3cbSArtem B. Bityutskiy len = JFFS2_MIN_NODE_HEADER; 101010731f83SArtem Bityutskiy if (jffs2_is_writebuffered(c)) { 101110731f83SArtem Bityutskiy int end, rem; 101210731f83SArtem Bityutskiy 101310731f83SArtem Bityutskiy /* 101410731f83SArtem Bityutskiy * We are about to read JFFS2_MIN_NODE_HEADER bytes, 101510731f83SArtem Bityutskiy * but this flash has some minimal I/O unit. It is 101610731f83SArtem Bityutskiy * possible that we'll need to read more soon, so read 101710731f83SArtem Bityutskiy * up to the next min. I/O unit, in order not to 101810731f83SArtem Bityutskiy * re-read the same min. I/O unit twice. 101910731f83SArtem Bityutskiy */ 102010731f83SArtem Bityutskiy end = ref_offset(ref) + len; 102110731f83SArtem Bityutskiy rem = end % c->wbuf_pagesize; 102210731f83SArtem Bityutskiy if (rem) 102310731f83SArtem Bityutskiy end += c->wbuf_pagesize - rem; 102410731f83SArtem Bityutskiy len = end - ref_offset(ref); 10251e0da3cbSArtem B. Bityutskiy } 10261e0da3cbSArtem B. Bityutskiy 1027733802d9SArtem B. Bityutskiy dbg_readinode("read %d bytes at %#08x(%d).\n", len, ref_offset(ref), ref_flags(ref)); 10281e0da3cbSArtem B. Bityutskiy 1029f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 103010731f83SArtem Bityutskiy err = jffs2_flash_read(c, ref_offset(ref), len, &retlen, buf); 1031f97117d1SArtem B. Bityutskiy if (err) { 10321e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, " "error code: %d.\n", len, ref_offset(ref), err); 1033f97117d1SArtem B. Bityutskiy goto free_out; 1034f97117d1SArtem B. Bityutskiy } 1035f97117d1SArtem B. Bityutskiy 10361e0da3cbSArtem B. Bityutskiy if (retlen < len) { 1037fb6a82c9SRandy Dunlap JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", ref_offset(ref), retlen, len); 1038f97117d1SArtem B. Bityutskiy err = -EIO; 1039f97117d1SArtem B. Bityutskiy goto free_out; 1040f97117d1SArtem B. Bityutskiy } 1041f97117d1SArtem B. Bityutskiy 104210731f83SArtem Bityutskiy node = (union jffs2_node_union *)buf; 10431e0da3cbSArtem B. Bityutskiy 10443877f0b6SDavid Woodhouse /* No need to mask in the valid bit; it shouldn't be invalid */ 10453877f0b6SDavid Woodhouse if (je32_to_cpu(node->u.hdr_crc) != crc32(0, node, sizeof(node->u)-4)) { 10463877f0b6SDavid Woodhouse JFFS2_NOTICE("Node header CRC failed at %#08x. {%04x,%04x,%08x,%08x}\n", 10473877f0b6SDavid Woodhouse ref_offset(ref), je16_to_cpu(node->u.magic), 10483877f0b6SDavid Woodhouse je16_to_cpu(node->u.nodetype), 10493877f0b6SDavid Woodhouse je32_to_cpu(node->u.totlen), 10503877f0b6SDavid Woodhouse je32_to_cpu(node->u.hdr_crc)); 10513877f0b6SDavid Woodhouse jffs2_dbg_dump_node(c, ref_offset(ref)); 10523877f0b6SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 10533877f0b6SDavid Woodhouse goto cont; 10543877f0b6SDavid Woodhouse } 10550dec4c8bSJoakim Tjernlund if (je16_to_cpu(node->u.magic) != JFFS2_MAGIC_BITMASK) { 10560dec4c8bSJoakim Tjernlund /* Not a JFFS2 node, whinge and move on */ 10570dec4c8bSJoakim Tjernlund JFFS2_NOTICE("Wrong magic bitmask 0x%04x in node header at %#08x.\n", 10580dec4c8bSJoakim Tjernlund je16_to_cpu(node->u.magic), ref_offset(ref)); 1059c7258a44SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 1060c7258a44SDavid Woodhouse goto cont; 1061c7258a44SDavid Woodhouse } 10623877f0b6SDavid Woodhouse 10631e0da3cbSArtem B. Bityutskiy switch (je16_to_cpu(node->u.nodetype)) { 10641e0da3cbSArtem B. Bityutskiy 10651e0da3cbSArtem B. Bityutskiy case JFFS2_NODETYPE_DIRENT: 10661e0da3cbSArtem B. Bityutskiy 10671e0da3cbSArtem B. Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_dirent)) { 106810731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_raw_dirent), &len, buf); 10691e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 10701e0da3cbSArtem B. Bityutskiy goto free_out; 10711e0da3cbSArtem B. Bityutskiy } 10721e0da3cbSArtem B. Bityutskiy 1073df8e96f3SDavid Woodhouse err = read_direntry(c, ref, &node->d, retlen, rii); 1074df8e96f3SDavid Woodhouse if (unlikely(err)) 1075f97117d1SArtem B. Bityutskiy goto free_out; 1076f97117d1SArtem B. Bityutskiy 1077f97117d1SArtem B. Bityutskiy break; 1078f97117d1SArtem B. Bityutskiy 1079f97117d1SArtem B. Bityutskiy case JFFS2_NODETYPE_INODE: 1080f97117d1SArtem B. Bityutskiy 10811e0da3cbSArtem B. Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_inode)) { 108210731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_raw_inode), &len, buf); 10831e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 1084f97117d1SArtem B. Bityutskiy goto free_out; 1085f97117d1SArtem B. Bityutskiy } 1086f97117d1SArtem B. Bityutskiy 1087df8e96f3SDavid Woodhouse err = read_dnode(c, ref, &node->i, len, rii); 1088df8e96f3SDavid Woodhouse if (unlikely(err)) 1089f97117d1SArtem B. Bityutskiy goto free_out; 1090f97117d1SArtem B. Bityutskiy 10911da177e4SLinus Torvalds break; 10921da177e4SLinus Torvalds 10931da177e4SLinus Torvalds default: 10941e0da3cbSArtem B. Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_unknown_node)) { 109510731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_unknown_node), &len, buf); 10961e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 10971e0da3cbSArtem B. Bityutskiy goto free_out; 10981da177e4SLinus Torvalds } 10991da177e4SLinus Torvalds 11001e0da3cbSArtem B. Bityutskiy err = read_unknown(c, ref, &node->u); 1101f97117d1SArtem B. Bityutskiy if (err == 1) { 1102f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, ref); 1103f97117d1SArtem B. Bityutskiy break; 1104f97117d1SArtem B. Bityutskiy } else if (unlikely(err)) 1105f97117d1SArtem B. Bityutskiy goto free_out; 1106f97117d1SArtem B. Bityutskiy 11071da177e4SLinus Torvalds } 11083877f0b6SDavid Woodhouse cont: 1109f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 11101da177e4SLinus Torvalds } 11111e0da3cbSArtem B. Bityutskiy 1112f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 11131e0da3cbSArtem B. Bityutskiy kfree(buf); 1114f97117d1SArtem B. Bityutskiy 1115df8e96f3SDavid Woodhouse f->highest_version = rii->highest_version; 1116df8e96f3SDavid Woodhouse 1117733802d9SArtem B. Bityutskiy dbg_readinode("nodes of inode #%u were read, the highest version is %u, latest_mctime %u, mctime_ver %u.\n", 1118df8e96f3SDavid Woodhouse f->inocache->ino, rii->highest_version, rii->latest_mctime, 1119df8e96f3SDavid Woodhouse rii->mctime_ver); 1120f97117d1SArtem B. Bityutskiy return 0; 1121f97117d1SArtem B. Bityutskiy 1122f97117d1SArtem B. Bityutskiy free_out: 1123df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info_list(&rii->tn_root); 1124df8e96f3SDavid Woodhouse jffs2_free_full_dirent_list(rii->fds); 1125df8e96f3SDavid Woodhouse rii->fds = NULL; 11261e0da3cbSArtem B. Bityutskiy kfree(buf); 1127f97117d1SArtem B. Bityutskiy return err; 11281da177e4SLinus Torvalds } 11291da177e4SLinus Torvalds 11301da177e4SLinus Torvalds static int jffs2_do_read_inode_internal(struct jffs2_sb_info *c, 11311da177e4SLinus Torvalds struct jffs2_inode_info *f, 11321da177e4SLinus Torvalds struct jffs2_raw_inode *latest_node) 11331da177e4SLinus Torvalds { 1134df8e96f3SDavid Woodhouse struct jffs2_readinode_info rii; 11351da177e4SLinus Torvalds uint32_t crc; 11361da177e4SLinus Torvalds size_t retlen; 11371da177e4SLinus Torvalds int ret; 11381da177e4SLinus Torvalds 1139733802d9SArtem B. Bityutskiy dbg_readinode("ino #%u nlink is %d\n", f->inocache->ino, f->inocache->nlink); 11401da177e4SLinus Torvalds 1141df8e96f3SDavid Woodhouse memset(&rii, 0, sizeof(rii)); 1142df8e96f3SDavid Woodhouse 11431da177e4SLinus Torvalds /* Grab all nodes relevant to this ino */ 1144df8e96f3SDavid Woodhouse ret = jffs2_get_inode_nodes(c, f, &rii); 11451da177e4SLinus Torvalds 11461da177e4SLinus Torvalds if (ret) { 1147e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret); 11481da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 11491da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 11501da177e4SLinus Torvalds return ret; 11511da177e4SLinus Torvalds } 11521da177e4SLinus Torvalds 1153df8e96f3SDavid Woodhouse ret = jffs2_build_inode_fragtree(c, f, &rii); 11541e0da3cbSArtem B. Bityutskiy if (ret) { 1155df8e96f3SDavid Woodhouse JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n", 1156df8e96f3SDavid Woodhouse f->inocache->ino, ret); 1157df8e96f3SDavid Woodhouse if (f->inocache->state == INO_STATE_READING) 1158df8e96f3SDavid Woodhouse jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 1159df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info_list(&rii.tn_root); 1160df8e96f3SDavid Woodhouse /* FIXME: We could at least crc-check them all */ 1161df8e96f3SDavid Woodhouse if (rii.mdata_tn) { 1162df8e96f3SDavid Woodhouse jffs2_free_full_dnode(rii.mdata_tn->fn); 1163df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(rii.mdata_tn); 1164df8e96f3SDavid Woodhouse rii.mdata_tn = NULL; 11651e0da3cbSArtem B. Bityutskiy } 1166df8e96f3SDavid Woodhouse return ret; 11671da177e4SLinus Torvalds } 1168df8e96f3SDavid Woodhouse 1169df8e96f3SDavid Woodhouse if (rii.mdata_tn) { 1170df8e96f3SDavid Woodhouse if (rii.mdata_tn->fn->raw == rii.latest_ref) { 1171df8e96f3SDavid Woodhouse f->metadata = rii.mdata_tn->fn; 1172df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(rii.mdata_tn); 1173df8e96f3SDavid Woodhouse } else { 1174df8e96f3SDavid Woodhouse jffs2_kill_tn(c, rii.mdata_tn); 1175df8e96f3SDavid Woodhouse } 1176df8e96f3SDavid Woodhouse rii.mdata_tn = NULL; 1177df8e96f3SDavid Woodhouse } 1178df8e96f3SDavid Woodhouse 1179df8e96f3SDavid Woodhouse f->dents = rii.fds; 1180df8e96f3SDavid Woodhouse 1181e0c8e42fSArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 11821da177e4SLinus Torvalds 1183df8e96f3SDavid Woodhouse if (unlikely(!rii.latest_ref)) { 11841da177e4SLinus Torvalds /* No data nodes for this inode. */ 11851da177e4SLinus Torvalds if (f->inocache->ino != 1) { 1186e0d60137SArtem B. Bityutskiy JFFS2_WARNING("no data nodes found for ino #%u\n", f->inocache->ino); 1187df8e96f3SDavid Woodhouse if (!rii.fds) { 11881da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 11891da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 11901da177e4SLinus Torvalds return -EIO; 11911da177e4SLinus Torvalds } 1192e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("but it has children so we fake some modes for it\n"); 11931da177e4SLinus Torvalds } 11941da177e4SLinus Torvalds latest_node->mode = cpu_to_jemode(S_IFDIR|S_IRUGO|S_IWUSR|S_IXUGO); 11951da177e4SLinus Torvalds latest_node->version = cpu_to_je32(0); 11961da177e4SLinus Torvalds latest_node->atime = latest_node->ctime = latest_node->mtime = cpu_to_je32(0); 11971da177e4SLinus Torvalds latest_node->isize = cpu_to_je32(0); 11981da177e4SLinus Torvalds latest_node->gid = cpu_to_je16(0); 11991da177e4SLinus Torvalds latest_node->uid = cpu_to_je16(0); 12001da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 12011da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 12021da177e4SLinus Torvalds return 0; 12031da177e4SLinus Torvalds } 12041da177e4SLinus Torvalds 1205df8e96f3SDavid Woodhouse ret = jffs2_flash_read(c, ref_offset(rii.latest_ref), sizeof(*latest_node), &retlen, (void *)latest_node); 12061da177e4SLinus Torvalds if (ret || retlen != sizeof(*latest_node)) { 1207e0d60137SArtem B. Bityutskiy JFFS2_ERROR("failed to read from flash: error %d, %zd of %zd bytes read\n", 12081da177e4SLinus Torvalds ret, retlen, sizeof(*latest_node)); 12091da177e4SLinus Torvalds /* FIXME: If this fails, there seems to be a memory leak. Find it. */ 12101da177e4SLinus Torvalds up(&f->sem); 12111da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12121da177e4SLinus Torvalds return ret?ret:-EIO; 12131da177e4SLinus Torvalds } 12141da177e4SLinus Torvalds 12151da177e4SLinus Torvalds crc = crc32(0, latest_node, sizeof(*latest_node)-8); 12161da177e4SLinus Torvalds if (crc != je32_to_cpu(latest_node->node_crc)) { 1217e0d60137SArtem B. Bityutskiy JFFS2_ERROR("CRC failed for read_inode of inode %u at physical location 0x%x\n", 1218df8e96f3SDavid Woodhouse f->inocache->ino, ref_offset(rii.latest_ref)); 12191da177e4SLinus Torvalds up(&f->sem); 12201da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12211da177e4SLinus Torvalds return -EIO; 12221da177e4SLinus Torvalds } 12231da177e4SLinus Torvalds 12241da177e4SLinus Torvalds switch(jemode_to_cpu(latest_node->mode) & S_IFMT) { 12251da177e4SLinus Torvalds case S_IFDIR: 1226df8e96f3SDavid Woodhouse if (rii.mctime_ver > je32_to_cpu(latest_node->version)) { 12271da177e4SLinus Torvalds /* The times in the latest_node are actually older than 12281da177e4SLinus Torvalds mctime in the latest dirent. Cheat. */ 1229df8e96f3SDavid Woodhouse latest_node->ctime = latest_node->mtime = cpu_to_je32(rii.latest_mctime); 12301da177e4SLinus Torvalds } 12311da177e4SLinus Torvalds break; 12321da177e4SLinus Torvalds 12331da177e4SLinus Torvalds 12341da177e4SLinus Torvalds case S_IFREG: 12351da177e4SLinus Torvalds /* If it was a regular file, truncate it to the latest node's isize */ 1236f302cd02SArtem B. Bityutskiy jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); 12371da177e4SLinus Torvalds break; 12381da177e4SLinus Torvalds 12391da177e4SLinus Torvalds case S_IFLNK: 12401da177e4SLinus Torvalds /* Hack to work around broken isize in old symlink code. 12411da177e4SLinus Torvalds Remove this when dwmw2 comes to his senses and stops 12421da177e4SLinus Torvalds symlinks from being an entirely gratuitous special 12431da177e4SLinus Torvalds case. */ 12441da177e4SLinus Torvalds if (!je32_to_cpu(latest_node->isize)) 12451da177e4SLinus Torvalds latest_node->isize = latest_node->dsize; 124632f1a95dSArtem B. Bityuckiy 124732f1a95dSArtem B. Bityuckiy if (f->inocache->state != INO_STATE_CHECKING) { 124832f1a95dSArtem B. Bityuckiy /* Symlink's inode data is the target path. Read it and 12492b79adccSArtem B. Bityutskiy * keep in RAM to facilitate quick follow symlink 12502b79adccSArtem B. Bityutskiy * operation. */ 12512b79adccSArtem B. Bityutskiy f->target = kmalloc(je32_to_cpu(latest_node->csize) + 1, GFP_KERNEL); 12522b79adccSArtem B. Bityutskiy if (!f->target) { 1253e0d60137SArtem B. Bityutskiy JFFS2_ERROR("can't allocate %d bytes of memory for the symlink target path cache\n", je32_to_cpu(latest_node->csize)); 125432f1a95dSArtem B. Bityuckiy up(&f->sem); 125532f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 125632f1a95dSArtem B. Bityuckiy return -ENOMEM; 125732f1a95dSArtem B. Bityuckiy } 125832f1a95dSArtem B. Bityuckiy 1259df8e96f3SDavid Woodhouse ret = jffs2_flash_read(c, ref_offset(rii.latest_ref) + sizeof(*latest_node), 12602b79adccSArtem B. Bityutskiy je32_to_cpu(latest_node->csize), &retlen, (char *)f->target); 126132f1a95dSArtem B. Bityuckiy 126232f1a95dSArtem B. Bityuckiy if (ret || retlen != je32_to_cpu(latest_node->csize)) { 126332f1a95dSArtem B. Bityuckiy if (retlen != je32_to_cpu(latest_node->csize)) 126432f1a95dSArtem B. Bityuckiy ret = -EIO; 12652b79adccSArtem B. Bityutskiy kfree(f->target); 12662b79adccSArtem B. Bityutskiy f->target = NULL; 126732f1a95dSArtem B. Bityuckiy up(&f->sem); 126832f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 126932f1a95dSArtem B. Bityuckiy return -ret; 127032f1a95dSArtem B. Bityuckiy } 127132f1a95dSArtem B. Bityuckiy 12722b79adccSArtem B. Bityutskiy f->target[je32_to_cpu(latest_node->csize)] = '\0'; 1273733802d9SArtem B. Bityutskiy dbg_readinode("symlink's target '%s' cached\n", f->target); 127432f1a95dSArtem B. Bityuckiy } 127532f1a95dSArtem B. Bityuckiy 12761da177e4SLinus Torvalds /* fall through... */ 12771da177e4SLinus Torvalds 12781da177e4SLinus Torvalds case S_IFBLK: 12791da177e4SLinus Torvalds case S_IFCHR: 12801da177e4SLinus Torvalds /* Certain inode types should have only one data node, and it's 12811da177e4SLinus Torvalds kept as the metadata node */ 12821da177e4SLinus Torvalds if (f->metadata) { 1283e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o had metadata node\n", 12841da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 12851da177e4SLinus Torvalds up(&f->sem); 12861da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12871da177e4SLinus Torvalds return -EIO; 12881da177e4SLinus Torvalds } 12891da177e4SLinus Torvalds if (!frag_first(&f->fragtree)) { 1290e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o has no fragments\n", 12911da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 12921da177e4SLinus Torvalds up(&f->sem); 12931da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12941da177e4SLinus Torvalds return -EIO; 12951da177e4SLinus Torvalds } 12961da177e4SLinus Torvalds /* ASSERT: f->fraglist != NULL */ 12971da177e4SLinus Torvalds if (frag_next(frag_first(&f->fragtree))) { 1298e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0x%x had more than one node\n", 12991da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 13001da177e4SLinus Torvalds /* FIXME: Deal with it - check crc32, check for duplicate node, check times and discard the older one */ 13011da177e4SLinus Torvalds up(&f->sem); 13021da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 13031da177e4SLinus Torvalds return -EIO; 13041da177e4SLinus Torvalds } 13051da177e4SLinus Torvalds /* OK. We're happy */ 13061da177e4SLinus Torvalds f->metadata = frag_first(&f->fragtree)->node; 13071da177e4SLinus Torvalds jffs2_free_node_frag(frag_first(&f->fragtree)); 13081da177e4SLinus Torvalds f->fragtree = RB_ROOT; 13091da177e4SLinus Torvalds break; 13101da177e4SLinus Torvalds } 13111da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 13121da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 13131da177e4SLinus Torvalds 13141da177e4SLinus Torvalds return 0; 13151da177e4SLinus Torvalds } 13161da177e4SLinus Torvalds 1317f97117d1SArtem B. Bityutskiy /* Scan the list of all nodes present for this ino, build map of versions, etc. */ 1318f97117d1SArtem B. Bityutskiy int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 1319f97117d1SArtem B. Bityutskiy uint32_t ino, struct jffs2_raw_inode *latest_node) 1320f97117d1SArtem B. Bityutskiy { 1321733802d9SArtem B. Bityutskiy dbg_readinode("read inode #%u\n", ino); 1322f97117d1SArtem B. Bityutskiy 1323f97117d1SArtem B. Bityutskiy retry_inocache: 1324f97117d1SArtem B. Bityutskiy spin_lock(&c->inocache_lock); 1325f97117d1SArtem B. Bityutskiy f->inocache = jffs2_get_ino_cache(c, ino); 1326f97117d1SArtem B. Bityutskiy 1327f97117d1SArtem B. Bityutskiy if (f->inocache) { 1328f97117d1SArtem B. Bityutskiy /* Check its state. We may need to wait before we can use it */ 1329f97117d1SArtem B. Bityutskiy switch(f->inocache->state) { 1330f97117d1SArtem B. Bityutskiy case INO_STATE_UNCHECKED: 1331f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKEDABSENT: 1332f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 1333f97117d1SArtem B. Bityutskiy break; 1334f97117d1SArtem B. Bityutskiy 1335f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKING: 1336f97117d1SArtem B. Bityutskiy case INO_STATE_GC: 1337f97117d1SArtem B. Bityutskiy /* If it's in either of these states, we need 1338f97117d1SArtem B. Bityutskiy to wait for whoever's got it to finish and 1339f97117d1SArtem B. Bityutskiy put it back. */ 1340733802d9SArtem B. Bityutskiy dbg_readinode("waiting for ino #%u in state %d\n", ino, f->inocache->state); 1341f97117d1SArtem B. Bityutskiy sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); 1342f97117d1SArtem B. Bityutskiy goto retry_inocache; 1343f97117d1SArtem B. Bityutskiy 1344f97117d1SArtem B. Bityutskiy case INO_STATE_READING: 1345f97117d1SArtem B. Bityutskiy case INO_STATE_PRESENT: 1346f97117d1SArtem B. Bityutskiy /* Eep. This should never happen. It can 1347f97117d1SArtem B. Bityutskiy happen if Linux calls read_inode() again 1348f97117d1SArtem B. Bityutskiy before clear_inode() has finished though. */ 1349e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Eep. Trying to read_inode #%u when it's already in state %d!\n", ino, f->inocache->state); 1350f97117d1SArtem B. Bityutskiy /* Fail. That's probably better than allowing it to succeed */ 1351f97117d1SArtem B. Bityutskiy f->inocache = NULL; 1352f97117d1SArtem B. Bityutskiy break; 1353f97117d1SArtem B. Bityutskiy 1354f97117d1SArtem B. Bityutskiy default: 1355f97117d1SArtem B. Bityutskiy BUG(); 1356f97117d1SArtem B. Bityutskiy } 1357f97117d1SArtem B. Bityutskiy } 1358f97117d1SArtem B. Bityutskiy spin_unlock(&c->inocache_lock); 1359f97117d1SArtem B. Bityutskiy 1360f97117d1SArtem B. Bityutskiy if (!f->inocache && ino == 1) { 1361f97117d1SArtem B. Bityutskiy /* Special case - no root inode on medium */ 1362f97117d1SArtem B. Bityutskiy f->inocache = jffs2_alloc_inode_cache(); 1363f97117d1SArtem B. Bityutskiy if (!f->inocache) { 1364e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot allocate inocache for root inode\n"); 1365f97117d1SArtem B. Bityutskiy return -ENOMEM; 1366f97117d1SArtem B. Bityutskiy } 1367733802d9SArtem B. Bityutskiy dbg_readinode("creating inocache for root inode\n"); 1368f97117d1SArtem B. Bityutskiy memset(f->inocache, 0, sizeof(struct jffs2_inode_cache)); 1369f97117d1SArtem B. Bityutskiy f->inocache->ino = f->inocache->nlink = 1; 1370f97117d1SArtem B. Bityutskiy f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache; 1371f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 1372f97117d1SArtem B. Bityutskiy jffs2_add_ino_cache(c, f->inocache); 1373f97117d1SArtem B. Bityutskiy } 1374f97117d1SArtem B. Bityutskiy if (!f->inocache) { 1375e0d60137SArtem B. Bityutskiy JFFS2_ERROR("requestied to read an nonexistent ino %u\n", ino); 1376f97117d1SArtem B. Bityutskiy return -ENOENT; 1377f97117d1SArtem B. Bityutskiy } 1378f97117d1SArtem B. Bityutskiy 1379f97117d1SArtem B. Bityutskiy return jffs2_do_read_inode_internal(c, f, latest_node); 1380f97117d1SArtem B. Bityutskiy } 1381f97117d1SArtem B. Bityutskiy 1382f97117d1SArtem B. Bityutskiy int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic) 1383f97117d1SArtem B. Bityutskiy { 1384f97117d1SArtem B. Bityutskiy struct jffs2_raw_inode n; 13853d375d9eSYan Burman struct jffs2_inode_info *f = kzalloc(sizeof(*f), GFP_KERNEL); 1386f97117d1SArtem B. Bityutskiy int ret; 1387f97117d1SArtem B. Bityutskiy 1388f97117d1SArtem B. Bityutskiy if (!f) 1389f97117d1SArtem B. Bityutskiy return -ENOMEM; 1390f97117d1SArtem B. Bityutskiy 1391f97117d1SArtem B. Bityutskiy init_MUTEX_LOCKED(&f->sem); 1392f97117d1SArtem B. Bityutskiy f->inocache = ic; 1393f97117d1SArtem B. Bityutskiy 1394f97117d1SArtem B. Bityutskiy ret = jffs2_do_read_inode_internal(c, f, &n); 1395f97117d1SArtem B. Bityutskiy if (!ret) { 1396f97117d1SArtem B. Bityutskiy up(&f->sem); 1397f97117d1SArtem B. Bityutskiy jffs2_do_clear_inode(c, f); 1398f97117d1SArtem B. Bityutskiy } 1399f97117d1SArtem B. Bityutskiy kfree (f); 1400f97117d1SArtem B. Bityutskiy return ret; 1401f97117d1SArtem B. Bityutskiy } 1402f97117d1SArtem B. Bityutskiy 14031da177e4SLinus Torvalds void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f) 14041da177e4SLinus Torvalds { 14051da177e4SLinus Torvalds struct jffs2_full_dirent *fd, *fds; 14061da177e4SLinus Torvalds int deleted; 14071da177e4SLinus Torvalds 1408c7afb0f9SKaiGai Kohei jffs2_clear_acl(f); 1409355ed4e1SKaiGai Kohei jffs2_xattr_delete_inode(c, f->inocache); 14101da177e4SLinus Torvalds down(&f->sem); 14111da177e4SLinus Torvalds deleted = f->inocache && !f->inocache->nlink; 14121da177e4SLinus Torvalds 141367e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) 141467e345d1SDavid Woodhouse jffs2_set_inocache_state(c, f->inocache, INO_STATE_CLEARING); 141567e345d1SDavid Woodhouse 14161da177e4SLinus Torvalds if (f->metadata) { 14171da177e4SLinus Torvalds if (deleted) 14181da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 14191da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 14201da177e4SLinus Torvalds } 14211da177e4SLinus Torvalds 14221da177e4SLinus Torvalds jffs2_kill_fragtree(&f->fragtree, deleted?c:NULL); 14231da177e4SLinus Torvalds 14242b79adccSArtem B. Bityutskiy if (f->target) { 14252b79adccSArtem B. Bityutskiy kfree(f->target); 14262b79adccSArtem B. Bityutskiy f->target = NULL; 142732f1a95dSArtem B. Bityuckiy } 14281da177e4SLinus Torvalds 14292b79adccSArtem B. Bityutskiy fds = f->dents; 14301da177e4SLinus Torvalds while(fds) { 14311da177e4SLinus Torvalds fd = fds; 14321da177e4SLinus Torvalds fds = fd->next; 14331da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 14341da177e4SLinus Torvalds } 14351da177e4SLinus Torvalds 143667e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) { 14371da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 143867e345d1SDavid Woodhouse if (f->inocache->nodes == (void *)f->inocache) 143967e345d1SDavid Woodhouse jffs2_del_ino_cache(c, f->inocache); 144067e345d1SDavid Woodhouse } 14411da177e4SLinus Torvalds 14421da177e4SLinus Torvalds up(&f->sem); 14431da177e4SLinus Torvalds } 1444