11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 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 * 10182ec4eeSThomas Gleixner * $Id: nodelist.c,v 1.115 2005/11/07 11:14:40 gleixner Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/sched.h> 161da177e4SLinus Torvalds #include <linux/fs.h> 171da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 181da177e4SLinus Torvalds #include <linux/rbtree.h> 191da177e4SLinus Torvalds #include <linux/crc32.h> 201da177e4SLinus Torvalds #include <linux/slab.h> 211da177e4SLinus Torvalds #include <linux/pagemap.h> 221da177e4SLinus Torvalds #include "nodelist.h" 231da177e4SLinus Torvalds 2490a18fabSAdrian Bunk static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, 2590a18fabSAdrian Bunk struct jffs2_node_frag *this); 2690a18fabSAdrian Bunk 271da177e4SLinus Torvalds void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list) 281da177e4SLinus Torvalds { 291da177e4SLinus Torvalds struct jffs2_full_dirent **prev = list; 30e0d60137SArtem B. Bityutskiy 31733802d9SArtem B. Bityutskiy dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino); 321da177e4SLinus Torvalds 331da177e4SLinus Torvalds while ((*prev) && (*prev)->nhash <= new->nhash) { 341da177e4SLinus Torvalds if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { 351da177e4SLinus Torvalds /* Duplicate. Free one */ 361da177e4SLinus Torvalds if (new->version < (*prev)->version) { 37733802d9SArtem B. Bityutskiy dbg_dentlist("Eep! Marking new dirent node is obsolete, old is \"%s\", ino #%u\n", 38e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 391da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, new->raw); 401da177e4SLinus Torvalds jffs2_free_full_dirent(new); 411da177e4SLinus Torvalds } else { 42733802d9SArtem B. Bityutskiy dbg_dentlist("marking old dirent \"%s\", ino #%u bsolete\n", 43e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 441da177e4SLinus Torvalds new->next = (*prev)->next; 451da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, ((*prev)->raw)); 461da177e4SLinus Torvalds jffs2_free_full_dirent(*prev); 471da177e4SLinus Torvalds *prev = new; 481da177e4SLinus Torvalds } 49e0d60137SArtem B. Bityutskiy return; 501da177e4SLinus Torvalds } 511da177e4SLinus Torvalds prev = &((*prev)->next); 521da177e4SLinus Torvalds } 531da177e4SLinus Torvalds new->next = *prev; 541da177e4SLinus Torvalds *prev = new; 551da177e4SLinus Torvalds } 561da177e4SLinus Torvalds 571e900979SArtem B. Bityutskiy void jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) 581e900979SArtem B. Bityutskiy { 591e900979SArtem B. Bityutskiy struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size); 601e900979SArtem B. Bityutskiy 61733802d9SArtem B. Bityutskiy dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size); 621e900979SArtem B. Bityutskiy 631e900979SArtem B. Bityutskiy /* We know frag->ofs <= size. That's what lookup does for us */ 641e900979SArtem B. Bityutskiy if (frag && frag->ofs != size) { 651e0da3cbSArtem B. Bityutskiy if (frag->ofs+frag->size > size) { 661e900979SArtem B. Bityutskiy frag->size = size - frag->ofs; 671e900979SArtem B. Bityutskiy } 681e900979SArtem B. Bityutskiy frag = frag_next(frag); 691e900979SArtem B. Bityutskiy } 701e900979SArtem B. Bityutskiy while (frag && frag->ofs >= size) { 711e900979SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(frag); 721e900979SArtem B. Bityutskiy 731e900979SArtem B. Bityutskiy frag_erase(frag, list); 741e900979SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, frag); 751e900979SArtem B. Bityutskiy frag = next; 761e900979SArtem B. Bityutskiy } 771e0da3cbSArtem B. Bityutskiy 781e0da3cbSArtem B. Bityutskiy if (size == 0) 791e0da3cbSArtem B. Bityutskiy return; 801e0da3cbSArtem B. Bityutskiy 811e0da3cbSArtem B. Bityutskiy /* 821e0da3cbSArtem B. Bityutskiy * If the last fragment starts at the RAM page boundary, it is 831e0da3cbSArtem B. Bityutskiy * REF_PRISTINE irrespective of its size. 841e0da3cbSArtem B. Bityutskiy */ 851e0da3cbSArtem B. Bityutskiy frag = frag_last(list); 86f0507530SArtem B. Bityutskiy if (frag->node && (frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) { 87733802d9SArtem B. Bityutskiy dbg_fragtree2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n", 881e0da3cbSArtem B. Bityutskiy frag->ofs, frag->ofs + frag->size); 891e0da3cbSArtem B. Bityutskiy frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE; 901e0da3cbSArtem B. Bityutskiy } 911e900979SArtem B. Bityutskiy } 921e900979SArtem B. Bityutskiy 9390a18fabSAdrian Bunk static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, 9490a18fabSAdrian Bunk struct jffs2_node_frag *this) 951da177e4SLinus Torvalds { 96f97117d1SArtem B. Bityutskiy if (this->node) { 97f97117d1SArtem B. Bityutskiy this->node->frags--; 98f97117d1SArtem B. Bityutskiy if (!this->node->frags) { 99f97117d1SArtem B. Bityutskiy /* The node has no valid frags left. It's totally obsoleted */ 100733802d9SArtem B. Bityutskiy dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", 101e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); 102f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, this->node->raw); 103f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(this->node); 104f97117d1SArtem B. Bityutskiy } else { 105733802d9SArtem B. Bityutskiy dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", 106e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); 107f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 1081da177e4SLinus Torvalds } 1091da177e4SLinus Torvalds 110f97117d1SArtem B. Bityutskiy } 111f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(this); 1129dee7503SDavid Woodhouse } 1139dee7503SDavid Woodhouse 114f97117d1SArtem B. Bityutskiy static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) 1151da177e4SLinus Torvalds { 116f97117d1SArtem B. Bityutskiy struct rb_node *parent = &base->rb; 117f97117d1SArtem B. Bityutskiy struct rb_node **link = &parent; 1181da177e4SLinus Torvalds 119733802d9SArtem B. Bityutskiy dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); 1209dee7503SDavid Woodhouse 121f97117d1SArtem B. Bityutskiy while (*link) { 122f97117d1SArtem B. Bityutskiy parent = *link; 123f97117d1SArtem B. Bityutskiy base = rb_entry(parent, struct jffs2_node_frag, rb); 124f97117d1SArtem B. Bityutskiy 125f97117d1SArtem B. Bityutskiy if (newfrag->ofs > base->ofs) 126f97117d1SArtem B. Bityutskiy link = &base->rb.rb_right; 127f97117d1SArtem B. Bityutskiy else if (newfrag->ofs < base->ofs) 128f97117d1SArtem B. Bityutskiy link = &base->rb.rb_left; 1299dee7503SDavid Woodhouse else { 130e0d60137SArtem B. Bityutskiy JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); 131dae6227fSArtem B. Bityutskiy BUG(); 132dae6227fSArtem B. Bityutskiy } 133dae6227fSArtem B. Bityutskiy } 134dae6227fSArtem B. Bityutskiy 135f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &base->rb, link); 136dae6227fSArtem B. Bityutskiy } 137dae6227fSArtem B. Bityutskiy 1381e0da3cbSArtem B. Bityutskiy /* 1391e0da3cbSArtem B. Bityutskiy * Allocate and initializes a new fragment. 1401e0da3cbSArtem B. Bityutskiy */ 141858119e1SArjan van de Ven static struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size) 1421e0da3cbSArtem B. Bityutskiy { 1431e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 1441e0da3cbSArtem B. Bityutskiy 1451e0da3cbSArtem B. Bityutskiy newfrag = jffs2_alloc_node_frag(); 1461e0da3cbSArtem B. Bityutskiy if (likely(newfrag)) { 1471e0da3cbSArtem B. Bityutskiy newfrag->ofs = ofs; 1481e0da3cbSArtem B. Bityutskiy newfrag->size = size; 1491e0da3cbSArtem B. Bityutskiy newfrag->node = fn; 1501e0da3cbSArtem B. Bityutskiy } else { 1511e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("cannot allocate a jffs2_node_frag object\n"); 1521e0da3cbSArtem B. Bityutskiy } 1531e0da3cbSArtem B. Bityutskiy 1541e0da3cbSArtem B. Bityutskiy return newfrag; 1551e0da3cbSArtem B. Bityutskiy } 1561e0da3cbSArtem B. Bityutskiy 1571e0da3cbSArtem B. Bityutskiy /* 1581e0da3cbSArtem B. Bityutskiy * Called when there is no overlapping fragment exist. Inserts a hole before the new 1591e0da3cbSArtem B. Bityutskiy * fragment and inserts the new fragment to the fragtree. 1601e0da3cbSArtem B. Bityutskiy */ 1611e0da3cbSArtem B. Bityutskiy static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, 1621e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag, 1631e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *this, uint32_t lastend) 1641e0da3cbSArtem B. Bityutskiy { 1651e0da3cbSArtem B. Bityutskiy if (lastend < newfrag->node->ofs) { 1661e0da3cbSArtem B. Bityutskiy /* put a hole in before the new fragment */ 1671e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *holefrag; 1681e0da3cbSArtem B. Bityutskiy 1691e0da3cbSArtem B. Bityutskiy holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend); 1701e0da3cbSArtem B. Bityutskiy if (unlikely(!holefrag)) { 1711e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 1721e0da3cbSArtem B. Bityutskiy return -ENOMEM; 1731e0da3cbSArtem B. Bityutskiy } 1741e0da3cbSArtem B. Bityutskiy 1751e0da3cbSArtem B. Bityutskiy if (this) { 1761e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 1771e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 1781e0da3cbSArtem B. Bityutskiy So that's where we want to put the hole */ 179733802d9SArtem B. Bityutskiy dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n", 1801e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1811e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); 1821e0da3cbSArtem B. Bityutskiy } else { 183733802d9SArtem B. Bityutskiy dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n", 1841e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1851e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, NULL, &root->rb_node); 1861e0da3cbSArtem B. Bityutskiy } 1871e0da3cbSArtem B. Bityutskiy rb_insert_color(&holefrag->rb, root); 1881e0da3cbSArtem B. Bityutskiy this = holefrag; 1891e0da3cbSArtem B. Bityutskiy } 1901e0da3cbSArtem B. Bityutskiy 1911e0da3cbSArtem B. Bityutskiy if (this) { 1921e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 1931e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 1941e0da3cbSArtem B. Bityutskiy So that's where we want to put new fragment */ 195733802d9SArtem B. Bityutskiy dbg_fragtree2("add the new node at the right\n"); 1961e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 1971e0da3cbSArtem B. Bityutskiy } else { 198733802d9SArtem B. Bityutskiy dbg_fragtree2("insert the new node at the root of the tree\n"); 1991e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, NULL, &root->rb_node); 2001e0da3cbSArtem B. Bityutskiy } 2011e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2021e0da3cbSArtem B. Bityutskiy 2031e0da3cbSArtem B. Bityutskiy return 0; 2041e0da3cbSArtem B. Bityutskiy } 2051e0da3cbSArtem B. Bityutskiy 206f97117d1SArtem B. Bityutskiy /* Doesn't set inode->i_size */ 2071e0da3cbSArtem B. Bityutskiy static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) 2081da177e4SLinus Torvalds { 209f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *this; 210f97117d1SArtem B. Bityutskiy uint32_t lastend; 2111da177e4SLinus Torvalds 212f97117d1SArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 2131e0da3cbSArtem B. Bityutskiy this = jffs2_lookup_node_frag(root, newfrag->node->ofs); 2141da177e4SLinus Torvalds 215f97117d1SArtem B. Bityutskiy if (this) { 216733802d9SArtem B. Bityutskiy dbg_fragtree2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 217e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 218f97117d1SArtem B. Bityutskiy lastend = this->ofs + this->size; 219f97117d1SArtem B. Bityutskiy } else { 220733802d9SArtem B. Bityutskiy dbg_fragtree2("lookup gave no frag\n"); 221f97117d1SArtem B. Bityutskiy lastend = 0; 222f97117d1SArtem B. Bityutskiy } 2231da177e4SLinus Torvalds 2241e0da3cbSArtem B. Bityutskiy /* See if we ran off the end of the fragtree */ 225f97117d1SArtem B. Bityutskiy if (lastend <= newfrag->ofs) { 226f97117d1SArtem B. Bityutskiy /* We did */ 2271da177e4SLinus Torvalds 228f97117d1SArtem B. Bityutskiy /* Check if 'this' node was on the same page as the new node. 229f97117d1SArtem B. Bityutskiy If so, both 'this' and the new node get marked REF_NORMAL so 230f97117d1SArtem B. Bityutskiy the GC can take a look. 2311da177e4SLinus Torvalds */ 232f97117d1SArtem B. Bityutskiy if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { 233f97117d1SArtem B. Bityutskiy if (this->node) 234f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 235f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 2361da177e4SLinus Torvalds } 2371da177e4SLinus Torvalds 2381e0da3cbSArtem B. Bityutskiy return no_overlapping_node(c, root, newfrag, this, lastend); 2391da177e4SLinus Torvalds } 240dae6227fSArtem B. Bityutskiy 2411e0da3cbSArtem B. Bityutskiy if (this->node) 242733802d9SArtem B. Bityutskiy dbg_fragtree2("dealing with frag %u-%u, phys %#08x(%d).\n", 2431e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, 2441e0da3cbSArtem B. Bityutskiy ref_offset(this->node->raw), ref_flags(this->node->raw)); 2451e0da3cbSArtem B. Bityutskiy else 246733802d9SArtem B. Bityutskiy dbg_fragtree2("dealing with hole frag %u-%u.\n", 2471e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size); 248dae6227fSArtem B. Bityutskiy 249f97117d1SArtem B. Bityutskiy /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, 250f97117d1SArtem B. Bityutskiy * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs 251f97117d1SArtem B. Bityutskiy */ 252f97117d1SArtem B. Bityutskiy if (newfrag->ofs > this->ofs) { 253f97117d1SArtem B. Bityutskiy /* This node isn't completely obsoleted. The start of it remains valid */ 2541da177e4SLinus Torvalds 255f97117d1SArtem B. Bityutskiy /* Mark the new node and the partially covered node REF_NORMAL -- let 256f97117d1SArtem B. Bityutskiy the GC take a look at them */ 257f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 258f97117d1SArtem B. Bityutskiy if (this->node) 259f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 2601da177e4SLinus Torvalds 261f97117d1SArtem B. Bityutskiy if (this->ofs + this->size > newfrag->ofs + newfrag->size) { 262f97117d1SArtem B. Bityutskiy /* The new node splits 'this' frag into two */ 2631e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag2; 2641e0da3cbSArtem B. Bityutskiy 265f97117d1SArtem B. Bityutskiy if (this->node) 266733802d9SArtem B. Bityutskiy dbg_fragtree2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", 267e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 268f97117d1SArtem B. Bityutskiy else 269733802d9SArtem B. Bityutskiy dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n", 2708d5df409SArtem B. Bityutskiy this->ofs, this->ofs+this->size); 271dae6227fSArtem B. Bityutskiy 272f97117d1SArtem B. Bityutskiy /* New second frag pointing to this's node */ 2731e0da3cbSArtem B. Bityutskiy newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size, 2741e0da3cbSArtem B. Bityutskiy this->ofs + this->size - newfrag->ofs - newfrag->size); 2751e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag2)) 2761e0da3cbSArtem B. Bityutskiy return -ENOMEM; 277f97117d1SArtem B. Bityutskiy if (this->node) 278f97117d1SArtem B. Bityutskiy this->node->frags++; 279dae6227fSArtem B. Bityutskiy 280f97117d1SArtem B. Bityutskiy /* Adjust size of original 'this' */ 281f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 2821da177e4SLinus Torvalds 283f97117d1SArtem B. Bityutskiy /* Now, we know there's no node with offset 284f97117d1SArtem B. Bityutskiy greater than this->ofs but smaller than 285f97117d1SArtem B. Bityutskiy newfrag2->ofs or newfrag->ofs, for obvious 286f97117d1SArtem B. Bityutskiy reasons. So we can do a tree insert from 287f97117d1SArtem B. Bityutskiy 'this' to insert newfrag, and a tree insert 288f97117d1SArtem B. Bityutskiy from newfrag to insert newfrag2. */ 289f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 2901e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2911da177e4SLinus Torvalds 292f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 2931e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, root); 2941da177e4SLinus Torvalds 2951da177e4SLinus Torvalds return 0; 2961da177e4SLinus Torvalds } 297f97117d1SArtem B. Bityutskiy /* New node just reduces 'this' frag in size, doesn't split it */ 298f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 299f97117d1SArtem B. Bityutskiy 300f97117d1SArtem B. Bityutskiy /* Again, we know it lives down here in the tree */ 301f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 3021e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 303f97117d1SArtem B. Bityutskiy } else { 304f97117d1SArtem B. Bityutskiy /* New frag starts at the same point as 'this' used to. Replace 305f97117d1SArtem B. Bityutskiy it in the tree without doing a delete and insertion */ 306733802d9SArtem B. Bityutskiy dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", 307e0d60137SArtem B. Bityutskiy newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); 308f97117d1SArtem B. Bityutskiy 3091e0da3cbSArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, root); 310f97117d1SArtem B. Bityutskiy 311f97117d1SArtem B. Bityutskiy if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { 312733802d9SArtem B. Bityutskiy dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); 313f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 314f97117d1SArtem B. Bityutskiy } else { 315f97117d1SArtem B. Bityutskiy this->ofs += newfrag->size; 316f97117d1SArtem B. Bityutskiy this->size -= newfrag->size; 317f97117d1SArtem B. Bityutskiy 318f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(this, newfrag); 3191e0da3cbSArtem B. Bityutskiy rb_insert_color(&this->rb, root); 320f97117d1SArtem B. Bityutskiy return 0; 321f97117d1SArtem B. Bityutskiy } 322f97117d1SArtem B. Bityutskiy } 323f97117d1SArtem B. Bityutskiy /* OK, now we have newfrag added in the correct place in the tree, but 324f97117d1SArtem B. Bityutskiy frag_next(newfrag) may be a fragment which is overlapped by it 325f97117d1SArtem B. Bityutskiy */ 326f97117d1SArtem B. Bityutskiy while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { 327f97117d1SArtem B. Bityutskiy /* 'this' frag is obsoleted completely. */ 328733802d9SArtem B. Bityutskiy dbg_fragtree2("obsoleting node frag %p (%x-%x) and removing from tree\n", 329e0d60137SArtem B. Bityutskiy this, this->ofs, this->ofs+this->size); 3301e0da3cbSArtem B. Bityutskiy rb_erase(&this->rb, root); 331f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 332f97117d1SArtem B. Bityutskiy } 333f97117d1SArtem B. Bityutskiy /* Now we're pointing at the first frag which isn't totally obsoleted by 334f97117d1SArtem B. Bityutskiy the new frag */ 335f97117d1SArtem B. Bityutskiy 3361e0da3cbSArtem B. Bityutskiy if (!this || newfrag->ofs + newfrag->size == this->ofs) 337f97117d1SArtem B. Bityutskiy return 0; 3381e0da3cbSArtem B. Bityutskiy 339f97117d1SArtem B. Bityutskiy /* Still some overlap but we don't need to move it in the tree */ 340f97117d1SArtem B. Bityutskiy this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); 341f97117d1SArtem B. Bityutskiy this->ofs = newfrag->ofs + newfrag->size; 342f97117d1SArtem B. Bityutskiy 343f97117d1SArtem B. Bityutskiy /* And mark them REF_NORMAL so the GC takes a look at them */ 344f97117d1SArtem B. Bityutskiy if (this->node) 345f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 346f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 347f97117d1SArtem B. Bityutskiy 348f97117d1SArtem B. Bityutskiy return 0; 349f97117d1SArtem B. Bityutskiy } 350f97117d1SArtem B. Bityutskiy 3511e0da3cbSArtem B. Bityutskiy /* 3521e0da3cbSArtem B. Bityutskiy * Given an inode, probably with existing tree of fragments, add the new node 3531e0da3cbSArtem B. Bityutskiy * to the fragment tree. 354f97117d1SArtem B. Bityutskiy */ 355f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 356f97117d1SArtem B. Bityutskiy { 357f97117d1SArtem B. Bityutskiy int ret; 358f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 359f97117d1SArtem B. Bityutskiy 360f97117d1SArtem B. Bityutskiy if (unlikely(!fn->size)) 361f97117d1SArtem B. Bityutskiy return 0; 362f97117d1SArtem B. Bityutskiy 3631e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn->ofs, fn->size); 364f97117d1SArtem B. Bityutskiy if (unlikely(!newfrag)) 365f97117d1SArtem B. Bityutskiy return -ENOMEM; 3661e0da3cbSArtem B. Bityutskiy newfrag->node->frags = 1; 367f97117d1SArtem B. Bityutskiy 368733802d9SArtem B. Bityutskiy dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", 369e0d60137SArtem B. Bityutskiy fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); 370f97117d1SArtem B. Bityutskiy 371f97117d1SArtem B. Bityutskiy ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); 372f97117d1SArtem B. Bityutskiy if (unlikely(ret)) 373f97117d1SArtem B. Bityutskiy return ret; 374f97117d1SArtem B. Bityutskiy 375f97117d1SArtem B. Bityutskiy /* If we now share a page with other nodes, mark either previous 376f97117d1SArtem B. Bityutskiy or next node REF_NORMAL, as appropriate. */ 377f97117d1SArtem B. Bityutskiy if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { 378f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *prev = frag_prev(newfrag); 379f97117d1SArtem B. Bityutskiy 380f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 381f97117d1SArtem B. Bityutskiy /* If we don't start at zero there's _always_ a previous */ 382f97117d1SArtem B. Bityutskiy if (prev->node) 383f97117d1SArtem B. Bityutskiy mark_ref_normal(prev->node->raw); 384f97117d1SArtem B. Bityutskiy } 385f97117d1SArtem B. Bityutskiy 386f97117d1SArtem B. Bityutskiy if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { 387f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(newfrag); 388f97117d1SArtem B. Bityutskiy 389f97117d1SArtem B. Bityutskiy if (next) { 390f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 391f97117d1SArtem B. Bityutskiy if (next->node) 392f97117d1SArtem B. Bityutskiy mark_ref_normal(next->node->raw); 393f97117d1SArtem B. Bityutskiy } 394f97117d1SArtem B. Bityutskiy } 395f97117d1SArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 3961e0da3cbSArtem B. Bityutskiy 397f97117d1SArtem B. Bityutskiy return 0; 398f97117d1SArtem B. Bityutskiy } 399f97117d1SArtem B. Bityutskiy 4001e0da3cbSArtem B. Bityutskiy /* 4011e0da3cbSArtem B. Bityutskiy * Check the data CRC of the node. 4021e0da3cbSArtem B. Bityutskiy * 4031e0da3cbSArtem B. Bityutskiy * Returns: 0 if the data CRC is correct; 4041e0da3cbSArtem B. Bityutskiy * 1 - if incorrect; 4051e0da3cbSArtem B. Bityutskiy * error code if an error occured. 4061e0da3cbSArtem B. Bityutskiy */ 4071e0da3cbSArtem B. Bityutskiy static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 4081e0da3cbSArtem B. Bityutskiy { 4091e0da3cbSArtem B. Bityutskiy struct jffs2_raw_node_ref *ref = tn->fn->raw; 4101e0da3cbSArtem B. Bityutskiy int err = 0, pointed = 0; 4111e0da3cbSArtem B. Bityutskiy struct jffs2_eraseblock *jeb; 4121e0da3cbSArtem B. Bityutskiy unsigned char *buffer; 4130ef675d4SAtsushi Nemoto uint32_t crc, ofs, len; 4140ef675d4SAtsushi Nemoto size_t retlen; 4151e0da3cbSArtem B. Bityutskiy 4161e0da3cbSArtem B. Bityutskiy BUG_ON(tn->csize == 0); 4171e0da3cbSArtem B. Bityutskiy 418733802d9SArtem B. Bityutskiy if (!jffs2_is_writebuffered(c)) 419733802d9SArtem B. Bityutskiy goto adj_acc; 420733802d9SArtem B. Bityutskiy 4211e0da3cbSArtem B. Bityutskiy /* Calculate how many bytes were already checked */ 4221e0da3cbSArtem B. Bityutskiy ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode); 423733802d9SArtem B. Bityutskiy len = ofs % c->wbuf_pagesize; 424280562b2SArtem B. Bityutskiy if (likely(len)) 4251e0da3cbSArtem B. Bityutskiy len = c->wbuf_pagesize - len; 4261e0da3cbSArtem B. Bityutskiy 4271e0da3cbSArtem B. Bityutskiy if (len >= tn->csize) { 428733802d9SArtem B. Bityutskiy dbg_readinode("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n", 4291e0da3cbSArtem B. Bityutskiy ref_offset(ref), tn->csize, ofs); 4301e0da3cbSArtem B. Bityutskiy goto adj_acc; 4311e0da3cbSArtem B. Bityutskiy } 4321e0da3cbSArtem B. Bityutskiy 4331e0da3cbSArtem B. Bityutskiy ofs += len; 4341e0da3cbSArtem B. Bityutskiy len = tn->csize - len; 4351e0da3cbSArtem B. Bityutskiy 436733802d9SArtem B. Bityutskiy 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", 4371e0da3cbSArtem B. Bityutskiy ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len); 4381e0da3cbSArtem B. Bityutskiy 4391e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 4401e0da3cbSArtem B. Bityutskiy /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(), 4411e0da3cbSArtem B. Bityutskiy * adding and jffs2_flash_read_end() interface. */ 4421e0da3cbSArtem B. Bityutskiy if (c->mtd->point) { 4431e0da3cbSArtem B. Bityutskiy err = c->mtd->point(c->mtd, ofs, len, &retlen, &buffer); 4441e0da3cbSArtem B. Bityutskiy if (!err && retlen < tn->csize) { 445184f5652SAndrew Morton JFFS2_WARNING("MTD point returned len too short: %zu instead of %u.\n", retlen, tn->csize); 4461e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 4471e0da3cbSArtem B. Bityutskiy } else if (err) 4481e0da3cbSArtem B. Bityutskiy JFFS2_WARNING("MTD point failed: error code %d.\n", err); 4491e0da3cbSArtem B. Bityutskiy else 4501e0da3cbSArtem B. Bityutskiy pointed = 1; /* succefully pointed to device */ 4511e0da3cbSArtem B. Bityutskiy } 4521e0da3cbSArtem B. Bityutskiy #endif 4531e0da3cbSArtem B. Bityutskiy 4541e0da3cbSArtem B. Bityutskiy if (!pointed) { 4551e0da3cbSArtem B. Bityutskiy buffer = kmalloc(len, GFP_KERNEL); 4561e0da3cbSArtem B. Bityutskiy if (unlikely(!buffer)) 4571e0da3cbSArtem B. Bityutskiy return -ENOMEM; 4581e0da3cbSArtem B. Bityutskiy 4591e0da3cbSArtem B. Bityutskiy /* TODO: this is very frequent pattern, make it a separate 4601e0da3cbSArtem B. Bityutskiy * routine */ 4611e0da3cbSArtem B. Bityutskiy err = jffs2_flash_read(c, ofs, len, &retlen, buffer); 4621e0da3cbSArtem B. Bityutskiy if (err) { 4631e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err); 4641e0da3cbSArtem B. Bityutskiy goto free_out; 4651e0da3cbSArtem B. Bityutskiy } 4661e0da3cbSArtem B. Bityutskiy 4671e0da3cbSArtem B. Bityutskiy if (retlen != len) { 468184f5652SAndrew Morton JFFS2_ERROR("short read at %#08x: %zd instead of %d.\n", ofs, retlen, len); 4691e0da3cbSArtem B. Bityutskiy err = -EIO; 4701e0da3cbSArtem B. Bityutskiy goto free_out; 4711e0da3cbSArtem B. Bityutskiy } 4721e0da3cbSArtem B. Bityutskiy } 4731e0da3cbSArtem B. Bityutskiy 4741e0da3cbSArtem B. Bityutskiy /* Continue calculating CRC */ 4751e0da3cbSArtem B. Bityutskiy crc = crc32(tn->partial_crc, buffer, len); 4761e0da3cbSArtem B. Bityutskiy if(!pointed) 4771e0da3cbSArtem B. Bityutskiy kfree(buffer); 4781e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 4791e0da3cbSArtem B. Bityutskiy else 4801e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 4811e0da3cbSArtem B. Bityutskiy #endif 4821e0da3cbSArtem B. Bityutskiy 4831e0da3cbSArtem B. Bityutskiy if (crc != tn->data_crc) { 48439243508SArtem B. Bityutskiy JFFS2_NOTICE("wrong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 4851e0da3cbSArtem B. Bityutskiy ofs, tn->data_crc, crc); 4861e0da3cbSArtem B. Bityutskiy return 1; 4871e0da3cbSArtem B. Bityutskiy } 4881e0da3cbSArtem B. Bityutskiy 4891e0da3cbSArtem B. Bityutskiy adj_acc: 4901e0da3cbSArtem B. Bityutskiy jeb = &c->blocks[ref->flash_offset / c->sector_size]; 4911e0da3cbSArtem B. Bityutskiy len = ref_totlen(c, jeb, ref); 4921e0da3cbSArtem B. Bityutskiy 4931e0da3cbSArtem B. Bityutskiy /* 4941e0da3cbSArtem B. Bityutskiy * Mark the node as having been checked and fix the 4951e0da3cbSArtem B. Bityutskiy * accounting accordingly. 4961e0da3cbSArtem B. Bityutskiy */ 4971e0da3cbSArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 4981e0da3cbSArtem B. Bityutskiy jeb->used_size += len; 4991e0da3cbSArtem B. Bityutskiy jeb->unchecked_size -= len; 5001e0da3cbSArtem B. Bityutskiy c->used_size += len; 5011e0da3cbSArtem B. Bityutskiy c->unchecked_size -= len; 5021e0da3cbSArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 5031e0da3cbSArtem B. Bityutskiy 5041e0da3cbSArtem B. Bityutskiy return 0; 5051e0da3cbSArtem B. Bityutskiy 5061e0da3cbSArtem B. Bityutskiy free_out: 5071e0da3cbSArtem B. Bityutskiy if(!pointed) 5081e0da3cbSArtem B. Bityutskiy kfree(buffer); 5091e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 5101e0da3cbSArtem B. Bityutskiy else 5111e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 5121e0da3cbSArtem B. Bityutskiy #endif 5131e0da3cbSArtem B. Bityutskiy return err; 5141e0da3cbSArtem B. Bityutskiy } 5151e0da3cbSArtem B. Bityutskiy 5161e0da3cbSArtem B. Bityutskiy /* 5171e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_add_older_frag_to_fragtree(). 5181e0da3cbSArtem B. Bityutskiy * 5191e0da3cbSArtem B. Bityutskiy * Checks the node if we are in the checking stage. 5201e0da3cbSArtem B. Bityutskiy */ 521858119e1SArjan van de Ven static int check_node(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn) 5221e0da3cbSArtem B. Bityutskiy { 5231e0da3cbSArtem B. Bityutskiy int ret; 5241e0da3cbSArtem B. Bityutskiy 5251e0da3cbSArtem B. Bityutskiy BUG_ON(ref_obsolete(tn->fn->raw)); 5261e0da3cbSArtem B. Bityutskiy 5271e0da3cbSArtem B. Bityutskiy /* We only check the data CRC of unchecked nodes */ 5281e0da3cbSArtem B. Bityutskiy if (ref_flags(tn->fn->raw) != REF_UNCHECKED) 5291e0da3cbSArtem B. Bityutskiy return 0; 5301e0da3cbSArtem B. Bityutskiy 531733802d9SArtem B. Bityutskiy dbg_fragtree2("check node %#04x-%#04x, phys offs %#08x.\n", 53239243508SArtem B. Bityutskiy tn->fn->ofs, tn->fn->ofs + tn->fn->size, ref_offset(tn->fn->raw)); 5331e0da3cbSArtem B. Bityutskiy 5341e0da3cbSArtem B. Bityutskiy ret = check_node_data(c, tn); 5351e0da3cbSArtem B. Bityutskiy if (unlikely(ret < 0)) { 5361e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("check_node_data() returned error: %d.\n", 5371e0da3cbSArtem B. Bityutskiy ret); 5381e0da3cbSArtem B. Bityutskiy } else if (unlikely(ret > 0)) { 539733802d9SArtem B. Bityutskiy dbg_fragtree2("CRC error, mark it obsolete.\n"); 5401e0da3cbSArtem B. Bityutskiy jffs2_mark_node_obsolete(c, tn->fn->raw); 5411e0da3cbSArtem B. Bityutskiy } 5421e0da3cbSArtem B. Bityutskiy 5431e0da3cbSArtem B. Bityutskiy return ret; 5441e0da3cbSArtem B. Bityutskiy } 5451e0da3cbSArtem B. Bityutskiy 5461e0da3cbSArtem B. Bityutskiy /* 5471e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_add_older_frag_to_fragtree(). 5481e0da3cbSArtem B. Bityutskiy * 5491e0da3cbSArtem B. Bityutskiy * Called when the new fragment that is being inserted 5501e0da3cbSArtem B. Bityutskiy * splits a hole fragment. 5511e0da3cbSArtem B. Bityutskiy */ 5521e0da3cbSArtem B. Bityutskiy static int split_hole(struct jffs2_sb_info *c, struct rb_root *root, 5531e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag, struct jffs2_node_frag *hole) 5541e0da3cbSArtem B. Bityutskiy { 555733802d9SArtem B. Bityutskiy dbg_fragtree2("fragment %#04x-%#04x splits the hole %#04x-%#04x\n", 5561e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size, hole->ofs, hole->ofs + hole->size); 5571e0da3cbSArtem B. Bityutskiy 5581e0da3cbSArtem B. Bityutskiy if (hole->ofs == newfrag->ofs) { 5591e0da3cbSArtem B. Bityutskiy /* 5601e0da3cbSArtem B. Bityutskiy * Well, the new fragment actually starts at the same offset as 5611e0da3cbSArtem B. Bityutskiy * the hole. 5621e0da3cbSArtem B. Bityutskiy */ 5631e0da3cbSArtem B. Bityutskiy if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) { 5641e0da3cbSArtem B. Bityutskiy /* 5651e0da3cbSArtem B. Bityutskiy * We replace the overlapped left part of the hole by 5661e0da3cbSArtem B. Bityutskiy * the new node. 5671e0da3cbSArtem B. Bityutskiy */ 5681e0da3cbSArtem B. Bityutskiy 569733802d9SArtem B. Bityutskiy dbg_fragtree2("insert fragment %#04x-%#04x and cut the left part of the hole\n", 5701e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 5711e0da3cbSArtem B. Bityutskiy rb_replace_node(&hole->rb, &newfrag->rb, root); 5721e0da3cbSArtem B. Bityutskiy 5731e0da3cbSArtem B. Bityutskiy hole->ofs += newfrag->size; 5741e0da3cbSArtem B. Bityutskiy hole->size -= newfrag->size; 5751e0da3cbSArtem B. Bityutskiy 5761e0da3cbSArtem B. Bityutskiy /* 5771e0da3cbSArtem B. Bityutskiy * We know that 'hole' should be the right hand 5781e0da3cbSArtem B. Bityutskiy * fragment. 5791e0da3cbSArtem B. Bityutskiy */ 5801e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(hole, newfrag); 5811e0da3cbSArtem B. Bityutskiy rb_insert_color(&hole->rb, root); 5821e0da3cbSArtem B. Bityutskiy } else { 5831e0da3cbSArtem B. Bityutskiy /* 5841e0da3cbSArtem B. Bityutskiy * Ah, the new fragment is of the same size as the hole. 5851e0da3cbSArtem B. Bityutskiy * Relace the hole by it. 5861e0da3cbSArtem B. Bityutskiy */ 587733802d9SArtem B. Bityutskiy dbg_fragtree2("insert fragment %#04x-%#04x and overwrite hole\n", 5881e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 5891e0da3cbSArtem B. Bityutskiy rb_replace_node(&hole->rb, &newfrag->rb, root); 5901e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(hole); 5911e0da3cbSArtem B. Bityutskiy } 5921e0da3cbSArtem B. Bityutskiy } else { 5931e0da3cbSArtem B. Bityutskiy /* The new fragment lefts some hole space at the left */ 5941e0da3cbSArtem B. Bityutskiy 5951e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag * newfrag2 = NULL; 5961e0da3cbSArtem B. Bityutskiy 5971e0da3cbSArtem B. Bityutskiy if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) { 5981e0da3cbSArtem B. Bityutskiy /* The new frag also lefts some space at the right */ 5991e0da3cbSArtem B. Bityutskiy newfrag2 = new_fragment(NULL, newfrag->ofs + 6001e0da3cbSArtem B. Bityutskiy newfrag->size, hole->ofs + hole->size 6011e0da3cbSArtem B. Bityutskiy - newfrag->ofs - newfrag->size); 6021e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag2)) { 6031e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 6041e0da3cbSArtem B. Bityutskiy return -ENOMEM; 6051e0da3cbSArtem B. Bityutskiy } 6061e0da3cbSArtem B. Bityutskiy } 6071e0da3cbSArtem B. Bityutskiy 6081e0da3cbSArtem B. Bityutskiy hole->size = newfrag->ofs - hole->ofs; 609733802d9SArtem B. Bityutskiy dbg_fragtree2("left the hole %#04x-%#04x at the left and inserd fragment %#04x-%#04x\n", 6101e0da3cbSArtem B. Bityutskiy hole->ofs, hole->ofs + hole->size, newfrag->ofs, newfrag->ofs + newfrag->size); 6111e0da3cbSArtem B. Bityutskiy 6121e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, hole); 6131e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 6141e0da3cbSArtem B. Bityutskiy 6151e0da3cbSArtem B. Bityutskiy if (newfrag2) { 616733802d9SArtem B. Bityutskiy dbg_fragtree2("left the hole %#04x-%#04x at the right\n", 6171e0da3cbSArtem B. Bityutskiy newfrag2->ofs, newfrag2->ofs + newfrag2->size); 6181e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 6191e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, root); 6201e0da3cbSArtem B. Bityutskiy } 6211e0da3cbSArtem B. Bityutskiy } 6221e0da3cbSArtem B. Bityutskiy 6231e0da3cbSArtem B. Bityutskiy return 0; 6241e0da3cbSArtem B. Bityutskiy } 6251e0da3cbSArtem B. Bityutskiy 6261e0da3cbSArtem B. Bityutskiy /* 6271e0da3cbSArtem B. Bityutskiy * This function is used when we build inode. It expects the nodes are passed 6281e0da3cbSArtem B. Bityutskiy * in the decreasing version order. The whole point of this is to improve the 6291e0da3cbSArtem B. Bityutskiy * inodes checking on NAND: we check the nodes' data CRC only when they are not 6301e0da3cbSArtem B. Bityutskiy * obsoleted. Previously, add_frag_to_fragtree() function was used and 6311e0da3cbSArtem B. Bityutskiy * nodes were passed to it in the increasing version ordes and CRCs of all 6321e0da3cbSArtem B. Bityutskiy * nodes were checked. 6331e0da3cbSArtem B. Bityutskiy * 6341e0da3cbSArtem B. Bityutskiy * Note: tn->fn->size shouldn't be zero. 6351e0da3cbSArtem B. Bityutskiy * 6361e0da3cbSArtem B. Bityutskiy * Returns 0 if the node was inserted 6371e0da3cbSArtem B. Bityutskiy * 1 if it wasn't inserted (since it is obsolete) 6381e0da3cbSArtem B. Bityutskiy * < 0 an if error occured 6391e0da3cbSArtem B. Bityutskiy */ 6401e0da3cbSArtem B. Bityutskiy int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 6411e0da3cbSArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn) 6421e0da3cbSArtem B. Bityutskiy { 6431e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *this, *newfrag; 6441e0da3cbSArtem B. Bityutskiy uint32_t lastend; 6451e0da3cbSArtem B. Bityutskiy struct jffs2_full_dnode *fn = tn->fn; 6461e0da3cbSArtem B. Bityutskiy struct rb_root *root = &f->fragtree; 6471e0da3cbSArtem B. Bityutskiy uint32_t fn_size = fn->size, fn_ofs = fn->ofs; 6481e0da3cbSArtem B. Bityutskiy int err, checked = 0; 6491e0da3cbSArtem B. Bityutskiy int ref_flag; 6501e0da3cbSArtem B. Bityutskiy 651733802d9SArtem B. Bityutskiy dbg_fragtree("insert fragment %#04x-%#04x, ver %u\n", fn_ofs, fn_ofs + fn_size, tn->version); 6521e0da3cbSArtem B. Bityutskiy 6531e0da3cbSArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 6541e0da3cbSArtem B. Bityutskiy this = jffs2_lookup_node_frag(root, fn_ofs); 6551e0da3cbSArtem B. Bityutskiy if (this) 656733802d9SArtem B. Bityutskiy dbg_fragtree2("'this' found %#04x-%#04x (%s)\n", this->ofs, this->ofs + this->size, this->node ? "data" : "hole"); 6571e0da3cbSArtem B. Bityutskiy 6581e0da3cbSArtem B. Bityutskiy if (this) 6591e0da3cbSArtem B. Bityutskiy lastend = this->ofs + this->size; 6601e0da3cbSArtem B. Bityutskiy else 6611e0da3cbSArtem B. Bityutskiy lastend = 0; 6621e0da3cbSArtem B. Bityutskiy 6631e0da3cbSArtem B. Bityutskiy /* Detect the preliminary type of node */ 6641e0da3cbSArtem B. Bityutskiy if (fn->size >= PAGE_CACHE_SIZE) 6651e0da3cbSArtem B. Bityutskiy ref_flag = REF_PRISTINE; 6661e0da3cbSArtem B. Bityutskiy else 6671e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 6681e0da3cbSArtem B. Bityutskiy 6691e0da3cbSArtem B. Bityutskiy /* See if we ran off the end of the root */ 6701e0da3cbSArtem B. Bityutskiy if (lastend <= fn_ofs) { 6711e0da3cbSArtem B. Bityutskiy /* We did */ 6721e0da3cbSArtem B. Bityutskiy 6731e0da3cbSArtem B. Bityutskiy /* 6741e0da3cbSArtem B. Bityutskiy * We are going to insert the new node into the 6751e0da3cbSArtem B. Bityutskiy * fragment tree, so check it. 6761e0da3cbSArtem B. Bityutskiy */ 6771e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 6781e0da3cbSArtem B. Bityutskiy if (err != 0) 6791e0da3cbSArtem B. Bityutskiy return err; 6801e0da3cbSArtem B. Bityutskiy 6811e0da3cbSArtem B. Bityutskiy fn->frags = 1; 6821e0da3cbSArtem B. Bityutskiy 6831e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 6841e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 6851e0da3cbSArtem B. Bityutskiy return -ENOMEM; 6861e0da3cbSArtem B. Bityutskiy 6871e0da3cbSArtem B. Bityutskiy err = no_overlapping_node(c, root, newfrag, this, lastend); 6881e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) { 6891e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 6901e0da3cbSArtem B. Bityutskiy return err; 6911e0da3cbSArtem B. Bityutskiy } 6921e0da3cbSArtem B. Bityutskiy 6931e0da3cbSArtem B. Bityutskiy goto out_ok; 6941e0da3cbSArtem B. Bityutskiy } 6951e0da3cbSArtem B. Bityutskiy 6961e0da3cbSArtem B. Bityutskiy fn->frags = 0; 6971e0da3cbSArtem B. Bityutskiy 6981e0da3cbSArtem B. Bityutskiy while (1) { 6991e0da3cbSArtem B. Bityutskiy /* 7001e0da3cbSArtem B. Bityutskiy * Here we have: 7011e0da3cbSArtem B. Bityutskiy * fn_ofs < this->ofs + this->size && fn_ofs >= this->ofs. 7021e0da3cbSArtem B. Bityutskiy * 7031e0da3cbSArtem B. Bityutskiy * Remember, 'this' has higher version, any non-hole node 7041e0da3cbSArtem B. Bityutskiy * which is already in the fragtree is newer then the newly 7051e0da3cbSArtem B. Bityutskiy * inserted. 7061e0da3cbSArtem B. Bityutskiy */ 7071e0da3cbSArtem B. Bityutskiy if (!this->node) { 7081e0da3cbSArtem B. Bityutskiy /* 7091e0da3cbSArtem B. Bityutskiy * 'this' is the hole fragment, so at least the 7101e0da3cbSArtem B. Bityutskiy * beginning of the new fragment is valid. 7111e0da3cbSArtem B. Bityutskiy */ 7121e0da3cbSArtem B. Bityutskiy 7131e0da3cbSArtem B. Bityutskiy /* 7141e0da3cbSArtem B. Bityutskiy * We are going to insert the new node into the 7151e0da3cbSArtem B. Bityutskiy * fragment tree, so check it. 7161e0da3cbSArtem B. Bityutskiy */ 7171e0da3cbSArtem B. Bityutskiy if (!checked) { 7181e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 7191e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) 7201e0da3cbSArtem B. Bityutskiy return err; 7211e0da3cbSArtem B. Bityutskiy checked = 1; 7221e0da3cbSArtem B. Bityutskiy } 7231e0da3cbSArtem B. Bityutskiy 7241e0da3cbSArtem B. Bityutskiy if (this->ofs + this->size >= fn_ofs + fn_size) { 7251e0da3cbSArtem B. Bityutskiy /* We split the hole on two parts */ 7261e0da3cbSArtem B. Bityutskiy 7271e0da3cbSArtem B. Bityutskiy fn->frags += 1; 7281e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 7291e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 7301e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7311e0da3cbSArtem B. Bityutskiy 7321e0da3cbSArtem B. Bityutskiy err = split_hole(c, root, newfrag, this); 7331e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 7341e0da3cbSArtem B. Bityutskiy return err; 7351e0da3cbSArtem B. Bityutskiy goto out_ok; 7361e0da3cbSArtem B. Bityutskiy } 7371e0da3cbSArtem B. Bityutskiy 7381e0da3cbSArtem B. Bityutskiy /* 7391e0da3cbSArtem B. Bityutskiy * The beginning of the new fragment is valid since it 7401e0da3cbSArtem B. Bityutskiy * overlaps the hole node. 7411e0da3cbSArtem B. Bityutskiy */ 7421e0da3cbSArtem B. Bityutskiy 7431e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 7441e0da3cbSArtem B. Bityutskiy 7451e0da3cbSArtem B. Bityutskiy fn->frags += 1; 7461e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, 7471e0da3cbSArtem B. Bityutskiy this->ofs + this->size - fn_ofs); 7481e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 7491e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7501e0da3cbSArtem B. Bityutskiy 7511e0da3cbSArtem B. Bityutskiy if (fn_ofs == this->ofs) { 7521e0da3cbSArtem B. Bityutskiy /* 7531e0da3cbSArtem B. Bityutskiy * The new node starts at the same offset as 7541e0da3cbSArtem B. Bityutskiy * the hole and supersieds the hole. 7551e0da3cbSArtem B. Bityutskiy */ 756733802d9SArtem B. Bityutskiy dbg_fragtree2("add the new fragment instead of hole %#04x-%#04x, refcnt %d\n", 7571e0da3cbSArtem B. Bityutskiy fn_ofs, fn_ofs + this->ofs + this->size - fn_ofs, fn->frags); 7581e0da3cbSArtem B. Bityutskiy 7591e0da3cbSArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, root); 7601e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(this); 7611e0da3cbSArtem B. Bityutskiy } else { 7621e0da3cbSArtem B. Bityutskiy /* 7631e0da3cbSArtem B. Bityutskiy * The hole becomes shorter as its right part 7641e0da3cbSArtem B. Bityutskiy * is supersieded by the new fragment. 7651e0da3cbSArtem B. Bityutskiy */ 766733802d9SArtem B. Bityutskiy dbg_fragtree2("reduce size of hole %#04x-%#04x to %#04x-%#04x\n", 7671e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->ofs, this->ofs + this->size - newfrag->size); 7681e0da3cbSArtem B. Bityutskiy 769733802d9SArtem B. Bityutskiy dbg_fragtree2("add new fragment %#04x-%#04x, refcnt %d\n", fn_ofs, 7701e0da3cbSArtem B. Bityutskiy fn_ofs + this->ofs + this->size - fn_ofs, fn->frags); 7711e0da3cbSArtem B. Bityutskiy 7721e0da3cbSArtem B. Bityutskiy this->size -= newfrag->size; 7731e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 7741e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 7751e0da3cbSArtem B. Bityutskiy } 7761e0da3cbSArtem B. Bityutskiy 7771e0da3cbSArtem B. Bityutskiy fn_ofs += newfrag->size; 7781e0da3cbSArtem B. Bityutskiy fn_size -= newfrag->size; 7791e0da3cbSArtem B. Bityutskiy this = rb_entry(rb_next(&newfrag->rb), 7801e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag, rb); 7811e0da3cbSArtem B. Bityutskiy 782733802d9SArtem B. Bityutskiy dbg_fragtree2("switch to the next 'this' fragment: %#04x-%#04x %s\n", 7831e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)"); 7841e0da3cbSArtem B. Bityutskiy } 7851e0da3cbSArtem B. Bityutskiy 7861e0da3cbSArtem B. Bityutskiy /* 7871e0da3cbSArtem B. Bityutskiy * 'This' node is not the hole so it obsoletes the new fragment 7881e0da3cbSArtem B. Bityutskiy * either fully or partially. 7891e0da3cbSArtem B. Bityutskiy */ 7901e0da3cbSArtem B. Bityutskiy if (this->ofs + this->size >= fn_ofs + fn_size) { 7911e0da3cbSArtem B. Bityutskiy /* The new node is obsolete, drop it */ 7921e0da3cbSArtem B. Bityutskiy if (fn->frags == 0) { 793733802d9SArtem B. Bityutskiy dbg_fragtree2("%#04x-%#04x is obsolete, mark it obsolete\n", fn_ofs, fn_ofs + fn_size); 7941e0da3cbSArtem B. Bityutskiy ref_flag = REF_OBSOLETE; 7951e0da3cbSArtem B. Bityutskiy } 7961e0da3cbSArtem B. Bityutskiy goto out_ok; 7971e0da3cbSArtem B. Bityutskiy } else { 7981e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *new_this; 7991e0da3cbSArtem B. Bityutskiy 8001e0da3cbSArtem B. Bityutskiy /* 'This' node obsoletes the beginning of the new node */ 801733802d9SArtem B. Bityutskiy dbg_fragtree2("the beginning %#04x-%#04x is obsolete\n", fn_ofs, this->ofs + this->size); 8021e0da3cbSArtem B. Bityutskiy 8031e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 8041e0da3cbSArtem B. Bityutskiy 8051e0da3cbSArtem B. Bityutskiy fn_size -= this->ofs + this->size - fn_ofs; 8061e0da3cbSArtem B. Bityutskiy fn_ofs = this->ofs + this->size; 807733802d9SArtem B. Bityutskiy dbg_fragtree2("now considering %#04x-%#04x\n", fn_ofs, fn_ofs + fn_size); 8081e0da3cbSArtem B. Bityutskiy 8091e0da3cbSArtem B. Bityutskiy new_this = rb_entry(rb_next(&this->rb), struct jffs2_node_frag, rb); 8101e0da3cbSArtem B. Bityutskiy if (!new_this) { 8111e0da3cbSArtem B. Bityutskiy /* 8121e0da3cbSArtem B. Bityutskiy * There is no next fragment. Add the rest of 8131e0da3cbSArtem B. Bityutskiy * the new node as the right-hand child. 8141e0da3cbSArtem B. Bityutskiy */ 8151e0da3cbSArtem B. Bityutskiy if (!checked) { 8161e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 8171e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) 8181e0da3cbSArtem B. Bityutskiy return err; 8191e0da3cbSArtem B. Bityutskiy checked = 1; 8201e0da3cbSArtem B. Bityutskiy } 8211e0da3cbSArtem B. Bityutskiy 8221e0da3cbSArtem B. Bityutskiy fn->frags += 1; 8231e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 8241e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 8251e0da3cbSArtem B. Bityutskiy return -ENOMEM; 8261e0da3cbSArtem B. Bityutskiy 827733802d9SArtem B. Bityutskiy dbg_fragtree2("there are no more fragments, insert %#04x-%#04x\n", 8281e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 8291e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 8301e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 8311e0da3cbSArtem B. Bityutskiy goto out_ok; 8321e0da3cbSArtem B. Bityutskiy } else { 8331e0da3cbSArtem B. Bityutskiy this = new_this; 834733802d9SArtem B. Bityutskiy dbg_fragtree2("switch to the next 'this' fragment: %#04x-%#04x %s\n", 8351e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)"); 8361e0da3cbSArtem B. Bityutskiy } 8371e0da3cbSArtem B. Bityutskiy } 8381e0da3cbSArtem B. Bityutskiy } 8391e0da3cbSArtem B. Bityutskiy 8401e0da3cbSArtem B. Bityutskiy out_ok: 8411e0da3cbSArtem B. Bityutskiy BUG_ON(fn->size < PAGE_CACHE_SIZE && ref_flag == REF_PRISTINE); 8421e0da3cbSArtem B. Bityutskiy 8431e0da3cbSArtem B. Bityutskiy if (ref_flag == REF_OBSOLETE) { 844733802d9SArtem B. Bityutskiy dbg_fragtree2("the node is obsolete now\n"); 8451e0da3cbSArtem B. Bityutskiy /* jffs2_mark_node_obsolete() will adjust space accounting */ 8461e0da3cbSArtem B. Bityutskiy jffs2_mark_node_obsolete(c, fn->raw); 8471e0da3cbSArtem B. Bityutskiy return 1; 8481e0da3cbSArtem B. Bityutskiy } 8491e0da3cbSArtem B. Bityutskiy 850733802d9SArtem B. Bityutskiy dbg_fragtree2("the node is \"%s\" now\n", ref_flag == REF_NORMAL ? "REF_NORMAL" : "REF_PRISTINE"); 8511e0da3cbSArtem B. Bityutskiy 8521e0da3cbSArtem B. Bityutskiy /* Space accounting was adjusted at check_node_data() */ 8531e0da3cbSArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 8541e0da3cbSArtem B. Bityutskiy fn->raw->flash_offset = ref_offset(fn->raw) | ref_flag; 8551e0da3cbSArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 8561e0da3cbSArtem B. Bityutskiy 8571e0da3cbSArtem B. Bityutskiy return 0; 8581e0da3cbSArtem B. Bityutskiy } 8591da177e4SLinus Torvalds 8601da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) 8611da177e4SLinus Torvalds { 8621da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 8631da177e4SLinus Torvalds ic->state = state; 8641da177e4SLinus Torvalds wake_up(&c->inocache_wq); 8651da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 8661da177e4SLinus Torvalds } 8671da177e4SLinus Torvalds 8681da177e4SLinus Torvalds /* During mount, this needs no locking. During normal operation, its 8691da177e4SLinus Torvalds callers want to do other stuff while still holding the inocache_lock. 8701da177e4SLinus Torvalds Rather than introducing special case get_ino_cache functions or 8711da177e4SLinus Torvalds callbacks, we just let the caller do the locking itself. */ 8721da177e4SLinus Torvalds 8731da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 8741da177e4SLinus Torvalds { 8751da177e4SLinus Torvalds struct jffs2_inode_cache *ret; 8761da177e4SLinus Torvalds 8771da177e4SLinus Torvalds ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; 8781da177e4SLinus Torvalds while (ret && ret->ino < ino) { 8791da177e4SLinus Torvalds ret = ret->next; 8801da177e4SLinus Torvalds } 8811da177e4SLinus Torvalds 8821da177e4SLinus Torvalds if (ret && ret->ino != ino) 8831da177e4SLinus Torvalds ret = NULL; 8841da177e4SLinus Torvalds 8851da177e4SLinus Torvalds return ret; 8861da177e4SLinus Torvalds } 8871da177e4SLinus Torvalds 8881da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) 8891da177e4SLinus Torvalds { 8901da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 8917d27c814SThomas Gleixner 8921da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 8937d200960SDavid Woodhouse if (!new->ino) 8947d200960SDavid Woodhouse new->ino = ++c->highest_ino; 8957d200960SDavid Woodhouse 896733802d9SArtem B. Bityutskiy dbg_inocache("add %p (ino #%u)\n", new, new->ino); 8971da177e4SLinus Torvalds 8981da177e4SLinus Torvalds prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; 8991da177e4SLinus Torvalds 9001da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < new->ino) { 9011da177e4SLinus Torvalds prev = &(*prev)->next; 9021da177e4SLinus Torvalds } 9031da177e4SLinus Torvalds new->next = *prev; 9041da177e4SLinus Torvalds *prev = new; 9051da177e4SLinus Torvalds 9061da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 9071da177e4SLinus Torvalds } 9081da177e4SLinus Torvalds 9091da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) 9101da177e4SLinus Torvalds { 9111da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 912e0d60137SArtem B. Bityutskiy 913355ed4e1SKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 914355ed4e1SKaiGai Kohei BUG_ON(old->xref); 915355ed4e1SKaiGai Kohei #endif 916733802d9SArtem B. Bityutskiy dbg_inocache("del %p (ino #%u)\n", old, old->ino); 9171da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 9181da177e4SLinus Torvalds 9191da177e4SLinus Torvalds prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; 9201da177e4SLinus Torvalds 9211da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < old->ino) { 9221da177e4SLinus Torvalds prev = &(*prev)->next; 9231da177e4SLinus Torvalds } 9241da177e4SLinus Torvalds if ((*prev) == old) { 9251da177e4SLinus Torvalds *prev = old->next; 9261da177e4SLinus Torvalds } 9271da177e4SLinus Torvalds 92867e345d1SDavid Woodhouse /* Free it now unless it's in READING or CLEARING state, which 92967e345d1SDavid Woodhouse are the transitions upon read_inode() and clear_inode(). The 93067e345d1SDavid Woodhouse rest of the time we know nobody else is looking at it, and 93167e345d1SDavid Woodhouse if it's held by read_inode() or clear_inode() they'll free it 93267e345d1SDavid Woodhouse for themselves. */ 93367e345d1SDavid Woodhouse if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) 93467e345d1SDavid Woodhouse jffs2_free_inode_cache(old); 93567e345d1SDavid Woodhouse 9361da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 9371da177e4SLinus Torvalds } 9381da177e4SLinus Torvalds 9391da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c) 9401da177e4SLinus Torvalds { 9411da177e4SLinus Torvalds int i; 9421da177e4SLinus Torvalds struct jffs2_inode_cache *this, *next; 9431da177e4SLinus Torvalds 9441da177e4SLinus Torvalds for (i=0; i<INOCACHE_HASHSIZE; i++) { 9451da177e4SLinus Torvalds this = c->inocache_list[i]; 9461da177e4SLinus Torvalds while (this) { 9471da177e4SLinus Torvalds next = this->next; 948aa98d7cfSKaiGai Kohei jffs2_xattr_free_inode(c, this); 9491da177e4SLinus Torvalds jffs2_free_inode_cache(this); 9501da177e4SLinus Torvalds this = next; 9511da177e4SLinus Torvalds } 9521da177e4SLinus Torvalds c->inocache_list[i] = NULL; 9531da177e4SLinus Torvalds } 9541da177e4SLinus Torvalds } 9551da177e4SLinus Torvalds 9561da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) 9571da177e4SLinus Torvalds { 9581da177e4SLinus Torvalds int i; 9591da177e4SLinus Torvalds struct jffs2_raw_node_ref *this, *next; 9601da177e4SLinus Torvalds 9611da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 9621da177e4SLinus Torvalds this = c->blocks[i].first_node; 9631da177e4SLinus Torvalds while (this) { 9649bfeb691SDavid Woodhouse if (this[REFS_PER_BLOCK].flash_offset == REF_LINK_NODE) 9659bfeb691SDavid Woodhouse next = this[REFS_PER_BLOCK].next_in_ino; 9669bfeb691SDavid Woodhouse else 9679bfeb691SDavid Woodhouse next = NULL; 9689bfeb691SDavid Woodhouse 9699bfeb691SDavid Woodhouse jffs2_free_refblock(this); 9701da177e4SLinus Torvalds this = next; 9711da177e4SLinus Torvalds } 9721da177e4SLinus Torvalds c->blocks[i].first_node = c->blocks[i].last_node = NULL; 9731da177e4SLinus Torvalds } 9741da177e4SLinus Torvalds } 9751da177e4SLinus Torvalds 9761da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) 9771da177e4SLinus Torvalds { 9781da177e4SLinus Torvalds /* The common case in lookup is that there will be a node 9791da177e4SLinus Torvalds which precisely matches. So we go looking for that first */ 9801da177e4SLinus Torvalds struct rb_node *next; 9811da177e4SLinus Torvalds struct jffs2_node_frag *prev = NULL; 9821da177e4SLinus Torvalds struct jffs2_node_frag *frag = NULL; 9831da177e4SLinus Torvalds 984733802d9SArtem B. Bityutskiy dbg_fragtree2("root %p, offset %d\n", fragtree, offset); 9851da177e4SLinus Torvalds 9861da177e4SLinus Torvalds next = fragtree->rb_node; 9871da177e4SLinus Torvalds 9881da177e4SLinus Torvalds while(next) { 9891da177e4SLinus Torvalds frag = rb_entry(next, struct jffs2_node_frag, rb); 9901da177e4SLinus Torvalds 9911da177e4SLinus Torvalds if (frag->ofs + frag->size <= offset) { 9921da177e4SLinus Torvalds /* Remember the closest smaller match on the way down */ 9931da177e4SLinus Torvalds if (!prev || frag->ofs > prev->ofs) 9941da177e4SLinus Torvalds prev = frag; 9951da177e4SLinus Torvalds next = frag->rb.rb_right; 9961da177e4SLinus Torvalds } else if (frag->ofs > offset) { 9971da177e4SLinus Torvalds next = frag->rb.rb_left; 9981da177e4SLinus Torvalds } else { 9991da177e4SLinus Torvalds return frag; 10001da177e4SLinus Torvalds } 10011da177e4SLinus Torvalds } 10021da177e4SLinus Torvalds 10031da177e4SLinus Torvalds /* Exact match not found. Go back up looking at each parent, 10041da177e4SLinus Torvalds and return the closest smaller one */ 10051da177e4SLinus Torvalds 10061da177e4SLinus Torvalds if (prev) 1007733802d9SArtem B. Bityutskiy dbg_fragtree2("no match. Returning frag %#04x-%#04x, closest previous\n", 1008e0d60137SArtem B. Bityutskiy prev->ofs, prev->ofs+prev->size); 10091da177e4SLinus Torvalds else 1010733802d9SArtem B. Bityutskiy dbg_fragtree2("returning NULL, empty fragtree\n"); 10111da177e4SLinus Torvalds 10121da177e4SLinus Torvalds return prev; 10131da177e4SLinus Torvalds } 10141da177e4SLinus Torvalds 10151da177e4SLinus Torvalds /* Pass 'c' argument to indicate that nodes should be marked obsolete as 10161da177e4SLinus Torvalds they're killed. */ 10171da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) 10181da177e4SLinus Torvalds { 10191da177e4SLinus Torvalds struct jffs2_node_frag *frag; 10201da177e4SLinus Torvalds struct jffs2_node_frag *parent; 10211da177e4SLinus Torvalds 10221da177e4SLinus Torvalds if (!root->rb_node) 10231da177e4SLinus Torvalds return; 10241da177e4SLinus Torvalds 1025733802d9SArtem B. Bityutskiy dbg_fragtree("killing\n"); 10261da177e4SLinus Torvalds 1027e0d60137SArtem B. Bityutskiy frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); 10281da177e4SLinus Torvalds while(frag) { 10291da177e4SLinus Torvalds if (frag->rb.rb_left) { 10301da177e4SLinus Torvalds frag = frag_left(frag); 10311da177e4SLinus Torvalds continue; 10321da177e4SLinus Torvalds } 10331da177e4SLinus Torvalds if (frag->rb.rb_right) { 10341da177e4SLinus Torvalds frag = frag_right(frag); 10351da177e4SLinus Torvalds continue; 10361da177e4SLinus Torvalds } 10371da177e4SLinus Torvalds 10381da177e4SLinus Torvalds if (frag->node && !(--frag->node->frags)) { 10391da177e4SLinus Torvalds /* Not a hole, and it's the final remaining frag 10401da177e4SLinus Torvalds of this node. Free the node */ 10411da177e4SLinus Torvalds if (c) 10421da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, frag->node->raw); 10431da177e4SLinus Torvalds 10441da177e4SLinus Torvalds jffs2_free_full_dnode(frag->node); 10451da177e4SLinus Torvalds } 10461da177e4SLinus Torvalds parent = frag_parent(frag); 10471da177e4SLinus Torvalds if (parent) { 10481da177e4SLinus Torvalds if (frag_left(parent) == frag) 10491da177e4SLinus Torvalds parent->rb.rb_left = NULL; 10501da177e4SLinus Torvalds else 10511da177e4SLinus Torvalds parent->rb.rb_right = NULL; 10521da177e4SLinus Torvalds } 10531da177e4SLinus Torvalds 10541da177e4SLinus Torvalds jffs2_free_node_frag(frag); 10551da177e4SLinus Torvalds frag = parent; 10561da177e4SLinus Torvalds 10571da177e4SLinus Torvalds cond_resched(); 10581da177e4SLinus Torvalds } 10591da177e4SLinus Torvalds } 1060f1f9671bSDavid Woodhouse 10612f785402SDavid Woodhouse struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c, 10622f785402SDavid Woodhouse struct jffs2_eraseblock *jeb, 10632f785402SDavid Woodhouse uint32_t ofs, uint32_t len, 1064fcb75787SDavid Woodhouse struct jffs2_inode_cache *ic) 1065f1f9671bSDavid Woodhouse { 10662f785402SDavid Woodhouse struct jffs2_raw_node_ref *ref; 10672f785402SDavid Woodhouse 10689bfeb691SDavid Woodhouse BUG_ON(!jeb->allocated_refs); 10699bfeb691SDavid Woodhouse jeb->allocated_refs--; 10709bfeb691SDavid Woodhouse 10719bfeb691SDavid Woodhouse ref = jeb->last_node; 10729bfeb691SDavid Woodhouse 10739bfeb691SDavid Woodhouse dbg_noderef("Last node at %p is (%08x,%p)\n", ref, ref->flash_offset, 10749bfeb691SDavid Woodhouse ref->next_in_ino); 10759bfeb691SDavid Woodhouse 10769bfeb691SDavid Woodhouse while (ref->flash_offset != REF_EMPTY_NODE) { 10779bfeb691SDavid Woodhouse if (ref->flash_offset == REF_LINK_NODE) 10789bfeb691SDavid Woodhouse ref = ref->next_in_ino; 10799bfeb691SDavid Woodhouse else 10809bfeb691SDavid Woodhouse ref++; 10812f785402SDavid Woodhouse } 10822f785402SDavid Woodhouse 10839bfeb691SDavid Woodhouse dbg_noderef("New ref is %p (%08x becomes %08x,%p) len 0x%x\n", ref, 10849bfeb691SDavid Woodhouse ref->flash_offset, ofs, ref->next_in_ino, len); 10859bfeb691SDavid Woodhouse 10862f785402SDavid Woodhouse ref->flash_offset = ofs; 10872f785402SDavid Woodhouse 10889bfeb691SDavid Woodhouse if (!jeb->first_node) { 1089f1f9671bSDavid Woodhouse jeb->first_node = ref; 10909bfeb691SDavid Woodhouse BUG_ON(ref_offset(ref) != jeb->offset); 10919bfeb691SDavid Woodhouse } else if (unlikely(ref_offset(ref) != jeb->offset + c->sector_size - jeb->free_size)) { 10929bfeb691SDavid Woodhouse uint32_t last_len = ref_totlen(c, jeb, jeb->last_node); 10939bfeb691SDavid Woodhouse 10949bfeb691SDavid Woodhouse JFFS2_ERROR("Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n", 10959bfeb691SDavid Woodhouse ref, ref_offset(ref), ref_offset(ref)+len, 10969bfeb691SDavid Woodhouse ref_offset(jeb->last_node), 10979bfeb691SDavid Woodhouse ref_offset(jeb->last_node)+last_len); 10989bfeb691SDavid Woodhouse BUG(); 1099ca89a517SDavid Woodhouse } 1100f1f9671bSDavid Woodhouse jeb->last_node = ref; 1101f1f9671bSDavid Woodhouse 1102fcb75787SDavid Woodhouse if (ic) { 1103fcb75787SDavid Woodhouse ref->next_in_ino = ic->nodes; 1104fcb75787SDavid Woodhouse ic->nodes = ref; 1105fcb75787SDavid Woodhouse } else { 1106fcb75787SDavid Woodhouse ref->next_in_ino = NULL; 1107fcb75787SDavid Woodhouse } 1108fcb75787SDavid Woodhouse 1109f1f9671bSDavid Woodhouse switch(ref_flags(ref)) { 1110f1f9671bSDavid Woodhouse case REF_UNCHECKED: 1111f1f9671bSDavid Woodhouse c->unchecked_size += len; 1112f1f9671bSDavid Woodhouse jeb->unchecked_size += len; 1113f1f9671bSDavid Woodhouse break; 1114f1f9671bSDavid Woodhouse 1115f1f9671bSDavid Woodhouse case REF_NORMAL: 1116f1f9671bSDavid Woodhouse case REF_PRISTINE: 1117f1f9671bSDavid Woodhouse c->used_size += len; 1118f1f9671bSDavid Woodhouse jeb->used_size += len; 1119f1f9671bSDavid Woodhouse break; 1120f1f9671bSDavid Woodhouse 1121f1f9671bSDavid Woodhouse case REF_OBSOLETE: 1122f1f9671bSDavid Woodhouse c->dirty_size += len; 11233b79673cSDavid Woodhouse jeb->dirty_size += len; 1124f1f9671bSDavid Woodhouse break; 1125f1f9671bSDavid Woodhouse } 1126f1f9671bSDavid Woodhouse c->free_size -= len; 1127f1f9671bSDavid Woodhouse jeb->free_size -= len; 1128f1f9671bSDavid Woodhouse 1129ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 1130ca89a517SDavid Woodhouse /* Set (and test) __totlen field... for now */ 1131ca89a517SDavid Woodhouse ref->__totlen = len; 1132ca89a517SDavid Woodhouse ref_totlen(c, jeb, ref); 1133ca89a517SDavid Woodhouse #endif 11342f785402SDavid Woodhouse return ref; 1135f1f9671bSDavid Woodhouse } 113668270995SDavid Woodhouse 11372f785402SDavid Woodhouse /* No locking, no reservation of 'ref'. Do not use on a live file system */ 113868270995SDavid Woodhouse int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 113968270995SDavid Woodhouse uint32_t size) 114068270995SDavid Woodhouse { 1141ca89a517SDavid Woodhouse if (!size) 1142ca89a517SDavid Woodhouse return 0; 11439bfeb691SDavid Woodhouse if (unlikely(size > jeb->free_size)) { 11449bfeb691SDavid Woodhouse printk(KERN_CRIT "Dirty space 0x%x larger then free_size 0x%x (wasted 0x%x)\n", 11459bfeb691SDavid Woodhouse size, jeb->free_size, jeb->wasted_size); 1146ca89a517SDavid Woodhouse BUG(); 1147ca89a517SDavid Woodhouse } 11489bfeb691SDavid Woodhouse /* REF_EMPTY_NODE is !obsolete, so that works OK */ 11492ebf09c2SDavid Woodhouse if (jeb->last_node && ref_obsolete(jeb->last_node)) { 1150ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 1151ca89a517SDavid Woodhouse jeb->last_node->__totlen += size; 1152ca89a517SDavid Woodhouse #endif 115368270995SDavid Woodhouse c->dirty_size += size; 115468270995SDavid Woodhouse c->free_size -= size; 115568270995SDavid Woodhouse jeb->dirty_size += size; 115668270995SDavid Woodhouse jeb->free_size -= size; 1157ca89a517SDavid Woodhouse } else { 11582f785402SDavid Woodhouse uint32_t ofs = jeb->offset + c->sector_size - jeb->free_size; 11592f785402SDavid Woodhouse ofs |= REF_OBSOLETE; 1160ca89a517SDavid Woodhouse 11612f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs, size, NULL); 1162ca89a517SDavid Woodhouse } 116368270995SDavid Woodhouse 116468270995SDavid Woodhouse return 0; 116568270995SDavid Woodhouse } 1166ca89a517SDavid Woodhouse 1167ca89a517SDavid Woodhouse /* Calculate totlen from surrounding nodes or eraseblock */ 1168ca89a517SDavid Woodhouse static inline uint32_t __ref_totlen(struct jffs2_sb_info *c, 1169ca89a517SDavid Woodhouse struct jffs2_eraseblock *jeb, 1170ca89a517SDavid Woodhouse struct jffs2_raw_node_ref *ref) 1171ca89a517SDavid Woodhouse { 1172ca89a517SDavid Woodhouse uint32_t ref_end; 117399988f7bSDavid Woodhouse struct jffs2_raw_node_ref *next_ref = ref_next(ref); 1174ca89a517SDavid Woodhouse 117599988f7bSDavid Woodhouse if (next_ref) 117699988f7bSDavid Woodhouse ref_end = ref_offset(next_ref); 1177ca89a517SDavid Woodhouse else { 1178ca89a517SDavid Woodhouse if (!jeb) 1179ca89a517SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 1180ca89a517SDavid Woodhouse 1181ca89a517SDavid Woodhouse /* Last node in block. Use free_space */ 11829bfeb691SDavid Woodhouse if (unlikely(ref != jeb->last_node)) { 1183ca89a517SDavid Woodhouse printk(KERN_CRIT "ref %p @0x%08x is not jeb->last_node (%p @0x%08x)\n", 1184ca89a517SDavid Woodhouse ref, ref_offset(ref), jeb->last_node, jeb->last_node?ref_offset(jeb->last_node):0); 1185ca89a517SDavid Woodhouse BUG(); 1186ca89a517SDavid Woodhouse } 1187ca89a517SDavid Woodhouse ref_end = jeb->offset + c->sector_size - jeb->free_size; 1188ca89a517SDavid Woodhouse } 1189ca89a517SDavid Woodhouse return ref_end - ref_offset(ref); 1190ca89a517SDavid Woodhouse } 1191ca89a517SDavid Woodhouse 1192ca89a517SDavid Woodhouse uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 1193ca89a517SDavid Woodhouse struct jffs2_raw_node_ref *ref) 1194ca89a517SDavid Woodhouse { 1195ca89a517SDavid Woodhouse uint32_t ret; 1196ca89a517SDavid Woodhouse 1197ca89a517SDavid Woodhouse ret = __ref_totlen(c, jeb, ref); 11989bfeb691SDavid Woodhouse 1199ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 12009bfeb691SDavid Woodhouse if (unlikely(ret != ref->__totlen)) { 12019bfeb691SDavid Woodhouse if (!jeb) 12029bfeb691SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 12039bfeb691SDavid Woodhouse 1204ca89a517SDavid Woodhouse printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n", 1205ca89a517SDavid Woodhouse ref, ref_offset(ref), ref_offset(ref)+ref->__totlen, 1206ca89a517SDavid Woodhouse ret, ref->__totlen); 120799988f7bSDavid Woodhouse if (ref_next(ref)) { 120899988f7bSDavid Woodhouse printk(KERN_CRIT "next %p (0x%08x-0x%08x)\n", ref_next(ref), ref_offset(ref_next(ref)), 120999988f7bSDavid Woodhouse ref_offset(ref_next(ref))+ref->__totlen); 1210ca89a517SDavid Woodhouse } else 121199988f7bSDavid Woodhouse printk(KERN_CRIT "No next ref. jeb->last_node is %p\n", jeb->last_node); 1212ca89a517SDavid Woodhouse 1213ca89a517SDavid Woodhouse printk(KERN_CRIT "jeb->wasted_size %x, dirty_size %x, used_size %x, free_size %x\n", jeb->wasted_size, jeb->dirty_size, jeb->used_size, jeb->free_size); 12149bfeb691SDavid Woodhouse 1215ca89a517SDavid Woodhouse #if defined(JFFS2_DBG_DUMPS) || defined(JFFS2_DBG_PARANOIA_CHECKS) 1216ca89a517SDavid Woodhouse __jffs2_dbg_dump_node_refs_nolock(c, jeb); 1217ca89a517SDavid Woodhouse #endif 12189bfeb691SDavid Woodhouse 1219ca89a517SDavid Woodhouse WARN_ON(1); 12209bfeb691SDavid Woodhouse 12219bfeb691SDavid Woodhouse ret = ref->__totlen; 1222ca89a517SDavid Woodhouse } 1223ca89a517SDavid Woodhouse #endif /* TEST_TOTLEN */ 1224ca89a517SDavid Woodhouse return ret; 1225ca89a517SDavid Woodhouse } 1226