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> 131da177e4SLinus Torvalds #include <linux/sched.h> 141da177e4SLinus Torvalds #include <linux/fs.h> 151da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 161da177e4SLinus Torvalds #include <linux/rbtree.h> 171da177e4SLinus Torvalds #include <linux/crc32.h> 181da177e4SLinus Torvalds #include <linux/slab.h> 191da177e4SLinus Torvalds #include <linux/pagemap.h> 201da177e4SLinus Torvalds #include "nodelist.h" 211da177e4SLinus Torvalds 2290a18fabSAdrian Bunk static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, 2390a18fabSAdrian Bunk struct jffs2_node_frag *this); 2490a18fabSAdrian Bunk 251da177e4SLinus Torvalds void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list) 261da177e4SLinus Torvalds { 271da177e4SLinus Torvalds struct jffs2_full_dirent **prev = list; 28e0d60137SArtem B. Bityutskiy 29733802d9SArtem B. Bityutskiy dbg_dentlist("add dirent \"%s\", ino #%u\n", new->name, new->ino); 301da177e4SLinus Torvalds 311da177e4SLinus Torvalds while ((*prev) && (*prev)->nhash <= new->nhash) { 321da177e4SLinus Torvalds if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { 331da177e4SLinus Torvalds /* Duplicate. Free one */ 341da177e4SLinus Torvalds if (new->version < (*prev)->version) { 3515953580SDavid Woodhouse dbg_dentlist("Eep! Marking new dirent node obsolete, old is \"%s\", ino #%u\n", 36e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 371da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, new->raw); 381da177e4SLinus Torvalds jffs2_free_full_dirent(new); 391da177e4SLinus Torvalds } else { 4015953580SDavid Woodhouse dbg_dentlist("marking old dirent \"%s\", ino #%u obsolete\n", 41e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 421da177e4SLinus Torvalds new->next = (*prev)->next; 4315953580SDavid Woodhouse /* It may have been a 'placeholder' deletion dirent, 4415953580SDavid Woodhouse if jffs2_can_mark_obsolete() (see jffs2_do_unlink()) */ 4515953580SDavid Woodhouse if ((*prev)->raw) 461da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, ((*prev)->raw)); 471da177e4SLinus Torvalds jffs2_free_full_dirent(*prev); 481da177e4SLinus Torvalds *prev = new; 491da177e4SLinus Torvalds } 50e0d60137SArtem B. Bityutskiy return; 511da177e4SLinus Torvalds } 521da177e4SLinus Torvalds prev = &((*prev)->next); 531da177e4SLinus Torvalds } 541da177e4SLinus Torvalds new->next = *prev; 551da177e4SLinus Torvalds *prev = new; 561da177e4SLinus Torvalds } 571da177e4SLinus Torvalds 5861c4b237SDavid Woodhouse uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) 591e900979SArtem B. Bityutskiy { 601e900979SArtem B. Bityutskiy struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size); 611e900979SArtem B. Bityutskiy 62733802d9SArtem B. Bityutskiy dbg_fragtree("truncating fragtree to 0x%08x bytes\n", size); 631e900979SArtem B. Bityutskiy 641e900979SArtem B. Bityutskiy /* We know frag->ofs <= size. That's what lookup does for us */ 651e900979SArtem B. Bityutskiy if (frag && frag->ofs != size) { 661e0da3cbSArtem B. Bityutskiy if (frag->ofs+frag->size > size) { 671e900979SArtem B. Bityutskiy frag->size = size - frag->ofs; 681e900979SArtem B. Bityutskiy } 691e900979SArtem B. Bityutskiy frag = frag_next(frag); 701e900979SArtem B. Bityutskiy } 711e900979SArtem B. Bityutskiy while (frag && frag->ofs >= size) { 721e900979SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(frag); 731e900979SArtem B. Bityutskiy 741e900979SArtem B. Bityutskiy frag_erase(frag, list); 751e900979SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, frag); 761e900979SArtem B. Bityutskiy frag = next; 771e900979SArtem B. Bityutskiy } 781e0da3cbSArtem B. Bityutskiy 791e0da3cbSArtem B. Bityutskiy if (size == 0) 8061c4b237SDavid Woodhouse return 0; 811e0da3cbSArtem B. Bityutskiy 821e0da3cbSArtem B. Bityutskiy frag = frag_last(list); 8361c4b237SDavid Woodhouse 8461c4b237SDavid Woodhouse /* Sanity check for truncation to longer than we started with... */ 8561c4b237SDavid Woodhouse if (!frag) 8661c4b237SDavid Woodhouse return 0; 8761c4b237SDavid Woodhouse if (frag->ofs + frag->size < size) 8861c4b237SDavid Woodhouse return frag->ofs + frag->size; 8961c4b237SDavid Woodhouse 9061c4b237SDavid Woodhouse /* If the last fragment starts at the RAM page boundary, it is 9161c4b237SDavid Woodhouse * REF_PRISTINE irrespective of its size. */ 92f0507530SArtem B. Bityutskiy if (frag->node && (frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) { 93733802d9SArtem B. Bityutskiy dbg_fragtree2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n", 941e0da3cbSArtem B. Bityutskiy frag->ofs, frag->ofs + frag->size); 951e0da3cbSArtem B. Bityutskiy frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE; 961e0da3cbSArtem B. Bityutskiy } 9761c4b237SDavid Woodhouse return size; 981e900979SArtem B. Bityutskiy } 991e900979SArtem B. Bityutskiy 10090a18fabSAdrian Bunk static void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, 10190a18fabSAdrian Bunk struct jffs2_node_frag *this) 1021da177e4SLinus Torvalds { 103f97117d1SArtem B. Bityutskiy if (this->node) { 104f97117d1SArtem B. Bityutskiy this->node->frags--; 105f97117d1SArtem B. Bityutskiy if (!this->node->frags) { 106f97117d1SArtem B. Bityutskiy /* The node has no valid frags left. It's totally obsoleted */ 107733802d9SArtem B. Bityutskiy dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", 108e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); 109f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, this->node->raw); 110f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(this->node); 111f97117d1SArtem B. Bityutskiy } else { 112733802d9SArtem B. Bityutskiy dbg_fragtree2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", 113e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); 114f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 1151da177e4SLinus Torvalds } 1161da177e4SLinus Torvalds 117f97117d1SArtem B. Bityutskiy } 118f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(this); 1199dee7503SDavid Woodhouse } 1209dee7503SDavid Woodhouse 121f97117d1SArtem B. Bityutskiy static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) 1221da177e4SLinus Torvalds { 123f97117d1SArtem B. Bityutskiy struct rb_node *parent = &base->rb; 124f97117d1SArtem B. Bityutskiy struct rb_node **link = &parent; 1251da177e4SLinus Torvalds 126733802d9SArtem B. Bityutskiy dbg_fragtree2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); 1279dee7503SDavid Woodhouse 128f97117d1SArtem B. Bityutskiy while (*link) { 129f97117d1SArtem B. Bityutskiy parent = *link; 130f97117d1SArtem B. Bityutskiy base = rb_entry(parent, struct jffs2_node_frag, rb); 131f97117d1SArtem B. Bityutskiy 132f97117d1SArtem B. Bityutskiy if (newfrag->ofs > base->ofs) 133f97117d1SArtem B. Bityutskiy link = &base->rb.rb_right; 134f97117d1SArtem B. Bityutskiy else if (newfrag->ofs < base->ofs) 135f97117d1SArtem B. Bityutskiy link = &base->rb.rb_left; 1369dee7503SDavid Woodhouse else { 137e0d60137SArtem B. Bityutskiy JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); 138dae6227fSArtem B. Bityutskiy BUG(); 139dae6227fSArtem B. Bityutskiy } 140dae6227fSArtem B. Bityutskiy } 141dae6227fSArtem B. Bityutskiy 142f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &base->rb, link); 143dae6227fSArtem B. Bityutskiy } 144dae6227fSArtem B. Bityutskiy 1451e0da3cbSArtem B. Bityutskiy /* 1461e0da3cbSArtem B. Bityutskiy * Allocate and initializes a new fragment. 1471e0da3cbSArtem B. Bityutskiy */ 148858119e1SArjan van de Ven static struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size) 1491e0da3cbSArtem B. Bityutskiy { 1501e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 1511e0da3cbSArtem B. Bityutskiy 1521e0da3cbSArtem B. Bityutskiy newfrag = jffs2_alloc_node_frag(); 1531e0da3cbSArtem B. Bityutskiy if (likely(newfrag)) { 1541e0da3cbSArtem B. Bityutskiy newfrag->ofs = ofs; 1551e0da3cbSArtem B. Bityutskiy newfrag->size = size; 1561e0da3cbSArtem B. Bityutskiy newfrag->node = fn; 1571e0da3cbSArtem B. Bityutskiy } else { 1581e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("cannot allocate a jffs2_node_frag object\n"); 1591e0da3cbSArtem B. Bityutskiy } 1601e0da3cbSArtem B. Bityutskiy 1611e0da3cbSArtem B. Bityutskiy return newfrag; 1621e0da3cbSArtem B. Bityutskiy } 1631e0da3cbSArtem B. Bityutskiy 1641e0da3cbSArtem B. Bityutskiy /* 1651e0da3cbSArtem B. Bityutskiy * Called when there is no overlapping fragment exist. Inserts a hole before the new 1661e0da3cbSArtem B. Bityutskiy * fragment and inserts the new fragment to the fragtree. 1671e0da3cbSArtem B. Bityutskiy */ 1681e0da3cbSArtem B. Bityutskiy static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, 1691e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag, 1701e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *this, uint32_t lastend) 1711e0da3cbSArtem B. Bityutskiy { 1721e0da3cbSArtem B. Bityutskiy if (lastend < newfrag->node->ofs) { 1731e0da3cbSArtem B. Bityutskiy /* put a hole in before the new fragment */ 1741e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *holefrag; 1751e0da3cbSArtem B. Bityutskiy 1761e0da3cbSArtem B. Bityutskiy holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend); 1771e0da3cbSArtem B. Bityutskiy if (unlikely(!holefrag)) { 1781e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 1791e0da3cbSArtem B. Bityutskiy return -ENOMEM; 1801e0da3cbSArtem B. Bityutskiy } 1811e0da3cbSArtem B. Bityutskiy 1821e0da3cbSArtem B. Bityutskiy if (this) { 1831e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 1841e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 1851e0da3cbSArtem B. Bityutskiy So that's where we want to put the hole */ 186733802d9SArtem B. Bityutskiy dbg_fragtree2("add hole frag %#04x-%#04x on the right of the new frag.\n", 1871e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1881e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); 1891e0da3cbSArtem B. Bityutskiy } else { 190733802d9SArtem B. Bityutskiy dbg_fragtree2("Add hole frag %#04x-%#04x to the root of the tree.\n", 1911e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1921e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, NULL, &root->rb_node); 1931e0da3cbSArtem B. Bityutskiy } 1941e0da3cbSArtem B. Bityutskiy rb_insert_color(&holefrag->rb, root); 1951e0da3cbSArtem B. Bityutskiy this = holefrag; 1961e0da3cbSArtem B. Bityutskiy } 1971e0da3cbSArtem B. Bityutskiy 1981e0da3cbSArtem B. Bityutskiy if (this) { 1991e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 2001e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 2011e0da3cbSArtem B. Bityutskiy So that's where we want to put new fragment */ 202733802d9SArtem B. Bityutskiy dbg_fragtree2("add the new node at the right\n"); 2031e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 2041e0da3cbSArtem B. Bityutskiy } else { 205733802d9SArtem B. Bityutskiy dbg_fragtree2("insert the new node at the root of the tree\n"); 2061e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, NULL, &root->rb_node); 2071e0da3cbSArtem B. Bityutskiy } 2081e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2091e0da3cbSArtem B. Bityutskiy 2101e0da3cbSArtem B. Bityutskiy return 0; 2111e0da3cbSArtem B. Bityutskiy } 2121e0da3cbSArtem B. Bityutskiy 213f97117d1SArtem B. Bityutskiy /* Doesn't set inode->i_size */ 2141e0da3cbSArtem B. Bityutskiy static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) 2151da177e4SLinus Torvalds { 216f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *this; 217f97117d1SArtem B. Bityutskiy uint32_t lastend; 2181da177e4SLinus Torvalds 219f97117d1SArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 2201e0da3cbSArtem B. Bityutskiy this = jffs2_lookup_node_frag(root, newfrag->node->ofs); 2211da177e4SLinus Torvalds 222f97117d1SArtem B. Bityutskiy if (this) { 223733802d9SArtem B. Bityutskiy dbg_fragtree2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 224e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 225f97117d1SArtem B. Bityutskiy lastend = this->ofs + this->size; 226f97117d1SArtem B. Bityutskiy } else { 227733802d9SArtem B. Bityutskiy dbg_fragtree2("lookup gave no frag\n"); 228f97117d1SArtem B. Bityutskiy lastend = 0; 229f97117d1SArtem B. Bityutskiy } 2301da177e4SLinus Torvalds 2311e0da3cbSArtem B. Bityutskiy /* See if we ran off the end of the fragtree */ 232f97117d1SArtem B. Bityutskiy if (lastend <= newfrag->ofs) { 233f97117d1SArtem B. Bityutskiy /* We did */ 2341da177e4SLinus Torvalds 235f97117d1SArtem B. Bityutskiy /* Check if 'this' node was on the same page as the new node. 236f97117d1SArtem B. Bityutskiy If so, both 'this' and the new node get marked REF_NORMAL so 237f97117d1SArtem B. Bityutskiy the GC can take a look. 2381da177e4SLinus Torvalds */ 239f97117d1SArtem B. Bityutskiy if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { 240f97117d1SArtem B. Bityutskiy if (this->node) 241f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 242f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 2431da177e4SLinus Torvalds } 2441da177e4SLinus Torvalds 2451e0da3cbSArtem B. Bityutskiy return no_overlapping_node(c, root, newfrag, this, lastend); 2461da177e4SLinus Torvalds } 247dae6227fSArtem B. Bityutskiy 2481e0da3cbSArtem B. Bityutskiy if (this->node) 249733802d9SArtem B. Bityutskiy dbg_fragtree2("dealing with frag %u-%u, phys %#08x(%d).\n", 2501e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, 2511e0da3cbSArtem B. Bityutskiy ref_offset(this->node->raw), ref_flags(this->node->raw)); 2521e0da3cbSArtem B. Bityutskiy else 253733802d9SArtem B. Bityutskiy dbg_fragtree2("dealing with hole frag %u-%u.\n", 2541e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size); 255dae6227fSArtem B. Bityutskiy 256f97117d1SArtem B. Bityutskiy /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, 257f97117d1SArtem B. Bityutskiy * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs 258f97117d1SArtem B. Bityutskiy */ 259f97117d1SArtem B. Bityutskiy if (newfrag->ofs > this->ofs) { 260f97117d1SArtem B. Bityutskiy /* This node isn't completely obsoleted. The start of it remains valid */ 2611da177e4SLinus Torvalds 262f97117d1SArtem B. Bityutskiy /* Mark the new node and the partially covered node REF_NORMAL -- let 263f97117d1SArtem B. Bityutskiy the GC take a look at them */ 264f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 265f97117d1SArtem B. Bityutskiy if (this->node) 266f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 2671da177e4SLinus Torvalds 268f97117d1SArtem B. Bityutskiy if (this->ofs + this->size > newfrag->ofs + newfrag->size) { 269f97117d1SArtem B. Bityutskiy /* The new node splits 'this' frag into two */ 2701e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag2; 2711e0da3cbSArtem B. Bityutskiy 272f97117d1SArtem B. Bityutskiy if (this->node) 273733802d9SArtem B. Bityutskiy dbg_fragtree2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", 274e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 275f97117d1SArtem B. Bityutskiy else 276733802d9SArtem B. Bityutskiy dbg_fragtree2("split old hole frag 0x%04x-0x%04x\n", 2778d5df409SArtem B. Bityutskiy this->ofs, this->ofs+this->size); 278dae6227fSArtem B. Bityutskiy 279f97117d1SArtem B. Bityutskiy /* New second frag pointing to this's node */ 2801e0da3cbSArtem B. Bityutskiy newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size, 2811e0da3cbSArtem B. Bityutskiy this->ofs + this->size - newfrag->ofs - newfrag->size); 2821e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag2)) 2831e0da3cbSArtem B. Bityutskiy return -ENOMEM; 284f97117d1SArtem B. Bityutskiy if (this->node) 285f97117d1SArtem B. Bityutskiy this->node->frags++; 286dae6227fSArtem B. Bityutskiy 287f97117d1SArtem B. Bityutskiy /* Adjust size of original 'this' */ 288f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 2891da177e4SLinus Torvalds 290f97117d1SArtem B. Bityutskiy /* Now, we know there's no node with offset 291f97117d1SArtem B. Bityutskiy greater than this->ofs but smaller than 292f97117d1SArtem B. Bityutskiy newfrag2->ofs or newfrag->ofs, for obvious 293f97117d1SArtem B. Bityutskiy reasons. So we can do a tree insert from 294f97117d1SArtem B. Bityutskiy 'this' to insert newfrag, and a tree insert 295f97117d1SArtem B. Bityutskiy from newfrag to insert newfrag2. */ 296f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 2971e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2981da177e4SLinus Torvalds 299f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 3001e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, root); 3011da177e4SLinus Torvalds 3021da177e4SLinus Torvalds return 0; 3031da177e4SLinus Torvalds } 304f97117d1SArtem B. Bityutskiy /* New node just reduces 'this' frag in size, doesn't split it */ 305f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 306f97117d1SArtem B. Bityutskiy 307f97117d1SArtem B. Bityutskiy /* Again, we know it lives down here in the tree */ 308f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 3091e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 310f97117d1SArtem B. Bityutskiy } else { 311f97117d1SArtem B. Bityutskiy /* New frag starts at the same point as 'this' used to. Replace 312f97117d1SArtem B. Bityutskiy it in the tree without doing a delete and insertion */ 313733802d9SArtem B. Bityutskiy dbg_fragtree2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", 314e0d60137SArtem B. Bityutskiy newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); 315f97117d1SArtem B. Bityutskiy 3161e0da3cbSArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, root); 317f97117d1SArtem B. Bityutskiy 318f97117d1SArtem B. Bityutskiy if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { 319733802d9SArtem B. Bityutskiy dbg_fragtree2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); 320f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 321f97117d1SArtem B. Bityutskiy } else { 322f97117d1SArtem B. Bityutskiy this->ofs += newfrag->size; 323f97117d1SArtem B. Bityutskiy this->size -= newfrag->size; 324f97117d1SArtem B. Bityutskiy 325f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(this, newfrag); 3261e0da3cbSArtem B. Bityutskiy rb_insert_color(&this->rb, root); 327f97117d1SArtem B. Bityutskiy return 0; 328f97117d1SArtem B. Bityutskiy } 329f97117d1SArtem B. Bityutskiy } 330f97117d1SArtem B. Bityutskiy /* OK, now we have newfrag added in the correct place in the tree, but 331f97117d1SArtem B. Bityutskiy frag_next(newfrag) may be a fragment which is overlapped by it 332f97117d1SArtem B. Bityutskiy */ 333f97117d1SArtem B. Bityutskiy while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { 334f97117d1SArtem B. Bityutskiy /* 'this' frag is obsoleted completely. */ 335733802d9SArtem B. Bityutskiy dbg_fragtree2("obsoleting node frag %p (%x-%x) and removing from tree\n", 336e0d60137SArtem B. Bityutskiy this, this->ofs, this->ofs+this->size); 3371e0da3cbSArtem B. Bityutskiy rb_erase(&this->rb, root); 338f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 339f97117d1SArtem B. Bityutskiy } 340f97117d1SArtem B. Bityutskiy /* Now we're pointing at the first frag which isn't totally obsoleted by 341f97117d1SArtem B. Bityutskiy the new frag */ 342f97117d1SArtem B. Bityutskiy 3431e0da3cbSArtem B. Bityutskiy if (!this || newfrag->ofs + newfrag->size == this->ofs) 344f97117d1SArtem B. Bityutskiy return 0; 3451e0da3cbSArtem B. Bityutskiy 346f97117d1SArtem B. Bityutskiy /* Still some overlap but we don't need to move it in the tree */ 347f97117d1SArtem B. Bityutskiy this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); 348f97117d1SArtem B. Bityutskiy this->ofs = newfrag->ofs + newfrag->size; 349f97117d1SArtem B. Bityutskiy 350f97117d1SArtem B. Bityutskiy /* And mark them REF_NORMAL so the GC takes a look at them */ 351f97117d1SArtem B. Bityutskiy if (this->node) 352f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 353f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 354f97117d1SArtem B. Bityutskiy 355f97117d1SArtem B. Bityutskiy return 0; 356f97117d1SArtem B. Bityutskiy } 357f97117d1SArtem B. Bityutskiy 3581e0da3cbSArtem B. Bityutskiy /* 3591e0da3cbSArtem B. Bityutskiy * Given an inode, probably with existing tree of fragments, add the new node 3601e0da3cbSArtem B. Bityutskiy * to the fragment tree. 361f97117d1SArtem B. Bityutskiy */ 362f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 363f97117d1SArtem B. Bityutskiy { 364f97117d1SArtem B. Bityutskiy int ret; 365f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 366f97117d1SArtem B. Bityutskiy 367f97117d1SArtem B. Bityutskiy if (unlikely(!fn->size)) 368f97117d1SArtem B. Bityutskiy return 0; 369f97117d1SArtem B. Bityutskiy 3701e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn->ofs, fn->size); 371f97117d1SArtem B. Bityutskiy if (unlikely(!newfrag)) 372f97117d1SArtem B. Bityutskiy return -ENOMEM; 3731e0da3cbSArtem B. Bityutskiy newfrag->node->frags = 1; 374f97117d1SArtem B. Bityutskiy 375733802d9SArtem B. Bityutskiy dbg_fragtree("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", 376e0d60137SArtem B. Bityutskiy fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); 377f97117d1SArtem B. Bityutskiy 378f97117d1SArtem B. Bityutskiy ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); 379f97117d1SArtem B. Bityutskiy if (unlikely(ret)) 380f97117d1SArtem B. Bityutskiy return ret; 381f97117d1SArtem B. Bityutskiy 382f97117d1SArtem B. Bityutskiy /* If we now share a page with other nodes, mark either previous 383f97117d1SArtem B. Bityutskiy or next node REF_NORMAL, as appropriate. */ 384f97117d1SArtem B. Bityutskiy if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { 385f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *prev = frag_prev(newfrag); 386f97117d1SArtem B. Bityutskiy 387f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 388f97117d1SArtem B. Bityutskiy /* If we don't start at zero there's _always_ a previous */ 389f97117d1SArtem B. Bityutskiy if (prev->node) 390f97117d1SArtem B. Bityutskiy mark_ref_normal(prev->node->raw); 391f97117d1SArtem B. Bityutskiy } 392f97117d1SArtem B. Bityutskiy 393f97117d1SArtem B. Bityutskiy if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { 394f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(newfrag); 395f97117d1SArtem B. Bityutskiy 396f97117d1SArtem B. Bityutskiy if (next) { 397f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 398f97117d1SArtem B. Bityutskiy if (next->node) 399f97117d1SArtem B. Bityutskiy mark_ref_normal(next->node->raw); 400f97117d1SArtem B. Bityutskiy } 401f97117d1SArtem B. Bityutskiy } 402f97117d1SArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 4031e0da3cbSArtem B. Bityutskiy 404f97117d1SArtem B. Bityutskiy return 0; 405f97117d1SArtem B. Bityutskiy } 406f97117d1SArtem B. Bityutskiy 4071da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) 4081da177e4SLinus Torvalds { 4091da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 4101da177e4SLinus Torvalds ic->state = state; 4111da177e4SLinus Torvalds wake_up(&c->inocache_wq); 4121da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 4131da177e4SLinus Torvalds } 4141da177e4SLinus Torvalds 4151da177e4SLinus Torvalds /* During mount, this needs no locking. During normal operation, its 4161da177e4SLinus Torvalds callers want to do other stuff while still holding the inocache_lock. 4171da177e4SLinus Torvalds Rather than introducing special case get_ino_cache functions or 4181da177e4SLinus Torvalds callbacks, we just let the caller do the locking itself. */ 4191da177e4SLinus Torvalds 4201da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 4211da177e4SLinus Torvalds { 4221da177e4SLinus Torvalds struct jffs2_inode_cache *ret; 4231da177e4SLinus Torvalds 4241da177e4SLinus Torvalds ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; 4251da177e4SLinus Torvalds while (ret && ret->ino < ino) { 4261da177e4SLinus Torvalds ret = ret->next; 4271da177e4SLinus Torvalds } 4281da177e4SLinus Torvalds 4291da177e4SLinus Torvalds if (ret && ret->ino != ino) 4301da177e4SLinus Torvalds ret = NULL; 4311da177e4SLinus Torvalds 4321da177e4SLinus Torvalds return ret; 4331da177e4SLinus Torvalds } 4341da177e4SLinus Torvalds 4351da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) 4361da177e4SLinus Torvalds { 4371da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 4387d27c814SThomas Gleixner 4391da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 4407d200960SDavid Woodhouse if (!new->ino) 4417d200960SDavid Woodhouse new->ino = ++c->highest_ino; 4427d200960SDavid Woodhouse 443733802d9SArtem B. Bityutskiy dbg_inocache("add %p (ino #%u)\n", new, new->ino); 4441da177e4SLinus Torvalds 4451da177e4SLinus Torvalds prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; 4461da177e4SLinus Torvalds 4471da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < new->ino) { 4481da177e4SLinus Torvalds prev = &(*prev)->next; 4491da177e4SLinus Torvalds } 4501da177e4SLinus Torvalds new->next = *prev; 4511da177e4SLinus Torvalds *prev = new; 4521da177e4SLinus Torvalds 4531da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 4541da177e4SLinus Torvalds } 4551da177e4SLinus Torvalds 4561da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) 4571da177e4SLinus Torvalds { 4581da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 459e0d60137SArtem B. Bityutskiy 460355ed4e1SKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 461355ed4e1SKaiGai Kohei BUG_ON(old->xref); 462355ed4e1SKaiGai Kohei #endif 463733802d9SArtem B. Bityutskiy dbg_inocache("del %p (ino #%u)\n", old, old->ino); 4641da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 4651da177e4SLinus Torvalds 4661da177e4SLinus Torvalds prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; 4671da177e4SLinus Torvalds 4681da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < old->ino) { 4691da177e4SLinus Torvalds prev = &(*prev)->next; 4701da177e4SLinus Torvalds } 4711da177e4SLinus Torvalds if ((*prev) == old) { 4721da177e4SLinus Torvalds *prev = old->next; 4731da177e4SLinus Torvalds } 4741da177e4SLinus Torvalds 47567e345d1SDavid Woodhouse /* Free it now unless it's in READING or CLEARING state, which 47667e345d1SDavid Woodhouse are the transitions upon read_inode() and clear_inode(). The 47767e345d1SDavid Woodhouse rest of the time we know nobody else is looking at it, and 47867e345d1SDavid Woodhouse if it's held by read_inode() or clear_inode() they'll free it 47967e345d1SDavid Woodhouse for themselves. */ 48067e345d1SDavid Woodhouse if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) 48167e345d1SDavid Woodhouse jffs2_free_inode_cache(old); 48267e345d1SDavid Woodhouse 4831da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 4841da177e4SLinus Torvalds } 4851da177e4SLinus Torvalds 4861da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c) 4871da177e4SLinus Torvalds { 4881da177e4SLinus Torvalds int i; 4891da177e4SLinus Torvalds struct jffs2_inode_cache *this, *next; 4901da177e4SLinus Torvalds 4911da177e4SLinus Torvalds for (i=0; i<INOCACHE_HASHSIZE; i++) { 4921da177e4SLinus Torvalds this = c->inocache_list[i]; 4931da177e4SLinus Torvalds while (this) { 4941da177e4SLinus Torvalds next = this->next; 495aa98d7cfSKaiGai Kohei jffs2_xattr_free_inode(c, this); 4961da177e4SLinus Torvalds jffs2_free_inode_cache(this); 4971da177e4SLinus Torvalds this = next; 4981da177e4SLinus Torvalds } 4991da177e4SLinus Torvalds c->inocache_list[i] = NULL; 5001da177e4SLinus Torvalds } 5011da177e4SLinus Torvalds } 5021da177e4SLinus Torvalds 5031da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) 5041da177e4SLinus Torvalds { 5051da177e4SLinus Torvalds int i; 5061da177e4SLinus Torvalds struct jffs2_raw_node_ref *this, *next; 5071da177e4SLinus Torvalds 5081da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 5091da177e4SLinus Torvalds this = c->blocks[i].first_node; 5101da177e4SLinus Torvalds while (this) { 5119bfeb691SDavid Woodhouse if (this[REFS_PER_BLOCK].flash_offset == REF_LINK_NODE) 5129bfeb691SDavid Woodhouse next = this[REFS_PER_BLOCK].next_in_ino; 5139bfeb691SDavid Woodhouse else 5149bfeb691SDavid Woodhouse next = NULL; 5159bfeb691SDavid Woodhouse 5169bfeb691SDavid Woodhouse jffs2_free_refblock(this); 5171da177e4SLinus Torvalds this = next; 5181da177e4SLinus Torvalds } 5191da177e4SLinus Torvalds c->blocks[i].first_node = c->blocks[i].last_node = NULL; 5201da177e4SLinus Torvalds } 5211da177e4SLinus Torvalds } 5221da177e4SLinus Torvalds 5231da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) 5241da177e4SLinus Torvalds { 5251da177e4SLinus Torvalds /* The common case in lookup is that there will be a node 5261da177e4SLinus Torvalds which precisely matches. So we go looking for that first */ 5271da177e4SLinus Torvalds struct rb_node *next; 5281da177e4SLinus Torvalds struct jffs2_node_frag *prev = NULL; 5291da177e4SLinus Torvalds struct jffs2_node_frag *frag = NULL; 5301da177e4SLinus Torvalds 531733802d9SArtem B. Bityutskiy dbg_fragtree2("root %p, offset %d\n", fragtree, offset); 5321da177e4SLinus Torvalds 5331da177e4SLinus Torvalds next = fragtree->rb_node; 5341da177e4SLinus Torvalds 5351da177e4SLinus Torvalds while(next) { 5361da177e4SLinus Torvalds frag = rb_entry(next, struct jffs2_node_frag, rb); 5371da177e4SLinus Torvalds 5381da177e4SLinus Torvalds if (frag->ofs + frag->size <= offset) { 5391da177e4SLinus Torvalds /* Remember the closest smaller match on the way down */ 5401da177e4SLinus Torvalds if (!prev || frag->ofs > prev->ofs) 5411da177e4SLinus Torvalds prev = frag; 5421da177e4SLinus Torvalds next = frag->rb.rb_right; 5431da177e4SLinus Torvalds } else if (frag->ofs > offset) { 5441da177e4SLinus Torvalds next = frag->rb.rb_left; 5451da177e4SLinus Torvalds } else { 5461da177e4SLinus Torvalds return frag; 5471da177e4SLinus Torvalds } 5481da177e4SLinus Torvalds } 5491da177e4SLinus Torvalds 5501da177e4SLinus Torvalds /* Exact match not found. Go back up looking at each parent, 5511da177e4SLinus Torvalds and return the closest smaller one */ 5521da177e4SLinus Torvalds 5531da177e4SLinus Torvalds if (prev) 554733802d9SArtem B. Bityutskiy dbg_fragtree2("no match. Returning frag %#04x-%#04x, closest previous\n", 555e0d60137SArtem B. Bityutskiy prev->ofs, prev->ofs+prev->size); 5561da177e4SLinus Torvalds else 557733802d9SArtem B. Bityutskiy dbg_fragtree2("returning NULL, empty fragtree\n"); 5581da177e4SLinus Torvalds 5591da177e4SLinus Torvalds return prev; 5601da177e4SLinus Torvalds } 5611da177e4SLinus Torvalds 5621da177e4SLinus Torvalds /* Pass 'c' argument to indicate that nodes should be marked obsolete as 5631da177e4SLinus Torvalds they're killed. */ 5641da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) 5651da177e4SLinus Torvalds { 5661da177e4SLinus Torvalds struct jffs2_node_frag *frag; 5671da177e4SLinus Torvalds struct jffs2_node_frag *parent; 5681da177e4SLinus Torvalds 5691da177e4SLinus Torvalds if (!root->rb_node) 5701da177e4SLinus Torvalds return; 5711da177e4SLinus Torvalds 572733802d9SArtem B. Bityutskiy dbg_fragtree("killing\n"); 5731da177e4SLinus Torvalds 574e0d60137SArtem B. Bityutskiy frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); 5751da177e4SLinus Torvalds while(frag) { 5761da177e4SLinus Torvalds if (frag->rb.rb_left) { 5771da177e4SLinus Torvalds frag = frag_left(frag); 5781da177e4SLinus Torvalds continue; 5791da177e4SLinus Torvalds } 5801da177e4SLinus Torvalds if (frag->rb.rb_right) { 5811da177e4SLinus Torvalds frag = frag_right(frag); 5821da177e4SLinus Torvalds continue; 5831da177e4SLinus Torvalds } 5841da177e4SLinus Torvalds 5851da177e4SLinus Torvalds if (frag->node && !(--frag->node->frags)) { 5861da177e4SLinus Torvalds /* Not a hole, and it's the final remaining frag 5871da177e4SLinus Torvalds of this node. Free the node */ 5881da177e4SLinus Torvalds if (c) 5891da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, frag->node->raw); 5901da177e4SLinus Torvalds 5911da177e4SLinus Torvalds jffs2_free_full_dnode(frag->node); 5921da177e4SLinus Torvalds } 5931da177e4SLinus Torvalds parent = frag_parent(frag); 5941da177e4SLinus Torvalds if (parent) { 5951da177e4SLinus Torvalds if (frag_left(parent) == frag) 5961da177e4SLinus Torvalds parent->rb.rb_left = NULL; 5971da177e4SLinus Torvalds else 5981da177e4SLinus Torvalds parent->rb.rb_right = NULL; 5991da177e4SLinus Torvalds } 6001da177e4SLinus Torvalds 6011da177e4SLinus Torvalds jffs2_free_node_frag(frag); 6021da177e4SLinus Torvalds frag = parent; 6031da177e4SLinus Torvalds 6041da177e4SLinus Torvalds cond_resched(); 6051da177e4SLinus Torvalds } 6061da177e4SLinus Torvalds } 607f1f9671bSDavid Woodhouse 6082f785402SDavid Woodhouse struct jffs2_raw_node_ref *jffs2_link_node_ref(struct jffs2_sb_info *c, 6092f785402SDavid Woodhouse struct jffs2_eraseblock *jeb, 6102f785402SDavid Woodhouse uint32_t ofs, uint32_t len, 611fcb75787SDavid Woodhouse struct jffs2_inode_cache *ic) 612f1f9671bSDavid Woodhouse { 6132f785402SDavid Woodhouse struct jffs2_raw_node_ref *ref; 6142f785402SDavid Woodhouse 6159bfeb691SDavid Woodhouse BUG_ON(!jeb->allocated_refs); 6169bfeb691SDavid Woodhouse jeb->allocated_refs--; 6179bfeb691SDavid Woodhouse 6189bfeb691SDavid Woodhouse ref = jeb->last_node; 6199bfeb691SDavid Woodhouse 6209bfeb691SDavid Woodhouse dbg_noderef("Last node at %p is (%08x,%p)\n", ref, ref->flash_offset, 6219bfeb691SDavid Woodhouse ref->next_in_ino); 6229bfeb691SDavid Woodhouse 6239bfeb691SDavid Woodhouse while (ref->flash_offset != REF_EMPTY_NODE) { 6249bfeb691SDavid Woodhouse if (ref->flash_offset == REF_LINK_NODE) 6259bfeb691SDavid Woodhouse ref = ref->next_in_ino; 6269bfeb691SDavid Woodhouse else 6279bfeb691SDavid Woodhouse ref++; 6282f785402SDavid Woodhouse } 6292f785402SDavid Woodhouse 6309bfeb691SDavid Woodhouse dbg_noderef("New ref is %p (%08x becomes %08x,%p) len 0x%x\n", ref, 6319bfeb691SDavid Woodhouse ref->flash_offset, ofs, ref->next_in_ino, len); 6329bfeb691SDavid Woodhouse 6332f785402SDavid Woodhouse ref->flash_offset = ofs; 6342f785402SDavid Woodhouse 6359bfeb691SDavid Woodhouse if (!jeb->first_node) { 636f1f9671bSDavid Woodhouse jeb->first_node = ref; 6379bfeb691SDavid Woodhouse BUG_ON(ref_offset(ref) != jeb->offset); 6389bfeb691SDavid Woodhouse } else if (unlikely(ref_offset(ref) != jeb->offset + c->sector_size - jeb->free_size)) { 6399bfeb691SDavid Woodhouse uint32_t last_len = ref_totlen(c, jeb, jeb->last_node); 6409bfeb691SDavid Woodhouse 6419bfeb691SDavid Woodhouse JFFS2_ERROR("Adding new ref %p at (0x%08x-0x%08x) not immediately after previous (0x%08x-0x%08x)\n", 6429bfeb691SDavid Woodhouse ref, ref_offset(ref), ref_offset(ref)+len, 6439bfeb691SDavid Woodhouse ref_offset(jeb->last_node), 6449bfeb691SDavid Woodhouse ref_offset(jeb->last_node)+last_len); 6459bfeb691SDavid Woodhouse BUG(); 646ca89a517SDavid Woodhouse } 647f1f9671bSDavid Woodhouse jeb->last_node = ref; 648f1f9671bSDavid Woodhouse 649fcb75787SDavid Woodhouse if (ic) { 650fcb75787SDavid Woodhouse ref->next_in_ino = ic->nodes; 651fcb75787SDavid Woodhouse ic->nodes = ref; 652fcb75787SDavid Woodhouse } else { 653fcb75787SDavid Woodhouse ref->next_in_ino = NULL; 654fcb75787SDavid Woodhouse } 655fcb75787SDavid Woodhouse 656f1f9671bSDavid Woodhouse switch(ref_flags(ref)) { 657f1f9671bSDavid Woodhouse case REF_UNCHECKED: 658f1f9671bSDavid Woodhouse c->unchecked_size += len; 659f1f9671bSDavid Woodhouse jeb->unchecked_size += len; 660f1f9671bSDavid Woodhouse break; 661f1f9671bSDavid Woodhouse 662f1f9671bSDavid Woodhouse case REF_NORMAL: 663f1f9671bSDavid Woodhouse case REF_PRISTINE: 664f1f9671bSDavid Woodhouse c->used_size += len; 665f1f9671bSDavid Woodhouse jeb->used_size += len; 666f1f9671bSDavid Woodhouse break; 667f1f9671bSDavid Woodhouse 668f1f9671bSDavid Woodhouse case REF_OBSOLETE: 669f1f9671bSDavid Woodhouse c->dirty_size += len; 6703b79673cSDavid Woodhouse jeb->dirty_size += len; 671f1f9671bSDavid Woodhouse break; 672f1f9671bSDavid Woodhouse } 673f1f9671bSDavid Woodhouse c->free_size -= len; 674f1f9671bSDavid Woodhouse jeb->free_size -= len; 675f1f9671bSDavid Woodhouse 676ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 677ca89a517SDavid Woodhouse /* Set (and test) __totlen field... for now */ 678ca89a517SDavid Woodhouse ref->__totlen = len; 679ca89a517SDavid Woodhouse ref_totlen(c, jeb, ref); 680ca89a517SDavid Woodhouse #endif 6812f785402SDavid Woodhouse return ref; 682f1f9671bSDavid Woodhouse } 68368270995SDavid Woodhouse 6842f785402SDavid Woodhouse /* No locking, no reservation of 'ref'. Do not use on a live file system */ 68568270995SDavid Woodhouse int jffs2_scan_dirty_space(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 68668270995SDavid Woodhouse uint32_t size) 68768270995SDavid Woodhouse { 688ca89a517SDavid Woodhouse if (!size) 689ca89a517SDavid Woodhouse return 0; 6909bfeb691SDavid Woodhouse if (unlikely(size > jeb->free_size)) { 6919bfeb691SDavid Woodhouse printk(KERN_CRIT "Dirty space 0x%x larger then free_size 0x%x (wasted 0x%x)\n", 6929bfeb691SDavid Woodhouse size, jeb->free_size, jeb->wasted_size); 693ca89a517SDavid Woodhouse BUG(); 694ca89a517SDavid Woodhouse } 6959bfeb691SDavid Woodhouse /* REF_EMPTY_NODE is !obsolete, so that works OK */ 6962ebf09c2SDavid Woodhouse if (jeb->last_node && ref_obsolete(jeb->last_node)) { 697ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 698ca89a517SDavid Woodhouse jeb->last_node->__totlen += size; 699ca89a517SDavid Woodhouse #endif 70068270995SDavid Woodhouse c->dirty_size += size; 70168270995SDavid Woodhouse c->free_size -= size; 70268270995SDavid Woodhouse jeb->dirty_size += size; 70368270995SDavid Woodhouse jeb->free_size -= size; 704ca89a517SDavid Woodhouse } else { 7052f785402SDavid Woodhouse uint32_t ofs = jeb->offset + c->sector_size - jeb->free_size; 7062f785402SDavid Woodhouse ofs |= REF_OBSOLETE; 707ca89a517SDavid Woodhouse 7082f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, ofs, size, NULL); 709ca89a517SDavid Woodhouse } 71068270995SDavid Woodhouse 71168270995SDavid Woodhouse return 0; 71268270995SDavid Woodhouse } 713ca89a517SDavid Woodhouse 714ca89a517SDavid Woodhouse /* Calculate totlen from surrounding nodes or eraseblock */ 715ca89a517SDavid Woodhouse static inline uint32_t __ref_totlen(struct jffs2_sb_info *c, 716ca89a517SDavid Woodhouse struct jffs2_eraseblock *jeb, 717ca89a517SDavid Woodhouse struct jffs2_raw_node_ref *ref) 718ca89a517SDavid Woodhouse { 719ca89a517SDavid Woodhouse uint32_t ref_end; 72099988f7bSDavid Woodhouse struct jffs2_raw_node_ref *next_ref = ref_next(ref); 721ca89a517SDavid Woodhouse 72299988f7bSDavid Woodhouse if (next_ref) 72399988f7bSDavid Woodhouse ref_end = ref_offset(next_ref); 724ca89a517SDavid Woodhouse else { 725ca89a517SDavid Woodhouse if (!jeb) 726ca89a517SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 727ca89a517SDavid Woodhouse 728ca89a517SDavid Woodhouse /* Last node in block. Use free_space */ 7299bfeb691SDavid Woodhouse if (unlikely(ref != jeb->last_node)) { 730ca89a517SDavid Woodhouse printk(KERN_CRIT "ref %p @0x%08x is not jeb->last_node (%p @0x%08x)\n", 731ca89a517SDavid Woodhouse ref, ref_offset(ref), jeb->last_node, jeb->last_node?ref_offset(jeb->last_node):0); 732ca89a517SDavid Woodhouse BUG(); 733ca89a517SDavid Woodhouse } 734ca89a517SDavid Woodhouse ref_end = jeb->offset + c->sector_size - jeb->free_size; 735ca89a517SDavid Woodhouse } 736ca89a517SDavid Woodhouse return ref_end - ref_offset(ref); 737ca89a517SDavid Woodhouse } 738ca89a517SDavid Woodhouse 739ca89a517SDavid Woodhouse uint32_t __jffs2_ref_totlen(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 740ca89a517SDavid Woodhouse struct jffs2_raw_node_ref *ref) 741ca89a517SDavid Woodhouse { 742ca89a517SDavid Woodhouse uint32_t ret; 743ca89a517SDavid Woodhouse 744ca89a517SDavid Woodhouse ret = __ref_totlen(c, jeb, ref); 7459bfeb691SDavid Woodhouse 746ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 7479bfeb691SDavid Woodhouse if (unlikely(ret != ref->__totlen)) { 7489bfeb691SDavid Woodhouse if (!jeb) 7499bfeb691SDavid Woodhouse jeb = &c->blocks[ref->flash_offset / c->sector_size]; 7509bfeb691SDavid Woodhouse 751ca89a517SDavid Woodhouse printk(KERN_CRIT "Totlen for ref at %p (0x%08x-0x%08x) miscalculated as 0x%x instead of %x\n", 752ca89a517SDavid Woodhouse ref, ref_offset(ref), ref_offset(ref)+ref->__totlen, 753ca89a517SDavid Woodhouse ret, ref->__totlen); 75499988f7bSDavid Woodhouse if (ref_next(ref)) { 75599988f7bSDavid Woodhouse printk(KERN_CRIT "next %p (0x%08x-0x%08x)\n", ref_next(ref), ref_offset(ref_next(ref)), 75699988f7bSDavid Woodhouse ref_offset(ref_next(ref))+ref->__totlen); 757ca89a517SDavid Woodhouse } else 75899988f7bSDavid Woodhouse printk(KERN_CRIT "No next ref. jeb->last_node is %p\n", jeb->last_node); 759ca89a517SDavid Woodhouse 760ca89a517SDavid 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); 7619bfeb691SDavid Woodhouse 762ca89a517SDavid Woodhouse #if defined(JFFS2_DBG_DUMPS) || defined(JFFS2_DBG_PARANOIA_CHECKS) 763ca89a517SDavid Woodhouse __jffs2_dbg_dump_node_refs_nolock(c, jeb); 764ca89a517SDavid Woodhouse #endif 7659bfeb691SDavid Woodhouse 766ca89a517SDavid Woodhouse WARN_ON(1); 7679bfeb691SDavid Woodhouse 7689bfeb691SDavid Woodhouse ret = ref->__totlen; 769ca89a517SDavid Woodhouse } 770ca89a517SDavid Woodhouse #endif /* TEST_TOTLEN */ 771ca89a517SDavid Woodhouse return ret; 772ca89a517SDavid Woodhouse } 773