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 * 10e0d60137SArtem B. Bityutskiy * $Id: nodelist.c,v 1.102 2005/07/28 12:45:10 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 54f97117d1SArtem B. Bityutskiy void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this) 551da177e4SLinus Torvalds { 56f97117d1SArtem B. Bityutskiy if (this->node) { 57f97117d1SArtem B. Bityutskiy this->node->frags--; 58f97117d1SArtem B. Bityutskiy if (!this->node->frags) { 59f97117d1SArtem B. Bityutskiy /* The node has no valid frags left. It's totally obsoleted */ 60e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", 61e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); 62f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, this->node->raw); 63f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(this->node); 64f97117d1SArtem B. Bityutskiy } else { 65e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", 66e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); 67f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 681da177e4SLinus Torvalds } 691da177e4SLinus Torvalds 70f97117d1SArtem B. Bityutskiy } 71f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(this); 729dee7503SDavid Woodhouse } 739dee7503SDavid Woodhouse 74f97117d1SArtem B. Bityutskiy static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) 751da177e4SLinus Torvalds { 76f97117d1SArtem B. Bityutskiy struct rb_node *parent = &base->rb; 77f97117d1SArtem B. Bityutskiy struct rb_node **link = &parent; 781da177e4SLinus Torvalds 79e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); 809dee7503SDavid Woodhouse 81f97117d1SArtem B. Bityutskiy while (*link) { 82f97117d1SArtem B. Bityutskiy parent = *link; 83f97117d1SArtem B. Bityutskiy base = rb_entry(parent, struct jffs2_node_frag, rb); 84f97117d1SArtem B. Bityutskiy 85e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag at 0x%08x\n", base->ofs); 86f97117d1SArtem B. Bityutskiy if (newfrag->ofs > base->ofs) 87f97117d1SArtem B. Bityutskiy link = &base->rb.rb_right; 88f97117d1SArtem B. Bityutskiy else if (newfrag->ofs < base->ofs) 89f97117d1SArtem B. Bityutskiy link = &base->rb.rb_left; 909dee7503SDavid Woodhouse else { 91e0d60137SArtem B. Bityutskiy JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); 92dae6227fSArtem B. Bityutskiy BUG(); 93dae6227fSArtem B. Bityutskiy } 94dae6227fSArtem B. Bityutskiy } 95dae6227fSArtem B. Bityutskiy 96f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &base->rb, link); 97dae6227fSArtem B. Bityutskiy } 98dae6227fSArtem B. Bityutskiy 99f97117d1SArtem B. Bityutskiy /* Doesn't set inode->i_size */ 100f97117d1SArtem B. Bityutskiy static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *list, struct jffs2_node_frag *newfrag) 1011da177e4SLinus Torvalds { 102f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *this; 103f97117d1SArtem B. Bityutskiy uint32_t lastend; 1041da177e4SLinus Torvalds 105f97117d1SArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 106f97117d1SArtem B. Bityutskiy this = jffs2_lookup_node_frag(list, newfrag->node->ofs); 1071da177e4SLinus Torvalds 108f97117d1SArtem B. Bityutskiy if (this) { 109e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 110e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 111f97117d1SArtem B. Bityutskiy lastend = this->ofs + this->size; 112f97117d1SArtem B. Bityutskiy } else { 113e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave no frag\n"); 114f97117d1SArtem B. Bityutskiy lastend = 0; 115f97117d1SArtem B. Bityutskiy } 1161da177e4SLinus Torvalds 117f97117d1SArtem B. Bityutskiy /* See if we ran off the end of the list */ 118f97117d1SArtem B. Bityutskiy if (lastend <= newfrag->ofs) { 119f97117d1SArtem B. Bityutskiy /* We did */ 1201da177e4SLinus Torvalds 121f97117d1SArtem B. Bityutskiy /* Check if 'this' node was on the same page as the new node. 122f97117d1SArtem B. Bityutskiy If so, both 'this' and the new node get marked REF_NORMAL so 123f97117d1SArtem B. Bityutskiy the GC can take a look. 1241da177e4SLinus Torvalds */ 125f97117d1SArtem B. Bityutskiy if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { 126f97117d1SArtem B. Bityutskiy if (this->node) 127f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 128f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 1291da177e4SLinus Torvalds } 1301da177e4SLinus Torvalds 131f97117d1SArtem B. Bityutskiy if (lastend < newfrag->node->ofs) { 132f97117d1SArtem B. Bityutskiy /* ... and we need to put a hole in before the new node */ 133f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *holefrag = jffs2_alloc_node_frag(); 134f97117d1SArtem B. Bityutskiy if (!holefrag) { 135f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 136f97117d1SArtem B. Bityutskiy return -ENOMEM; 137f97117d1SArtem B. Bityutskiy } 138f97117d1SArtem B. Bityutskiy holefrag->ofs = lastend; 139f97117d1SArtem B. Bityutskiy holefrag->size = newfrag->node->ofs - lastend; 140f97117d1SArtem B. Bityutskiy holefrag->node = NULL; 141f97117d1SArtem B. Bityutskiy if (this) { 142f97117d1SArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 143f97117d1SArtem B. Bityutskiy because there are no frags with offset greater than it. 144f97117d1SArtem B. Bityutskiy So that's where we want to put the hole */ 145e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding hole frag (%p) on right of node at (%p)\n", holefrag, this); 146f97117d1SArtem B. Bityutskiy rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); 147f97117d1SArtem B. Bityutskiy } else { 148e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding hole frag (%p) at root of tree\n", holefrag); 149f97117d1SArtem B. Bityutskiy rb_link_node(&holefrag->rb, NULL, &list->rb_node); 150f97117d1SArtem B. Bityutskiy } 151f97117d1SArtem B. Bityutskiy rb_insert_color(&holefrag->rb, list); 152f97117d1SArtem B. Bityutskiy this = holefrag; 153f97117d1SArtem B. Bityutskiy } 154f97117d1SArtem B. Bityutskiy if (this) { 155f97117d1SArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 156f97117d1SArtem B. Bityutskiy because there are no frags with offset greater than it. 157f97117d1SArtem B. Bityutskiy So that's where we want to put new fragment */ 158e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding new frag (%p) on right of node at (%p)\n", newfrag, this); 159f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 160f97117d1SArtem B. Bityutskiy } else { 161e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding new frag (%p) at root of tree\n", newfrag); 162f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, NULL, &list->rb_node); 163f97117d1SArtem B. Bityutskiy } 164f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 165f97117d1SArtem B. Bityutskiy return 0; 1661da177e4SLinus Torvalds } 167dae6227fSArtem B. Bityutskiy 168e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("dealing with frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 169e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 170dae6227fSArtem B. Bityutskiy 171f97117d1SArtem B. Bityutskiy /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, 172f97117d1SArtem B. Bityutskiy * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs 173f97117d1SArtem B. Bityutskiy */ 174f97117d1SArtem B. Bityutskiy if (newfrag->ofs > this->ofs) { 175f97117d1SArtem B. Bityutskiy /* This node isn't completely obsoleted. The start of it remains valid */ 1761da177e4SLinus Torvalds 177f97117d1SArtem B. Bityutskiy /* Mark the new node and the partially covered node REF_NORMAL -- let 178f97117d1SArtem B. Bityutskiy the GC take a look at them */ 179f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 180f97117d1SArtem B. Bityutskiy if (this->node) 181f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 1821da177e4SLinus Torvalds 183f97117d1SArtem B. Bityutskiy if (this->ofs + this->size > newfrag->ofs + newfrag->size) { 184f97117d1SArtem B. Bityutskiy /* The new node splits 'this' frag into two */ 185f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag2 = jffs2_alloc_node_frag(); 186f97117d1SArtem B. Bityutskiy if (!newfrag2) { 187f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 188f97117d1SArtem B. Bityutskiy return -ENOMEM; 1891da177e4SLinus Torvalds } 190f97117d1SArtem B. Bityutskiy if (this->node) 191e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", 192e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 193f97117d1SArtem B. Bityutskiy else 194e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old hole frag 0x%04x-0x%04x\n", 195e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 196dae6227fSArtem B. Bityutskiy 197f97117d1SArtem B. Bityutskiy /* New second frag pointing to this's node */ 198f97117d1SArtem B. Bityutskiy newfrag2->ofs = newfrag->ofs + newfrag->size; 199f97117d1SArtem B. Bityutskiy newfrag2->size = (this->ofs+this->size) - newfrag2->ofs; 200f97117d1SArtem B. Bityutskiy newfrag2->node = this->node; 201f97117d1SArtem B. Bityutskiy if (this->node) 202f97117d1SArtem B. Bityutskiy this->node->frags++; 203dae6227fSArtem B. Bityutskiy 204f97117d1SArtem B. Bityutskiy /* Adjust size of original 'this' */ 205f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 2061da177e4SLinus Torvalds 207f97117d1SArtem B. Bityutskiy /* Now, we know there's no node with offset 208f97117d1SArtem B. Bityutskiy greater than this->ofs but smaller than 209f97117d1SArtem B. Bityutskiy newfrag2->ofs or newfrag->ofs, for obvious 210f97117d1SArtem B. Bityutskiy reasons. So we can do a tree insert from 211f97117d1SArtem B. Bityutskiy 'this' to insert newfrag, and a tree insert 212f97117d1SArtem B. Bityutskiy from newfrag to insert newfrag2. */ 213f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 214f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 2151da177e4SLinus Torvalds 216f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 217f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, list); 2181da177e4SLinus Torvalds 2191da177e4SLinus Torvalds return 0; 2201da177e4SLinus Torvalds } 221f97117d1SArtem B. Bityutskiy /* New node just reduces 'this' frag in size, doesn't split it */ 222f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 223f97117d1SArtem B. Bityutskiy 224f97117d1SArtem B. Bityutskiy /* Again, we know it lives down here in the tree */ 225f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 226f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 227f97117d1SArtem B. Bityutskiy } else { 228f97117d1SArtem B. Bityutskiy /* New frag starts at the same point as 'this' used to. Replace 229f97117d1SArtem B. Bityutskiy it in the tree without doing a delete and insertion */ 230e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", 231e0d60137SArtem B. Bityutskiy newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); 232f97117d1SArtem B. Bityutskiy 233f97117d1SArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, list); 234f97117d1SArtem B. Bityutskiy 235f97117d1SArtem B. Bityutskiy if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { 236e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); 237f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 238f97117d1SArtem B. Bityutskiy } else { 239f97117d1SArtem B. Bityutskiy this->ofs += newfrag->size; 240f97117d1SArtem B. Bityutskiy this->size -= newfrag->size; 241f97117d1SArtem B. Bityutskiy 242f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(this, newfrag); 243f97117d1SArtem B. Bityutskiy rb_insert_color(&this->rb, list); 244f97117d1SArtem B. Bityutskiy return 0; 245f97117d1SArtem B. Bityutskiy } 246f97117d1SArtem B. Bityutskiy } 247f97117d1SArtem B. Bityutskiy /* OK, now we have newfrag added in the correct place in the tree, but 248f97117d1SArtem B. Bityutskiy frag_next(newfrag) may be a fragment which is overlapped by it 249f97117d1SArtem B. Bityutskiy */ 250f97117d1SArtem B. Bityutskiy while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { 251f97117d1SArtem B. Bityutskiy /* 'this' frag is obsoleted completely. */ 252e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x) and removing from tree\n", 253e0d60137SArtem B. Bityutskiy this, this->ofs, this->ofs+this->size); 254f97117d1SArtem B. Bityutskiy rb_erase(&this->rb, list); 255f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 256f97117d1SArtem B. Bityutskiy } 257f97117d1SArtem B. Bityutskiy /* Now we're pointing at the first frag which isn't totally obsoleted by 258f97117d1SArtem B. Bityutskiy the new frag */ 259f97117d1SArtem B. Bityutskiy 260f97117d1SArtem B. Bityutskiy if (!this || newfrag->ofs + newfrag->size == this->ofs) { 261f97117d1SArtem B. Bityutskiy return 0; 262f97117d1SArtem B. Bityutskiy } 263f97117d1SArtem B. Bityutskiy /* Still some overlap but we don't need to move it in the tree */ 264f97117d1SArtem B. Bityutskiy this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); 265f97117d1SArtem B. Bityutskiy this->ofs = newfrag->ofs + newfrag->size; 266f97117d1SArtem B. Bityutskiy 267f97117d1SArtem B. Bityutskiy /* And mark them REF_NORMAL so the GC takes a look at them */ 268f97117d1SArtem B. Bityutskiy if (this->node) 269f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 270f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 271f97117d1SArtem B. Bityutskiy 272f97117d1SArtem B. Bityutskiy return 0; 273f97117d1SArtem B. Bityutskiy } 274f97117d1SArtem B. Bityutskiy 275f97117d1SArtem B. Bityutskiy /* Given an inode, probably with existing list of fragments, add the new node 276f97117d1SArtem B. Bityutskiy * to the fragment list. 277f97117d1SArtem B. Bityutskiy */ 278f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 279f97117d1SArtem B. Bityutskiy { 280f97117d1SArtem B. Bityutskiy int ret; 281f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 282f97117d1SArtem B. Bityutskiy 283f97117d1SArtem B. Bityutskiy if (unlikely(!fn->size)) 284f97117d1SArtem B. Bityutskiy return 0; 285f97117d1SArtem B. Bityutskiy 286f97117d1SArtem B. Bityutskiy newfrag = jffs2_alloc_node_frag(); 287f97117d1SArtem B. Bityutskiy if (unlikely(!newfrag)) 288f97117d1SArtem B. Bityutskiy return -ENOMEM; 289f97117d1SArtem B. Bityutskiy 290e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", 291e0d60137SArtem B. Bityutskiy fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); 292f97117d1SArtem B. Bityutskiy 293f97117d1SArtem B. Bityutskiy newfrag->ofs = fn->ofs; 294f97117d1SArtem B. Bityutskiy newfrag->size = fn->size; 295f97117d1SArtem B. Bityutskiy newfrag->node = fn; 296f97117d1SArtem B. Bityutskiy newfrag->node->frags = 1; 297f97117d1SArtem B. Bityutskiy 298f97117d1SArtem B. Bityutskiy ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); 299f97117d1SArtem B. Bityutskiy if (unlikely(ret)) 300f97117d1SArtem B. Bityutskiy return ret; 301f97117d1SArtem B. Bityutskiy 302f97117d1SArtem B. Bityutskiy /* If we now share a page with other nodes, mark either previous 303f97117d1SArtem B. Bityutskiy or next node REF_NORMAL, as appropriate. */ 304f97117d1SArtem B. Bityutskiy if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { 305f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *prev = frag_prev(newfrag); 306f97117d1SArtem B. Bityutskiy 307f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 308f97117d1SArtem B. Bityutskiy /* If we don't start at zero there's _always_ a previous */ 309f97117d1SArtem B. Bityutskiy if (prev->node) 310f97117d1SArtem B. Bityutskiy mark_ref_normal(prev->node->raw); 311f97117d1SArtem B. Bityutskiy } 312f97117d1SArtem B. Bityutskiy 313f97117d1SArtem B. Bityutskiy if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { 314f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(newfrag); 315f97117d1SArtem B. Bityutskiy 316f97117d1SArtem B. Bityutskiy if (next) { 317f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 318f97117d1SArtem B. Bityutskiy if (next->node) 319f97117d1SArtem B. Bityutskiy mark_ref_normal(next->node->raw); 320f97117d1SArtem B. Bityutskiy } 321f97117d1SArtem B. Bityutskiy } 322f97117d1SArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 323f97117d1SArtem B. Bityutskiy jffs2_dbg_dump_fragtree_nolock(f); 324f97117d1SArtem B. Bityutskiy return 0; 325f97117d1SArtem B. Bityutskiy } 326f97117d1SArtem B. Bityutskiy 3271da177e4SLinus Torvalds 3281da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) 3291da177e4SLinus Torvalds { 3301da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3311da177e4SLinus Torvalds ic->state = state; 3321da177e4SLinus Torvalds wake_up(&c->inocache_wq); 3331da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3341da177e4SLinus Torvalds } 3351da177e4SLinus Torvalds 3361da177e4SLinus Torvalds /* During mount, this needs no locking. During normal operation, its 3371da177e4SLinus Torvalds callers want to do other stuff while still holding the inocache_lock. 3381da177e4SLinus Torvalds Rather than introducing special case get_ino_cache functions or 3391da177e4SLinus Torvalds callbacks, we just let the caller do the locking itself. */ 3401da177e4SLinus Torvalds 3411da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 3421da177e4SLinus Torvalds { 3431da177e4SLinus Torvalds struct jffs2_inode_cache *ret; 3441da177e4SLinus Torvalds 3451da177e4SLinus Torvalds ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; 3461da177e4SLinus Torvalds while (ret && ret->ino < ino) { 3471da177e4SLinus Torvalds ret = ret->next; 3481da177e4SLinus Torvalds } 3491da177e4SLinus Torvalds 3501da177e4SLinus Torvalds if (ret && ret->ino != ino) 3511da177e4SLinus Torvalds ret = NULL; 3521da177e4SLinus Torvalds 3531da177e4SLinus Torvalds return ret; 3541da177e4SLinus Torvalds } 3551da177e4SLinus Torvalds 3561da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) 3571da177e4SLinus Torvalds { 3581da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 3597d27c814SThomas Gleixner 3601da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3617d200960SDavid Woodhouse if (!new->ino) 3627d200960SDavid Woodhouse new->ino = ++c->highest_ino; 3637d200960SDavid Woodhouse 364e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("add %p (ino #%u)\n", new, new->ino); 3651da177e4SLinus Torvalds 3661da177e4SLinus Torvalds prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; 3671da177e4SLinus Torvalds 3681da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < new->ino) { 3691da177e4SLinus Torvalds prev = &(*prev)->next; 3701da177e4SLinus Torvalds } 3711da177e4SLinus Torvalds new->next = *prev; 3721da177e4SLinus Torvalds *prev = new; 3731da177e4SLinus Torvalds 3741da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3751da177e4SLinus Torvalds } 3761da177e4SLinus Torvalds 3771da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) 3781da177e4SLinus Torvalds { 3791da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 380e0d60137SArtem B. Bityutskiy 381e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("del %p (ino #%u)\n", old, old->ino); 3821da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3831da177e4SLinus Torvalds 3841da177e4SLinus Torvalds prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; 3851da177e4SLinus Torvalds 3861da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < old->ino) { 3871da177e4SLinus Torvalds prev = &(*prev)->next; 3881da177e4SLinus Torvalds } 3891da177e4SLinus Torvalds if ((*prev) == old) { 3901da177e4SLinus Torvalds *prev = old->next; 3911da177e4SLinus Torvalds } 3921da177e4SLinus Torvalds 39367e345d1SDavid Woodhouse /* Free it now unless it's in READING or CLEARING state, which 39467e345d1SDavid Woodhouse are the transitions upon read_inode() and clear_inode(). The 39567e345d1SDavid Woodhouse rest of the time we know nobody else is looking at it, and 39667e345d1SDavid Woodhouse if it's held by read_inode() or clear_inode() they'll free it 39767e345d1SDavid Woodhouse for themselves. */ 39867e345d1SDavid Woodhouse if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) 39967e345d1SDavid Woodhouse jffs2_free_inode_cache(old); 40067e345d1SDavid Woodhouse 4011da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 4021da177e4SLinus Torvalds } 4031da177e4SLinus Torvalds 4041da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c) 4051da177e4SLinus Torvalds { 4061da177e4SLinus Torvalds int i; 4071da177e4SLinus Torvalds struct jffs2_inode_cache *this, *next; 4081da177e4SLinus Torvalds 4091da177e4SLinus Torvalds for (i=0; i<INOCACHE_HASHSIZE; i++) { 4101da177e4SLinus Torvalds this = c->inocache_list[i]; 4111da177e4SLinus Torvalds while (this) { 4121da177e4SLinus Torvalds next = this->next; 4131da177e4SLinus Torvalds jffs2_free_inode_cache(this); 4141da177e4SLinus Torvalds this = next; 4151da177e4SLinus Torvalds } 4161da177e4SLinus Torvalds c->inocache_list[i] = NULL; 4171da177e4SLinus Torvalds } 4181da177e4SLinus Torvalds } 4191da177e4SLinus Torvalds 4201da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) 4211da177e4SLinus Torvalds { 4221da177e4SLinus Torvalds int i; 4231da177e4SLinus Torvalds struct jffs2_raw_node_ref *this, *next; 4241da177e4SLinus Torvalds 4251da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 4261da177e4SLinus Torvalds this = c->blocks[i].first_node; 4271da177e4SLinus Torvalds while(this) { 4281da177e4SLinus Torvalds next = this->next_phys; 4291da177e4SLinus Torvalds jffs2_free_raw_node_ref(this); 4301da177e4SLinus Torvalds this = next; 4311da177e4SLinus Torvalds } 4321da177e4SLinus Torvalds c->blocks[i].first_node = c->blocks[i].last_node = NULL; 4331da177e4SLinus Torvalds } 4341da177e4SLinus Torvalds } 4351da177e4SLinus Torvalds 4361da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) 4371da177e4SLinus Torvalds { 4381da177e4SLinus Torvalds /* The common case in lookup is that there will be a node 4391da177e4SLinus Torvalds which precisely matches. So we go looking for that first */ 4401da177e4SLinus Torvalds struct rb_node *next; 4411da177e4SLinus Torvalds struct jffs2_node_frag *prev = NULL; 4421da177e4SLinus Torvalds struct jffs2_node_frag *frag = NULL; 4431da177e4SLinus Torvalds 444e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("root %p, offset %d\n", fragtree, offset); 4451da177e4SLinus Torvalds 4461da177e4SLinus Torvalds next = fragtree->rb_node; 4471da177e4SLinus Torvalds 4481da177e4SLinus Torvalds while(next) { 4491da177e4SLinus Torvalds frag = rb_entry(next, struct jffs2_node_frag, rb); 4501da177e4SLinus Torvalds 451e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag %#04x-%#04x (%p). left %p, right %p\n", 452e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag, frag->rb.rb_left, frag->rb.rb_right); 4531da177e4SLinus Torvalds if (frag->ofs + frag->size <= offset) { 454e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag %#04x-%#04x, before the region we care about\n", 455e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4561da177e4SLinus Torvalds /* Remember the closest smaller match on the way down */ 4571da177e4SLinus Torvalds if (!prev || frag->ofs > prev->ofs) 4581da177e4SLinus Torvalds prev = frag; 4591da177e4SLinus Torvalds next = frag->rb.rb_right; 4601da177e4SLinus Torvalds } else if (frag->ofs > offset) { 461e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag %#04x-%#04x, after the region we care about\n", 462e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4631da177e4SLinus Torvalds next = frag->rb.rb_left; 4641da177e4SLinus Torvalds } else { 465e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning frag %#04x-%#04x, matched\n", 466e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4671da177e4SLinus Torvalds return frag; 4681da177e4SLinus Torvalds } 4691da177e4SLinus Torvalds } 4701da177e4SLinus Torvalds 4711da177e4SLinus Torvalds /* Exact match not found. Go back up looking at each parent, 4721da177e4SLinus Torvalds and return the closest smaller one */ 4731da177e4SLinus Torvalds 4741da177e4SLinus Torvalds if (prev) 475e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("no match. Returning frag %#04x-%#04x, closest previous\n", 476e0d60137SArtem B. Bityutskiy prev->ofs, prev->ofs+prev->size); 4771da177e4SLinus Torvalds else 478e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning NULL, empty fragtree\n"); 4791da177e4SLinus Torvalds 4801da177e4SLinus Torvalds return prev; 4811da177e4SLinus Torvalds } 4821da177e4SLinus Torvalds 4831da177e4SLinus Torvalds /* Pass 'c' argument to indicate that nodes should be marked obsolete as 4841da177e4SLinus Torvalds they're killed. */ 4851da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) 4861da177e4SLinus Torvalds { 4871da177e4SLinus Torvalds struct jffs2_node_frag *frag; 4881da177e4SLinus Torvalds struct jffs2_node_frag *parent; 4891da177e4SLinus Torvalds 4901da177e4SLinus Torvalds if (!root->rb_node) 4911da177e4SLinus Torvalds return; 4921da177e4SLinus Torvalds 493e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("killing\n"); 4941da177e4SLinus Torvalds 495e0d60137SArtem B. Bityutskiy frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); 4961da177e4SLinus Torvalds while(frag) { 4971da177e4SLinus Torvalds if (frag->rb.rb_left) { 498e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag (%p) %#04x-%#04x\n", 499e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 5001da177e4SLinus Torvalds frag = frag_left(frag); 5011da177e4SLinus Torvalds continue; 5021da177e4SLinus Torvalds } 5031da177e4SLinus Torvalds if (frag->rb.rb_right) { 504e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag (%p) %#04x-%#04x\n", 505e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 5061da177e4SLinus Torvalds frag = frag_right(frag); 5071da177e4SLinus Torvalds continue; 5081da177e4SLinus Torvalds } 5091da177e4SLinus Torvalds 510e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("frag %#04x-%#04x: node %p, frags %d\n", 511e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag->node, frag->node?frag->node->frags:0); 5121da177e4SLinus Torvalds 5131da177e4SLinus Torvalds if (frag->node && !(--frag->node->frags)) { 5141da177e4SLinus Torvalds /* Not a hole, and it's the final remaining frag 5151da177e4SLinus Torvalds of this node. Free the node */ 5161da177e4SLinus Torvalds if (c) 5171da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, frag->node->raw); 5181da177e4SLinus Torvalds 5191da177e4SLinus Torvalds jffs2_free_full_dnode(frag->node); 5201da177e4SLinus Torvalds } 5211da177e4SLinus Torvalds parent = frag_parent(frag); 5221da177e4SLinus Torvalds if (parent) { 5231da177e4SLinus Torvalds if (frag_left(parent) == frag) 5241da177e4SLinus Torvalds parent->rb.rb_left = NULL; 5251da177e4SLinus Torvalds else 5261da177e4SLinus Torvalds parent->rb.rb_right = NULL; 5271da177e4SLinus Torvalds } 5281da177e4SLinus Torvalds 5291da177e4SLinus Torvalds jffs2_free_node_frag(frag); 5301da177e4SLinus Torvalds frag = parent; 5311da177e4SLinus Torvalds 5321da177e4SLinus Torvalds cond_resched(); 5331da177e4SLinus Torvalds } 5341da177e4SLinus Torvalds } 535