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 /* Calculate how many bytes were already checked */ 41df8e96f3SDavid Woodhouse ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode); 4292525726SDavid Woodhouse len = tn->csize; 43df8e96f3SDavid Woodhouse 4492525726SDavid Woodhouse if (jffs2_is_writebuffered(c)) { 4592525726SDavid Woodhouse int adj = ofs % c->wbuf_pagesize; 4692525726SDavid Woodhouse if (likely(adj)) 4792525726SDavid Woodhouse adj = c->wbuf_pagesize - adj; 4892525726SDavid Woodhouse 4992525726SDavid Woodhouse if (adj >= 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 5592525726SDavid Woodhouse ofs += adj; 5692525726SDavid Woodhouse len -= adj; 5792525726SDavid Woodhouse } 58df8e96f3SDavid Woodhouse 59df8e96f3SDavid 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", 60df8e96f3SDavid Woodhouse ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len); 61df8e96f3SDavid Woodhouse 62df8e96f3SDavid Woodhouse #ifndef __ECOS 63df8e96f3SDavid Woodhouse /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(), 64df8e96f3SDavid Woodhouse * adding and jffs2_flash_read_end() interface. */ 65df8e96f3SDavid Woodhouse if (c->mtd->point) { 66a98889f3SJared Hulbert err = c->mtd->point(c->mtd, ofs, len, &retlen, 67a98889f3SJared Hulbert (void **)&buffer, NULL); 68c2056e1eSAlexey Korolev if (!err && retlen < len) { 69df8e96f3SDavid Woodhouse JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize); 70a98889f3SJared Hulbert c->mtd->unpoint(c->mtd, ofs, retlen); 71df8e96f3SDavid Woodhouse } else if (err) 72df8e96f3SDavid Woodhouse JFFS2_WARNING("MTD point failed: error code %d.\n", err); 73df8e96f3SDavid Woodhouse else 74df8e96f3SDavid Woodhouse pointed = 1; /* succefully pointed to device */ 75df8e96f3SDavid Woodhouse } 76df8e96f3SDavid Woodhouse #endif 77df8e96f3SDavid Woodhouse 78df8e96f3SDavid Woodhouse if (!pointed) { 79df8e96f3SDavid Woodhouse buffer = kmalloc(len, GFP_KERNEL); 80df8e96f3SDavid Woodhouse if (unlikely(!buffer)) 81df8e96f3SDavid Woodhouse return -ENOMEM; 82df8e96f3SDavid Woodhouse 83df8e96f3SDavid Woodhouse /* TODO: this is very frequent pattern, make it a separate 84df8e96f3SDavid Woodhouse * routine */ 85df8e96f3SDavid Woodhouse err = jffs2_flash_read(c, ofs, len, &retlen, buffer); 86df8e96f3SDavid Woodhouse if (err) { 87df8e96f3SDavid Woodhouse JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err); 88df8e96f3SDavid Woodhouse goto free_out; 89df8e96f3SDavid Woodhouse } 90df8e96f3SDavid Woodhouse 91df8e96f3SDavid Woodhouse if (retlen != len) { 92df8e96f3SDavid Woodhouse JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len); 93df8e96f3SDavid Woodhouse err = -EIO; 94df8e96f3SDavid Woodhouse goto free_out; 95df8e96f3SDavid Woodhouse } 96df8e96f3SDavid Woodhouse } 97df8e96f3SDavid Woodhouse 98df8e96f3SDavid Woodhouse /* Continue calculating CRC */ 99df8e96f3SDavid Woodhouse crc = crc32(tn->partial_crc, buffer, len); 100df8e96f3SDavid Woodhouse if(!pointed) 101df8e96f3SDavid Woodhouse kfree(buffer); 102df8e96f3SDavid Woodhouse #ifndef __ECOS 103df8e96f3SDavid Woodhouse else 104a98889f3SJared Hulbert c->mtd->unpoint(c->mtd, ofs, len); 105df8e96f3SDavid Woodhouse #endif 106df8e96f3SDavid Woodhouse 107df8e96f3SDavid Woodhouse if (crc != tn->data_crc) { 108df8e96f3SDavid Woodhouse JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 109b2e25235SDavid Woodhouse ref_offset(ref), tn->data_crc, crc); 110df8e96f3SDavid Woodhouse return 1; 111df8e96f3SDavid Woodhouse } 112df8e96f3SDavid Woodhouse 113df8e96f3SDavid Woodhouse adj_acc: 114df8e96f3SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 115df8e96f3SDavid Woodhouse len = ref_totlen(c, jeb, ref); 116df8e96f3SDavid Woodhouse /* If it should be REF_NORMAL, it'll get marked as such when 117df8e96f3SDavid Woodhouse we build the fragtree, shortly. No need to worry about GC 118df8e96f3SDavid Woodhouse moving it while it's marked REF_PRISTINE -- GC won't happen 119df8e96f3SDavid Woodhouse till we've finished checking every inode anyway. */ 120df8e96f3SDavid Woodhouse ref->flash_offset |= REF_PRISTINE; 121df8e96f3SDavid Woodhouse /* 122df8e96f3SDavid Woodhouse * Mark the node as having been checked and fix the 123df8e96f3SDavid Woodhouse * accounting accordingly. 124df8e96f3SDavid Woodhouse */ 125df8e96f3SDavid Woodhouse spin_lock(&c->erase_completion_lock); 126df8e96f3SDavid Woodhouse jeb->used_size += len; 127df8e96f3SDavid Woodhouse jeb->unchecked_size -= len; 128df8e96f3SDavid Woodhouse c->used_size += len; 129df8e96f3SDavid Woodhouse c->unchecked_size -= len; 130df8e96f3SDavid Woodhouse jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 131df8e96f3SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 132df8e96f3SDavid Woodhouse 133df8e96f3SDavid Woodhouse return 0; 134df8e96f3SDavid Woodhouse 135df8e96f3SDavid Woodhouse free_out: 136df8e96f3SDavid Woodhouse if(!pointed) 137df8e96f3SDavid Woodhouse kfree(buffer); 138df8e96f3SDavid Woodhouse #ifndef __ECOS 139df8e96f3SDavid Woodhouse else 140a98889f3SJared Hulbert c->mtd->unpoint(c->mtd, ofs, len); 141df8e96f3SDavid Woodhouse #endif 142df8e96f3SDavid Woodhouse return err; 143df8e96f3SDavid Woodhouse } 144df8e96f3SDavid Woodhouse 145df8e96f3SDavid Woodhouse /* 146df8e96f3SDavid Woodhouse * Helper function for jffs2_add_older_frag_to_fragtree(). 147df8e96f3SDavid Woodhouse * 148df8e96f3SDavid Woodhouse * Checks the node if we are in the checking stage. 149df8e96f3SDavid Woodhouse */ 150df8e96f3SDavid Woodhouse static int check_tn_node(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 151df8e96f3SDavid Woodhouse { 152df8e96f3SDavid Woodhouse int ret; 153df8e96f3SDavid Woodhouse 154df8e96f3SDavid Woodhouse BUG_ON(ref_obsolete(tn->fn->raw)); 155df8e96f3SDavid Woodhouse 156df8e96f3SDavid Woodhouse /* We only check the data CRC of unchecked nodes */ 157df8e96f3SDavid Woodhouse if (ref_flags(tn->fn->raw) != REF_UNCHECKED) 158df8e96f3SDavid Woodhouse return 0; 159df8e96f3SDavid Woodhouse 160df8e96f3SDavid Woodhouse dbg_readinode("check node %#04x-%#04x, phys offs %#08x\n", 161df8e96f3SDavid Woodhouse tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw)); 162df8e96f3SDavid Woodhouse 163df8e96f3SDavid Woodhouse ret = check_node_data(c, tn); 164df8e96f3SDavid Woodhouse if (unlikely(ret < 0)) { 165df8e96f3SDavid Woodhouse JFFS2_ERROR("check_node_data() returned error: %d.\n", 166df8e96f3SDavid Woodhouse ret); 167df8e96f3SDavid Woodhouse } else if (unlikely(ret > 0)) { 168df8e96f3SDavid Woodhouse dbg_readinode("CRC error, mark it obsolete.\n"); 169df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, tn->fn->raw); 170df8e96f3SDavid Woodhouse } 171df8e96f3SDavid Woodhouse 172df8e96f3SDavid Woodhouse return ret; 173df8e96f3SDavid Woodhouse } 174df8e96f3SDavid Woodhouse 175df8e96f3SDavid Woodhouse static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) 176df8e96f3SDavid Woodhouse { 177df8e96f3SDavid Woodhouse struct rb_node *next; 178df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *tn = NULL; 179df8e96f3SDavid Woodhouse 180df8e96f3SDavid Woodhouse dbg_readinode("root %p, offset %d\n", tn_root, offset); 181df8e96f3SDavid Woodhouse 182df8e96f3SDavid Woodhouse next = tn_root->rb_node; 183df8e96f3SDavid Woodhouse 184df8e96f3SDavid Woodhouse while (next) { 185df8e96f3SDavid Woodhouse tn = rb_entry(next, struct jffs2_tmp_dnode_info, rb); 186df8e96f3SDavid Woodhouse 187df8e96f3SDavid Woodhouse if (tn->fn->ofs < offset) 188df8e96f3SDavid Woodhouse next = tn->rb.rb_right; 189df8e96f3SDavid Woodhouse else if (tn->fn->ofs >= offset) 190df8e96f3SDavid Woodhouse next = tn->rb.rb_left; 191df8e96f3SDavid Woodhouse else 192df8e96f3SDavid Woodhouse break; 193df8e96f3SDavid Woodhouse } 194df8e96f3SDavid Woodhouse 195df8e96f3SDavid Woodhouse return tn; 196df8e96f3SDavid Woodhouse } 197df8e96f3SDavid Woodhouse 198df8e96f3SDavid Woodhouse 199df8e96f3SDavid Woodhouse static void jffs2_kill_tn(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 200df8e96f3SDavid Woodhouse { 201df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, tn->fn->raw); 202df8e96f3SDavid Woodhouse jffs2_free_full_dnode(tn->fn); 203df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(tn); 204df8e96f3SDavid Woodhouse } 205df8e96f3SDavid Woodhouse /* 206df8e96f3SDavid Woodhouse * This function is used when we read an inode. Data nodes arrive in 207df8e96f3SDavid Woodhouse * arbitrary order -- they may be older or newer than the nodes which 208df8e96f3SDavid Woodhouse * are already in the tree. Where overlaps occur, the older node can 209df8e96f3SDavid Woodhouse * be discarded as long as the newer passes the CRC check. We don't 210df8e96f3SDavid Woodhouse * bother to keep track of holes in this rbtree, and neither do we deal 211df8e96f3SDavid Woodhouse * with frags -- we can have multiple entries starting at the same 212df8e96f3SDavid Woodhouse * offset, and the one with the smallest length will come first in the 213df8e96f3SDavid Woodhouse * ordering. 214df8e96f3SDavid Woodhouse * 21514c6381eSDavid Woodhouse * Returns 0 if the node was handled (including marking it obsolete) 216df8e96f3SDavid Woodhouse * < 0 an if error occurred 217df8e96f3SDavid Woodhouse */ 218df8e96f3SDavid Woodhouse static int jffs2_add_tn_to_tree(struct jffs2_sb_info *c, 219df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii, 220df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *tn) 221df8e96f3SDavid Woodhouse { 222df8e96f3SDavid Woodhouse uint32_t fn_end = tn->fn->ofs + tn->fn->size; 22396dd8d25SDavid Woodhouse struct jffs2_tmp_dnode_info *this; 224df8e96f3SDavid Woodhouse 225fcf3cafbSDavid Woodhouse dbg_readinode("insert fragment %#04x-%#04x, ver %u at %08x\n", tn->fn->ofs, fn_end, tn->version, ref_offset(tn->fn->raw)); 226df8e96f3SDavid Woodhouse 227df8e96f3SDavid Woodhouse /* If a node has zero dsize, we only have to keep if it if it might be the 228df8e96f3SDavid Woodhouse node with highest version -- i.e. the one which will end up as f->metadata. 229df8e96f3SDavid Woodhouse Note that such nodes won't be REF_UNCHECKED since there are no data to 230df8e96f3SDavid Woodhouse check anyway. */ 231df8e96f3SDavid Woodhouse if (!tn->fn->size) { 232df8e96f3SDavid Woodhouse if (rii->mdata_tn) { 2330477d24eSDavid Woodhouse if (rii->mdata_tn->version < tn->version) { 234df8e96f3SDavid Woodhouse /* We had a candidate mdata node already */ 235df8e96f3SDavid Woodhouse dbg_readinode("kill old mdata with ver %d\n", rii->mdata_tn->version); 236df8e96f3SDavid Woodhouse jffs2_kill_tn(c, rii->mdata_tn); 2370477d24eSDavid Woodhouse } else { 2380477d24eSDavid Woodhouse dbg_readinode("kill new mdata with ver %d (older than existing %d\n", 2390477d24eSDavid Woodhouse tn->version, rii->mdata_tn->version); 2400477d24eSDavid Woodhouse jffs2_kill_tn(c, tn); 2410477d24eSDavid Woodhouse return 0; 2420477d24eSDavid Woodhouse } 243df8e96f3SDavid Woodhouse } 244df8e96f3SDavid Woodhouse rii->mdata_tn = tn; 245df8e96f3SDavid Woodhouse dbg_readinode("keep new mdata with ver %d\n", tn->version); 246df8e96f3SDavid Woodhouse return 0; 247df8e96f3SDavid Woodhouse } 248df8e96f3SDavid Woodhouse 249df8e96f3SDavid Woodhouse /* Find the earliest node which _may_ be relevant to this one */ 250df8e96f3SDavid Woodhouse this = jffs2_lookup_tn(&rii->tn_root, tn->fn->ofs); 2511c979645SDavid Woodhouse if (this) { 252df8e96f3SDavid Woodhouse /* If the node is coincident with another at a lower address, 253df8e96f3SDavid Woodhouse back up until the other node is found. It may be relevant */ 2541c979645SDavid Woodhouse while (this->overlapped) 2551c979645SDavid Woodhouse this = tn_prev(this); 256df8e96f3SDavid Woodhouse 2571c979645SDavid Woodhouse /* First node should never be marked overlapped */ 2581c979645SDavid Woodhouse BUG_ON(!this); 259df8e96f3SDavid Woodhouse dbg_readinode("'this' found %#04x-%#04x (%s)\n", this->fn->ofs, this->fn->ofs + this->fn->size, this->fn ? "data" : "hole"); 2601c979645SDavid Woodhouse } 261df8e96f3SDavid Woodhouse 262df8e96f3SDavid Woodhouse while (this) { 263df8e96f3SDavid Woodhouse if (this->fn->ofs > fn_end) 264df8e96f3SDavid Woodhouse break; 265df8e96f3SDavid Woodhouse dbg_readinode("Ponder this ver %d, 0x%x-0x%x\n", 266df8e96f3SDavid Woodhouse this->version, this->fn->ofs, this->fn->size); 267df8e96f3SDavid Woodhouse 268df8e96f3SDavid Woodhouse if (this->version == tn->version) { 269df8e96f3SDavid Woodhouse /* Version number collision means REF_PRISTINE GC. Accept either of them 270df8e96f3SDavid Woodhouse as long as the CRC is correct. Check the one we have already... */ 271df8e96f3SDavid Woodhouse if (!check_tn_node(c, this)) { 272df8e96f3SDavid Woodhouse /* The one we already had was OK. Keep it and throw away the new one */ 273df8e96f3SDavid Woodhouse dbg_readinode("Like old node. Throw away new\n"); 274df8e96f3SDavid Woodhouse jffs2_kill_tn(c, tn); 275df8e96f3SDavid Woodhouse return 0; 276df8e96f3SDavid Woodhouse } else { 277df8e96f3SDavid Woodhouse /* Who cares if the new one is good; keep it for now anyway. */ 278df8e96f3SDavid Woodhouse dbg_readinode("Like new node. Throw away old\n"); 279fcf3cafbSDavid Woodhouse rb_replace_node(&this->rb, &tn->rb, &rii->tn_root); 280fcf3cafbSDavid Woodhouse jffs2_kill_tn(c, this); 281fcf3cafbSDavid Woodhouse /* Same overlapping from in front and behind */ 282fcf3cafbSDavid 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 } 294fcf3cafbSDavid Woodhouse /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ 2951c979645SDavid Woodhouse while (this && this->fn->ofs + this->fn->size <= fn_end) { 296df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *next = tn_next(this); 297df8e96f3SDavid Woodhouse if (this->version < tn->version) { 298df8e96f3SDavid Woodhouse tn_erase(this, &rii->tn_root); 299df8e96f3SDavid Woodhouse dbg_readinode("Kill overlapped ver %d, 0x%x-0x%x\n", 300df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 301df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 302df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 303df8e96f3SDavid Woodhouse } 304df8e96f3SDavid Woodhouse this = next; 305df8e96f3SDavid Woodhouse } 306fcf3cafbSDavid Woodhouse dbg_readinode("Done killing overlapped nodes\n"); 3071c979645SDavid Woodhouse continue; 308df8e96f3SDavid Woodhouse } 309df8e96f3SDavid Woodhouse if (this->version > tn->version && 310df8e96f3SDavid Woodhouse this->fn->ofs <= tn->fn->ofs && 311df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size >= fn_end) { 312df8e96f3SDavid Woodhouse /* New node entirely overlapped by 'this' */ 313df8e96f3SDavid Woodhouse if (!check_tn_node(c, this)) { 314df8e96f3SDavid Woodhouse dbg_readinode("Good CRC on old node. Kill new\n"); 315df8e96f3SDavid Woodhouse jffs2_kill_tn(c, tn); 316df8e96f3SDavid Woodhouse return 0; 317df8e96f3SDavid Woodhouse } 318df8e96f3SDavid Woodhouse /* ... but 'this' was bad. Replace it... */ 319df8e96f3SDavid Woodhouse dbg_readinode("Bad CRC on old overlapping node. Kill it\n"); 320fcf3cafbSDavid Woodhouse tn_erase(this, &rii->tn_root); 321df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 322fcf3cafbSDavid Woodhouse break; 323df8e96f3SDavid Woodhouse } 324df8e96f3SDavid Woodhouse 325df8e96f3SDavid Woodhouse this = tn_next(this); 326df8e96f3SDavid Woodhouse } 32796dd8d25SDavid Woodhouse 328df8e96f3SDavid Woodhouse /* We neither completely obsoleted nor were completely 32996dd8d25SDavid Woodhouse obsoleted by an earlier node. Insert into the tree */ 330df8e96f3SDavid Woodhouse { 33196dd8d25SDavid Woodhouse struct rb_node *parent; 33296dd8d25SDavid Woodhouse struct rb_node **link = &rii->tn_root.rb_node; 3331c979645SDavid Woodhouse struct jffs2_tmp_dnode_info *insert_point = NULL; 334df8e96f3SDavid Woodhouse 335df8e96f3SDavid Woodhouse while (*link) { 336df8e96f3SDavid Woodhouse parent = *link; 337df8e96f3SDavid Woodhouse insert_point = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); 338df8e96f3SDavid Woodhouse if (tn->fn->ofs > insert_point->fn->ofs) 339df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_right; 340df8e96f3SDavid Woodhouse else if (tn->fn->ofs < insert_point->fn->ofs || 341df8e96f3SDavid Woodhouse tn->fn->size < insert_point->fn->size) 342df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_left; 343df8e96f3SDavid Woodhouse else 344df8e96f3SDavid Woodhouse link = &insert_point->rb.rb_right; 345df8e96f3SDavid Woodhouse } 346df8e96f3SDavid Woodhouse rb_link_node(&tn->rb, &insert_point->rb, link); 347df8e96f3SDavid Woodhouse rb_insert_color(&tn->rb, &rii->tn_root); 348df8e96f3SDavid Woodhouse } 3491123e2a8SDavid Woodhouse 350df8e96f3SDavid Woodhouse /* If there's anything behind that overlaps us, note it */ 351df8e96f3SDavid Woodhouse this = tn_prev(tn); 352df8e96f3SDavid Woodhouse if (this) { 353df8e96f3SDavid Woodhouse while (1) { 354df8e96f3SDavid Woodhouse if (this->fn->ofs + this->fn->size > tn->fn->ofs) { 355df8e96f3SDavid Woodhouse dbg_readinode("Node is overlapped by %p (v %d, 0x%x-0x%x)\n", 356df8e96f3SDavid Woodhouse this, this->version, this->fn->ofs, 357df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 358df8e96f3SDavid Woodhouse tn->overlapped = 1; 359df8e96f3SDavid Woodhouse break; 360df8e96f3SDavid Woodhouse } 361df8e96f3SDavid Woodhouse if (!this->overlapped) 362df8e96f3SDavid Woodhouse break; 363df8e96f3SDavid Woodhouse this = tn_prev(this); 364df8e96f3SDavid Woodhouse } 365df8e96f3SDavid Woodhouse } 366df8e96f3SDavid Woodhouse 367df8e96f3SDavid Woodhouse /* If the new node overlaps anything ahead, note it */ 368df8e96f3SDavid Woodhouse this = tn_next(tn); 369df8e96f3SDavid Woodhouse while (this && this->fn->ofs < fn_end) { 370df8e96f3SDavid Woodhouse this->overlapped = 1; 371df8e96f3SDavid Woodhouse dbg_readinode("Node ver %d, 0x%x-0x%x is overlapped\n", 372df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 373df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 374df8e96f3SDavid Woodhouse this = tn_next(this); 375df8e96f3SDavid Woodhouse } 376df8e96f3SDavid Woodhouse return 0; 377df8e96f3SDavid Woodhouse } 378df8e96f3SDavid Woodhouse 379df8e96f3SDavid Woodhouse /* Trivial function to remove the last node in the tree. Which by definition 380df8e96f3SDavid Woodhouse has no right-hand -- so can be removed just by making its only child (if 381df8e96f3SDavid Woodhouse any) take its place under its parent. */ 382df8e96f3SDavid Woodhouse static void eat_last(struct rb_root *root, struct rb_node *node) 383df8e96f3SDavid Woodhouse { 384df8e96f3SDavid Woodhouse struct rb_node *parent = rb_parent(node); 385df8e96f3SDavid Woodhouse struct rb_node **link; 386df8e96f3SDavid Woodhouse 387df8e96f3SDavid Woodhouse /* LAST! */ 388df8e96f3SDavid Woodhouse BUG_ON(node->rb_right); 389df8e96f3SDavid Woodhouse 390df8e96f3SDavid Woodhouse if (!parent) 391df8e96f3SDavid Woodhouse link = &root->rb_node; 392df8e96f3SDavid Woodhouse else if (node == parent->rb_left) 393df8e96f3SDavid Woodhouse link = &parent->rb_left; 394df8e96f3SDavid Woodhouse else 395df8e96f3SDavid Woodhouse link = &parent->rb_right; 396df8e96f3SDavid Woodhouse 397df8e96f3SDavid Woodhouse *link = node->rb_left; 398df8e96f3SDavid Woodhouse /* Colour doesn't matter now. Only the parent pointer. */ 399df8e96f3SDavid Woodhouse if (node->rb_left) 400df8e96f3SDavid Woodhouse node->rb_left->rb_parent_color = node->rb_parent_color; 401df8e96f3SDavid Woodhouse } 402df8e96f3SDavid Woodhouse 403df8e96f3SDavid Woodhouse /* We put this in reverse order, so we can just use eat_last */ 404df8e96f3SDavid Woodhouse static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) 405df8e96f3SDavid Woodhouse { 406df8e96f3SDavid Woodhouse struct rb_node **link = &ver_root->rb_node; 407df8e96f3SDavid Woodhouse struct rb_node *parent = NULL; 408df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *this_tn; 409df8e96f3SDavid Woodhouse 410df8e96f3SDavid Woodhouse while (*link) { 411df8e96f3SDavid Woodhouse parent = *link; 412df8e96f3SDavid Woodhouse this_tn = rb_entry(parent, struct jffs2_tmp_dnode_info, rb); 413df8e96f3SDavid Woodhouse 414df8e96f3SDavid Woodhouse if (tn->version > this_tn->version) 415df8e96f3SDavid Woodhouse link = &parent->rb_left; 416df8e96f3SDavid Woodhouse else 417df8e96f3SDavid Woodhouse link = &parent->rb_right; 418df8e96f3SDavid Woodhouse } 419df8e96f3SDavid Woodhouse dbg_readinode("Link new node at %p (root is %p)\n", link, ver_root); 420df8e96f3SDavid Woodhouse rb_link_node(&tn->rb, parent, link); 421df8e96f3SDavid Woodhouse rb_insert_color(&tn->rb, ver_root); 422df8e96f3SDavid Woodhouse } 423df8e96f3SDavid Woodhouse 424df8e96f3SDavid Woodhouse /* Build final, normal fragtree from tn tree. It doesn't matter which order 425df8e96f3SDavid Woodhouse we add nodes to the real fragtree, as long as they don't overlap. And 426df8e96f3SDavid Woodhouse having thrown away the majority of overlapped nodes as we went, there 427df8e96f3SDavid Woodhouse really shouldn't be many sets of nodes which do overlap. If we start at 428df8e96f3SDavid Woodhouse the end, we can use the overlap markers -- we can just eat nodes which 429df8e96f3SDavid Woodhouse aren't overlapped, and when we encounter nodes which _do_ overlap we 430df8e96f3SDavid Woodhouse sort them all into a temporary tree in version order before replaying them. */ 431df8e96f3SDavid Woodhouse static int jffs2_build_inode_fragtree(struct jffs2_sb_info *c, 432df8e96f3SDavid Woodhouse struct jffs2_inode_info *f, 433df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 434df8e96f3SDavid Woodhouse { 435df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *pen, *last, *this; 436df8e96f3SDavid Woodhouse struct rb_root ver_root = RB_ROOT; 437df8e96f3SDavid Woodhouse uint32_t high_ver = 0; 438df8e96f3SDavid Woodhouse 439df8e96f3SDavid Woodhouse if (rii->mdata_tn) { 440df8e96f3SDavid Woodhouse dbg_readinode("potential mdata is ver %d at %p\n", rii->mdata_tn->version, rii->mdata_tn); 441df8e96f3SDavid Woodhouse high_ver = rii->mdata_tn->version; 442df8e96f3SDavid Woodhouse rii->latest_ref = rii->mdata_tn->fn->raw; 443df8e96f3SDavid Woodhouse } 444df8e96f3SDavid Woodhouse #ifdef JFFS2_DBG_READINODE_MESSAGES 445df8e96f3SDavid Woodhouse this = tn_last(&rii->tn_root); 446df8e96f3SDavid Woodhouse while (this) { 447df8e96f3SDavid Woodhouse dbg_readinode("tn %p ver %d range 0x%x-0x%x ov %d\n", this, this->version, this->fn->ofs, 448df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size, this->overlapped); 449df8e96f3SDavid Woodhouse this = tn_prev(this); 450df8e96f3SDavid Woodhouse } 451df8e96f3SDavid Woodhouse #endif 452df8e96f3SDavid Woodhouse pen = tn_last(&rii->tn_root); 453df8e96f3SDavid Woodhouse while ((last = pen)) { 454df8e96f3SDavid Woodhouse pen = tn_prev(last); 455df8e96f3SDavid Woodhouse 456df8e96f3SDavid Woodhouse eat_last(&rii->tn_root, &last->rb); 457df8e96f3SDavid Woodhouse ver_insert(&ver_root, last); 458df8e96f3SDavid Woodhouse 459df8e96f3SDavid Woodhouse if (unlikely(last->overlapped)) 460df8e96f3SDavid Woodhouse continue; 461df8e96f3SDavid Woodhouse 462df8e96f3SDavid Woodhouse /* Now we have a bunch of nodes in reverse version 463df8e96f3SDavid Woodhouse order, in the tree at ver_root. Most of the time, 464df8e96f3SDavid Woodhouse there'll actually be only one node in the 'tree', 465df8e96f3SDavid Woodhouse in fact. */ 466df8e96f3SDavid Woodhouse this = tn_last(&ver_root); 467df8e96f3SDavid Woodhouse 468df8e96f3SDavid Woodhouse while (this) { 469df8e96f3SDavid Woodhouse struct jffs2_tmp_dnode_info *vers_next; 470df8e96f3SDavid Woodhouse int ret; 471df8e96f3SDavid Woodhouse vers_next = tn_prev(this); 472df8e96f3SDavid Woodhouse eat_last(&ver_root, &this->rb); 473df8e96f3SDavid Woodhouse if (check_tn_node(c, this)) { 4741123e2a8SDavid Woodhouse dbg_readinode("node ver %d, 0x%x-0x%x failed CRC\n", 475df8e96f3SDavid Woodhouse this->version, this->fn->ofs, 476df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size); 477df8e96f3SDavid Woodhouse jffs2_kill_tn(c, this); 478df8e96f3SDavid Woodhouse } else { 479df8e96f3SDavid Woodhouse if (this->version > high_ver) { 480df8e96f3SDavid Woodhouse /* Note that this is different from the other 481df8e96f3SDavid Woodhouse highest_version, because this one is only 482df8e96f3SDavid Woodhouse counting _valid_ nodes which could give the 483df8e96f3SDavid Woodhouse latest inode metadata */ 484df8e96f3SDavid Woodhouse high_ver = this->version; 485df8e96f3SDavid Woodhouse rii->latest_ref = this->fn->raw; 486df8e96f3SDavid Woodhouse } 4871123e2a8SDavid Woodhouse dbg_readinode("Add %p (v %d, 0x%x-0x%x, ov %d) to fragtree\n", 488df8e96f3SDavid Woodhouse this, this->version, this->fn->ofs, 489df8e96f3SDavid Woodhouse this->fn->ofs+this->fn->size, this->overlapped); 490df8e96f3SDavid Woodhouse 491df8e96f3SDavid Woodhouse ret = jffs2_add_full_dnode_to_inode(c, f, this->fn); 492df8e96f3SDavid Woodhouse if (ret) { 493df8e96f3SDavid Woodhouse /* Free the nodes in vers_root; let the caller 494df8e96f3SDavid Woodhouse deal with the rest */ 495df8e96f3SDavid Woodhouse JFFS2_ERROR("Add node to tree failed %d\n", ret); 496df8e96f3SDavid Woodhouse while (1) { 497df8e96f3SDavid Woodhouse vers_next = tn_prev(this); 498df8e96f3SDavid Woodhouse if (check_tn_node(c, this)) 499df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, this->fn->raw); 500df8e96f3SDavid Woodhouse jffs2_free_full_dnode(this->fn); 501df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(this); 502df8e96f3SDavid Woodhouse this = vers_next; 503df8e96f3SDavid Woodhouse if (!this) 504df8e96f3SDavid Woodhouse break; 505df8e96f3SDavid Woodhouse eat_last(&ver_root, &vers_next->rb); 506df8e96f3SDavid Woodhouse } 507df8e96f3SDavid Woodhouse return ret; 508df8e96f3SDavid Woodhouse } 509df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(this); 510df8e96f3SDavid Woodhouse } 511df8e96f3SDavid Woodhouse this = vers_next; 512df8e96f3SDavid Woodhouse } 513df8e96f3SDavid Woodhouse } 514df8e96f3SDavid Woodhouse return 0; 515f97117d1SArtem B. Bityutskiy } 516f97117d1SArtem B. Bityutskiy 517f97117d1SArtem B. Bityutskiy static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) 518f97117d1SArtem B. Bityutskiy { 519f97117d1SArtem B. Bityutskiy struct rb_node *this; 520f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 521f97117d1SArtem B. Bityutskiy 522f97117d1SArtem B. Bityutskiy this = list->rb_node; 523f97117d1SArtem B. Bityutskiy 524f97117d1SArtem B. Bityutskiy /* Now at bottom of tree */ 525f97117d1SArtem B. Bityutskiy while (this) { 526f97117d1SArtem B. Bityutskiy if (this->rb_left) 527f97117d1SArtem B. Bityutskiy this = this->rb_left; 528f97117d1SArtem B. Bityutskiy else if (this->rb_right) 529f97117d1SArtem B. Bityutskiy this = this->rb_right; 530f97117d1SArtem B. Bityutskiy else { 531f97117d1SArtem B. Bityutskiy tn = rb_entry(this, struct jffs2_tmp_dnode_info, rb); 532f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(tn->fn); 533f97117d1SArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 534f97117d1SArtem B. Bityutskiy 53521f1d5fcSDavid Woodhouse this = rb_parent(this); 536f97117d1SArtem B. Bityutskiy if (!this) 5371da177e4SLinus Torvalds break; 5381da177e4SLinus Torvalds 539f97117d1SArtem B. Bityutskiy if (this->rb_left == &tn->rb) 540f97117d1SArtem B. Bityutskiy this->rb_left = NULL; 541f97117d1SArtem B. Bityutskiy else if (this->rb_right == &tn->rb) 542f97117d1SArtem B. Bityutskiy this->rb_right = NULL; 543f97117d1SArtem B. Bityutskiy else BUG(); 544f97117d1SArtem B. Bityutskiy } 545f97117d1SArtem B. Bityutskiy } 546f97117d1SArtem B. Bityutskiy list->rb_node = NULL; 547f97117d1SArtem B. Bityutskiy } 5481da177e4SLinus Torvalds 549f97117d1SArtem B. Bityutskiy static void jffs2_free_full_dirent_list(struct jffs2_full_dirent *fd) 550f97117d1SArtem B. Bityutskiy { 551f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *next; 552f97117d1SArtem B. Bityutskiy 553f97117d1SArtem B. Bityutskiy while (fd) { 554f97117d1SArtem B. Bityutskiy next = fd->next; 555f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 556f97117d1SArtem B. Bityutskiy fd = next; 557f97117d1SArtem B. Bityutskiy } 558f97117d1SArtem B. Bityutskiy } 559f97117d1SArtem B. Bityutskiy 560f97117d1SArtem B. Bityutskiy /* Returns first valid node after 'ref'. May return 'ref' */ 561f97117d1SArtem B. Bityutskiy static struct jffs2_raw_node_ref *jffs2_first_valid_node(struct jffs2_raw_node_ref *ref) 562f97117d1SArtem B. Bityutskiy { 563f97117d1SArtem B. Bityutskiy while (ref && ref->next_in_ino) { 564f97117d1SArtem B. Bityutskiy if (!ref_obsolete(ref)) 565f97117d1SArtem B. Bityutskiy return ref; 566733802d9SArtem B. Bityutskiy dbg_noderef("node at 0x%08x is obsoleted. Ignoring.\n", ref_offset(ref)); 567f97117d1SArtem B. Bityutskiy ref = ref->next_in_ino; 568f97117d1SArtem B. Bityutskiy } 569f97117d1SArtem B. Bityutskiy return NULL; 570f97117d1SArtem B. Bityutskiy } 571f97117d1SArtem B. Bityutskiy 572f97117d1SArtem B. Bityutskiy /* 573f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 574f97117d1SArtem B. Bityutskiy * It is called every time an directory entry node is found. 575f97117d1SArtem B. Bityutskiy * 57614c6381eSDavid Woodhouse * Returns: 0 on success; 577f97117d1SArtem B. Bityutskiy * negative error code on failure. 578f97117d1SArtem B. Bityutskiy */ 5791e0da3cbSArtem B. Bityutskiy static inline int read_direntry(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 580df8e96f3SDavid Woodhouse struct jffs2_raw_dirent *rd, size_t read, 581df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 582f97117d1SArtem B. Bityutskiy { 583f97117d1SArtem B. Bityutskiy struct jffs2_full_dirent *fd; 5841046d880SDavid Woodhouse uint32_t crc; 585f97117d1SArtem B. Bityutskiy 586f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 587f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 588f97117d1SArtem B. Bityutskiy 5891046d880SDavid Woodhouse crc = crc32(0, rd, sizeof(*rd) - 8); 5901046d880SDavid Woodhouse if (unlikely(crc != je32_to_cpu(rd->node_crc))) { 5911046d880SDavid Woodhouse JFFS2_NOTICE("header CRC failed on dirent node at %#08x: read %#08x, calculated %#08x\n", 5921046d880SDavid Woodhouse ref_offset(ref), je32_to_cpu(rd->node_crc), crc); 593df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 594df8e96f3SDavid Woodhouse return 0; 5951046d880SDavid Woodhouse } 5961046d880SDavid Woodhouse 5971046d880SDavid Woodhouse /* If we've never checked the CRCs on this node, check them now */ 5981046d880SDavid Woodhouse if (ref_flags(ref) == REF_UNCHECKED) { 5991046d880SDavid Woodhouse struct jffs2_eraseblock *jeb; 6001046d880SDavid Woodhouse int len; 6011046d880SDavid Woodhouse 602f97117d1SArtem B. Bityutskiy /* Sanity check */ 603f97117d1SArtem B. Bityutskiy if (unlikely(PAD((rd->nsize + sizeof(*rd))) != PAD(je32_to_cpu(rd->totlen)))) { 604e0d60137SArtem B. Bityutskiy JFFS2_ERROR("illegal nsize in node at %#08x: nsize %#02x, totlen %#04x\n", 605f97117d1SArtem B. Bityutskiy ref_offset(ref), rd->nsize, je32_to_cpu(rd->totlen)); 606df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 607df8e96f3SDavid Woodhouse return 0; 608f97117d1SArtem B. Bityutskiy } 609f97117d1SArtem B. Bityutskiy 6101046d880SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 6111046d880SDavid Woodhouse len = ref_totlen(c, jeb, ref); 6121046d880SDavid Woodhouse 6131046d880SDavid Woodhouse spin_lock(&c->erase_completion_lock); 6141046d880SDavid Woodhouse jeb->used_size += len; 6151046d880SDavid Woodhouse jeb->unchecked_size -= len; 6161046d880SDavid Woodhouse c->used_size += len; 6171046d880SDavid Woodhouse c->unchecked_size -= len; 61843dfa07fSDavid Woodhouse ref->flash_offset = ref_offset(ref) | dirent_node_state(rd); 6191046d880SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 6201046d880SDavid Woodhouse } 6211046d880SDavid Woodhouse 622f97117d1SArtem B. Bityutskiy fd = jffs2_alloc_full_dirent(rd->nsize + 1); 623f97117d1SArtem B. Bityutskiy if (unlikely(!fd)) 624f97117d1SArtem B. Bityutskiy return -ENOMEM; 625f97117d1SArtem B. Bityutskiy 626f97117d1SArtem B. Bityutskiy fd->raw = ref; 627f97117d1SArtem B. Bityutskiy fd->version = je32_to_cpu(rd->version); 628f97117d1SArtem B. Bityutskiy fd->ino = je32_to_cpu(rd->ino); 629f97117d1SArtem B. Bityutskiy fd->type = rd->type; 630f97117d1SArtem B. Bityutskiy 631df8e96f3SDavid Woodhouse if (fd->version > rii->highest_version) 632df8e96f3SDavid Woodhouse rii->highest_version = fd->version; 633df8e96f3SDavid Woodhouse 634f97117d1SArtem B. Bityutskiy /* Pick out the mctime of the latest dirent */ 635df8e96f3SDavid Woodhouse if(fd->version > rii->mctime_ver && je32_to_cpu(rd->mctime)) { 636df8e96f3SDavid Woodhouse rii->mctime_ver = fd->version; 637df8e96f3SDavid Woodhouse rii->latest_mctime = je32_to_cpu(rd->mctime); 638f97117d1SArtem B. Bityutskiy } 639f97117d1SArtem B. Bityutskiy 640f97117d1SArtem B. Bityutskiy /* 641f97117d1SArtem B. Bityutskiy * Copy as much of the name as possible from the raw 642f97117d1SArtem B. Bityutskiy * dirent we've already read from the flash. 643f97117d1SArtem B. Bityutskiy */ 644f97117d1SArtem B. Bityutskiy if (read > sizeof(*rd)) 645f97117d1SArtem B. Bityutskiy memcpy(&fd->name[0], &rd->name[0], 646f97117d1SArtem B. Bityutskiy min_t(uint32_t, rd->nsize, (read - sizeof(*rd)) )); 647f97117d1SArtem B. Bityutskiy 648f97117d1SArtem B. Bityutskiy /* Do we need to copy any more of the name directly from the flash? */ 649f97117d1SArtem B. Bityutskiy if (rd->nsize + sizeof(*rd) > read) { 650f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 651f97117d1SArtem B. Bityutskiy int err; 652f97117d1SArtem B. Bityutskiy int already = read - sizeof(*rd); 653f97117d1SArtem B. Bityutskiy 654f97117d1SArtem B. Bityutskiy err = jffs2_flash_read(c, (ref_offset(ref)) + read, 655f97117d1SArtem B. Bityutskiy rd->nsize - already, &read, &fd->name[already]); 656f97117d1SArtem B. Bityutskiy if (unlikely(read != rd->nsize - already) && likely(!err)) 657f97117d1SArtem B. Bityutskiy return -EIO; 658f97117d1SArtem B. Bityutskiy 659f97117d1SArtem B. Bityutskiy if (unlikely(err)) { 660e0d60137SArtem B. Bityutskiy JFFS2_ERROR("read remainder of name: error %d\n", err); 661f97117d1SArtem B. Bityutskiy jffs2_free_full_dirent(fd); 662f97117d1SArtem B. Bityutskiy return -EIO; 663f97117d1SArtem B. Bityutskiy } 664f97117d1SArtem B. Bityutskiy } 665f97117d1SArtem B. Bityutskiy 666f97117d1SArtem B. Bityutskiy fd->nhash = full_name_hash(fd->name, rd->nsize); 667f97117d1SArtem B. Bityutskiy fd->next = NULL; 668f97117d1SArtem B. Bityutskiy fd->name[rd->nsize] = '\0'; 669f97117d1SArtem B. Bityutskiy 670f97117d1SArtem B. Bityutskiy /* 671f97117d1SArtem B. Bityutskiy * Wheee. We now have a complete jffs2_full_dirent structure, with 672f97117d1SArtem B. Bityutskiy * the name in it and everything. Link it into the list 673f97117d1SArtem B. Bityutskiy */ 674df8e96f3SDavid Woodhouse jffs2_add_fd_to_list(c, fd, &rii->fds); 675f97117d1SArtem B. Bityutskiy 676f97117d1SArtem B. Bityutskiy return 0; 677f97117d1SArtem B. Bityutskiy } 678f97117d1SArtem B. Bityutskiy 679f97117d1SArtem B. Bityutskiy /* 680f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 681f97117d1SArtem B. Bityutskiy * It is called every time an inode node is found. 682f97117d1SArtem B. Bityutskiy * 68314c6381eSDavid Woodhouse * Returns: 0 on success (possibly after marking a bad node obsolete); 684f97117d1SArtem B. Bityutskiy * negative error code on failure. 685f97117d1SArtem B. Bityutskiy */ 6861e0da3cbSArtem B. Bityutskiy static inline int read_dnode(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 687df8e96f3SDavid Woodhouse struct jffs2_raw_inode *rd, int rdlen, 688df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 689f97117d1SArtem B. Bityutskiy { 690f97117d1SArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn; 6911e0da3cbSArtem B. Bityutskiy uint32_t len, csize; 69214c6381eSDavid Woodhouse int ret = 0; 6931046d880SDavid Woodhouse uint32_t crc; 694f97117d1SArtem B. Bityutskiy 695f97117d1SArtem B. Bityutskiy /* Obsoleted. This cannot happen, surely? dwmw2 20020308 */ 696f97117d1SArtem B. Bityutskiy BUG_ON(ref_obsolete(ref)); 697f97117d1SArtem B. Bityutskiy 6981046d880SDavid Woodhouse crc = crc32(0, rd, sizeof(*rd) - 8); 6991046d880SDavid Woodhouse if (unlikely(crc != je32_to_cpu(rd->node_crc))) { 7001046d880SDavid Woodhouse JFFS2_NOTICE("node CRC failed on dnode at %#08x: read %#08x, calculated %#08x\n", 7011046d880SDavid Woodhouse ref_offset(ref), je32_to_cpu(rd->node_crc), crc); 702df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 703df8e96f3SDavid Woodhouse return 0; 7041046d880SDavid Woodhouse } 7051046d880SDavid Woodhouse 7061e0da3cbSArtem B. Bityutskiy tn = jffs2_alloc_tmp_dnode_info(); 7071e0da3cbSArtem B. Bityutskiy if (!tn) { 708fb6a82c9SRandy Dunlap JFFS2_ERROR("failed to allocate tn (%zu bytes).\n", sizeof(*tn)); 7091e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7101e0da3cbSArtem B. Bityutskiy } 7111e0da3cbSArtem B. Bityutskiy 7121e0da3cbSArtem B. Bityutskiy tn->partial_crc = 0; 7131e0da3cbSArtem B. Bityutskiy csize = je32_to_cpu(rd->csize); 7141e0da3cbSArtem B. Bityutskiy 715f97117d1SArtem B. Bityutskiy /* If we've never checked the CRCs on this node, check them now */ 716f97117d1SArtem B. Bityutskiy if (ref_flags(ref) == REF_UNCHECKED) { 717f97117d1SArtem B. Bityutskiy 718f97117d1SArtem B. Bityutskiy /* Sanity checks */ 719f97117d1SArtem B. Bityutskiy if (unlikely(je32_to_cpu(rd->offset) > je32_to_cpu(rd->isize)) || 720f97117d1SArtem B. Bityutskiy unlikely(PAD(je32_to_cpu(rd->csize) + sizeof(*rd)) != PAD(je32_to_cpu(rd->totlen)))) { 721e0d60137SArtem B. Bityutskiy JFFS2_WARNING("inode node header CRC is corrupted at %#08x\n", ref_offset(ref)); 722737b7661SAndrew Lunn jffs2_dbg_dump_node(c, ref_offset(ref)); 72314c6381eSDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 7241e0da3cbSArtem B. Bityutskiy goto free_out; 725f97117d1SArtem B. Bityutskiy } 726f97117d1SArtem B. Bityutskiy 7271e0da3cbSArtem B. Bityutskiy if (jffs2_is_writebuffered(c) && csize != 0) { 7281e0da3cbSArtem B. Bityutskiy /* At this point we are supposed to check the data CRC 7291e0da3cbSArtem B. Bityutskiy * of our unchecked node. But thus far, we do not 7301e0da3cbSArtem B. Bityutskiy * know whether the node is valid or obsolete. To 7311e0da3cbSArtem B. Bityutskiy * figure this out, we need to walk all the nodes of 7321e0da3cbSArtem B. Bityutskiy * the inode and build the inode fragtree. We don't 7331e0da3cbSArtem B. Bityutskiy * want to spend time checking data of nodes which may 7341e0da3cbSArtem B. Bityutskiy * later be found to be obsolete. So we put off the full 7351e0da3cbSArtem B. Bityutskiy * data CRC checking until we have read all the inode 7361e0da3cbSArtem B. Bityutskiy * nodes and have started building the fragtree. 7371e0da3cbSArtem B. Bityutskiy * 7381e0da3cbSArtem B. Bityutskiy * The fragtree is being built starting with nodes 7391e0da3cbSArtem B. Bityutskiy * having the highest version number, so we'll be able 7401e0da3cbSArtem B. Bityutskiy * to detect whether a node is valid (i.e., it is not 7411e0da3cbSArtem B. Bityutskiy * overlapped by a node with higher version) or not. 7421e0da3cbSArtem B. Bityutskiy * And we'll be able to check only those nodes, which 7431e0da3cbSArtem B. Bityutskiy * are not obsolete. 7441e0da3cbSArtem B. Bityutskiy * 7451e0da3cbSArtem B. Bityutskiy * Of course, this optimization only makes sense in case 746e1b8513dSRobert P. J. Day * of NAND flashes (or other flashes with 7471e0da3cbSArtem B. Bityutskiy * !jffs2_can_mark_obsolete()), since on NOR flashes 7481e0da3cbSArtem B. Bityutskiy * nodes are marked obsolete physically. 7491e0da3cbSArtem B. Bityutskiy * 7501e0da3cbSArtem B. Bityutskiy * Since NAND flashes (or other flashes with 7511e0da3cbSArtem B. Bityutskiy * jffs2_is_writebuffered(c)) are anyway read by 7521e0da3cbSArtem B. Bityutskiy * fractions of c->wbuf_pagesize, and we have just read 7531e0da3cbSArtem B. Bityutskiy * the node header, it is likely that the starting part 7541e0da3cbSArtem B. Bityutskiy * of the node data is also read when we read the 7551e0da3cbSArtem B. Bityutskiy * header. So we don't mind to check the CRC of the 7561e0da3cbSArtem B. Bityutskiy * starting part of the data of the node now, and check 7571e0da3cbSArtem B. Bityutskiy * the second part later (in jffs2_check_node_data()). 7581e0da3cbSArtem B. Bityutskiy * Of course, we will not need to re-read and re-check 7591e0da3cbSArtem B. Bityutskiy * the NAND page which we have just read. This is why we 7601e0da3cbSArtem B. Bityutskiy * read the whole NAND page at jffs2_get_inode_nodes(), 7611e0da3cbSArtem B. Bityutskiy * while we needed only the node header. 7621e0da3cbSArtem B. Bityutskiy */ 7631e0da3cbSArtem B. Bityutskiy unsigned char *buf; 764f97117d1SArtem B. Bityutskiy 7651e0da3cbSArtem B. Bityutskiy /* 'buf' will point to the start of data */ 7661e0da3cbSArtem B. Bityutskiy buf = (unsigned char *)rd + sizeof(*rd); 7671e0da3cbSArtem B. Bityutskiy /* len will be the read data length */ 7681e0da3cbSArtem B. Bityutskiy len = min_t(uint32_t, rdlen - sizeof(*rd), csize); 769280562b2SArtem B. Bityutskiy tn->partial_crc = crc32(0, buf, len); 770f97117d1SArtem B. Bityutskiy 771733802d9SArtem B. Bityutskiy dbg_readinode("Calculates CRC (%#08x) for %d bytes, csize %d\n", tn->partial_crc, len, csize); 772f97117d1SArtem B. Bityutskiy 7731e0da3cbSArtem B. Bityutskiy /* If we actually calculated the whole data CRC 7741e0da3cbSArtem B. Bityutskiy * and it is wrong, drop the node. */ 7753c091337SArtem B. Bityutskiy if (len >= csize && unlikely(tn->partial_crc != je32_to_cpu(rd->data_crc))) { 77639243508SArtem B. Bityutskiy JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 77739243508SArtem B. Bityutskiy ref_offset(ref), tn->partial_crc, je32_to_cpu(rd->data_crc)); 77814c6381eSDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 7791e0da3cbSArtem B. Bityutskiy goto free_out; 78039243508SArtem B. Bityutskiy } 781f97117d1SArtem B. Bityutskiy 7821e0da3cbSArtem B. Bityutskiy } else if (csize == 0) { 7831e0da3cbSArtem B. Bityutskiy /* 7841e0da3cbSArtem B. Bityutskiy * We checked the header CRC. If the node has no data, adjust 7851e0da3cbSArtem B. Bityutskiy * the space accounting now. For other nodes this will be done 7861e0da3cbSArtem B. Bityutskiy * later either when the node is marked obsolete or when its 7871e0da3cbSArtem B. Bityutskiy * data is checked. 7881e0da3cbSArtem B. Bityutskiy */ 7891e0da3cbSArtem B. Bityutskiy struct jffs2_eraseblock *jeb; 7901e0da3cbSArtem B. Bityutskiy 791733802d9SArtem B. Bityutskiy dbg_readinode("the node has no data.\n"); 792f97117d1SArtem B. Bityutskiy jeb = &c->blocks[ref->flash_offset / c->sector_size]; 793f97117d1SArtem B. Bityutskiy len = ref_totlen(c, jeb, ref); 794f97117d1SArtem B. Bityutskiy 795f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 796f97117d1SArtem B. Bityutskiy jeb->used_size += len; 797f97117d1SArtem B. Bityutskiy jeb->unchecked_size -= len; 798f97117d1SArtem B. Bityutskiy c->used_size += len; 799f97117d1SArtem B. Bityutskiy c->unchecked_size -= len; 800f97117d1SArtem B. Bityutskiy ref->flash_offset = ref_offset(ref) | REF_NORMAL; 801f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 802f97117d1SArtem B. Bityutskiy } 803f97117d1SArtem B. Bityutskiy } 804f97117d1SArtem B. Bityutskiy 805f97117d1SArtem B. Bityutskiy tn->fn = jffs2_alloc_full_dnode(); 806f97117d1SArtem B. Bityutskiy if (!tn->fn) { 807e0d60137SArtem B. Bityutskiy JFFS2_ERROR("alloc fn failed\n"); 8081e0da3cbSArtem B. Bityutskiy ret = -ENOMEM; 8091e0da3cbSArtem B. Bityutskiy goto free_out; 810f97117d1SArtem B. Bityutskiy } 811f97117d1SArtem B. Bityutskiy 812f97117d1SArtem B. Bityutskiy tn->version = je32_to_cpu(rd->version); 813f97117d1SArtem B. Bityutskiy tn->fn->ofs = je32_to_cpu(rd->offset); 8141e0da3cbSArtem B. Bityutskiy tn->data_crc = je32_to_cpu(rd->data_crc); 8151e0da3cbSArtem B. Bityutskiy tn->csize = csize; 816f97117d1SArtem B. Bityutskiy tn->fn->raw = ref; 817df8e96f3SDavid Woodhouse tn->overlapped = 0; 818df8e96f3SDavid Woodhouse 819df8e96f3SDavid Woodhouse if (tn->version > rii->highest_version) 820df8e96f3SDavid Woodhouse rii->highest_version = tn->version; 821f97117d1SArtem B. Bityutskiy 822f97117d1SArtem B. Bityutskiy /* There was a bug where we wrote hole nodes out with 823f97117d1SArtem B. Bityutskiy csize/dsize swapped. Deal with it */ 8241e0da3cbSArtem B. Bityutskiy if (rd->compr == JFFS2_COMPR_ZERO && !je32_to_cpu(rd->dsize) && csize) 8251e0da3cbSArtem B. Bityutskiy tn->fn->size = csize; 826f97117d1SArtem B. Bityutskiy else // normal case... 827f97117d1SArtem B. Bityutskiy tn->fn->size = je32_to_cpu(rd->dsize); 828f97117d1SArtem B. Bityutskiy 8292c61cb25SDavid Woodhouse dbg_readinode2("dnode @%08x: ver %u, offset %#04x, dsize %#04x, csize %#04x\n", 8302c61cb25SDavid Woodhouse ref_offset(ref), je32_to_cpu(rd->version), 8312c61cb25SDavid Woodhouse je32_to_cpu(rd->offset), je32_to_cpu(rd->dsize), csize); 832f97117d1SArtem B. Bityutskiy 833df8e96f3SDavid Woodhouse ret = jffs2_add_tn_to_tree(c, rii, tn); 834f97117d1SArtem B. Bityutskiy 835df8e96f3SDavid Woodhouse if (ret) { 836df8e96f3SDavid Woodhouse jffs2_free_full_dnode(tn->fn); 8371e0da3cbSArtem B. Bityutskiy free_out: 8381e0da3cbSArtem B. Bityutskiy jffs2_free_tmp_dnode_info(tn); 8391e0da3cbSArtem B. Bityutskiy return ret; 840f97117d1SArtem B. Bityutskiy } 8412c61cb25SDavid Woodhouse #ifdef JFFS2_DBG_READINODE2_MESSAGES 8422c61cb25SDavid Woodhouse dbg_readinode2("After adding ver %d:\n", je32_to_cpu(rd->version)); 843df8e96f3SDavid Woodhouse tn = tn_first(&rii->tn_root); 844df8e96f3SDavid Woodhouse while (tn) { 8452c61cb25SDavid Woodhouse dbg_readinode2("%p: v %d r 0x%x-0x%x ov %d\n", 846df8e96f3SDavid Woodhouse tn, tn->version, tn->fn->ofs, 847df8e96f3SDavid Woodhouse tn->fn->ofs+tn->fn->size, tn->overlapped); 848df8e96f3SDavid Woodhouse tn = tn_next(tn); 849df8e96f3SDavid Woodhouse } 850df8e96f3SDavid Woodhouse #endif 851df8e96f3SDavid Woodhouse return 0; 852df8e96f3SDavid Woodhouse } 853f97117d1SArtem B. Bityutskiy 854f97117d1SArtem B. Bityutskiy /* 855f97117d1SArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 856f97117d1SArtem B. Bityutskiy * It is called every time an unknown node is found. 857f97117d1SArtem B. Bityutskiy * 8583877f0b6SDavid Woodhouse * Returns: 0 on success; 859f97117d1SArtem B. Bityutskiy * negative error code on failure. 860f97117d1SArtem B. Bityutskiy */ 8611e0da3cbSArtem B. Bityutskiy static inline int read_unknown(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, struct jffs2_unknown_node *un) 862f97117d1SArtem B. Bityutskiy { 863f97117d1SArtem B. Bityutskiy /* We don't mark unknown nodes as REF_UNCHECKED */ 864c7258a44SDavid Woodhouse if (ref_flags(ref) == REF_UNCHECKED) { 865c7258a44SDavid Woodhouse JFFS2_ERROR("REF_UNCHECKED but unknown node at %#08x\n", 866c7258a44SDavid Woodhouse ref_offset(ref)); 867c7258a44SDavid Woodhouse JFFS2_ERROR("Node is {%04x,%04x,%08x,%08x}. Please report this error.\n", 868c7258a44SDavid Woodhouse je16_to_cpu(un->magic), je16_to_cpu(un->nodetype), 869c7258a44SDavid Woodhouse je32_to_cpu(un->totlen), je32_to_cpu(un->hdr_crc)); 870df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 871df8e96f3SDavid Woodhouse return 0; 872c7258a44SDavid Woodhouse } 873f97117d1SArtem B. Bityutskiy 874f97117d1SArtem B. Bityutskiy un->nodetype = cpu_to_je16(JFFS2_NODE_ACCURATE | je16_to_cpu(un->nodetype)); 875f97117d1SArtem B. Bityutskiy 876f97117d1SArtem B. Bityutskiy switch(je16_to_cpu(un->nodetype) & JFFS2_COMPAT_MASK) { 877f97117d1SArtem B. Bityutskiy 878f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_INCOMPAT: 879e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown INCOMPAT nodetype %#04X at %#08x\n", 880f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 881f97117d1SArtem B. Bityutskiy /* EEP */ 882f97117d1SArtem B. Bityutskiy BUG(); 883f97117d1SArtem B. Bityutskiy break; 884f97117d1SArtem B. Bityutskiy 885f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_ROCOMPAT: 886e0d60137SArtem B. Bityutskiy JFFS2_ERROR("unknown ROCOMPAT nodetype %#04X at %#08x\n", 887f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 888f97117d1SArtem B. Bityutskiy BUG_ON(!(c->flags & JFFS2_SB_FLAG_RO)); 889f97117d1SArtem B. Bityutskiy break; 890f97117d1SArtem B. Bityutskiy 891f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_COPY: 892e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_COPY nodetype %#04X at %#08x\n", 893f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 894f97117d1SArtem B. Bityutskiy break; 895f97117d1SArtem B. Bityutskiy 896f97117d1SArtem B. Bityutskiy case JFFS2_FEATURE_RWCOMPAT_DELETE: 897e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("unknown RWCOMPAT_DELETE nodetype %#04X at %#08x\n", 898f97117d1SArtem B. Bityutskiy je16_to_cpu(un->nodetype), ref_offset(ref)); 899df8e96f3SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 900df8e96f3SDavid Woodhouse return 0; 901f97117d1SArtem B. Bityutskiy } 902f97117d1SArtem B. Bityutskiy 903f97117d1SArtem B. Bityutskiy return 0; 904f97117d1SArtem B. Bityutskiy } 905f97117d1SArtem B. Bityutskiy 9061e0da3cbSArtem B. Bityutskiy /* 9071e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_get_inode_nodes(). 9081e0da3cbSArtem B. Bityutskiy * The function detects whether more data should be read and reads it if yes. 9091e0da3cbSArtem B. Bityutskiy * 9101e0da3cbSArtem B. Bityutskiy * Returns: 0 on succes; 9111e0da3cbSArtem B. Bityutskiy * negative error code on failure. 9121e0da3cbSArtem B. Bityutskiy */ 9131e0da3cbSArtem B. Bityutskiy static int read_more(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref, 91410731f83SArtem Bityutskiy int needed_len, int *rdlen, unsigned char *buf) 9151e0da3cbSArtem B. Bityutskiy { 91610731f83SArtem Bityutskiy int err, to_read = needed_len - *rdlen; 9171e0da3cbSArtem B. Bityutskiy size_t retlen; 9181e0da3cbSArtem B. Bityutskiy uint32_t offs; 9191e0da3cbSArtem B. Bityutskiy 9201e0da3cbSArtem B. Bityutskiy if (jffs2_is_writebuffered(c)) { 92110731f83SArtem Bityutskiy int rem = to_read % c->wbuf_pagesize; 9221e0da3cbSArtem B. Bityutskiy 92310731f83SArtem Bityutskiy if (rem) 92410731f83SArtem Bityutskiy to_read += c->wbuf_pagesize - rem; 92510731f83SArtem Bityutskiy } 9261e0da3cbSArtem B. Bityutskiy 9271e0da3cbSArtem B. Bityutskiy /* We need to read more data */ 9281e0da3cbSArtem B. Bityutskiy offs = ref_offset(ref) + *rdlen; 9291e0da3cbSArtem B. Bityutskiy 93010731f83SArtem Bityutskiy dbg_readinode("read more %d bytes\n", to_read); 9311e0da3cbSArtem B. Bityutskiy 93210731f83SArtem Bityutskiy err = jffs2_flash_read(c, offs, to_read, &retlen, buf + *rdlen); 9331e0da3cbSArtem B. Bityutskiy if (err) { 9341e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, " 93510731f83SArtem Bityutskiy "error code: %d.\n", to_read, offs, err); 9361e0da3cbSArtem B. Bityutskiy return err; 9371e0da3cbSArtem B. Bityutskiy } 9381e0da3cbSArtem B. Bityutskiy 93910731f83SArtem Bityutskiy if (retlen < to_read) { 940fb6a82c9SRandy Dunlap JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", 94110731f83SArtem Bityutskiy offs, retlen, to_read); 9421e0da3cbSArtem B. Bityutskiy return -EIO; 9431e0da3cbSArtem B. Bityutskiy } 9441e0da3cbSArtem B. Bityutskiy 94510731f83SArtem Bityutskiy *rdlen += to_read; 9461e0da3cbSArtem B. Bityutskiy return 0; 9471e0da3cbSArtem B. Bityutskiy } 9481e0da3cbSArtem B. Bityutskiy 949f97117d1SArtem B. Bityutskiy /* Get tmp_dnode_info and full_dirent for all non-obsolete nodes associated 950df8e96f3SDavid Woodhouse with this ino. Perform a preliminary ordering on data nodes, throwing away 951df8e96f3SDavid Woodhouse those which are completely obsoleted by newer ones. The naïve approach we 952df8e96f3SDavid Woodhouse use to take of just returning them _all_ in version order will cause us to 953df8e96f3SDavid Woodhouse run out of memory in certain degenerate cases. */ 954f97117d1SArtem B. Bityutskiy static int jffs2_get_inode_nodes(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 955df8e96f3SDavid Woodhouse struct jffs2_readinode_info *rii) 956f97117d1SArtem B. Bityutskiy { 957f97117d1SArtem B. Bityutskiy struct jffs2_raw_node_ref *ref, *valid_ref; 9581e0da3cbSArtem B. Bityutskiy unsigned char *buf = NULL; 9591e0da3cbSArtem B. Bityutskiy union jffs2_node_union *node; 960f97117d1SArtem B. Bityutskiy size_t retlen; 9611e0da3cbSArtem B. Bityutskiy int len, err; 962f97117d1SArtem B. Bityutskiy 963df8e96f3SDavid Woodhouse rii->mctime_ver = 0; 964f97117d1SArtem B. Bityutskiy 965733802d9SArtem B. Bityutskiy dbg_readinode("ino #%u\n", f->inocache->ino); 966f97117d1SArtem B. Bityutskiy 9671e0da3cbSArtem B. Bityutskiy /* FIXME: in case of NOR and available ->point() this 9681e0da3cbSArtem B. Bityutskiy * needs to be fixed. */ 96910731f83SArtem Bityutskiy len = sizeof(union jffs2_node_union) + c->wbuf_pagesize; 9701e0da3cbSArtem B. Bityutskiy buf = kmalloc(len, GFP_KERNEL); 9711e0da3cbSArtem B. Bityutskiy if (!buf) 9721e0da3cbSArtem B. Bityutskiy return -ENOMEM; 9731e0da3cbSArtem B. Bityutskiy 974f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 975f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(f->inocache->nodes); 9761e0da3cbSArtem B. Bityutskiy if (!valid_ref && f->inocache->ino != 1) 9771e0da3cbSArtem B. Bityutskiy JFFS2_WARNING("Eep. No valid nodes for ino #%u.\n", f->inocache->ino); 978f97117d1SArtem B. Bityutskiy while (valid_ref) { 979f97117d1SArtem B. Bityutskiy /* We can hold a pointer to a non-obsolete node without the spinlock, 980f97117d1SArtem B. Bityutskiy but _obsolete_ nodes may disappear at any time, if the block 981f97117d1SArtem B. Bityutskiy they're in gets erased. So if we mark 'ref' obsolete while we're 982f97117d1SArtem B. Bityutskiy not holding the lock, it can go away immediately. For that reason, 983f97117d1SArtem B. Bityutskiy we find the next valid node first, before processing 'ref'. 984f97117d1SArtem B. Bityutskiy */ 985f97117d1SArtem B. Bityutskiy ref = valid_ref; 986f97117d1SArtem B. Bityutskiy valid_ref = jffs2_first_valid_node(ref->next_in_ino); 987f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 988f97117d1SArtem B. Bityutskiy 989f97117d1SArtem B. Bityutskiy cond_resched(); 990f97117d1SArtem B. Bityutskiy 9911e0da3cbSArtem B. Bityutskiy /* 9921e0da3cbSArtem B. Bityutskiy * At this point we don't know the type of the node we're going 9931e0da3cbSArtem B. Bityutskiy * to read, so we do not know the size of its header. In order 99410731f83SArtem Bityutskiy * to minimize the amount of flash IO we assume the header is 99510731f83SArtem Bityutskiy * of size = JFFS2_MIN_NODE_HEADER. 9961e0da3cbSArtem B. Bityutskiy */ 9971e0da3cbSArtem B. Bityutskiy len = JFFS2_MIN_NODE_HEADER; 99810731f83SArtem Bityutskiy if (jffs2_is_writebuffered(c)) { 99910731f83SArtem Bityutskiy int end, rem; 100010731f83SArtem Bityutskiy 100110731f83SArtem Bityutskiy /* 100210731f83SArtem Bityutskiy * We are about to read JFFS2_MIN_NODE_HEADER bytes, 100310731f83SArtem Bityutskiy * but this flash has some minimal I/O unit. It is 100410731f83SArtem Bityutskiy * possible that we'll need to read more soon, so read 100510731f83SArtem Bityutskiy * up to the next min. I/O unit, in order not to 100610731f83SArtem Bityutskiy * re-read the same min. I/O unit twice. 100710731f83SArtem Bityutskiy */ 100810731f83SArtem Bityutskiy end = ref_offset(ref) + len; 100910731f83SArtem Bityutskiy rem = end % c->wbuf_pagesize; 101010731f83SArtem Bityutskiy if (rem) 101110731f83SArtem Bityutskiy end += c->wbuf_pagesize - rem; 101210731f83SArtem Bityutskiy len = end - ref_offset(ref); 10131e0da3cbSArtem B. Bityutskiy } 10141e0da3cbSArtem B. Bityutskiy 1015733802d9SArtem B. Bityutskiy dbg_readinode("read %d bytes at %#08x(%d).\n", len, ref_offset(ref), ref_flags(ref)); 10161e0da3cbSArtem B. Bityutskiy 1017f97117d1SArtem B. Bityutskiy /* FIXME: point() */ 101810731f83SArtem Bityutskiy err = jffs2_flash_read(c, ref_offset(ref), len, &retlen, buf); 1019f97117d1SArtem B. Bityutskiy if (err) { 10201e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, " "error code: %d.\n", len, ref_offset(ref), err); 1021f97117d1SArtem B. Bityutskiy goto free_out; 1022f97117d1SArtem B. Bityutskiy } 1023f97117d1SArtem B. Bityutskiy 10241e0da3cbSArtem B. Bityutskiy if (retlen < len) { 1025fb6a82c9SRandy Dunlap JFFS2_ERROR("short read at %#08x: %zu instead of %d.\n", ref_offset(ref), retlen, len); 1026f97117d1SArtem B. Bityutskiy err = -EIO; 1027f97117d1SArtem B. Bityutskiy goto free_out; 1028f97117d1SArtem B. Bityutskiy } 1029f97117d1SArtem B. Bityutskiy 103010731f83SArtem Bityutskiy node = (union jffs2_node_union *)buf; 10311e0da3cbSArtem B. Bityutskiy 10323877f0b6SDavid Woodhouse /* No need to mask in the valid bit; it shouldn't be invalid */ 10333877f0b6SDavid Woodhouse if (je32_to_cpu(node->u.hdr_crc) != crc32(0, node, sizeof(node->u)-4)) { 10343877f0b6SDavid Woodhouse JFFS2_NOTICE("Node header CRC failed at %#08x. {%04x,%04x,%08x,%08x}\n", 10353877f0b6SDavid Woodhouse ref_offset(ref), je16_to_cpu(node->u.magic), 10363877f0b6SDavid Woodhouse je16_to_cpu(node->u.nodetype), 10373877f0b6SDavid Woodhouse je32_to_cpu(node->u.totlen), 10383877f0b6SDavid Woodhouse je32_to_cpu(node->u.hdr_crc)); 10393877f0b6SDavid Woodhouse jffs2_dbg_dump_node(c, ref_offset(ref)); 10403877f0b6SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 10413877f0b6SDavid Woodhouse goto cont; 10423877f0b6SDavid Woodhouse } 10430dec4c8bSJoakim Tjernlund if (je16_to_cpu(node->u.magic) != JFFS2_MAGIC_BITMASK) { 10440dec4c8bSJoakim Tjernlund /* Not a JFFS2 node, whinge and move on */ 10450dec4c8bSJoakim Tjernlund JFFS2_NOTICE("Wrong magic bitmask 0x%04x in node header at %#08x.\n", 10460dec4c8bSJoakim Tjernlund je16_to_cpu(node->u.magic), ref_offset(ref)); 1047c7258a44SDavid Woodhouse jffs2_mark_node_obsolete(c, ref); 1048c7258a44SDavid Woodhouse goto cont; 1049c7258a44SDavid Woodhouse } 10503877f0b6SDavid Woodhouse 10511e0da3cbSArtem B. Bityutskiy switch (je16_to_cpu(node->u.nodetype)) { 10521e0da3cbSArtem B. Bityutskiy 10531e0da3cbSArtem B. Bityutskiy case JFFS2_NODETYPE_DIRENT: 10541e0da3cbSArtem B. Bityutskiy 1055ea55d307SArtem Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_dirent) && 1056ea55d307SArtem Bityutskiy len < sizeof(struct jffs2_raw_dirent)) { 105710731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_raw_dirent), &len, buf); 10581e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 10591e0da3cbSArtem B. Bityutskiy goto free_out; 10601e0da3cbSArtem B. Bityutskiy } 10611e0da3cbSArtem B. Bityutskiy 1062df8e96f3SDavid Woodhouse err = read_direntry(c, ref, &node->d, retlen, rii); 1063df8e96f3SDavid Woodhouse if (unlikely(err)) 1064f97117d1SArtem B. Bityutskiy goto free_out; 1065f97117d1SArtem B. Bityutskiy 1066f97117d1SArtem B. Bityutskiy break; 1067f97117d1SArtem B. Bityutskiy 1068f97117d1SArtem B. Bityutskiy case JFFS2_NODETYPE_INODE: 1069f97117d1SArtem B. Bityutskiy 1070ea55d307SArtem Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_raw_inode) && 1071ea55d307SArtem Bityutskiy len < sizeof(struct jffs2_raw_inode)) { 107210731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_raw_inode), &len, buf); 10731e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 1074f97117d1SArtem B. Bityutskiy goto free_out; 1075f97117d1SArtem B. Bityutskiy } 1076f97117d1SArtem B. Bityutskiy 1077df8e96f3SDavid Woodhouse err = read_dnode(c, ref, &node->i, len, rii); 1078df8e96f3SDavid Woodhouse if (unlikely(err)) 1079f97117d1SArtem B. Bityutskiy goto free_out; 1080f97117d1SArtem B. Bityutskiy 10811da177e4SLinus Torvalds break; 10821da177e4SLinus Torvalds 10831da177e4SLinus Torvalds default: 1084ea55d307SArtem Bityutskiy if (JFFS2_MIN_NODE_HEADER < sizeof(struct jffs2_unknown_node) && 1085ea55d307SArtem Bityutskiy len < sizeof(struct jffs2_unknown_node)) { 108610731f83SArtem Bityutskiy err = read_more(c, ref, sizeof(struct jffs2_unknown_node), &len, buf); 10871e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 10881e0da3cbSArtem B. Bityutskiy goto free_out; 10891da177e4SLinus Torvalds } 10901da177e4SLinus Torvalds 10911e0da3cbSArtem B. Bityutskiy err = read_unknown(c, ref, &node->u); 109214c6381eSDavid Woodhouse if (unlikely(err)) 1093f97117d1SArtem B. Bityutskiy goto free_out; 1094f97117d1SArtem B. Bityutskiy 10951da177e4SLinus Torvalds } 10963877f0b6SDavid Woodhouse cont: 1097f97117d1SArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 10981da177e4SLinus Torvalds } 10991e0da3cbSArtem B. Bityutskiy 1100f97117d1SArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 11011e0da3cbSArtem B. Bityutskiy kfree(buf); 1102f97117d1SArtem B. Bityutskiy 1103df8e96f3SDavid Woodhouse f->highest_version = rii->highest_version; 1104df8e96f3SDavid Woodhouse 1105733802d9SArtem B. Bityutskiy dbg_readinode("nodes of inode #%u were read, the highest version is %u, latest_mctime %u, mctime_ver %u.\n", 1106df8e96f3SDavid Woodhouse f->inocache->ino, rii->highest_version, rii->latest_mctime, 1107df8e96f3SDavid Woodhouse rii->mctime_ver); 1108f97117d1SArtem B. Bityutskiy return 0; 1109f97117d1SArtem B. Bityutskiy 1110f97117d1SArtem B. Bityutskiy free_out: 1111df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info_list(&rii->tn_root); 1112df8e96f3SDavid Woodhouse jffs2_free_full_dirent_list(rii->fds); 1113df8e96f3SDavid Woodhouse rii->fds = NULL; 11141e0da3cbSArtem B. Bityutskiy kfree(buf); 1115f97117d1SArtem B. Bityutskiy return err; 11161da177e4SLinus Torvalds } 11171da177e4SLinus Torvalds 11181da177e4SLinus Torvalds static int jffs2_do_read_inode_internal(struct jffs2_sb_info *c, 11191da177e4SLinus Torvalds struct jffs2_inode_info *f, 11201da177e4SLinus Torvalds struct jffs2_raw_inode *latest_node) 11211da177e4SLinus Torvalds { 1122df8e96f3SDavid Woodhouse struct jffs2_readinode_info rii; 112361c4b237SDavid Woodhouse uint32_t crc, new_size; 11241da177e4SLinus Torvalds size_t retlen; 11251da177e4SLinus Torvalds int ret; 11261da177e4SLinus Torvalds 112727c72b04SDavid Woodhouse dbg_readinode("ino #%u pino/nlink is %d\n", f->inocache->ino, 112827c72b04SDavid Woodhouse f->inocache->pino_nlink); 11291da177e4SLinus Torvalds 1130df8e96f3SDavid Woodhouse memset(&rii, 0, sizeof(rii)); 1131df8e96f3SDavid Woodhouse 11321da177e4SLinus Torvalds /* Grab all nodes relevant to this ino */ 1133df8e96f3SDavid Woodhouse ret = jffs2_get_inode_nodes(c, f, &rii); 11341da177e4SLinus Torvalds 11351da177e4SLinus Torvalds if (ret) { 1136e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot read nodes for ino %u, returned error is %d\n", f->inocache->ino, ret); 11371da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 11381da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 11391da177e4SLinus Torvalds return ret; 11401da177e4SLinus Torvalds } 11411da177e4SLinus Torvalds 1142df8e96f3SDavid Woodhouse ret = jffs2_build_inode_fragtree(c, f, &rii); 11431e0da3cbSArtem B. Bityutskiy if (ret) { 1144df8e96f3SDavid Woodhouse JFFS2_ERROR("Failed to build final fragtree for inode #%u: error %d\n", 1145df8e96f3SDavid Woodhouse f->inocache->ino, ret); 1146df8e96f3SDavid Woodhouse if (f->inocache->state == INO_STATE_READING) 1147df8e96f3SDavid Woodhouse jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 1148df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info_list(&rii.tn_root); 1149df8e96f3SDavid Woodhouse /* FIXME: We could at least crc-check them all */ 1150df8e96f3SDavid Woodhouse if (rii.mdata_tn) { 1151df8e96f3SDavid Woodhouse jffs2_free_full_dnode(rii.mdata_tn->fn); 1152df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(rii.mdata_tn); 1153df8e96f3SDavid Woodhouse rii.mdata_tn = NULL; 11541e0da3cbSArtem B. Bityutskiy } 1155df8e96f3SDavid Woodhouse return ret; 11561da177e4SLinus Torvalds } 1157df8e96f3SDavid Woodhouse 1158df8e96f3SDavid Woodhouse if (rii.mdata_tn) { 1159df8e96f3SDavid Woodhouse if (rii.mdata_tn->fn->raw == rii.latest_ref) { 1160df8e96f3SDavid Woodhouse f->metadata = rii.mdata_tn->fn; 1161df8e96f3SDavid Woodhouse jffs2_free_tmp_dnode_info(rii.mdata_tn); 1162df8e96f3SDavid Woodhouse } else { 1163df8e96f3SDavid Woodhouse jffs2_kill_tn(c, rii.mdata_tn); 1164df8e96f3SDavid Woodhouse } 1165df8e96f3SDavid Woodhouse rii.mdata_tn = NULL; 1166df8e96f3SDavid Woodhouse } 1167df8e96f3SDavid Woodhouse 1168df8e96f3SDavid Woodhouse f->dents = rii.fds; 1169df8e96f3SDavid Woodhouse 1170e0c8e42fSArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 11711da177e4SLinus Torvalds 1172df8e96f3SDavid Woodhouse if (unlikely(!rii.latest_ref)) { 11731da177e4SLinus Torvalds /* No data nodes for this inode. */ 11741da177e4SLinus Torvalds if (f->inocache->ino != 1) { 1175e0d60137SArtem B. Bityutskiy JFFS2_WARNING("no data nodes found for ino #%u\n", f->inocache->ino); 1176df8e96f3SDavid Woodhouse if (!rii.fds) { 11771da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 11781da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 11791da177e4SLinus Torvalds return -EIO; 11801da177e4SLinus Torvalds } 1181e0d60137SArtem B. Bityutskiy JFFS2_NOTICE("but it has children so we fake some modes for it\n"); 11821da177e4SLinus Torvalds } 11831da177e4SLinus Torvalds latest_node->mode = cpu_to_jemode(S_IFDIR|S_IRUGO|S_IWUSR|S_IXUGO); 11841da177e4SLinus Torvalds latest_node->version = cpu_to_je32(0); 11851da177e4SLinus Torvalds latest_node->atime = latest_node->ctime = latest_node->mtime = cpu_to_je32(0); 11861da177e4SLinus Torvalds latest_node->isize = cpu_to_je32(0); 11871da177e4SLinus Torvalds latest_node->gid = cpu_to_je16(0); 11881da177e4SLinus Torvalds latest_node->uid = cpu_to_je16(0); 11891da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 11901da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 11911da177e4SLinus Torvalds return 0; 11921da177e4SLinus Torvalds } 11931da177e4SLinus Torvalds 1194df8e96f3SDavid Woodhouse ret = jffs2_flash_read(c, ref_offset(rii.latest_ref), sizeof(*latest_node), &retlen, (void *)latest_node); 11951da177e4SLinus Torvalds if (ret || retlen != sizeof(*latest_node)) { 1196e0d60137SArtem B. Bityutskiy JFFS2_ERROR("failed to read from flash: error %d, %zd of %zd bytes read\n", 11971da177e4SLinus Torvalds ret, retlen, sizeof(*latest_node)); 11981da177e4SLinus Torvalds /* FIXME: If this fails, there seems to be a memory leak. Find it. */ 1199ced22070SDavid Woodhouse mutex_unlock(&f->sem); 12001da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12011da177e4SLinus Torvalds return ret?ret:-EIO; 12021da177e4SLinus Torvalds } 12031da177e4SLinus Torvalds 12041da177e4SLinus Torvalds crc = crc32(0, latest_node, sizeof(*latest_node)-8); 12051da177e4SLinus Torvalds if (crc != je32_to_cpu(latest_node->node_crc)) { 1206e0d60137SArtem B. Bityutskiy JFFS2_ERROR("CRC failed for read_inode of inode %u at physical location 0x%x\n", 1207df8e96f3SDavid Woodhouse f->inocache->ino, ref_offset(rii.latest_ref)); 1208ced22070SDavid Woodhouse mutex_unlock(&f->sem); 12091da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12101da177e4SLinus Torvalds return -EIO; 12111da177e4SLinus Torvalds } 12121da177e4SLinus Torvalds 12131da177e4SLinus Torvalds switch(jemode_to_cpu(latest_node->mode) & S_IFMT) { 12141da177e4SLinus Torvalds case S_IFDIR: 1215df8e96f3SDavid Woodhouse if (rii.mctime_ver > je32_to_cpu(latest_node->version)) { 12161da177e4SLinus Torvalds /* The times in the latest_node are actually older than 12171da177e4SLinus Torvalds mctime in the latest dirent. Cheat. */ 1218df8e96f3SDavid Woodhouse latest_node->ctime = latest_node->mtime = cpu_to_je32(rii.latest_mctime); 12191da177e4SLinus Torvalds } 12201da177e4SLinus Torvalds break; 12211da177e4SLinus Torvalds 12221da177e4SLinus Torvalds 12231da177e4SLinus Torvalds case S_IFREG: 12241da177e4SLinus Torvalds /* If it was a regular file, truncate it to the latest node's isize */ 122561c4b237SDavid Woodhouse new_size = jffs2_truncate_fragtree(c, &f->fragtree, je32_to_cpu(latest_node->isize)); 122661c4b237SDavid Woodhouse if (new_size != je32_to_cpu(latest_node->isize)) { 122761c4b237SDavid Woodhouse JFFS2_WARNING("Truncating ino #%u to %d bytes failed because it only had %d bytes to start with!\n", 122861c4b237SDavid Woodhouse f->inocache->ino, je32_to_cpu(latest_node->isize), new_size); 122961c4b237SDavid Woodhouse latest_node->isize = cpu_to_je32(new_size); 123061c4b237SDavid Woodhouse } 12311da177e4SLinus Torvalds break; 12321da177e4SLinus Torvalds 12331da177e4SLinus Torvalds case S_IFLNK: 12341da177e4SLinus Torvalds /* Hack to work around broken isize in old symlink code. 12351da177e4SLinus Torvalds Remove this when dwmw2 comes to his senses and stops 12361da177e4SLinus Torvalds symlinks from being an entirely gratuitous special 12371da177e4SLinus Torvalds case. */ 12381da177e4SLinus Torvalds if (!je32_to_cpu(latest_node->isize)) 12391da177e4SLinus Torvalds latest_node->isize = latest_node->dsize; 124032f1a95dSArtem B. Bityuckiy 124132f1a95dSArtem B. Bityuckiy if (f->inocache->state != INO_STATE_CHECKING) { 124232f1a95dSArtem B. Bityuckiy /* Symlink's inode data is the target path. Read it and 12432b79adccSArtem B. Bityutskiy * keep in RAM to facilitate quick follow symlink 12442b79adccSArtem B. Bityutskiy * operation. */ 12452b79adccSArtem B. Bityutskiy f->target = kmalloc(je32_to_cpu(latest_node->csize) + 1, GFP_KERNEL); 12462b79adccSArtem B. Bityutskiy if (!f->target) { 1247e0d60137SArtem B. Bityutskiy JFFS2_ERROR("can't allocate %d bytes of memory for the symlink target path cache\n", je32_to_cpu(latest_node->csize)); 1248ced22070SDavid Woodhouse mutex_unlock(&f->sem); 124932f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 125032f1a95dSArtem B. Bityuckiy return -ENOMEM; 125132f1a95dSArtem B. Bityuckiy } 125232f1a95dSArtem B. Bityuckiy 1253df8e96f3SDavid Woodhouse ret = jffs2_flash_read(c, ref_offset(rii.latest_ref) + sizeof(*latest_node), 12542b79adccSArtem B. Bityutskiy je32_to_cpu(latest_node->csize), &retlen, (char *)f->target); 125532f1a95dSArtem B. Bityuckiy 125632f1a95dSArtem B. Bityuckiy if (ret || retlen != je32_to_cpu(latest_node->csize)) { 125732f1a95dSArtem B. Bityuckiy if (retlen != je32_to_cpu(latest_node->csize)) 125832f1a95dSArtem B. Bityuckiy ret = -EIO; 12592b79adccSArtem B. Bityutskiy kfree(f->target); 12602b79adccSArtem B. Bityutskiy f->target = NULL; 1261ced22070SDavid Woodhouse mutex_unlock(&f->sem); 126232f1a95dSArtem B. Bityuckiy jffs2_do_clear_inode(c, f); 126332f1a95dSArtem B. Bityuckiy return -ret; 126432f1a95dSArtem B. Bityuckiy } 126532f1a95dSArtem B. Bityuckiy 12662b79adccSArtem B. Bityutskiy f->target[je32_to_cpu(latest_node->csize)] = '\0'; 1267733802d9SArtem B. Bityutskiy dbg_readinode("symlink's target '%s' cached\n", f->target); 126832f1a95dSArtem B. Bityuckiy } 126932f1a95dSArtem B. Bityuckiy 12701da177e4SLinus Torvalds /* fall through... */ 12711da177e4SLinus Torvalds 12721da177e4SLinus Torvalds case S_IFBLK: 12731da177e4SLinus Torvalds case S_IFCHR: 12741da177e4SLinus Torvalds /* Certain inode types should have only one data node, and it's 12751da177e4SLinus Torvalds kept as the metadata node */ 12761da177e4SLinus Torvalds if (f->metadata) { 1277e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o had metadata node\n", 12781da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 1279ced22070SDavid Woodhouse mutex_unlock(&f->sem); 12801da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12811da177e4SLinus Torvalds return -EIO; 12821da177e4SLinus Torvalds } 12831da177e4SLinus Torvalds if (!frag_first(&f->fragtree)) { 1284e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0%o has no fragments\n", 12851da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 1286ced22070SDavid Woodhouse mutex_unlock(&f->sem); 12871da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12881da177e4SLinus Torvalds return -EIO; 12891da177e4SLinus Torvalds } 12901da177e4SLinus Torvalds /* ASSERT: f->fraglist != NULL */ 12911da177e4SLinus Torvalds if (frag_next(frag_first(&f->fragtree))) { 1292e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Argh. Special inode #%u with mode 0x%x had more than one node\n", 12931da177e4SLinus Torvalds f->inocache->ino, jemode_to_cpu(latest_node->mode)); 12941da177e4SLinus Torvalds /* FIXME: Deal with it - check crc32, check for duplicate node, check times and discard the older one */ 1295ced22070SDavid Woodhouse mutex_unlock(&f->sem); 12961da177e4SLinus Torvalds jffs2_do_clear_inode(c, f); 12971da177e4SLinus Torvalds return -EIO; 12981da177e4SLinus Torvalds } 12991da177e4SLinus Torvalds /* OK. We're happy */ 13001da177e4SLinus Torvalds f->metadata = frag_first(&f->fragtree)->node; 13011da177e4SLinus Torvalds jffs2_free_node_frag(frag_first(&f->fragtree)); 13021da177e4SLinus Torvalds f->fragtree = RB_ROOT; 13031da177e4SLinus Torvalds break; 13041da177e4SLinus Torvalds } 13051da177e4SLinus Torvalds if (f->inocache->state == INO_STATE_READING) 13061da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_PRESENT); 13071da177e4SLinus Torvalds 13081da177e4SLinus Torvalds return 0; 13091da177e4SLinus Torvalds } 13101da177e4SLinus Torvalds 1311f97117d1SArtem B. Bityutskiy /* Scan the list of all nodes present for this ino, build map of versions, etc. */ 1312f97117d1SArtem B. Bityutskiy int jffs2_do_read_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 1313f97117d1SArtem B. Bityutskiy uint32_t ino, struct jffs2_raw_inode *latest_node) 1314f97117d1SArtem B. Bityutskiy { 1315733802d9SArtem B. Bityutskiy dbg_readinode("read inode #%u\n", ino); 1316f97117d1SArtem B. Bityutskiy 1317f97117d1SArtem B. Bityutskiy retry_inocache: 1318f97117d1SArtem B. Bityutskiy spin_lock(&c->inocache_lock); 1319f97117d1SArtem B. Bityutskiy f->inocache = jffs2_get_ino_cache(c, ino); 1320f97117d1SArtem B. Bityutskiy 1321f97117d1SArtem B. Bityutskiy if (f->inocache) { 1322f97117d1SArtem B. Bityutskiy /* Check its state. We may need to wait before we can use it */ 1323f97117d1SArtem B. Bityutskiy switch(f->inocache->state) { 1324f97117d1SArtem B. Bityutskiy case INO_STATE_UNCHECKED: 1325f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKEDABSENT: 1326f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 1327f97117d1SArtem B. Bityutskiy break; 1328f97117d1SArtem B. Bityutskiy 1329f97117d1SArtem B. Bityutskiy case INO_STATE_CHECKING: 1330f97117d1SArtem B. Bityutskiy case INO_STATE_GC: 1331f97117d1SArtem B. Bityutskiy /* If it's in either of these states, we need 1332f97117d1SArtem B. Bityutskiy to wait for whoever's got it to finish and 1333f97117d1SArtem B. Bityutskiy put it back. */ 1334733802d9SArtem B. Bityutskiy dbg_readinode("waiting for ino #%u in state %d\n", ino, f->inocache->state); 1335f97117d1SArtem B. Bityutskiy sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); 1336f97117d1SArtem B. Bityutskiy goto retry_inocache; 1337f97117d1SArtem B. Bityutskiy 1338f97117d1SArtem B. Bityutskiy case INO_STATE_READING: 1339f97117d1SArtem B. Bityutskiy case INO_STATE_PRESENT: 1340f97117d1SArtem B. Bityutskiy /* Eep. This should never happen. It can 1341f97117d1SArtem B. Bityutskiy happen if Linux calls read_inode() again 1342f97117d1SArtem B. Bityutskiy before clear_inode() has finished though. */ 1343e0d60137SArtem B. Bityutskiy JFFS2_ERROR("Eep. Trying to read_inode #%u when it's already in state %d!\n", ino, f->inocache->state); 1344f97117d1SArtem B. Bityutskiy /* Fail. That's probably better than allowing it to succeed */ 1345f97117d1SArtem B. Bityutskiy f->inocache = NULL; 1346f97117d1SArtem B. Bityutskiy break; 1347f97117d1SArtem B. Bityutskiy 1348f97117d1SArtem B. Bityutskiy default: 1349f97117d1SArtem B. Bityutskiy BUG(); 1350f97117d1SArtem B. Bityutskiy } 1351f97117d1SArtem B. Bityutskiy } 1352f97117d1SArtem B. Bityutskiy spin_unlock(&c->inocache_lock); 1353f97117d1SArtem B. Bityutskiy 1354f97117d1SArtem B. Bityutskiy if (!f->inocache && ino == 1) { 1355f97117d1SArtem B. Bityutskiy /* Special case - no root inode on medium */ 1356f97117d1SArtem B. Bityutskiy f->inocache = jffs2_alloc_inode_cache(); 1357f97117d1SArtem B. Bityutskiy if (!f->inocache) { 1358e0d60137SArtem B. Bityutskiy JFFS2_ERROR("cannot allocate inocache for root inode\n"); 1359f97117d1SArtem B. Bityutskiy return -ENOMEM; 1360f97117d1SArtem B. Bityutskiy } 1361733802d9SArtem B. Bityutskiy dbg_readinode("creating inocache for root inode\n"); 1362f97117d1SArtem B. Bityutskiy memset(f->inocache, 0, sizeof(struct jffs2_inode_cache)); 136327c72b04SDavid Woodhouse f->inocache->ino = f->inocache->pino_nlink = 1; 1364f97117d1SArtem B. Bityutskiy f->inocache->nodes = (struct jffs2_raw_node_ref *)f->inocache; 1365f97117d1SArtem B. Bityutskiy f->inocache->state = INO_STATE_READING; 1366f97117d1SArtem B. Bityutskiy jffs2_add_ino_cache(c, f->inocache); 1367f97117d1SArtem B. Bityutskiy } 1368f97117d1SArtem B. Bityutskiy if (!f->inocache) { 1369e0d60137SArtem B. Bityutskiy JFFS2_ERROR("requestied to read an nonexistent ino %u\n", ino); 1370f97117d1SArtem B. Bityutskiy return -ENOENT; 1371f97117d1SArtem B. Bityutskiy } 1372f97117d1SArtem B. Bityutskiy 1373f97117d1SArtem B. Bityutskiy return jffs2_do_read_inode_internal(c, f, latest_node); 1374f97117d1SArtem B. Bityutskiy } 1375f97117d1SArtem B. Bityutskiy 1376f97117d1SArtem B. Bityutskiy int jffs2_do_crccheck_inode(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic) 1377f97117d1SArtem B. Bityutskiy { 1378f97117d1SArtem B. Bityutskiy struct jffs2_raw_inode n; 13793d375d9eSYan Burman struct jffs2_inode_info *f = kzalloc(sizeof(*f), GFP_KERNEL); 1380f97117d1SArtem B. Bityutskiy int ret; 1381f97117d1SArtem B. Bityutskiy 1382f97117d1SArtem B. Bityutskiy if (!f) 1383f97117d1SArtem B. Bityutskiy return -ENOMEM; 1384f97117d1SArtem B. Bityutskiy 1385ced22070SDavid Woodhouse mutex_init(&f->sem); 1386ced22070SDavid Woodhouse mutex_lock(&f->sem); 1387f97117d1SArtem B. Bityutskiy f->inocache = ic; 1388f97117d1SArtem B. Bityutskiy 1389f97117d1SArtem B. Bityutskiy ret = jffs2_do_read_inode_internal(c, f, &n); 1390f97117d1SArtem B. Bityutskiy if (!ret) { 1391ced22070SDavid Woodhouse mutex_unlock(&f->sem); 1392f97117d1SArtem B. Bityutskiy jffs2_do_clear_inode(c, f); 1393f97117d1SArtem B. Bityutskiy } 1394f97117d1SArtem B. Bityutskiy kfree (f); 1395f97117d1SArtem B. Bityutskiy return ret; 1396f97117d1SArtem B. Bityutskiy } 1397f97117d1SArtem B. Bityutskiy 13981da177e4SLinus Torvalds void jffs2_do_clear_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f) 13991da177e4SLinus Torvalds { 14001da177e4SLinus Torvalds struct jffs2_full_dirent *fd, *fds; 14011da177e4SLinus Torvalds int deleted; 14021da177e4SLinus Torvalds 1403c7afb0f9SKaiGai Kohei jffs2_clear_acl(f); 1404355ed4e1SKaiGai Kohei jffs2_xattr_delete_inode(c, f->inocache); 1405ced22070SDavid Woodhouse mutex_lock(&f->sem); 140627c72b04SDavid Woodhouse deleted = f->inocache && !f->inocache->pino_nlink; 14071da177e4SLinus Torvalds 140867e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) 140967e345d1SDavid Woodhouse jffs2_set_inocache_state(c, f->inocache, INO_STATE_CLEARING); 141067e345d1SDavid Woodhouse 14111da177e4SLinus Torvalds if (f->metadata) { 14121da177e4SLinus Torvalds if (deleted) 14131da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 14141da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 14151da177e4SLinus Torvalds } 14161da177e4SLinus Torvalds 14171da177e4SLinus Torvalds jffs2_kill_fragtree(&f->fragtree, deleted?c:NULL); 14181da177e4SLinus Torvalds 14192b79adccSArtem B. Bityutskiy if (f->target) { 14202b79adccSArtem B. Bityutskiy kfree(f->target); 14212b79adccSArtem B. Bityutskiy f->target = NULL; 142232f1a95dSArtem B. Bityuckiy } 14231da177e4SLinus Torvalds 14242b79adccSArtem B. Bityutskiy fds = f->dents; 14251da177e4SLinus Torvalds while(fds) { 14261da177e4SLinus Torvalds fd = fds; 14271da177e4SLinus Torvalds fds = fd->next; 14281da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 14291da177e4SLinus Torvalds } 14301da177e4SLinus Torvalds 143167e345d1SDavid Woodhouse if (f->inocache && f->inocache->state != INO_STATE_CHECKING) { 14321da177e4SLinus Torvalds jffs2_set_inocache_state(c, f->inocache, INO_STATE_CHECKEDABSENT); 143367e345d1SDavid Woodhouse if (f->inocache->nodes == (void *)f->inocache) 143467e345d1SDavid Woodhouse jffs2_del_ino_cache(c, f->inocache); 143567e345d1SDavid Woodhouse } 14361da177e4SLinus Torvalds 1437ced22070SDavid Woodhouse mutex_unlock(&f->sem); 14381da177e4SLinus Torvalds } 1439