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 * 101e900979SArtem B. Bityutskiy * $Id: nodelist.c,v 1.103 2005/07/31 08:20:44 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) { 621e900979SArtem 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 } 761e900979SArtem B. Bityutskiy } 771e900979SArtem B. Bityutskiy 78f97117d1SArtem B. Bityutskiy void jffs2_obsolete_node_frag(struct jffs2_sb_info *c, struct jffs2_node_frag *this) 791da177e4SLinus Torvalds { 80f97117d1SArtem B. Bityutskiy if (this->node) { 81f97117d1SArtem B. Bityutskiy this->node->frags--; 82f97117d1SArtem B. Bityutskiy if (!this->node->frags) { 83f97117d1SArtem B. Bityutskiy /* The node has no valid frags left. It's totally obsoleted */ 84e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) obsolete\n", 85e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size); 86f97117d1SArtem B. Bityutskiy jffs2_mark_node_obsolete(c, this->node->raw); 87f97117d1SArtem B. Bityutskiy jffs2_free_full_dnode(this->node); 88f97117d1SArtem B. Bityutskiy } else { 89e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("marking old node @0x%08x (0x%04x-0x%04x) REF_NORMAL. frags is %d\n", 90e0d60137SArtem B. Bityutskiy ref_offset(this->node->raw), this->node->ofs, this->node->ofs+this->node->size, this->node->frags); 91f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 921da177e4SLinus Torvalds } 931da177e4SLinus Torvalds 94f97117d1SArtem B. Bityutskiy } 95f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(this); 969dee7503SDavid Woodhouse } 979dee7503SDavid Woodhouse 98f97117d1SArtem B. Bityutskiy static void jffs2_fragtree_insert(struct jffs2_node_frag *newfrag, struct jffs2_node_frag *base) 991da177e4SLinus Torvalds { 100f97117d1SArtem B. Bityutskiy struct rb_node *parent = &base->rb; 101f97117d1SArtem B. Bityutskiy struct rb_node **link = &parent; 1021da177e4SLinus Torvalds 103e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("insert frag (0x%04x-0x%04x)\n", newfrag->ofs, newfrag->ofs + newfrag->size); 1049dee7503SDavid Woodhouse 105f97117d1SArtem B. Bityutskiy while (*link) { 106f97117d1SArtem B. Bityutskiy parent = *link; 107f97117d1SArtem B. Bityutskiy base = rb_entry(parent, struct jffs2_node_frag, rb); 108f97117d1SArtem B. Bityutskiy 109e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag at 0x%08x\n", base->ofs); 110f97117d1SArtem B. Bityutskiy if (newfrag->ofs > base->ofs) 111f97117d1SArtem B. Bityutskiy link = &base->rb.rb_right; 112f97117d1SArtem B. Bityutskiy else if (newfrag->ofs < base->ofs) 113f97117d1SArtem B. Bityutskiy link = &base->rb.rb_left; 1149dee7503SDavid Woodhouse else { 115e0d60137SArtem B. Bityutskiy JFFS2_ERROR("duplicate frag at %08x (%p,%p)\n", newfrag->ofs, newfrag, base); 116dae6227fSArtem B. Bityutskiy BUG(); 117dae6227fSArtem B. Bityutskiy } 118dae6227fSArtem B. Bityutskiy } 119dae6227fSArtem B. Bityutskiy 120f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &base->rb, link); 121dae6227fSArtem B. Bityutskiy } 122dae6227fSArtem B. Bityutskiy 123f97117d1SArtem B. Bityutskiy /* Doesn't set inode->i_size */ 124f97117d1SArtem B. Bityutskiy static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *list, struct jffs2_node_frag *newfrag) 1251da177e4SLinus Torvalds { 126f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *this; 127f97117d1SArtem B. Bityutskiy uint32_t lastend; 1281da177e4SLinus Torvalds 129f97117d1SArtem B. Bityutskiy /* Skip all the nodes which are completed before this one starts */ 130f97117d1SArtem B. Bityutskiy this = jffs2_lookup_node_frag(list, newfrag->node->ofs); 1311da177e4SLinus Torvalds 132f97117d1SArtem B. Bityutskiy if (this) { 133e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 134e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 135f97117d1SArtem B. Bityutskiy lastend = this->ofs + this->size; 136f97117d1SArtem B. Bityutskiy } else { 137e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("lookup gave no frag\n"); 138f97117d1SArtem B. Bityutskiy lastend = 0; 139f97117d1SArtem B. Bityutskiy } 1401da177e4SLinus Torvalds 141f97117d1SArtem B. Bityutskiy /* See if we ran off the end of the list */ 142f97117d1SArtem B. Bityutskiy if (lastend <= newfrag->ofs) { 143f97117d1SArtem B. Bityutskiy /* We did */ 1441da177e4SLinus Torvalds 145f97117d1SArtem B. Bityutskiy /* Check if 'this' node was on the same page as the new node. 146f97117d1SArtem B. Bityutskiy If so, both 'this' and the new node get marked REF_NORMAL so 147f97117d1SArtem B. Bityutskiy the GC can take a look. 1481da177e4SLinus Torvalds */ 149f97117d1SArtem B. Bityutskiy if (lastend && (lastend-1) >> PAGE_CACHE_SHIFT == newfrag->ofs >> PAGE_CACHE_SHIFT) { 150f97117d1SArtem B. Bityutskiy if (this->node) 151f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 152f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 1531da177e4SLinus Torvalds } 1541da177e4SLinus Torvalds 155f97117d1SArtem B. Bityutskiy if (lastend < newfrag->node->ofs) { 156f97117d1SArtem B. Bityutskiy /* ... and we need to put a hole in before the new node */ 157f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *holefrag = jffs2_alloc_node_frag(); 158f97117d1SArtem B. Bityutskiy if (!holefrag) { 159f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 160f97117d1SArtem B. Bityutskiy return -ENOMEM; 161f97117d1SArtem B. Bityutskiy } 162f97117d1SArtem B. Bityutskiy holefrag->ofs = lastend; 163f97117d1SArtem B. Bityutskiy holefrag->size = newfrag->node->ofs - lastend; 164f97117d1SArtem B. Bityutskiy holefrag->node = NULL; 165f97117d1SArtem B. Bityutskiy if (this) { 166f97117d1SArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 167f97117d1SArtem B. Bityutskiy because there are no frags with offset greater than it. 168f97117d1SArtem B. Bityutskiy So that's where we want to put the hole */ 169e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding hole frag (%p) on right of node at (%p)\n", holefrag, this); 170f97117d1SArtem B. Bityutskiy rb_link_node(&holefrag->rb, &this->rb, &this->rb.rb_right); 171f97117d1SArtem B. Bityutskiy } else { 172e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding hole frag (%p) at root of tree\n", holefrag); 173f97117d1SArtem B. Bityutskiy rb_link_node(&holefrag->rb, NULL, &list->rb_node); 174f97117d1SArtem B. Bityutskiy } 175f97117d1SArtem B. Bityutskiy rb_insert_color(&holefrag->rb, list); 176f97117d1SArtem B. Bityutskiy this = holefrag; 177f97117d1SArtem B. Bityutskiy } 178f97117d1SArtem B. Bityutskiy if (this) { 179f97117d1SArtem B. Bityutskiy /* By definition, the 'this' node has no right-hand child, 180f97117d1SArtem B. Bityutskiy because there are no frags with offset greater than it. 181f97117d1SArtem B. Bityutskiy So that's where we want to put new fragment */ 182e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding new frag (%p) on right of node at (%p)\n", newfrag, this); 183f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, &this->rb, &this->rb.rb_right); 184f97117d1SArtem B. Bityutskiy } else { 185e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("adding new frag (%p) at root of tree\n", newfrag); 186f97117d1SArtem B. Bityutskiy rb_link_node(&newfrag->rb, NULL, &list->rb_node); 187f97117d1SArtem B. Bityutskiy } 188f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 189f97117d1SArtem B. Bityutskiy return 0; 1901da177e4SLinus Torvalds } 191dae6227fSArtem B. Bityutskiy 192e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("dealing with frag 0x%04x-0x%04x; phys 0x%08x (*%p)\n", 193e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, this->node?(ref_offset(this->node->raw)):0xffffffff, this); 194dae6227fSArtem B. Bityutskiy 195f97117d1SArtem B. Bityutskiy /* OK. 'this' is pointing at the first frag that newfrag->ofs at least partially obsoletes, 196f97117d1SArtem B. Bityutskiy * - i.e. newfrag->ofs < this->ofs+this->size && newfrag->ofs >= this->ofs 197f97117d1SArtem B. Bityutskiy */ 198f97117d1SArtem B. Bityutskiy if (newfrag->ofs > this->ofs) { 199f97117d1SArtem B. Bityutskiy /* This node isn't completely obsoleted. The start of it remains valid */ 2001da177e4SLinus Torvalds 201f97117d1SArtem B. Bityutskiy /* Mark the new node and the partially covered node REF_NORMAL -- let 202f97117d1SArtem B. Bityutskiy the GC take a look at them */ 203f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 204f97117d1SArtem B. Bityutskiy if (this->node) 205f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 2061da177e4SLinus Torvalds 207f97117d1SArtem B. Bityutskiy if (this->ofs + this->size > newfrag->ofs + newfrag->size) { 208f97117d1SArtem B. Bityutskiy /* The new node splits 'this' frag into two */ 209f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag2 = jffs2_alloc_node_frag(); 210f97117d1SArtem B. Bityutskiy if (!newfrag2) { 211f97117d1SArtem B. Bityutskiy jffs2_free_node_frag(newfrag); 212f97117d1SArtem B. Bityutskiy return -ENOMEM; 2131da177e4SLinus Torvalds } 214f97117d1SArtem B. Bityutskiy if (this->node) 215e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old frag 0x%04x-0x%04x, phys 0x%08x\n", 216e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 217f97117d1SArtem B. Bityutskiy else 218e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("split old hole frag 0x%04x-0x%04x\n", 219e0d60137SArtem B. Bityutskiy this->ofs, this->ofs+this->size, ref_offset(this->node->raw)); 220dae6227fSArtem B. Bityutskiy 221f97117d1SArtem B. Bityutskiy /* New second frag pointing to this's node */ 222f97117d1SArtem B. Bityutskiy newfrag2->ofs = newfrag->ofs + newfrag->size; 223f97117d1SArtem B. Bityutskiy newfrag2->size = (this->ofs+this->size) - newfrag2->ofs; 224f97117d1SArtem B. Bityutskiy newfrag2->node = this->node; 225f97117d1SArtem B. Bityutskiy if (this->node) 226f97117d1SArtem B. Bityutskiy this->node->frags++; 227dae6227fSArtem B. Bityutskiy 228f97117d1SArtem B. Bityutskiy /* Adjust size of original 'this' */ 229f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 2301da177e4SLinus Torvalds 231f97117d1SArtem B. Bityutskiy /* Now, we know there's no node with offset 232f97117d1SArtem B. Bityutskiy greater than this->ofs but smaller than 233f97117d1SArtem B. Bityutskiy newfrag2->ofs or newfrag->ofs, for obvious 234f97117d1SArtem B. Bityutskiy reasons. So we can do a tree insert from 235f97117d1SArtem B. Bityutskiy 'this' to insert newfrag, and a tree insert 236f97117d1SArtem B. Bityutskiy from newfrag to insert newfrag2. */ 237f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 238f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 2391da177e4SLinus Torvalds 240f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag2, newfrag); 241f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag2->rb, list); 2421da177e4SLinus Torvalds 2431da177e4SLinus Torvalds return 0; 2441da177e4SLinus Torvalds } 245f97117d1SArtem B. Bityutskiy /* New node just reduces 'this' frag in size, doesn't split it */ 246f97117d1SArtem B. Bityutskiy this->size = newfrag->ofs - this->ofs; 247f97117d1SArtem B. Bityutskiy 248f97117d1SArtem B. Bityutskiy /* Again, we know it lives down here in the tree */ 249f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(newfrag, this); 250f97117d1SArtem B. Bityutskiy rb_insert_color(&newfrag->rb, list); 251f97117d1SArtem B. Bityutskiy } else { 252f97117d1SArtem B. Bityutskiy /* New frag starts at the same point as 'this' used to. Replace 253f97117d1SArtem B. Bityutskiy it in the tree without doing a delete and insertion */ 254e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("inserting newfrag (*%p),%d-%d in before 'this' (*%p),%d-%d\n", 255e0d60137SArtem B. Bityutskiy newfrag, newfrag->ofs, newfrag->ofs+newfrag->size, this, this->ofs, this->ofs+this->size); 256f97117d1SArtem B. Bityutskiy 257f97117d1SArtem B. Bityutskiy rb_replace_node(&this->rb, &newfrag->rb, list); 258f97117d1SArtem B. Bityutskiy 259f97117d1SArtem B. Bityutskiy if (newfrag->ofs + newfrag->size >= this->ofs+this->size) { 260e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x)\n", this, this->ofs, this->ofs+this->size); 261f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 262f97117d1SArtem B. Bityutskiy } else { 263f97117d1SArtem B. Bityutskiy this->ofs += newfrag->size; 264f97117d1SArtem B. Bityutskiy this->size -= newfrag->size; 265f97117d1SArtem B. Bityutskiy 266f97117d1SArtem B. Bityutskiy jffs2_fragtree_insert(this, newfrag); 267f97117d1SArtem B. Bityutskiy rb_insert_color(&this->rb, list); 268f97117d1SArtem B. Bityutskiy return 0; 269f97117d1SArtem B. Bityutskiy } 270f97117d1SArtem B. Bityutskiy } 271f97117d1SArtem B. Bityutskiy /* OK, now we have newfrag added in the correct place in the tree, but 272f97117d1SArtem B. Bityutskiy frag_next(newfrag) may be a fragment which is overlapped by it 273f97117d1SArtem B. Bityutskiy */ 274f97117d1SArtem B. Bityutskiy while ((this = frag_next(newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) { 275f97117d1SArtem B. Bityutskiy /* 'this' frag is obsoleted completely. */ 276e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("obsoleting node frag %p (%x-%x) and removing from tree\n", 277e0d60137SArtem B. Bityutskiy this, this->ofs, this->ofs+this->size); 278f97117d1SArtem B. Bityutskiy rb_erase(&this->rb, list); 279f97117d1SArtem B. Bityutskiy jffs2_obsolete_node_frag(c, this); 280f97117d1SArtem B. Bityutskiy } 281f97117d1SArtem B. Bityutskiy /* Now we're pointing at the first frag which isn't totally obsoleted by 282f97117d1SArtem B. Bityutskiy the new frag */ 283f97117d1SArtem B. Bityutskiy 284f97117d1SArtem B. Bityutskiy if (!this || newfrag->ofs + newfrag->size == this->ofs) { 285f97117d1SArtem B. Bityutskiy return 0; 286f97117d1SArtem B. Bityutskiy } 287f97117d1SArtem B. Bityutskiy /* Still some overlap but we don't need to move it in the tree */ 288f97117d1SArtem B. Bityutskiy this->size = (this->ofs + this->size) - (newfrag->ofs + newfrag->size); 289f97117d1SArtem B. Bityutskiy this->ofs = newfrag->ofs + newfrag->size; 290f97117d1SArtem B. Bityutskiy 291f97117d1SArtem B. Bityutskiy /* And mark them REF_NORMAL so the GC takes a look at them */ 292f97117d1SArtem B. Bityutskiy if (this->node) 293f97117d1SArtem B. Bityutskiy mark_ref_normal(this->node->raw); 294f97117d1SArtem B. Bityutskiy mark_ref_normal(newfrag->node->raw); 295f97117d1SArtem B. Bityutskiy 296f97117d1SArtem B. Bityutskiy return 0; 297f97117d1SArtem B. Bityutskiy } 298f97117d1SArtem B. Bityutskiy 299f97117d1SArtem B. Bityutskiy /* Given an inode, probably with existing list of fragments, add the new node 300f97117d1SArtem B. Bityutskiy * to the fragment list. 301f97117d1SArtem B. Bityutskiy */ 302f97117d1SArtem B. Bityutskiy int jffs2_add_full_dnode_to_inode(struct jffs2_sb_info *c, struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 303f97117d1SArtem B. Bityutskiy { 304f97117d1SArtem B. Bityutskiy int ret; 305f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *newfrag; 306f97117d1SArtem B. Bityutskiy 307f97117d1SArtem B. Bityutskiy if (unlikely(!fn->size)) 308f97117d1SArtem B. Bityutskiy return 0; 309f97117d1SArtem B. Bityutskiy 310f97117d1SArtem B. Bityutskiy newfrag = jffs2_alloc_node_frag(); 311f97117d1SArtem B. Bityutskiy if (unlikely(!newfrag)) 312f97117d1SArtem B. Bityutskiy return -ENOMEM; 313f97117d1SArtem B. Bityutskiy 314e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("adding node %#04x-%#04x @0x%08x on flash, newfrag *%p\n", 315e0d60137SArtem B. Bityutskiy fn->ofs, fn->ofs+fn->size, ref_offset(fn->raw), newfrag); 316f97117d1SArtem B. Bityutskiy 317f97117d1SArtem B. Bityutskiy newfrag->ofs = fn->ofs; 318f97117d1SArtem B. Bityutskiy newfrag->size = fn->size; 319f97117d1SArtem B. Bityutskiy newfrag->node = fn; 320f97117d1SArtem B. Bityutskiy newfrag->node->frags = 1; 321f97117d1SArtem B. Bityutskiy 322f97117d1SArtem B. Bityutskiy ret = jffs2_add_frag_to_fragtree(c, &f->fragtree, newfrag); 323f97117d1SArtem B. Bityutskiy if (unlikely(ret)) 324f97117d1SArtem B. Bityutskiy return ret; 325f97117d1SArtem B. Bityutskiy 326f97117d1SArtem B. Bityutskiy /* If we now share a page with other nodes, mark either previous 327f97117d1SArtem B. Bityutskiy or next node REF_NORMAL, as appropriate. */ 328f97117d1SArtem B. Bityutskiy if (newfrag->ofs & (PAGE_CACHE_SIZE-1)) { 329f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *prev = frag_prev(newfrag); 330f97117d1SArtem B. Bityutskiy 331f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 332f97117d1SArtem B. Bityutskiy /* If we don't start at zero there's _always_ a previous */ 333f97117d1SArtem B. Bityutskiy if (prev->node) 334f97117d1SArtem B. Bityutskiy mark_ref_normal(prev->node->raw); 335f97117d1SArtem B. Bityutskiy } 336f97117d1SArtem B. Bityutskiy 337f97117d1SArtem B. Bityutskiy if ((newfrag->ofs+newfrag->size) & (PAGE_CACHE_SIZE-1)) { 338f97117d1SArtem B. Bityutskiy struct jffs2_node_frag *next = frag_next(newfrag); 339f97117d1SArtem B. Bityutskiy 340f97117d1SArtem B. Bityutskiy if (next) { 341f97117d1SArtem B. Bityutskiy mark_ref_normal(fn->raw); 342f97117d1SArtem B. Bityutskiy if (next->node) 343f97117d1SArtem B. Bityutskiy mark_ref_normal(next->node->raw); 344f97117d1SArtem B. Bityutskiy } 345f97117d1SArtem B. Bityutskiy } 346f97117d1SArtem B. Bityutskiy jffs2_dbg_fragtree_paranoia_check_nolock(f); 347f97117d1SArtem B. Bityutskiy jffs2_dbg_dump_fragtree_nolock(f); 348f97117d1SArtem B. Bityutskiy return 0; 349f97117d1SArtem B. Bityutskiy } 350f97117d1SArtem B. Bityutskiy 3511da177e4SLinus Torvalds 3521da177e4SLinus Torvalds void jffs2_set_inocache_state(struct jffs2_sb_info *c, struct jffs2_inode_cache *ic, int state) 3531da177e4SLinus Torvalds { 3541da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3551da177e4SLinus Torvalds ic->state = state; 3561da177e4SLinus Torvalds wake_up(&c->inocache_wq); 3571da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3581da177e4SLinus Torvalds } 3591da177e4SLinus Torvalds 3601da177e4SLinus Torvalds /* During mount, this needs no locking. During normal operation, its 3611da177e4SLinus Torvalds callers want to do other stuff while still holding the inocache_lock. 3621da177e4SLinus Torvalds Rather than introducing special case get_ino_cache functions or 3631da177e4SLinus Torvalds callbacks, we just let the caller do the locking itself. */ 3641da177e4SLinus Torvalds 3651da177e4SLinus Torvalds struct jffs2_inode_cache *jffs2_get_ino_cache(struct jffs2_sb_info *c, uint32_t ino) 3661da177e4SLinus Torvalds { 3671da177e4SLinus Torvalds struct jffs2_inode_cache *ret; 3681da177e4SLinus Torvalds 3691da177e4SLinus Torvalds ret = c->inocache_list[ino % INOCACHE_HASHSIZE]; 3701da177e4SLinus Torvalds while (ret && ret->ino < ino) { 3711da177e4SLinus Torvalds ret = ret->next; 3721da177e4SLinus Torvalds } 3731da177e4SLinus Torvalds 3741da177e4SLinus Torvalds if (ret && ret->ino != ino) 3751da177e4SLinus Torvalds ret = NULL; 3761da177e4SLinus Torvalds 3771da177e4SLinus Torvalds return ret; 3781da177e4SLinus Torvalds } 3791da177e4SLinus Torvalds 3801da177e4SLinus Torvalds void jffs2_add_ino_cache (struct jffs2_sb_info *c, struct jffs2_inode_cache *new) 3811da177e4SLinus Torvalds { 3821da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 3837d27c814SThomas Gleixner 3841da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3857d200960SDavid Woodhouse if (!new->ino) 3867d200960SDavid Woodhouse new->ino = ++c->highest_ino; 3877d200960SDavid Woodhouse 388e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("add %p (ino #%u)\n", new, new->ino); 3891da177e4SLinus Torvalds 3901da177e4SLinus Torvalds prev = &c->inocache_list[new->ino % INOCACHE_HASHSIZE]; 3911da177e4SLinus Torvalds 3921da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < new->ino) { 3931da177e4SLinus Torvalds prev = &(*prev)->next; 3941da177e4SLinus Torvalds } 3951da177e4SLinus Torvalds new->next = *prev; 3961da177e4SLinus Torvalds *prev = new; 3971da177e4SLinus Torvalds 3981da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3991da177e4SLinus Torvalds } 4001da177e4SLinus Torvalds 4011da177e4SLinus Torvalds void jffs2_del_ino_cache(struct jffs2_sb_info *c, struct jffs2_inode_cache *old) 4021da177e4SLinus Torvalds { 4031da177e4SLinus Torvalds struct jffs2_inode_cache **prev; 404e0d60137SArtem B. Bityutskiy 405e0d60137SArtem B. Bityutskiy JFFS2_DBG_INOCACHE("del %p (ino #%u)\n", old, old->ino); 4061da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 4071da177e4SLinus Torvalds 4081da177e4SLinus Torvalds prev = &c->inocache_list[old->ino % INOCACHE_HASHSIZE]; 4091da177e4SLinus Torvalds 4101da177e4SLinus Torvalds while ((*prev) && (*prev)->ino < old->ino) { 4111da177e4SLinus Torvalds prev = &(*prev)->next; 4121da177e4SLinus Torvalds } 4131da177e4SLinus Torvalds if ((*prev) == old) { 4141da177e4SLinus Torvalds *prev = old->next; 4151da177e4SLinus Torvalds } 4161da177e4SLinus Torvalds 41767e345d1SDavid Woodhouse /* Free it now unless it's in READING or CLEARING state, which 41867e345d1SDavid Woodhouse are the transitions upon read_inode() and clear_inode(). The 41967e345d1SDavid Woodhouse rest of the time we know nobody else is looking at it, and 42067e345d1SDavid Woodhouse if it's held by read_inode() or clear_inode() they'll free it 42167e345d1SDavid Woodhouse for themselves. */ 42267e345d1SDavid Woodhouse if (old->state != INO_STATE_READING && old->state != INO_STATE_CLEARING) 42367e345d1SDavid Woodhouse jffs2_free_inode_cache(old); 42467e345d1SDavid Woodhouse 4251da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 4261da177e4SLinus Torvalds } 4271da177e4SLinus Torvalds 4281da177e4SLinus Torvalds void jffs2_free_ino_caches(struct jffs2_sb_info *c) 4291da177e4SLinus Torvalds { 4301da177e4SLinus Torvalds int i; 4311da177e4SLinus Torvalds struct jffs2_inode_cache *this, *next; 4321da177e4SLinus Torvalds 4331da177e4SLinus Torvalds for (i=0; i<INOCACHE_HASHSIZE; i++) { 4341da177e4SLinus Torvalds this = c->inocache_list[i]; 4351da177e4SLinus Torvalds while (this) { 4361da177e4SLinus Torvalds next = this->next; 4371da177e4SLinus Torvalds jffs2_free_inode_cache(this); 4381da177e4SLinus Torvalds this = next; 4391da177e4SLinus Torvalds } 4401da177e4SLinus Torvalds c->inocache_list[i] = NULL; 4411da177e4SLinus Torvalds } 4421da177e4SLinus Torvalds } 4431da177e4SLinus Torvalds 4441da177e4SLinus Torvalds void jffs2_free_raw_node_refs(struct jffs2_sb_info *c) 4451da177e4SLinus Torvalds { 4461da177e4SLinus Torvalds int i; 4471da177e4SLinus Torvalds struct jffs2_raw_node_ref *this, *next; 4481da177e4SLinus Torvalds 4491da177e4SLinus Torvalds for (i=0; i<c->nr_blocks; i++) { 4501da177e4SLinus Torvalds this = c->blocks[i].first_node; 4511da177e4SLinus Torvalds while(this) { 4521da177e4SLinus Torvalds next = this->next_phys; 4531da177e4SLinus Torvalds jffs2_free_raw_node_ref(this); 4541da177e4SLinus Torvalds this = next; 4551da177e4SLinus Torvalds } 4561da177e4SLinus Torvalds c->blocks[i].first_node = c->blocks[i].last_node = NULL; 4571da177e4SLinus Torvalds } 4581da177e4SLinus Torvalds } 4591da177e4SLinus Torvalds 4601da177e4SLinus Torvalds struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) 4611da177e4SLinus Torvalds { 4621da177e4SLinus Torvalds /* The common case in lookup is that there will be a node 4631da177e4SLinus Torvalds which precisely matches. So we go looking for that first */ 4641da177e4SLinus Torvalds struct rb_node *next; 4651da177e4SLinus Torvalds struct jffs2_node_frag *prev = NULL; 4661da177e4SLinus Torvalds struct jffs2_node_frag *frag = NULL; 4671da177e4SLinus Torvalds 468e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("root %p, offset %d\n", fragtree, offset); 4691da177e4SLinus Torvalds 4701da177e4SLinus Torvalds next = fragtree->rb_node; 4711da177e4SLinus Torvalds 4721da177e4SLinus Torvalds while(next) { 4731da177e4SLinus Torvalds frag = rb_entry(next, struct jffs2_node_frag, rb); 4741da177e4SLinus Torvalds 475e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("considering frag %#04x-%#04x (%p). left %p, right %p\n", 476e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag, frag->rb.rb_left, frag->rb.rb_right); 4771da177e4SLinus Torvalds if (frag->ofs + frag->size <= offset) { 478e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag %#04x-%#04x, before the region we care about\n", 479e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4801da177e4SLinus Torvalds /* Remember the closest smaller match on the way down */ 4811da177e4SLinus Torvalds if (!prev || frag->ofs > prev->ofs) 4821da177e4SLinus Torvalds prev = frag; 4831da177e4SLinus Torvalds next = frag->rb.rb_right; 4841da177e4SLinus Torvalds } else if (frag->ofs > offset) { 485e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag %#04x-%#04x, after the region we care about\n", 486e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4871da177e4SLinus Torvalds next = frag->rb.rb_left; 4881da177e4SLinus Torvalds } else { 489e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning frag %#04x-%#04x, matched\n", 490e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size); 4911da177e4SLinus Torvalds return frag; 4921da177e4SLinus Torvalds } 4931da177e4SLinus Torvalds } 4941da177e4SLinus Torvalds 4951da177e4SLinus Torvalds /* Exact match not found. Go back up looking at each parent, 4961da177e4SLinus Torvalds and return the closest smaller one */ 4971da177e4SLinus Torvalds 4981da177e4SLinus Torvalds if (prev) 499e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("no match. Returning frag %#04x-%#04x, closest previous\n", 500e0d60137SArtem B. Bityutskiy prev->ofs, prev->ofs+prev->size); 5011da177e4SLinus Torvalds else 502e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("returning NULL, empty fragtree\n"); 5031da177e4SLinus Torvalds 5041da177e4SLinus Torvalds return prev; 5051da177e4SLinus Torvalds } 5061da177e4SLinus Torvalds 5071da177e4SLinus Torvalds /* Pass 'c' argument to indicate that nodes should be marked obsolete as 5081da177e4SLinus Torvalds they're killed. */ 5091da177e4SLinus Torvalds void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) 5101da177e4SLinus Torvalds { 5111da177e4SLinus Torvalds struct jffs2_node_frag *frag; 5121da177e4SLinus Torvalds struct jffs2_node_frag *parent; 5131da177e4SLinus Torvalds 5141da177e4SLinus Torvalds if (!root->rb_node) 5151da177e4SLinus Torvalds return; 5161da177e4SLinus Torvalds 517e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE("killing\n"); 5181da177e4SLinus Torvalds 519e0d60137SArtem B. Bityutskiy frag = (rb_entry(root->rb_node, struct jffs2_node_frag, rb)); 5201da177e4SLinus Torvalds while(frag) { 5211da177e4SLinus Torvalds if (frag->rb.rb_left) { 522e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going left from frag (%p) %#04x-%#04x\n", 523e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 5241da177e4SLinus Torvalds frag = frag_left(frag); 5251da177e4SLinus Torvalds continue; 5261da177e4SLinus Torvalds } 5271da177e4SLinus Torvalds if (frag->rb.rb_right) { 528e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("going right from frag (%p) %#04x-%#04x\n", 529e0d60137SArtem B. Bityutskiy frag, frag->ofs, frag->ofs+frag->size); 5301da177e4SLinus Torvalds frag = frag_right(frag); 5311da177e4SLinus Torvalds continue; 5321da177e4SLinus Torvalds } 5331da177e4SLinus Torvalds 534e0d60137SArtem B. Bityutskiy JFFS2_DBG_FRAGTREE2("frag %#04x-%#04x: node %p, frags %d\n", 535e0d60137SArtem B. Bityutskiy frag->ofs, frag->ofs+frag->size, frag->node, frag->node?frag->node->frags:0); 5361da177e4SLinus Torvalds 5371da177e4SLinus Torvalds if (frag->node && !(--frag->node->frags)) { 5381da177e4SLinus Torvalds /* Not a hole, and it's the final remaining frag 5391da177e4SLinus Torvalds of this node. Free the node */ 5401da177e4SLinus Torvalds if (c) 5411da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, frag->node->raw); 5421da177e4SLinus Torvalds 5431da177e4SLinus Torvalds jffs2_free_full_dnode(frag->node); 5441da177e4SLinus Torvalds } 5451da177e4SLinus Torvalds parent = frag_parent(frag); 5461da177e4SLinus Torvalds if (parent) { 5471da177e4SLinus Torvalds if (frag_left(parent) == frag) 5481da177e4SLinus Torvalds parent->rb.rb_left = NULL; 5491da177e4SLinus Torvalds else 5501da177e4SLinus Torvalds parent->rb.rb_right = NULL; 5511da177e4SLinus Torvalds } 5521da177e4SLinus Torvalds 5531da177e4SLinus Torvalds jffs2_free_node_frag(frag); 5541da177e4SLinus Torvalds frag = parent; 5551da177e4SLinus Torvalds 5561da177e4SLinus Torvalds cond_resched(); 5571da177e4SLinus Torvalds } 5581da177e4SLinus Torvalds } 559