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 * 101e0da3cbSArtem B. Bityutskiy * $Id: nodelist.c,v 1.104 2005/08/01 12:05:19 dedekind 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 241da177e4SLinus Torvalds void jffs2_add_fd_to_list(struct jffs2_sb_info *c, struct jffs2_full_dirent *new, struct jffs2_full_dirent **list) 251da177e4SLinus Torvalds { 261da177e4SLinus Torvalds struct jffs2_full_dirent **prev = list; 27e0d60137SArtem B. Bityutskiy 28e0d60137SArtem B. Bityutskiy JFFS2_DBG_DENTLIST("add dirent \"%s\", ino #%u\n", new->name, new->ino); 291da177e4SLinus Torvalds 301da177e4SLinus Torvalds while ((*prev) && (*prev)->nhash <= new->nhash) { 311da177e4SLinus Torvalds if ((*prev)->nhash == new->nhash && !strcmp((*prev)->name, new->name)) { 321da177e4SLinus Torvalds /* Duplicate. Free one */ 331da177e4SLinus Torvalds if (new->version < (*prev)->version) { 34e0d60137SArtem B. Bityutskiy JFFS2_DBG_DENTLIST("Eep! Marking new dirent node is obsolete, old is \"%s\", ino #%u\n", 35e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 361da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, new->raw); 371da177e4SLinus Torvalds jffs2_free_full_dirent(new); 381da177e4SLinus Torvalds } else { 39e0d60137SArtem B. Bityutskiy JFFS2_DBG_DENTLIST("marking old dirent \"%s\", ino #%u bsolete\n", 40e0d60137SArtem B. Bityutskiy (*prev)->name, (*prev)->ino); 411da177e4SLinus Torvalds new->next = (*prev)->next; 421da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, ((*prev)->raw)); 431da177e4SLinus Torvalds jffs2_free_full_dirent(*prev); 441da177e4SLinus Torvalds *prev = new; 451da177e4SLinus Torvalds } 46e0d60137SArtem B. Bityutskiy return; 471da177e4SLinus Torvalds } 481da177e4SLinus Torvalds prev = &((*prev)->next); 491da177e4SLinus Torvalds } 501da177e4SLinus Torvalds new->next = *prev; 511da177e4SLinus Torvalds *prev = new; 521da177e4SLinus Torvalds } 531da177e4SLinus Torvalds 541e900979SArtem B. Bityutskiy void jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) 551e900979SArtem B. Bityutskiy { 561e900979SArtem B. Bityutskiy struct jffs2_node_frag *frag = jffs2_lookup_node_frag(list, size); 571e900979SArtem B. Bityutskiy 581e900979SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("truncating fragtree to 0x%08x bytes\n", size); 591e900979SArtem B. Bityutskiy 601e900979SArtem B. Bityutskiy /* We know frag->ofs <= size. That's what lookup does for us */ 611e900979SArtem B. Bityutskiy if (frag && frag->ofs != size) { 621e0da3cbSArtem B. Bityutskiy if (frag->ofs+frag->size > size) { 631e900979SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("truncating frag 0x%08x-0x%08x\n", frag->ofs, frag->ofs+frag->size); 641e900979SArtem B. Bityutskiy frag->size = size - frag->ofs; 651e900979SArtem B. Bityutskiy } 661e900979SArtem B. Bityutskiy frag = frag_next(frag); 671e900979SArtem B. Bityutskiy } 681e900979SArtem B. Bityutskiy while (frag && frag->ofs >= size) { 691e900979SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(frag); 701e900979SArtem B. Bityutskiy 711e900979SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("removing frag 0x%08x-0x%08x\n", frag->ofs, frag->ofs+frag->size); 721e900979SArtem B. Bityutskiy frag_erase(frag, list); 731e900979SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, frag); 741e900979SArtem B. Bityutskiy frag = next; 751e900979SArtem B. Bityutskiy } 761e0da3cbSArtem B. Bityutskiy 771e0da3cbSArtem B. Bityutskiy if (size == 0) 781e0da3cbSArtem B. Bityutskiy return; 791e0da3cbSArtem B. Bityutskiy 801e0da3cbSArtem B. Bityutskiy /* 811e0da3cbSArtem B. Bityutskiy * If the last fragment starts at the RAM page boundary, it is 821e0da3cbSArtem B. Bityutskiy * REF_PRISTINE irrespective of its size. 831e0da3cbSArtem B. Bityutskiy */ 841e0da3cbSArtem B. Bityutskiy frag = frag_last(list); 851e0da3cbSArtem B. Bityutskiy if ((frag->ofs & (PAGE_CACHE_SIZE - 1)) == 0) { 861e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking the last fragment 0x%08x-0x%08x REF_PRISTINE.\n", 871e0da3cbSArtem B. Bityutskiy frag->ofs, frag->ofs + frag->size); 881e0da3cbSArtem B. Bityutskiy frag->node->raw->flash_offset = ref_offset(frag->node->raw) | REF_PRISTINE; 891e0da3cbSArtem B. Bityutskiy } 901e900979SArtem B. Bityutskiy } 911e900979SArtem B. Bityutskiy 92f97117d1SArtem B. Bityutskiy void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this) 931da177e4SLinus Torvalds { 94f97117d1SArtem B. Bityutskiy if (this->node) { 95f97117d1SArtem B. Bityutskiy this->node->frags--; 96f97117d1SArtem B. Bityutskiy if (!this->node->frags) { 97f97117d1SArtem B. Bityutskiy /* The node has no valid frags left. It's totally obsoleted */ 98e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", 99e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); 100f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, this->node->raw); 101f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(this->node); 102f97117d1SArtem B. Bityutskiy } else { 103e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", 104e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); 105f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 1061da177e4SLinus Torvalds } 1071da177e4SLinus Torvalds 108f97117d1SArtem B. Bityutskiy } 109f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(this); 1109dee7503SDavid Woodhouse } 1119dee7503SDavid Woodhouse 112f97117d1SArtem B. Bityutskiy static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) 1131da177e4SLinus Torvalds { 114f97117d1SArtem B. Bityutskiy struct rb_node *parent = &base->rb; 115f97117d1SArtem B. Bityutskiy struct rb_node **link = &parent; 1161da177e4SLinus Torvalds 117e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); 1189dee7503SDavid Woodhouse 119f97117d1SArtem B. Bityutskiy while (*link) { 120f97117d1SArtem B. Bityutskiy parent = *link; 121f97117d1SArtem B. Bityutskiy base = rb_entry(parent, struct jffs2_node_frag, rb); 122f97117d1SArtem B. Bityutskiy 123e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag at 0x%08x\n", base->ofs); 124f97117d1SArtem B. Bityutskiy if (newfrag->ofs > base->ofs) 125f97117d1SArtem B. Bityutskiy link = &base->rb.rb_right; 126f97117d1SArtem B. Bityutskiy else if (newfrag->ofs < base->ofs) 127f97117d1SArtem B. Bityutskiy link = &base->rb.rb_left; 1289dee7503SDavid Woodhouse else { 129e0d60137SArtem B. Bityutskiy JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); 130dae6227fSArtem B. Bityutskiy BUG(); 131dae6227fSArtem B. Bityutskiy } 132dae6227fSArtem B. Bityutskiy } 133dae6227fSArtem B. Bityutskiy 134f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &base->rb, link); 135dae6227fSArtem B. Bityutskiy } 136dae6227fSArtem B. Bityutskiy 1371e0da3cbSArtem B. Bityutskiy /* 1381e0da3cbSArtem B. Bityutskiy * Allocate and initializes a new fragment. 1391e0da3cbSArtem B. Bityutskiy */ 1401e0da3cbSArtem B. Bityutskiy static inline struct jffs2_node_frag * new_fragment(struct jffs2_full_dnode *fn, uint32_t ofs, uint32_t size) 1411e0da3cbSArtem B. Bityutskiy { 1421e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 1431e0da3cbSArtem B. Bityutskiy 1441e0da3cbSArtem B. Bityutskiy newfrag = jffs2_alloc_node_frag(); 1451e0da3cbSArtem B. Bityutskiy if (likely(newfrag)) { 1461e0da3cbSArtem B. Bityutskiy newfrag->ofs = ofs; 1471e0da3cbSArtem B. Bityutskiy newfrag->size = size; 1481e0da3cbSArtem B. Bityutskiy newfrag->node = fn; 1491e0da3cbSArtem B. Bityutskiy } else { 1501e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("cannot allocate a jffs2_node_frag object\n"); 1511e0da3cbSArtem B. Bityutskiy } 1521e0da3cbSArtem B. Bityutskiy 1531e0da3cbSArtem B. Bityutskiy return newfrag; 1541e0da3cbSArtem B. Bityutskiy } 1551e0da3cbSArtem B. Bityutskiy 1561e0da3cbSArtem B. Bityutskiy /* 1571e0da3cbSArtem B. Bityutskiy * Called when there is no overlapping fragment exist. Inserts a hole before the new 1581e0da3cbSArtem B. Bityutskiy * fragment and inserts the new fragment to the fragtree. 1591e0da3cbSArtem B. Bityutskiy */ 1601e0da3cbSArtem B. Bityutskiy static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, 1611e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag, 1621e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *this, uint32_t lastend) 1631e0da3cbSArtem B. Bityutskiy { 1641e0da3cbSArtem B. Bityutskiy if (lastend < newfrag->node->ofs) { 1651e0da3cbSArtem B. Bityutskiy /* put a hole in before the new fragment */ 1661e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *holefrag; 1671e0da3cbSArtem B. Bityutskiy 1681e0da3cbSArtem B. Bityutskiy holefrag= new_fragment(NULL, lastend, newfrag->node->ofs - lastend); 1691e0da3cbSArtem B. Bityutskiy if (unlikely(!holefrag)) { 1701e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 1711e0da3cbSArtem B. Bityutskiy return -ENOMEM; 1721e0da3cbSArtem B. Bityutskiy } 1731e0da3cbSArtem B. Bityutskiy 1741e0da3cbSArtem B. Bityutskiy if (this) { 1751e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 1761e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 1771e0da3cbSArtem B. Bityutskiy So that's where we want to put the hole */ 1781e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("add hole frag %u-%u on the right of the new frag.\n", 1791e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1801e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); 1811e0da3cbSArtem B. Bityutskiy } else { 1821e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("Add hole frag %u-%u to the root of the tree.\n", 1831e0da3cbSArtem B. Bityutskiy holefrag->ofs, holefrag->ofs + holefrag->size); 1841e0da3cbSArtem B. Bityutskiy rb_link_node(&holefrag->rb, NULL, &root->rb_node); 1851e0da3cbSArtem B. Bityutskiy } 1861e0da3cbSArtem B. Bityutskiy rb_insert_color(&holefrag->rb, root); 1871e0da3cbSArtem B. Bityutskiy this = holefrag; 1881e0da3cbSArtem B. Bityutskiy } 1891e0da3cbSArtem B. Bityutskiy 1901e0da3cbSArtem B. Bityutskiy if (this) { 1911e0da3cbSArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 1921e0da3cbSArtem B. Bityutskiy because there are no frags with offset greater than it. 1931e0da3cbSArtem B. Bityutskiy So that's where we want to put new fragment */ 1941e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("add the new node at the right\n"); 1951e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 1961e0da3cbSArtem B. Bityutskiy } else { 1971e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert the new node at the root of the tree\n"); 1981e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, NULL, &root->rb_node); 1991e0da3cbSArtem B. Bityutskiy } 2001e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2011e0da3cbSArtem B. Bityutskiy 2021e0da3cbSArtem B. Bityutskiy return 0; 2031e0da3cbSArtem B. Bityutskiy } 2041e0da3cbSArtem B. Bityutskiy 205f97117d1SArtem B. Bityutskiy /* Doesn't set inode->i_size */ 2061e0da3cbSArtem B. Bityutskiy static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) 2071da177e4SLinus Torvalds { 208f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *this; 209f97117d1SArtem B. Bityutskiy uint32_t lastend; 2101da177e4SLinus Torvalds 211f97117d1SArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 2121e0da3cbSArtem B. Bityutskiy this = jffs2_lookup_node_frag(root, newfrag->node->ofs); 2131da177e4SLinus Torvalds 214f97117d1SArtem B. Bityutskiy if (this) { 215e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 216e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 217f97117d1SArtem B. Bityutskiy lastend = this->ofs + this->size; 218f97117d1SArtem B. Bityutskiy } else { 219e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave no frag\n"); 220f97117d1SArtem B. Bityutskiy lastend = 0; 221f97117d1SArtem B. Bityutskiy } 2221da177e4SLinus Torvalds 2231e0da3cbSArtem B. Bityutskiy /* See if we ran off the end of the fragtree */ 224f97117d1SArtem B. Bityutskiy if (lastend <= newfrag->ofs) { 225f97117d1SArtem B. Bityutskiy /* We did */ 2261da177e4SLinus Torvalds 227f97117d1SArtem B. Bityutskiy /* Check if 'this' node was on the same page as the new node. 228f97117d1SArtem B. Bityutskiy If so, both 'this' and the new node get marked REF_NORMAL so 229f97117d1SArtem B. Bityutskiy the GC can take a look. 2301da177e4SLinus Torvalds */ 231f97117d1SArtem B. Bityutskiy if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { 232f97117d1SArtem B. Bityutskiy if (this->node) 233f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 234f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 2351da177e4SLinus Torvalds } 2361da177e4SLinus Torvalds 2371e0da3cbSArtem B. Bityutskiy return no_overlapping_node(c, root, newfrag, this, lastend); 2381da177e4SLinus Torvalds } 239dae6227fSArtem B. Bityutskiy 2401e0da3cbSArtem B. Bityutskiy if (this->node) 2411e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("dealing with frag %u-%u, phys %#08x(%d).\n", 2421e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, 2431e0da3cbSArtem B. Bityutskiy ref_offset(this->node->raw), ref_flags(this->node->raw)); 2441e0da3cbSArtem B. Bityutskiy else 2451e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("dealing with hole frag %u-%u.\n", 2461e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size); 247dae6227fSArtem B. Bityutskiy 248f97117d1SArtem B. Bityutskiy /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, 249f97117d1SArtem B. Bityutskiy * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs 250f97117d1SArtem B. Bityutskiy */ 251f97117d1SArtem B. Bityutskiy if (newfrag->ofs > this->ofs) { 252f97117d1SArtem B. Bityutskiy /* This node isn't completely obsoleted. The start of it remains valid */ 2531da177e4SLinus Torvalds 254f97117d1SArtem B. Bityutskiy /* Mark the new node and the partially covered node REF_NORMAL -- let 255f97117d1SArtem B. Bityutskiy the GC take a look at them */ 256f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 257f97117d1SArtem B. Bityutskiy if (this->node) 258f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 2591da177e4SLinus Torvalds 260f97117d1SArtem B. Bityutskiy if (this->ofs + this->size > newfrag->ofs + newfrag->size) { 261f97117d1SArtem B. Bityutskiy /* The new node splits 'this' frag into two */ 2621e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag2; 2631e0da3cbSArtem B. Bityutskiy 264f97117d1SArtem B. Bityutskiy if (this->node) 265e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", 266e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 267f97117d1SArtem B. Bityutskiy else 268e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old hole frag 0x%04x-0x%04x\n", 269e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 270dae6227fSArtem B. Bityutskiy 271f97117d1SArtem B. Bityutskiy /* New second frag pointing to this's node */ 2721e0da3cbSArtem B. Bityutskiy newfrag2 = new_fragment(this->node, newfrag->ofs + newfrag->size, 2731e0da3cbSArtem B. Bityutskiy this->ofs + this->size - newfrag->ofs - newfrag->size); 2741e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag2)) 2751e0da3cbSArtem B. Bityutskiy return -ENOMEM; 276f97117d1SArtem B. Bityutskiy if (this->node) 277f97117d1SArtem B. Bityutskiy this->node->frags++; 278dae6227fSArtem B. Bityutskiy 279f97117d1SArtem B. Bityutskiy /* Adjust size of original 'this' */ 280f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 2811da177e4SLinus Torvalds 282f97117d1SArtem B. Bityutskiy /* Now, we know there's no node with offset 283f97117d1SArtem B. Bityutskiy greater than this->ofs but smaller than 284f97117d1SArtem B. Bityutskiy newfrag2->ofs or newfrag->ofs, for obvious 285f97117d1SArtem B. Bityutskiy reasons. So we can do a tree insert from 286f97117d1SArtem B. Bityutskiy 'this' to insert newfrag, and a tree insert 287f97117d1SArtem B. Bityutskiy from newfrag to insert newfrag2. */ 288f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 2891e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 2901da177e4SLinus Torvalds 291f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 2921e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, root); 2931da177e4SLinus Torvalds 2941da177e4SLinus Torvalds return 0; 2951da177e4SLinus Torvalds } 296f97117d1SArtem B. Bityutskiy /* New node just reduces 'this' frag in size, doesn't split it */ 297f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 298f97117d1SArtem B. Bityutskiy 299f97117d1SArtem B. Bityutskiy /* Again, we know it lives down here in the tree */ 300f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 3011e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 302f97117d1SArtem B. Bityutskiy } else { 303f97117d1SArtem B. Bityutskiy /* New frag starts at the same point as 'this' used to. Replace 304f97117d1SArtem B. Bityutskiy it in the tree without doing a delete and insertion */ 305e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", 306e0d60137SArtem B. Bityutskiy newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); 307f97117d1SArtem B. Bityutskiy 3081e0da3cbSArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, root); 309f97117d1SArtem B. Bityutskiy 310f97117d1SArtem B. Bityutskiy if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { 311e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); 312f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 313f97117d1SArtem B. Bityutskiy } else { 314f97117d1SArtem B. Bityutskiy this->ofs += newfrag->size; 315f97117d1SArtem B. Bityutskiy this->size -= newfrag->size; 316f97117d1SArtem B. Bityutskiy 317f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(this, newfrag); 3181e0da3cbSArtem B. Bityutskiy rb_insert_color(&this->rb, root); 319f97117d1SArtem B. Bityutskiy return 0; 320f97117d1SArtem B. Bityutskiy } 321f97117d1SArtem B. Bityutskiy } 322f97117d1SArtem B. Bityutskiy /* OK, now we have newfrag added in the correct place in the tree, but 323f97117d1SArtem B. Bityutskiy frag_next(newfrag) may be a fragment which is overlapped by it 324f97117d1SArtem B. Bityutskiy */ 325f97117d1SArtem B. Bityutskiy while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { 326f97117d1SArtem B. Bityutskiy /* 'this' frag is obsoleted completely. */ 327e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x) and removing from tree\n", 328e0d60137SArtem B. Bityutskiy this, this->ofs, this->ofs+this->size); 3291e0da3cbSArtem B. Bityutskiy rb_erase(&this->rb, root); 330f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 331f97117d1SArtem B. Bityutskiy } 332f97117d1SArtem B. Bityutskiy /* Now we're pointing at the first frag which isn't totally obsoleted by 333f97117d1SArtem B. Bityutskiy the new frag */ 334f97117d1SArtem B. Bityutskiy 3351e0da3cbSArtem B. Bityutskiy if (!this || newfrag->ofs + newfrag->size == this->ofs) 336f97117d1SArtem B. Bityutskiy return 0; 3371e0da3cbSArtem B. Bityutskiy 338f97117d1SArtem B. Bityutskiy /* Still some overlap but we don't need to move it in the tree */ 339f97117d1SArtem B. Bityutskiy this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); 340f97117d1SArtem B. Bityutskiy this->ofs = newfrag->ofs + newfrag->size; 341f97117d1SArtem B. Bityutskiy 342f97117d1SArtem B. Bityutskiy /* And mark them REF_NORMAL so the GC takes a look at them */ 343f97117d1SArtem B. Bityutskiy if (this->node) 344f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 345f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 346f97117d1SArtem B. Bityutskiy 347f97117d1SArtem B. Bityutskiy return 0; 348f97117d1SArtem B. Bityutskiy } 349f97117d1SArtem B. Bityutskiy 3501e0da3cbSArtem B. Bityutskiy /* 3511e0da3cbSArtem B. Bityutskiy * Given an inode, probably with existing tree of fragments, add the new node 3521e0da3cbSArtem B. Bityutskiy * to the fragment tree. 353f97117d1SArtem B. Bityutskiy */ 354f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 355f97117d1SArtem B. Bityutskiy { 356f97117d1SArtem B. Bityutskiy int ret; 357f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 358f97117d1SArtem B. Bityutskiy 359f97117d1SArtem B. Bityutskiy if (unlikely(!fn->size)) 360f97117d1SArtem B. Bityutskiy return 0; 361f97117d1SArtem B. Bityutskiy 3621e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn->ofs, fn->size); 363f97117d1SArtem B. Bityutskiy if (unlikely(!newfrag)) 364f97117d1SArtem B. Bityutskiy return -ENOMEM; 3651e0da3cbSArtem B. Bityutskiy newfrag->node->frags = 1; 366f97117d1SArtem B. Bityutskiy 367e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", 368e0d60137SArtem B. Bityutskiy fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); 369f97117d1SArtem B. Bityutskiy 370f97117d1SArtem B. Bityutskiy ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); 371f97117d1SArtem B. Bityutskiy if (unlikely(ret)) 372f97117d1SArtem B. Bityutskiy return ret; 373f97117d1SArtem B. Bityutskiy 374f97117d1SArtem B. Bityutskiy /* If we now share a page with other nodes, mark either previous 375f97117d1SArtem B. Bityutskiy or next node REF_NORMAL, as appropriate. */ 376f97117d1SArtem B. Bityutskiy if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { 377f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *prev = frag_prev(newfrag); 378f97117d1SArtem B. Bityutskiy 379f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 380f97117d1SArtem B. Bityutskiy /* If we don't start at zero there's _always_ a previous */ 381f97117d1SArtem B. Bityutskiy if (prev->node) 382f97117d1SArtem B. Bityutskiy mark_ref_normal(prev->node->raw); 383f97117d1SArtem B. Bityutskiy } 384f97117d1SArtem B. Bityutskiy 385f97117d1SArtem B. Bityutskiy if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { 386f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(newfrag); 387f97117d1SArtem B. Bityutskiy 388f97117d1SArtem B. Bityutskiy if (next) { 389f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 390f97117d1SArtem B. Bityutskiy if (next->node) 391f97117d1SArtem B. Bityutskiy mark_ref_normal(next->node->raw); 392f97117d1SArtem B. Bityutskiy } 393f97117d1SArtem B. Bityutskiy } 394f97117d1SArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 3951e0da3cbSArtem B. Bityutskiy 396f97117d1SArtem B. Bityutskiy return 0; 397f97117d1SArtem B. Bityutskiy } 398f97117d1SArtem B. Bityutskiy 3991e0da3cbSArtem B. Bityutskiy /* 4001e0da3cbSArtem B. Bityutskiy * Check the data CRC of the node. 4011e0da3cbSArtem B. Bityutskiy * 4021e0da3cbSArtem B. Bityutskiy * Returns: 0 if the data CRC is correct; 4031e0da3cbSArtem B. Bityutskiy * 1 - if incorrect; 4041e0da3cbSArtem B. Bityutskiy * error code if an error occured. 4051e0da3cbSArtem B. Bityutskiy */ 4061e0da3cbSArtem B. Bityutskiy static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) 4071e0da3cbSArtem B. Bityutskiy { 4081e0da3cbSArtem B. Bityutskiy struct jffs2_raw_node_ref *ref = tn->fn->raw; 4091e0da3cbSArtem B. Bityutskiy int err = 0, pointed = 0; 4101e0da3cbSArtem B. Bityutskiy struct jffs2_eraseblock *jeb; 4111e0da3cbSArtem B. Bityutskiy unsigned char *buffer; 4121e0da3cbSArtem B. Bityutskiy uint32_t crc, ofs, retlen, len; 4131e0da3cbSArtem B. Bityutskiy 4141e0da3cbSArtem B. Bityutskiy BUG_ON(tn->csize == 0); 4151e0da3cbSArtem B. Bityutskiy 4161e0da3cbSArtem B. Bityutskiy /* Calculate how many bytes were already checked */ 4171e0da3cbSArtem B. Bityutskiy ofs = ref_offset(ref) + sizeof(struct jffs2_raw_inode); 4181e0da3cbSArtem B. Bityutskiy len = ofs - (ofs & (PAGE_CACHE_SIZE - 1)); 4191e0da3cbSArtem B. Bityutskiy len = c->wbuf_pagesize - len; 4201e0da3cbSArtem B. Bityutskiy 4211e0da3cbSArtem B. Bityutskiy if (len >= tn->csize) { 4221e0da3cbSArtem B. Bityutskiy JFFS2_DBG_READINODE("no need to check node at %#08x, data length %u, data starts at %#08x - it has already been checked.\n", 4231e0da3cbSArtem B. Bityutskiy ref_offset(ref), tn->csize, ofs); 4241e0da3cbSArtem B. Bityutskiy goto adj_acc; 4251e0da3cbSArtem B. Bityutskiy } 4261e0da3cbSArtem B. Bityutskiy 4271e0da3cbSArtem B. Bityutskiy ofs += len; 4281e0da3cbSArtem B. Bityutskiy len = tn->csize - len; 4291e0da3cbSArtem B. Bityutskiy 4301e0da3cbSArtem B. Bityutskiy JFFS2_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", 4311e0da3cbSArtem B. Bityutskiy ref_offset(ref), tn->csize, tn->partial_crc, tn->data_crc, ofs - len, ofs, len); 4321e0da3cbSArtem B. Bityutskiy 4331e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 4341e0da3cbSArtem B. Bityutskiy /* TODO: instead, incapsulate point() stuff to jffs2_flash_read(), 4351e0da3cbSArtem B. Bityutskiy * adding and jffs2_flash_read_end() interface. */ 4361e0da3cbSArtem B. Bityutskiy if (c->mtd->point) { 4371e0da3cbSArtem B. Bityutskiy err = c->mtd->point(c->mtd, ofs, len, &retlen, &buffer); 4381e0da3cbSArtem B. Bityutskiy if (!err && retlen < tn->csize) { 4391e0da3cbSArtem B. Bityutskiy JFFS2_WARNING("MTD point returned len too short: %u instead of %u.\n", retlen, tn->csize); 4401e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 4411e0da3cbSArtem B. Bityutskiy } else if (err) 4421e0da3cbSArtem B. Bityutskiy JFFS2_WARNING("MTD point failed: error code %d.\n", err); 4431e0da3cbSArtem B. Bityutskiy else 4441e0da3cbSArtem B. Bityutskiy pointed = 1; /* succefully pointed to device */ 4451e0da3cbSArtem B. Bityutskiy } 4461e0da3cbSArtem B. Bityutskiy #endif 4471e0da3cbSArtem B. Bityutskiy 4481e0da3cbSArtem B. Bityutskiy if (!pointed) { 4491e0da3cbSArtem B. Bityutskiy buffer = kmalloc(len, GFP_KERNEL); 4501e0da3cbSArtem B. Bityutskiy if (unlikely(!buffer)) 4511e0da3cbSArtem B. Bityutskiy return -ENOMEM; 4521e0da3cbSArtem B. Bityutskiy 4531e0da3cbSArtem B. Bityutskiy /* TODO: this is very frequent pattern, make it a separate 4541e0da3cbSArtem B. Bityutskiy * routine */ 4551e0da3cbSArtem B. Bityutskiy err = jffs2_flash_read(c, ofs, len, &retlen, buffer); 4561e0da3cbSArtem B. Bityutskiy if (err) { 4571e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("can not read %d bytes from 0x%08x, error code: %d.\n", len, ofs, err); 4581e0da3cbSArtem B. Bityutskiy goto free_out; 4591e0da3cbSArtem B. Bityutskiy } 4601e0da3cbSArtem B. Bityutskiy 4611e0da3cbSArtem B. Bityutskiy if (retlen != len) { 4621e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("short read at %#08x: %d instead of %d.\n", ofs, retlen, len); 4631e0da3cbSArtem B. Bityutskiy err = -EIO; 4641e0da3cbSArtem B. Bityutskiy goto free_out; 4651e0da3cbSArtem B. Bityutskiy } 4661e0da3cbSArtem B. Bityutskiy } 4671e0da3cbSArtem B. Bityutskiy 4681e0da3cbSArtem B. Bityutskiy /* Continue calculating CRC */ 4691e0da3cbSArtem B. Bityutskiy crc = crc32(tn->partial_crc, buffer, len); 4701e0da3cbSArtem B. Bityutskiy if(!pointed) 4711e0da3cbSArtem B. Bityutskiy kfree(buffer); 4721e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 4731e0da3cbSArtem B. Bityutskiy else 4741e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 4751e0da3cbSArtem B. Bityutskiy #endif 4761e0da3cbSArtem B. Bityutskiy 4771e0da3cbSArtem B. Bityutskiy if (crc != tn->data_crc) { 4781e0da3cbSArtem B. Bityutskiy JFFS2_NOTICE("drong data CRC in data node at 0x%08x: read %#08x, calculated %#08x.\n", 4791e0da3cbSArtem B. Bityutskiy ofs, tn->data_crc, crc); 4801e0da3cbSArtem B. Bityutskiy return 1; 4811e0da3cbSArtem B. Bityutskiy } 4821e0da3cbSArtem B. Bityutskiy 4831e0da3cbSArtem B. Bityutskiy adj_acc: 4841e0da3cbSArtem B. Bityutskiy jeb = &c->blocks[ref->flash_offset / c->sector_size]; 4851e0da3cbSArtem B. Bityutskiy len = ref_totlen(c, jeb, ref); 4861e0da3cbSArtem B. Bityutskiy 4871e0da3cbSArtem B. Bityutskiy /* 4881e0da3cbSArtem B. Bityutskiy * Mark the node as having been checked and fix the 4891e0da3cbSArtem B. Bityutskiy * accounting accordingly. 4901e0da3cbSArtem B. Bityutskiy */ 4911e0da3cbSArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 4921e0da3cbSArtem B. Bityutskiy jeb->used_size += len; 4931e0da3cbSArtem B. Bityutskiy jeb->unchecked_size -= len; 4941e0da3cbSArtem B. Bityutskiy c->used_size += len; 4951e0da3cbSArtem B. Bityutskiy c->unchecked_size -= len; 4961e0da3cbSArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 4971e0da3cbSArtem B. Bityutskiy 4981e0da3cbSArtem B. Bityutskiy return 0; 4991e0da3cbSArtem B. Bityutskiy 5001e0da3cbSArtem B. Bityutskiy free_out: 5011e0da3cbSArtem B. Bityutskiy if(!pointed) 5021e0da3cbSArtem B. Bityutskiy kfree(buffer); 5031e0da3cbSArtem B. Bityutskiy #ifndef __ECOS 5041e0da3cbSArtem B. Bityutskiy else 5051e0da3cbSArtem B. Bityutskiy c->mtd->unpoint(c->mtd, buffer, ofs, len); 5061e0da3cbSArtem B. Bityutskiy #endif 5071e0da3cbSArtem B. Bityutskiy return err; 5081e0da3cbSArtem B. Bityutskiy } 5091e0da3cbSArtem B. Bityutskiy 5101e0da3cbSArtem B. Bityutskiy /* 5111e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_add_older_frag_to_fragtree(). 5121e0da3cbSArtem B. Bityutskiy * 5131e0da3cbSArtem B. Bityutskiy * Checks the node if we are in the checking stage. 5141e0da3cbSArtem B. Bityutskiy */ 5151e0da3cbSArtem B. Bityutskiy static inline int check_node(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_tmp_dnode_info *tn) 5161e0da3cbSArtem B. Bityutskiy { 5171e0da3cbSArtem B. Bityutskiy int ret; 5181e0da3cbSArtem B. Bityutskiy 5191e0da3cbSArtem B. Bityutskiy BUG_ON(ref_obsolete(tn->fn->raw)); 5201e0da3cbSArtem B. Bityutskiy 5211e0da3cbSArtem B. Bityutskiy /* We only check the data CRC of unchecked nodes */ 5221e0da3cbSArtem B. Bityutskiy if (ref_flags(tn->fn->raw) != REF_UNCHECKED) 5231e0da3cbSArtem B. Bityutskiy return 0; 5241e0da3cbSArtem B. Bityutskiy 5251e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("check node %u-%u, phys offs %#08x.\n", 5261e0da3cbSArtem B. Bityutskiy tn->fn->ofs, tn->fn->ofs + tn->fn->size, 5271e0da3cbSArtem B. Bityutskiy ref_offset(tn->fn->raw)); 5281e0da3cbSArtem B. Bityutskiy 5291e0da3cbSArtem B. Bityutskiy ret = check_node_data(c, tn); 5301e0da3cbSArtem B. Bityutskiy if (unlikely(ret < 0)) { 5311e0da3cbSArtem B. Bityutskiy JFFS2_ERROR("check_node_data() returned error: %d.\n", 5321e0da3cbSArtem B. Bityutskiy ret); 5331e0da3cbSArtem B. Bityutskiy } else if (unlikely(ret > 0)) { 5341e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("CRC error, mark it obsolete.\n"); 5351e0da3cbSArtem B. Bityutskiy jffs2_mark_node_obsolete(c, tn->fn->raw); 5361e0da3cbSArtem B. Bityutskiy } 5371e0da3cbSArtem B. Bityutskiy 5381e0da3cbSArtem B. Bityutskiy return ret; 5391e0da3cbSArtem B. Bityutskiy } 5401e0da3cbSArtem B. Bityutskiy 5411e0da3cbSArtem B. Bityutskiy /* 5421e0da3cbSArtem B. Bityutskiy * Helper function for jffs2_add_older_frag_to_fragtree(). 5431e0da3cbSArtem B. Bityutskiy * 5441e0da3cbSArtem B. Bityutskiy * Called when the new fragment that is being inserted 5451e0da3cbSArtem B. Bityutskiy * splits a hole fragment. 5461e0da3cbSArtem B. Bityutskiy */ 5471e0da3cbSArtem B. Bityutskiy static int split_hole(struct jffs2_sb_info *c, struct rb_root *root, 5481e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *newfrag, struct jffs2_node_frag *hole) 5491e0da3cbSArtem B. Bityutskiy { 5501e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("fragment %#04x-%#04x splits the hole %#04x-%#04x\n", 5511e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size, hole->ofs, hole->ofs + hole->size); 5521e0da3cbSArtem B. Bityutskiy 5531e0da3cbSArtem B. Bityutskiy if (hole->ofs == newfrag->ofs) { 5541e0da3cbSArtem B. Bityutskiy /* 5551e0da3cbSArtem B. Bityutskiy * Well, the new fragment actually starts at the same offset as 5561e0da3cbSArtem B. Bityutskiy * the hole. 5571e0da3cbSArtem B. Bityutskiy */ 5581e0da3cbSArtem B. Bityutskiy if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) { 5591e0da3cbSArtem B. Bityutskiy /* 5601e0da3cbSArtem B. Bityutskiy * We replace the overlapped left part of the hole by 5611e0da3cbSArtem B. Bityutskiy * the new node. 5621e0da3cbSArtem B. Bityutskiy */ 5631e0da3cbSArtem B. Bityutskiy 5641e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert fragment %#04x-%#04x and cut the left part of the hole\n", 5651e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 5661e0da3cbSArtem B. Bityutskiy rb_replace_node(&hole->rb, &newfrag->rb, root); 5671e0da3cbSArtem B. Bityutskiy 5681e0da3cbSArtem B. Bityutskiy hole->ofs += newfrag->size; 5691e0da3cbSArtem B. Bityutskiy hole->size -= newfrag->size; 5701e0da3cbSArtem B. Bityutskiy 5711e0da3cbSArtem B. Bityutskiy /* 5721e0da3cbSArtem B. Bityutskiy * We know that 'hole' should be the right hand 5731e0da3cbSArtem B. Bityutskiy * fragment. 5741e0da3cbSArtem B. Bityutskiy */ 5751e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(hole, newfrag); 5761e0da3cbSArtem B. Bityutskiy rb_insert_color(&hole->rb, root); 5771e0da3cbSArtem B. Bityutskiy } else { 5781e0da3cbSArtem B. Bityutskiy /* 5791e0da3cbSArtem B. Bityutskiy * Ah, the new fragment is of the same size as the hole. 5801e0da3cbSArtem B. Bityutskiy * Relace the hole by it. 5811e0da3cbSArtem B. Bityutskiy */ 5821e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert fragment %#04x-%#04x and overwrite hole\n", 5831e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 5841e0da3cbSArtem B. Bityutskiy rb_replace_node(&hole->rb, &newfrag->rb, root); 5851e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(hole); 5861e0da3cbSArtem B. Bityutskiy } 5871e0da3cbSArtem B. Bityutskiy } else { 5881e0da3cbSArtem B. Bityutskiy /* The new fragment lefts some hole space at the left */ 5891e0da3cbSArtem B. Bityutskiy 5901e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag * newfrag2 = NULL; 5911e0da3cbSArtem B. Bityutskiy 5921e0da3cbSArtem B. Bityutskiy if (hole->ofs + hole->size > newfrag->ofs + newfrag->size) { 5931e0da3cbSArtem B. Bityutskiy /* The new frag also lefts some space at the right */ 5941e0da3cbSArtem B. Bityutskiy newfrag2 = new_fragment(NULL, newfrag->ofs + 5951e0da3cbSArtem B. Bityutskiy newfrag->size, hole->ofs + hole->size 5961e0da3cbSArtem B. Bityutskiy - newfrag->ofs - newfrag->size); 5971e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag2)) { 5981e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 5991e0da3cbSArtem B. Bityutskiy return -ENOMEM; 6001e0da3cbSArtem B. Bityutskiy } 6011e0da3cbSArtem B. Bityutskiy } 6021e0da3cbSArtem B. Bityutskiy 6031e0da3cbSArtem B. Bityutskiy hole->size = newfrag->ofs - hole->ofs; 6041e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("left the hole %#04x-%#04x at the left and inserd fragment %#04x-%#04x\n", 6051e0da3cbSArtem B. Bityutskiy hole->ofs, hole->ofs + hole->size, newfrag->ofs, newfrag->ofs + newfrag->size); 6061e0da3cbSArtem B. Bityutskiy 6071e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, hole); 6081e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 6091e0da3cbSArtem B. Bityutskiy 6101e0da3cbSArtem B. Bityutskiy if (newfrag2) { 6111e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("left the hole %#04x-%#04x at the right\n", 6121e0da3cbSArtem B. Bityutskiy newfrag2->ofs, newfrag2->ofs + newfrag2->size); 6131e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 6141e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, root); 6151e0da3cbSArtem B. Bityutskiy } 6161e0da3cbSArtem B. Bityutskiy } 6171e0da3cbSArtem B. Bityutskiy 6181e0da3cbSArtem B. Bityutskiy return 0; 6191e0da3cbSArtem B. Bityutskiy } 6201e0da3cbSArtem B. Bityutskiy 6211e0da3cbSArtem B. Bityutskiy /* 6221e0da3cbSArtem B. Bityutskiy * This function is used when we build inode. It expects the nodes are passed 6231e0da3cbSArtem B. Bityutskiy * in the decreasing version order. The whole point of this is to improve the 6241e0da3cbSArtem B. Bityutskiy * inodes checking on NAND: we check the nodes' data CRC only when they are not 6251e0da3cbSArtem B. Bityutskiy * obsoleted. Previously, add_frag_to_fragtree() function was used and 6261e0da3cbSArtem B. Bityutskiy * nodes were passed to it in the increasing version ordes and CRCs of all 6271e0da3cbSArtem B. Bityutskiy * nodes were checked. 6281e0da3cbSArtem B. Bityutskiy * 6291e0da3cbSArtem B. Bityutskiy * Note: tn->fn->size shouldn't be zero. 6301e0da3cbSArtem B. Bityutskiy * 6311e0da3cbSArtem B. Bityutskiy * Returns 0 if the node was inserted 6321e0da3cbSArtem B. Bityutskiy * 1 if it wasn't inserted (since it is obsolete) 6331e0da3cbSArtem B. Bityutskiy * < 0 an if error occured 6341e0da3cbSArtem B. Bityutskiy */ 6351e0da3cbSArtem B. Bityutskiy int jffs2_add_older_frag_to_fragtree(struct jffs2_sb_info *c, struct jffs2_inode_info *f, 6361e0da3cbSArtem B. Bityutskiy struct jffs2_tmp_dnode_info *tn) 6371e0da3cbSArtem B. Bityutskiy { 6381e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *this, *newfrag; 6391e0da3cbSArtem B. Bityutskiy uint32_t lastend; 6401e0da3cbSArtem B. Bityutskiy struct jffs2_full_dnode *fn = tn->fn; 6411e0da3cbSArtem B. Bityutskiy struct rb_root *root = &f->fragtree; 6421e0da3cbSArtem B. Bityutskiy uint32_t fn_size = fn->size, fn_ofs = fn->ofs; 6431e0da3cbSArtem B. Bityutskiy int err, checked = 0; 6441e0da3cbSArtem B. Bityutskiy int ref_flag; 6451e0da3cbSArtem B. Bityutskiy 6461e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("insert fragment %#04x-%#04x\n", fn_ofs, fn_ofs + fn_size); 6471e0da3cbSArtem B. Bityutskiy 6481e0da3cbSArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 6491e0da3cbSArtem B. Bityutskiy this = jffs2_lookup_node_frag(root, fn_ofs); 6501e0da3cbSArtem B. Bityutskiy if (this) 6511e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("'this' found %#04x-%#04x (%s)\n", this->ofs, this->ofs + this->size, this->node ? "data" : "hole"); 6521e0da3cbSArtem B. Bityutskiy 6531e0da3cbSArtem B. Bityutskiy if (this) 6541e0da3cbSArtem B. Bityutskiy lastend = this->ofs + this->size; 6551e0da3cbSArtem B. Bityutskiy else 6561e0da3cbSArtem B. Bityutskiy lastend = 0; 6571e0da3cbSArtem B. Bityutskiy 6581e0da3cbSArtem B. Bityutskiy /* Detect the preliminary type of node */ 6591e0da3cbSArtem B. Bityutskiy if (fn->size >= PAGE_CACHE_SIZE) 6601e0da3cbSArtem B. Bityutskiy ref_flag = REF_PRISTINE; 6611e0da3cbSArtem B. Bityutskiy else 6621e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 6631e0da3cbSArtem B. Bityutskiy 6641e0da3cbSArtem B. Bityutskiy /* See if we ran off the end of the root */ 6651e0da3cbSArtem B. Bityutskiy if (lastend <= fn_ofs) { 6661e0da3cbSArtem B. Bityutskiy /* We did */ 6671e0da3cbSArtem B. Bityutskiy 6681e0da3cbSArtem B. Bityutskiy /* 6691e0da3cbSArtem B. Bityutskiy * We are going to insert the new node into the 6701e0da3cbSArtem B. Bityutskiy * fragment tree, so check it. 6711e0da3cbSArtem B. Bityutskiy */ 6721e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 6731e0da3cbSArtem B. Bityutskiy if (err != 0) 6741e0da3cbSArtem B. Bityutskiy return err; 6751e0da3cbSArtem B. Bityutskiy 6761e0da3cbSArtem B. Bityutskiy fn->frags = 1; 6771e0da3cbSArtem B. Bityutskiy 6781e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 6791e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 6801e0da3cbSArtem B. Bityutskiy return -ENOMEM; 6811e0da3cbSArtem B. Bityutskiy 6821e0da3cbSArtem B. Bityutskiy err = no_overlapping_node(c, root, newfrag, this, lastend); 6831e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) { 6841e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 6851e0da3cbSArtem B. Bityutskiy return err; 6861e0da3cbSArtem B. Bityutskiy } 6871e0da3cbSArtem B. Bityutskiy 6881e0da3cbSArtem B. Bityutskiy goto out_ok; 6891e0da3cbSArtem B. Bityutskiy } 6901e0da3cbSArtem B. Bityutskiy 6911e0da3cbSArtem B. Bityutskiy fn->frags = 0; 6921e0da3cbSArtem B. Bityutskiy 6931e0da3cbSArtem B. Bityutskiy while (1) { 6941e0da3cbSArtem B. Bityutskiy /* 6951e0da3cbSArtem B. Bityutskiy * Here we have: 6961e0da3cbSArtem B. Bityutskiy * fn_ofs < this->ofs + this->size && fn_ofs >= this->ofs. 6971e0da3cbSArtem B. Bityutskiy * 6981e0da3cbSArtem B. Bityutskiy * Remember, 'this' has higher version, any non-hole node 6991e0da3cbSArtem B. Bityutskiy * which is already in the fragtree is newer then the newly 7001e0da3cbSArtem B. Bityutskiy * inserted. 7011e0da3cbSArtem B. Bityutskiy */ 7021e0da3cbSArtem B. Bityutskiy if (!this->node) { 7031e0da3cbSArtem B. Bityutskiy /* 7041e0da3cbSArtem B. Bityutskiy * 'this' is the hole fragment, so at least the 7051e0da3cbSArtem B. Bityutskiy * beginning of the new fragment is valid. 7061e0da3cbSArtem B. Bityutskiy */ 7071e0da3cbSArtem B. Bityutskiy 7081e0da3cbSArtem B. Bityutskiy /* 7091e0da3cbSArtem B. Bityutskiy * We are going to insert the new node into the 7101e0da3cbSArtem B. Bityutskiy * fragment tree, so check it. 7111e0da3cbSArtem B. Bityutskiy */ 7121e0da3cbSArtem B. Bityutskiy if (!checked) { 7131e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 7141e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) 7151e0da3cbSArtem B. Bityutskiy return err; 7161e0da3cbSArtem B. Bityutskiy checked = 1; 7171e0da3cbSArtem B. Bityutskiy } 7181e0da3cbSArtem B. Bityutskiy 7191e0da3cbSArtem B. Bityutskiy if (this->ofs + this->size >= fn_ofs + fn_size) { 7201e0da3cbSArtem B. Bityutskiy /* We split the hole on two parts */ 7211e0da3cbSArtem B. Bityutskiy 7221e0da3cbSArtem B. Bityutskiy fn->frags += 1; 7231e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 7241e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 7251e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7261e0da3cbSArtem B. Bityutskiy 7271e0da3cbSArtem B. Bityutskiy err = split_hole(c, root, newfrag, this); 7281e0da3cbSArtem B. Bityutskiy if (unlikely(err)) 7291e0da3cbSArtem B. Bityutskiy return err; 7301e0da3cbSArtem B. Bityutskiy goto out_ok; 7311e0da3cbSArtem B. Bityutskiy } 7321e0da3cbSArtem B. Bityutskiy 7331e0da3cbSArtem B. Bityutskiy /* 7341e0da3cbSArtem B. Bityutskiy * The beginning of the new fragment is valid since it 7351e0da3cbSArtem B. Bityutskiy * overlaps the hole node. 7361e0da3cbSArtem B. Bityutskiy */ 7371e0da3cbSArtem B. Bityutskiy 7381e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 7391e0da3cbSArtem B. Bityutskiy 7401e0da3cbSArtem B. Bityutskiy fn->frags += 1; 7411e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, 7421e0da3cbSArtem B. Bityutskiy this->ofs + this->size - fn_ofs); 7431e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 7441e0da3cbSArtem B. Bityutskiy return -ENOMEM; 7451e0da3cbSArtem B. Bityutskiy 7461e0da3cbSArtem B. Bityutskiy if (fn_ofs == this->ofs) { 7471e0da3cbSArtem B. Bityutskiy /* 7481e0da3cbSArtem B. Bityutskiy * The new node starts at the same offset as 7491e0da3cbSArtem B. Bityutskiy * the hole and supersieds the hole. 7501e0da3cbSArtem B. Bityutskiy */ 7511e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("add the new fragment instead of hole %#04x-%#04x, refcnt %d\n", 7521e0da3cbSArtem B. Bityutskiy fn_ofs, fn_ofs + this->ofs + this->size - fn_ofs, fn->frags); 7531e0da3cbSArtem B. Bityutskiy 7541e0da3cbSArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, root); 7551e0da3cbSArtem B. Bityutskiy jffs2_free_node_frag(this); 7561e0da3cbSArtem B. Bityutskiy } else { 7571e0da3cbSArtem B. Bityutskiy /* 7581e0da3cbSArtem B. Bityutskiy * The hole becomes shorter as its right part 7591e0da3cbSArtem B. Bityutskiy * is supersieded by the new fragment. 7601e0da3cbSArtem B. Bityutskiy */ 7611e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("reduce size of hole %#04x-%#04x to %#04x-%#04x\n", 7621e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->ofs, this->ofs + this->size - newfrag->size); 7631e0da3cbSArtem B. Bityutskiy 7641e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("add new fragment %#04x-%#04x, refcnt %d\n", fn_ofs, 7651e0da3cbSArtem B. Bityutskiy fn_ofs + this->ofs + this->size - fn_ofs, fn->frags); 7661e0da3cbSArtem B. Bityutskiy 7671e0da3cbSArtem B. Bityutskiy this->size -= newfrag->size; 7681e0da3cbSArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 7691e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 7701e0da3cbSArtem B. Bityutskiy } 7711e0da3cbSArtem B. Bityutskiy 7721e0da3cbSArtem B. Bityutskiy fn_ofs += newfrag->size; 7731e0da3cbSArtem B. Bityutskiy fn_size -= newfrag->size; 7741e0da3cbSArtem B. Bityutskiy this = rb_entry(rb_next(&newfrag->rb), 7751e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag, rb); 7761e0da3cbSArtem B. Bityutskiy 7771e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("switch to the next 'this' fragment: %#04x-%#04x %s\n", 7781e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)"); 7791e0da3cbSArtem B. Bityutskiy } 7801e0da3cbSArtem B. Bityutskiy 7811e0da3cbSArtem B. Bityutskiy /* 7821e0da3cbSArtem B. Bityutskiy * 'This' node is not the hole so it obsoletes the new fragment 7831e0da3cbSArtem B. Bityutskiy * either fully or partially. 7841e0da3cbSArtem B. Bityutskiy */ 7851e0da3cbSArtem B. Bityutskiy if (this->ofs + this->size >= fn_ofs + fn_size) { 7861e0da3cbSArtem B. Bityutskiy /* The new node is obsolete, drop it */ 7871e0da3cbSArtem B. Bityutskiy if (fn->frags == 0) { 7881e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("%#04x-%#04x is obsolete, mark it obsolete\n", fn_ofs, fn_ofs + fn_size); 7891e0da3cbSArtem B. Bityutskiy ref_flag = REF_OBSOLETE; 7901e0da3cbSArtem B. Bityutskiy } 7911e0da3cbSArtem B. Bityutskiy goto out_ok; 7921e0da3cbSArtem B. Bityutskiy } else { 7931e0da3cbSArtem B. Bityutskiy struct jffs2_node_frag *new_this; 7941e0da3cbSArtem B. Bityutskiy 7951e0da3cbSArtem B. Bityutskiy /* 'This' node obsoletes the beginning of the new node */ 7961e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("the beginning %#04x-%#04x is obsolete\n", fn_ofs, this->ofs + this->size); 7971e0da3cbSArtem B. Bityutskiy 7981e0da3cbSArtem B. Bityutskiy ref_flag = REF_NORMAL; 7991e0da3cbSArtem B. Bityutskiy 8001e0da3cbSArtem B. Bityutskiy fn_size -= this->ofs + this->size - fn_ofs; 8011e0da3cbSArtem B. Bityutskiy fn_ofs = this->ofs + this->size; 8021e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("now considering %#04x-%#04x\n", fn_ofs, fn_ofs + fn_size); 8031e0da3cbSArtem B. Bityutskiy 8041e0da3cbSArtem B. Bityutskiy new_this = rb_entry(rb_next(&this->rb), struct jffs2_node_frag, rb); 8051e0da3cbSArtem B. Bityutskiy if (!new_this) { 8061e0da3cbSArtem B. Bityutskiy /* 8071e0da3cbSArtem B. Bityutskiy * There is no next fragment. Add the rest of 8081e0da3cbSArtem B. Bityutskiy * the new node as the right-hand child. 8091e0da3cbSArtem B. Bityutskiy */ 8101e0da3cbSArtem B. Bityutskiy if (!checked) { 8111e0da3cbSArtem B. Bityutskiy err = check_node(c, f, tn); 8121e0da3cbSArtem B. Bityutskiy if (unlikely(err != 0)) 8131e0da3cbSArtem B. Bityutskiy return err; 8141e0da3cbSArtem B. Bityutskiy checked = 1; 8151e0da3cbSArtem B. Bityutskiy } 8161e0da3cbSArtem B. Bityutskiy 8171e0da3cbSArtem B. Bityutskiy fn->frags += 1; 8181e0da3cbSArtem B. Bityutskiy newfrag = new_fragment(fn, fn_ofs, fn_size); 8191e0da3cbSArtem B. Bityutskiy if (unlikely(!newfrag)) 8201e0da3cbSArtem B. Bityutskiy return -ENOMEM; 8211e0da3cbSArtem B. Bityutskiy 8221e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("there are no more fragments, insert %#04x-%#04x\n", 8231e0da3cbSArtem B. Bityutskiy newfrag->ofs, newfrag->ofs + newfrag->size); 8241e0da3cbSArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 8251e0da3cbSArtem B. Bityutskiy rb_insert_color(&newfrag->rb, root); 8261e0da3cbSArtem B. Bityutskiy goto out_ok; 8271e0da3cbSArtem B. Bityutskiy } else { 8281e0da3cbSArtem B. Bityutskiy this = new_this; 8291e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("switch to the next 'this' fragment: %#04x-%#04x %s\n", 8301e0da3cbSArtem B. Bityutskiy this->ofs, this->ofs + this->size, this->node ? "(data)" : "(hole)"); 8311e0da3cbSArtem B. Bityutskiy } 8321e0da3cbSArtem B. Bityutskiy } 8331e0da3cbSArtem B. Bityutskiy } 8341e0da3cbSArtem B. Bityutskiy 8351e0da3cbSArtem B. Bityutskiy out_ok: 8361e0da3cbSArtem B. Bityutskiy BUG_ON(fn->size < PAGE_CACHE_SIZE && ref_flag == REF_PRISTINE); 8371e0da3cbSArtem B. Bityutskiy 8381e0da3cbSArtem B. Bityutskiy if (ref_flag == REF_OBSOLETE) { 8391e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("the node is obsolete now\n"); 8401e0da3cbSArtem B. Bityutskiy /* jffs2_mark_node_obsolete() will adjust space accounting */ 8411e0da3cbSArtem B. Bityutskiy jffs2_mark_node_obsolete(c, fn->raw); 8421e0da3cbSArtem B. Bityutskiy return 1; 8431e0da3cbSArtem B. Bityutskiy } 8441e0da3cbSArtem B. Bityutskiy 8451e0da3cbSArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("the node is \"%s\" now\n", ref_flag == REF_NORMAL ? "REF_NORMAL" : "REF_PRISTINE"); 8461e0da3cbSArtem B. Bityutskiy 8471e0da3cbSArtem B. Bityutskiy /* Space accounting was adjusted at check_node_data() */ 8481e0da3cbSArtem B. Bityutskiy spin_lock(&c->erase_completion_lock); 8491e0da3cbSArtem B. Bityutskiy fn->raw->flash_offset = ref_offset(fn->raw) | ref_flag; 8501e0da3cbSArtem B. Bityutskiy spin_unlock(&c->erase_completion_lock); 8511e0da3cbSArtem B. Bityutskiy 8521e0da3cbSArtem B. Bityutskiy return 0; 8531e0da3cbSArtem B. Bityutskiy } 8541da177e4SLinus Torvalds 8551da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) 8561da177e4SLinus Torvalds { 8571da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 8581da177e4SLinus Torvalds ic->state = state; 8591da177e4SLinus Torvalds wake_up(&c->inocache_wq); 8601da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 8611da177e4SLinus Torvalds } 8621da177e4SLinus Torvalds 8631da177e4SLinus Torvalds /* During mount, this needs no locking. During normal operation, its 8641da177e4SLinus Torvalds callers want to do other stuff while still holding the inocache_lock. 8651da177e4SLinus Torvalds Rather than introducing special case get_ino_cache functions or 8661da177e4SLinus Torvalds callbacks, we just let the caller do the locking itself. */ 8671da177e4SLinus Torvalds 8681da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 8691da177e4SLinus Torvalds { 8701da177e4SLinus Torvalds struct jffs2_inode_cache *ret; 8711da177e4SLinus Torvalds 8721da177e4SLinus Torvalds ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; 8731da177e4SLinus Torvalds while (ret && ret->ino < ino) { 8741da177e4SLinus Torvalds ret = ret->next; 8751da177e4SLinus Torvalds } 8761da177e4SLinus Torvalds 8771da177e4SLinus Torvalds if (ret && ret->ino != ino) 8781da177e4SLinus Torvalds ret = NULL; 8791da177e4SLinus Torvalds 8801da177e4SLinus Torvalds return ret; 8811da177e4SLinus Torvalds } 8821da177e4SLinus Torvalds 8831da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) 8841da177e4SLinus Torvalds { 8851da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 8867d27c814SThomas Gleixner 8871da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 8887d200960SDavid Woodhouse if (!new->ino) 8897d200960SDavid Woodhouse new->ino = ++c->highest_ino; 8907d200960SDavid Woodhouse 891e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("add %p (ino #%u)\n", new, new->ino); 8921da177e4SLinus Torvalds 8931da177e4SLinus Torvalds prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; 8941da177e4SLinus Torvalds 8951da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < new->ino) { 8961da177e4SLinus Torvalds prev = &(*prev)->next; 8971da177e4SLinus Torvalds } 8981da177e4SLinus Torvalds new->next = *prev; 8991da177e4SLinus Torvalds *prev = new; 9001da177e4SLinus Torvalds 9011da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 9021da177e4SLinus Torvalds } 9031da177e4SLinus Torvalds 9041da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) 9051da177e4SLinus Torvalds { 9061da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 907e0d60137SArtem B. Bityutskiy 908e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("del %p (ino #%u)\n", old, old->ino); 9091da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 9101da177e4SLinus Torvalds 9111da177e4SLinus Torvalds prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; 9121da177e4SLinus Torvalds 9131da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < old->ino) { 9141da177e4SLinus Torvalds prev = &(*prev)->next; 9151da177e4SLinus Torvalds } 9161da177e4SLinus Torvalds if ((*prev) == old) { 9171da177e4SLinus Torvalds *prev = old->next; 9181da177e4SLinus Torvalds } 9191da177e4SLinus Torvalds 92067e345d1SDavid Woodhouse /* Free it now unless it's in READING or CLEARING state, which 92167e345d1SDavid Woodhouse are the transitions upon read_inode() and clear_inode(). The 92267e345d1SDavid Woodhouse rest of the time we know nobody else is looking at it, and 92367e345d1SDavid Woodhouse if it's held by read_inode() or clear_inode() they'll free it 92467e345d1SDavid Woodhouse for themselves. */ 92567e345d1SDavid Woodhouse if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) 92667e345d1SDavid Woodhouse jffs2_free_inode_cache(old); 92767e345d1SDavid Woodhouse 9281da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 9291da177e4SLinus Torvalds } 9301da177e4SLinus Torvalds 9311da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c) 9321da177e4SLinus Torvalds { 9331da177e4SLinus Torvalds int i; 9341da177e4SLinus Torvalds struct jffs2_inode_cache *this, *next; 9351da177e4SLinus Torvalds 9361da177e4SLinus Torvalds for (i=0; i<INOCACHE_HASHSIZE; i++) { 9371da177e4SLinus Torvalds this = c->inocache_list[i]; 9381da177e4SLinus Torvalds while (this) { 9391da177e4SLinus Torvalds next = this->next; 9401da177e4SLinus Torvalds jffs2_free_inode_cache(this); 9411da177e4SLinus Torvalds this = next; 9421da177e4SLinus Torvalds } 9431da177e4SLinus Torvalds c->inocache_list[i] = NULL; 9441da177e4SLinus Torvalds } 9451da177e4SLinus Torvalds } 9461da177e4SLinus Torvalds 9471da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) 9481da177e4SLinus Torvalds { 9491da177e4SLinus Torvalds int i; 9501da177e4SLinus Torvalds struct jffs2_raw_node_ref *this, *next; 9511da177e4SLinus Torvalds 9521da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 9531da177e4SLinus Torvalds this = c->blocks[i].first_node; 9541da177e4SLinus Torvalds while(this) { 9551da177e4SLinus Torvalds next = this->next_phys; 9561da177e4SLinus Torvalds jffs2_free_raw_node_ref(this); 9571da177e4SLinus Torvalds this = next; 9581da177e4SLinus Torvalds } 9591da177e4SLinus Torvalds c->blocks[i].first_node = c->blocks[i].last_node = NULL; 9601da177e4SLinus Torvalds } 9611da177e4SLinus Torvalds } 9621da177e4SLinus Torvalds 9631da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) 9641da177e4SLinus Torvalds { 9651da177e4SLinus Torvalds /* The common case in lookup is that there will be a node 9661da177e4SLinus Torvalds which precisely matches. So we go looking for that first */ 9671da177e4SLinus Torvalds struct rb_node *next; 9681da177e4SLinus Torvalds struct jffs2_node_frag *prev = NULL; 9691da177e4SLinus Torvalds struct jffs2_node_frag *frag = NULL; 9701da177e4SLinus Torvalds 971e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("root %p, offset %d\n", fragtree, offset); 9721da177e4SLinus Torvalds 9731da177e4SLinus Torvalds next = fragtree->rb_node; 9741da177e4SLinus Torvalds 9751da177e4SLinus Torvalds while(next) { 9761da177e4SLinus Torvalds frag = rb_entry(next, struct jffs2_node_frag, rb); 9771da177e4SLinus Torvalds 978e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag %#04x-%#04x (%p). left %p, right %p\n", 979e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag, frag->rb.rb_left, frag->rb.rb_right); 9801da177e4SLinus Torvalds if (frag->ofs + frag->size <= offset) { 981e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag %#04x-%#04x, before the region we care about\n", 982e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 9831da177e4SLinus Torvalds /* Remember the closest smaller match on the way down */ 9841da177e4SLinus Torvalds if (!prev || frag->ofs > prev->ofs) 9851da177e4SLinus Torvalds prev = frag; 9861da177e4SLinus Torvalds next = frag->rb.rb_right; 9871da177e4SLinus Torvalds } else if (frag->ofs > offset) { 988e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag %#04x-%#04x, after the region we care about\n", 989e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 9901da177e4SLinus Torvalds next = frag->rb.rb_left; 9911da177e4SLinus Torvalds } else { 992e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning frag %#04x-%#04x, matched\n", 993e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 9941da177e4SLinus Torvalds return frag; 9951da177e4SLinus Torvalds } 9961da177e4SLinus Torvalds } 9971da177e4SLinus Torvalds 9981da177e4SLinus Torvalds /* Exact match not found. Go back up looking at each parent, 9991da177e4SLinus Torvalds and return the closest smaller one */ 10001da177e4SLinus Torvalds 10011da177e4SLinus Torvalds if (prev) 1002e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("no match. Returning frag %#04x-%#04x, closest previous\n", 1003e0d60137SArtem B. Bityutskiy prev->ofs, prev->ofs+prev->size); 10041da177e4SLinus Torvalds else 1005e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning NULL, empty fragtree\n"); 10061da177e4SLinus Torvalds 10071da177e4SLinus Torvalds return prev; 10081da177e4SLinus Torvalds } 10091da177e4SLinus Torvalds 10101da177e4SLinus Torvalds /* Pass 'c' argument to indicate that nodes should be marked obsolete as 10111da177e4SLinus Torvalds they're killed. */ 10121da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) 10131da177e4SLinus Torvalds { 10141da177e4SLinus Torvalds struct jffs2_node_frag *frag; 10151da177e4SLinus Torvalds struct jffs2_node_frag *parent; 10161da177e4SLinus Torvalds 10171da177e4SLinus Torvalds if (!root->rb_node) 10181da177e4SLinus Torvalds return; 10191da177e4SLinus Torvalds 1020e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("killing\n"); 10211da177e4SLinus Torvalds 1022e0d60137SArtem B. Bityutskiy frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); 10231da177e4SLinus Torvalds while(frag) { 10241da177e4SLinus Torvalds if (frag->rb.rb_left) { 1025e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag (%p) %#04x-%#04x\n", 1026e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 10271da177e4SLinus Torvalds frag = frag_left(frag); 10281da177e4SLinus Torvalds continue; 10291da177e4SLinus Torvalds } 10301da177e4SLinus Torvalds if (frag->rb.rb_right) { 1031e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag (%p) %#04x-%#04x\n", 1032e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 10331da177e4SLinus Torvalds frag = frag_right(frag); 10341da177e4SLinus Torvalds continue; 10351da177e4SLinus Torvalds } 10361da177e4SLinus Torvalds 1037e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("frag %#04x-%#04x: node %p, frags %d\n", 1038e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag->node, frag->node?frag->node->frags:0); 10391da177e4SLinus Torvalds 10401da177e4SLinus Torvalds if (frag->node && !(--frag->node->frags)) { 10411da177e4SLinus Torvalds /* Not a hole, and it's the final remaining frag 10421da177e4SLinus Torvalds of this node. Free the node */ 10431da177e4SLinus Torvalds if (c) 10441da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, frag->node->raw); 10451da177e4SLinus Torvalds 10461da177e4SLinus Torvalds jffs2_free_full_dnode(frag->node); 10471da177e4SLinus Torvalds } 10481da177e4SLinus Torvalds parent = frag_parent(frag); 10491da177e4SLinus Torvalds if (parent) { 10501da177e4SLinus Torvalds if (frag_left(parent) == frag) 10511da177e4SLinus Torvalds parent->rb.rb_left = NULL; 10521da177e4SLinus Torvalds else 10531da177e4SLinus Torvalds parent->rb.rb_right = NULL; 10541da177e4SLinus Torvalds } 10551da177e4SLinus Torvalds 10561da177e4SLinus Torvalds jffs2_free_node_frag(frag); 10571da177e4SLinus Torvalds frag = parent; 10581da177e4SLinus Torvalds 10591da177e4SLinus Torvalds cond_resched(); 10601da177e4SLinus Torvalds } 10611da177e4SLinus Torvalds } 1062