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 * 103cceb9f6SArtem B. Bityuckiy * $Id: gc.c,v 1.147 2005/03/20 21:43:22 dedekind Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 161da177e4SLinus Torvalds #include <linux/slab.h> 171da177e4SLinus Torvalds #include <linux/pagemap.h> 181da177e4SLinus Torvalds #include <linux/crc32.h> 191da177e4SLinus Torvalds #include <linux/compiler.h> 201da177e4SLinus Torvalds #include <linux/stat.h> 211da177e4SLinus Torvalds #include "nodelist.h" 221da177e4SLinus Torvalds #include "compr.h" 231da177e4SLinus Torvalds 241da177e4SLinus Torvalds static int jffs2_garbage_collect_pristine(struct jffs2_sb_info *c, 251da177e4SLinus Torvalds struct jffs2_inode_cache *ic, 261da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw); 271da177e4SLinus Torvalds static int jffs2_garbage_collect_metadata(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 281da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fd); 291da177e4SLinus Torvalds static int jffs2_garbage_collect_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 301da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dirent *fd); 311da177e4SLinus Torvalds static int jffs2_garbage_collect_deletion_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 321da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dirent *fd); 331da177e4SLinus Torvalds static int jffs2_garbage_collect_hole(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 341da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fn, 351da177e4SLinus Torvalds uint32_t start, uint32_t end); 361da177e4SLinus Torvalds static int jffs2_garbage_collect_dnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 371da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fn, 381da177e4SLinus Torvalds uint32_t start, uint32_t end); 391da177e4SLinus Torvalds static int jffs2_garbage_collect_live(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 401da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw, struct jffs2_inode_info *f); 411da177e4SLinus Torvalds 421da177e4SLinus Torvalds /* Called with erase_completion_lock held */ 431da177e4SLinus Torvalds static struct jffs2_eraseblock *jffs2_find_gc_block(struct jffs2_sb_info *c) 441da177e4SLinus Torvalds { 451da177e4SLinus Torvalds struct jffs2_eraseblock *ret; 461da177e4SLinus Torvalds struct list_head *nextlist = NULL; 471da177e4SLinus Torvalds int n = jiffies % 128; 481da177e4SLinus Torvalds 491da177e4SLinus Torvalds /* Pick an eraseblock to garbage collect next. This is where we'll 501da177e4SLinus Torvalds put the clever wear-levelling algorithms. Eventually. */ 511da177e4SLinus Torvalds /* We possibly want to favour the dirtier blocks more when the 521da177e4SLinus Torvalds number of free blocks is low. */ 53a42163d7SArtem B. Bityuckiy again: 541da177e4SLinus Torvalds if (!list_empty(&c->bad_used_list) && c->nr_free_blocks > c->resv_blocks_gcbad) { 551da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from bad_used_list to GC next\n")); 561da177e4SLinus Torvalds nextlist = &c->bad_used_list; 571da177e4SLinus Torvalds } else if (n < 50 && !list_empty(&c->erasable_list)) { 581da177e4SLinus Torvalds /* Note that most of them will have gone directly to be erased. 591da177e4SLinus Torvalds So don't favour the erasable_list _too_ much. */ 601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next\n")); 611da177e4SLinus Torvalds nextlist = &c->erasable_list; 621da177e4SLinus Torvalds } else if (n < 110 && !list_empty(&c->very_dirty_list)) { 631da177e4SLinus Torvalds /* Most of the time, pick one off the very_dirty list */ 641da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from very_dirty_list to GC next\n")); 651da177e4SLinus Torvalds nextlist = &c->very_dirty_list; 661da177e4SLinus Torvalds } else if (n < 126 && !list_empty(&c->dirty_list)) { 671da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from dirty_list to GC next\n")); 681da177e4SLinus Torvalds nextlist = &c->dirty_list; 691da177e4SLinus Torvalds } else if (!list_empty(&c->clean_list)) { 701da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from clean_list to GC next\n")); 711da177e4SLinus Torvalds nextlist = &c->clean_list; 721da177e4SLinus Torvalds } else if (!list_empty(&c->dirty_list)) { 731da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from dirty_list to GC next (clean_list was empty)\n")); 741da177e4SLinus Torvalds 751da177e4SLinus Torvalds nextlist = &c->dirty_list; 761da177e4SLinus Torvalds } else if (!list_empty(&c->very_dirty_list)) { 771da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from very_dirty_list to GC next (clean_list and dirty_list were empty)\n")); 781da177e4SLinus Torvalds nextlist = &c->very_dirty_list; 791da177e4SLinus Torvalds } else if (!list_empty(&c->erasable_list)) { 801da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Picking block from erasable_list to GC next (clean_list and {very_,}dirty_list were empty)\n")); 811da177e4SLinus Torvalds 821da177e4SLinus Torvalds nextlist = &c->erasable_list; 83a42163d7SArtem B. Bityuckiy } else if (!list_empty(&c->erasable_pending_wbuf_list)) { 84a42163d7SArtem B. Bityuckiy /* There are blocks are wating for the wbuf sync */ 85a42163d7SArtem B. Bityuckiy D1(printk(KERN_DEBUG "Synching wbuf in order to reuse erasable_pending_wbuf_list blocks\n")); 863cceb9f6SArtem B. Bityuckiy spin_unlock(&c->erase_completion_lock); 87a42163d7SArtem B. Bityuckiy jffs2_flush_wbuf_pad(c); 883cceb9f6SArtem B. Bityuckiy spin_lock(&c->erase_completion_lock); 89a42163d7SArtem B. Bityuckiy goto again; 901da177e4SLinus Torvalds } else { 911da177e4SLinus Torvalds /* Eep. All were empty */ 921da177e4SLinus Torvalds D1(printk(KERN_NOTICE "jffs2: No clean, dirty _or_ erasable blocks to GC from! Where are they all?\n")); 931da177e4SLinus Torvalds return NULL; 941da177e4SLinus Torvalds } 951da177e4SLinus Torvalds 961da177e4SLinus Torvalds ret = list_entry(nextlist->next, struct jffs2_eraseblock, list); 971da177e4SLinus Torvalds list_del(&ret->list); 981da177e4SLinus Torvalds c->gcblock = ret; 991da177e4SLinus Torvalds ret->gc_node = ret->first_node; 1001da177e4SLinus Torvalds if (!ret->gc_node) { 1011da177e4SLinus Torvalds printk(KERN_WARNING "Eep. ret->gc_node for block at 0x%08x is NULL\n", ret->offset); 1021da177e4SLinus Torvalds BUG(); 1031da177e4SLinus Torvalds } 1041da177e4SLinus Torvalds 1051da177e4SLinus Torvalds /* Have we accidentally picked a clean block with wasted space ? */ 1061da177e4SLinus Torvalds if (ret->wasted_size) { 1071da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Converting wasted_size %08x to dirty_size\n", ret->wasted_size)); 1081da177e4SLinus Torvalds ret->dirty_size += ret->wasted_size; 1091da177e4SLinus Torvalds c->wasted_size -= ret->wasted_size; 1101da177e4SLinus Torvalds c->dirty_size += ret->wasted_size; 1111da177e4SLinus Torvalds ret->wasted_size = 0; 1121da177e4SLinus Torvalds } 1131da177e4SLinus Torvalds 1141da177e4SLinus Torvalds D2(jffs2_dump_block_lists(c)); 1151da177e4SLinus Torvalds return ret; 1161da177e4SLinus Torvalds } 1171da177e4SLinus Torvalds 1181da177e4SLinus Torvalds /* jffs2_garbage_collect_pass 1191da177e4SLinus Torvalds * Make a single attempt to progress GC. Move one node, and possibly 1201da177e4SLinus Torvalds * start erasing one eraseblock. 1211da177e4SLinus Torvalds */ 1221da177e4SLinus Torvalds int jffs2_garbage_collect_pass(struct jffs2_sb_info *c) 1231da177e4SLinus Torvalds { 1241da177e4SLinus Torvalds struct jffs2_inode_info *f; 1251da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 1261da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 1271da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 1281da177e4SLinus Torvalds int ret = 0, inum, nlink; 1291da177e4SLinus Torvalds 1301da177e4SLinus Torvalds if (down_interruptible(&c->alloc_sem)) 1311da177e4SLinus Torvalds return -EINTR; 1321da177e4SLinus Torvalds 1331da177e4SLinus Torvalds for (;;) { 1341da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1351da177e4SLinus Torvalds if (!c->unchecked_size) 1361da177e4SLinus Torvalds break; 1371da177e4SLinus Torvalds 1381da177e4SLinus Torvalds /* We can't start doing GC yet. We haven't finished checking 1391da177e4SLinus Torvalds the node CRCs etc. Do it now. */ 1401da177e4SLinus Torvalds 1411da177e4SLinus Torvalds /* checked_ino is protected by the alloc_sem */ 1421da177e4SLinus Torvalds if (c->checked_ino > c->highest_ino) { 1431da177e4SLinus Torvalds printk(KERN_CRIT "Checked all inodes but still 0x%x bytes of unchecked space?\n", 1441da177e4SLinus Torvalds c->unchecked_size); 1451da177e4SLinus Torvalds D2(jffs2_dump_block_lists(c)); 1461da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1471da177e4SLinus Torvalds BUG(); 1481da177e4SLinus Torvalds } 1491da177e4SLinus Torvalds 1501da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1511da177e4SLinus Torvalds 1521da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 1531da177e4SLinus Torvalds 1541da177e4SLinus Torvalds ic = jffs2_get_ino_cache(c, c->checked_ino++); 1551da177e4SLinus Torvalds 1561da177e4SLinus Torvalds if (!ic) { 1571da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 1581da177e4SLinus Torvalds continue; 1591da177e4SLinus Torvalds } 1601da177e4SLinus Torvalds 1611da177e4SLinus Torvalds if (!ic->nlink) { 1621da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Skipping check of ino #%d with nlink zero\n", 1631da177e4SLinus Torvalds ic->ino)); 1641da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 1651da177e4SLinus Torvalds continue; 1661da177e4SLinus Torvalds } 1671da177e4SLinus Torvalds switch(ic->state) { 1681da177e4SLinus Torvalds case INO_STATE_CHECKEDABSENT: 1691da177e4SLinus Torvalds case INO_STATE_PRESENT: 1701da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Skipping ino #%u already checked\n", ic->ino)); 1711da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 1721da177e4SLinus Torvalds continue; 1731da177e4SLinus Torvalds 1741da177e4SLinus Torvalds case INO_STATE_GC: 1751da177e4SLinus Torvalds case INO_STATE_CHECKING: 1761da177e4SLinus Torvalds printk(KERN_WARNING "Inode #%u is in state %d during CRC check phase!\n", ic->ino, ic->state); 1771da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 1781da177e4SLinus Torvalds BUG(); 1791da177e4SLinus Torvalds 1801da177e4SLinus Torvalds case INO_STATE_READING: 1811da177e4SLinus Torvalds /* We need to wait for it to finish, lest we move on 1821da177e4SLinus Torvalds and trigger the BUG() above while we haven't yet 1831da177e4SLinus Torvalds finished checking all its nodes */ 1841da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Waiting for ino #%u to finish reading\n", ic->ino)); 1851da177e4SLinus Torvalds up(&c->alloc_sem); 1861da177e4SLinus Torvalds sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); 1871da177e4SLinus Torvalds return 0; 1881da177e4SLinus Torvalds 1891da177e4SLinus Torvalds default: 1901da177e4SLinus Torvalds BUG(); 1911da177e4SLinus Torvalds 1921da177e4SLinus Torvalds case INO_STATE_UNCHECKED: 1931da177e4SLinus Torvalds ; 1941da177e4SLinus Torvalds } 1951da177e4SLinus Torvalds ic->state = INO_STATE_CHECKING; 1961da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 1971da177e4SLinus Torvalds 1981da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_garbage_collect_pass() triggering inode scan of ino#%u\n", ic->ino)); 1991da177e4SLinus Torvalds 2001da177e4SLinus Torvalds ret = jffs2_do_crccheck_inode(c, ic); 2011da177e4SLinus Torvalds if (ret) 2021da177e4SLinus Torvalds printk(KERN_WARNING "Returned error for crccheck of ino #%u. Expect badness...\n", ic->ino); 2031da177e4SLinus Torvalds 2041da177e4SLinus Torvalds jffs2_set_inocache_state(c, ic, INO_STATE_CHECKEDABSENT); 2051da177e4SLinus Torvalds up(&c->alloc_sem); 2061da177e4SLinus Torvalds return ret; 2071da177e4SLinus Torvalds } 2081da177e4SLinus Torvalds 2091da177e4SLinus Torvalds /* First, work out which block we're garbage-collecting */ 2101da177e4SLinus Torvalds jeb = c->gcblock; 2111da177e4SLinus Torvalds 2121da177e4SLinus Torvalds if (!jeb) 2131da177e4SLinus Torvalds jeb = jffs2_find_gc_block(c); 2141da177e4SLinus Torvalds 2151da177e4SLinus Torvalds if (!jeb) { 2161da177e4SLinus Torvalds D1 (printk(KERN_NOTICE "jffs2: Couldn't find erase block to garbage collect!\n")); 2171da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2181da177e4SLinus Torvalds up(&c->alloc_sem); 2191da177e4SLinus Torvalds return -EIO; 2201da177e4SLinus Torvalds } 2211da177e4SLinus Torvalds 2221da177e4SLinus Torvalds D1(printk(KERN_DEBUG "GC from block %08x, used_size %08x, dirty_size %08x, free_size %08x\n", jeb->offset, jeb->used_size, jeb->dirty_size, jeb->free_size)); 2231da177e4SLinus Torvalds D1(if (c->nextblock) 2241da177e4SLinus Torvalds printk(KERN_DEBUG "Nextblock at %08x, used_size %08x, dirty_size %08x, wasted_size %08x, free_size %08x\n", c->nextblock->offset, c->nextblock->used_size, c->nextblock->dirty_size, c->nextblock->wasted_size, c->nextblock->free_size)); 2251da177e4SLinus Torvalds 2261da177e4SLinus Torvalds if (!jeb->used_size) { 2271da177e4SLinus Torvalds up(&c->alloc_sem); 2281da177e4SLinus Torvalds goto eraseit; 2291da177e4SLinus Torvalds } 2301da177e4SLinus Torvalds 2311da177e4SLinus Torvalds raw = jeb->gc_node; 2321da177e4SLinus Torvalds 2331da177e4SLinus Torvalds while(ref_obsolete(raw)) { 2341da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node at 0x%08x is obsolete... skipping\n", ref_offset(raw))); 2351da177e4SLinus Torvalds raw = raw->next_phys; 2361da177e4SLinus Torvalds if (unlikely(!raw)) { 2371da177e4SLinus Torvalds printk(KERN_WARNING "eep. End of raw list while still supposedly nodes to GC\n"); 2381da177e4SLinus Torvalds printk(KERN_WARNING "erase block at 0x%08x. free_size 0x%08x, dirty_size 0x%08x, used_size 0x%08x\n", 2391da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size); 2401da177e4SLinus Torvalds jeb->gc_node = raw; 2411da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2421da177e4SLinus Torvalds up(&c->alloc_sem); 2431da177e4SLinus Torvalds BUG(); 2441da177e4SLinus Torvalds } 2451da177e4SLinus Torvalds } 2461da177e4SLinus Torvalds jeb->gc_node = raw; 2471da177e4SLinus Torvalds 2481da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Going to garbage collect node at 0x%08x\n", ref_offset(raw))); 2491da177e4SLinus Torvalds 2501da177e4SLinus Torvalds if (!raw->next_in_ino) { 2511da177e4SLinus Torvalds /* Inode-less node. Clean marker, snapshot or something like that */ 2521da177e4SLinus Torvalds /* FIXME: If it's something that needs to be copied, including something 2531da177e4SLinus Torvalds we don't grok that has JFFS2_NODETYPE_RWCOMPAT_COPY, we should do so */ 2541da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2551da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, raw); 2561da177e4SLinus Torvalds up(&c->alloc_sem); 2571da177e4SLinus Torvalds goto eraseit_lock; 2581da177e4SLinus Torvalds } 2591da177e4SLinus Torvalds 2601da177e4SLinus Torvalds ic = jffs2_raw_ref_to_ic(raw); 2611da177e4SLinus Torvalds 2621da177e4SLinus Torvalds /* We need to hold the inocache. Either the erase_completion_lock or 2631da177e4SLinus Torvalds the inocache_lock are sufficient; we trade down since the inocache_lock 2641da177e4SLinus Torvalds causes less contention. */ 2651da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 2661da177e4SLinus Torvalds 2671da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2681da177e4SLinus Torvalds 2691da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_garbage_collect_pass collecting from block @0x%08x. Node @0x%08x(%d), ino #%u\n", jeb->offset, ref_offset(raw), ref_flags(raw), ic->ino)); 2701da177e4SLinus Torvalds 2711da177e4SLinus Torvalds /* Three possibilities: 2721da177e4SLinus Torvalds 1. Inode is already in-core. We must iget it and do proper 2731da177e4SLinus Torvalds updating to its fragtree, etc. 2741da177e4SLinus Torvalds 2. Inode is not in-core, node is REF_PRISTINE. We lock the 2751da177e4SLinus Torvalds inocache to prevent a read_inode(), copy the node intact. 2761da177e4SLinus Torvalds 3. Inode is not in-core, node is not pristine. We must iget() 2771da177e4SLinus Torvalds and take the slow path. 2781da177e4SLinus Torvalds */ 2791da177e4SLinus Torvalds 2801da177e4SLinus Torvalds switch(ic->state) { 2811da177e4SLinus Torvalds case INO_STATE_CHECKEDABSENT: 2821da177e4SLinus Torvalds /* It's been checked, but it's not currently in-core. 2831da177e4SLinus Torvalds We can just copy any pristine nodes, but have 2841da177e4SLinus Torvalds to prevent anyone else from doing read_inode() while 2851da177e4SLinus Torvalds we're at it, so we set the state accordingly */ 2861da177e4SLinus Torvalds if (ref_flags(raw) == REF_PRISTINE) 2871da177e4SLinus Torvalds ic->state = INO_STATE_GC; 2881da177e4SLinus Torvalds else { 2891da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Ino #%u is absent but node not REF_PRISTINE. Reading.\n", 2901da177e4SLinus Torvalds ic->ino)); 2911da177e4SLinus Torvalds } 2921da177e4SLinus Torvalds break; 2931da177e4SLinus Torvalds 2941da177e4SLinus Torvalds case INO_STATE_PRESENT: 2951da177e4SLinus Torvalds /* It's in-core. GC must iget() it. */ 2961da177e4SLinus Torvalds break; 2971da177e4SLinus Torvalds 2981da177e4SLinus Torvalds case INO_STATE_UNCHECKED: 2991da177e4SLinus Torvalds case INO_STATE_CHECKING: 3001da177e4SLinus Torvalds case INO_STATE_GC: 3011da177e4SLinus Torvalds /* Should never happen. We should have finished checking 3021da177e4SLinus Torvalds by the time we actually start doing any GC, and since 3031da177e4SLinus Torvalds we're holding the alloc_sem, no other garbage collection 3041da177e4SLinus Torvalds can happen. 3051da177e4SLinus Torvalds */ 3061da177e4SLinus Torvalds printk(KERN_CRIT "Inode #%u already in state %d in jffs2_garbage_collect_pass()!\n", 3071da177e4SLinus Torvalds ic->ino, ic->state); 3081da177e4SLinus Torvalds up(&c->alloc_sem); 3091da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3101da177e4SLinus Torvalds BUG(); 3111da177e4SLinus Torvalds 3121da177e4SLinus Torvalds case INO_STATE_READING: 3131da177e4SLinus Torvalds /* Someone's currently trying to read it. We must wait for 3141da177e4SLinus Torvalds them to finish and then go through the full iget() route 3151da177e4SLinus Torvalds to do the GC. However, sometimes read_inode() needs to get 3161da177e4SLinus Torvalds the alloc_sem() (for marking nodes invalid) so we must 3171da177e4SLinus Torvalds drop the alloc_sem before sleeping. */ 3181da177e4SLinus Torvalds 3191da177e4SLinus Torvalds up(&c->alloc_sem); 3201da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_garbage_collect_pass() waiting for ino #%u in state %d\n", 3211da177e4SLinus Torvalds ic->ino, ic->state)); 3221da177e4SLinus Torvalds sleep_on_spinunlock(&c->inocache_wq, &c->inocache_lock); 3231da177e4SLinus Torvalds /* And because we dropped the alloc_sem we must start again from the 3241da177e4SLinus Torvalds beginning. Ponder chance of livelock here -- we're returning success 3251da177e4SLinus Torvalds without actually making any progress. 3261da177e4SLinus Torvalds 3271da177e4SLinus Torvalds Q: What are the chances that the inode is back in INO_STATE_READING 3281da177e4SLinus Torvalds again by the time we next enter this function? And that this happens 3291da177e4SLinus Torvalds enough times to cause a real delay? 3301da177e4SLinus Torvalds 3311da177e4SLinus Torvalds A: Small enough that I don't care :) 3321da177e4SLinus Torvalds */ 3331da177e4SLinus Torvalds return 0; 3341da177e4SLinus Torvalds } 3351da177e4SLinus Torvalds 3361da177e4SLinus Torvalds /* OK. Now if the inode is in state INO_STATE_GC, we are going to copy the 3371da177e4SLinus Torvalds node intact, and we don't have to muck about with the fragtree etc. 3381da177e4SLinus Torvalds because we know it's not in-core. If it _was_ in-core, we go through 3391da177e4SLinus Torvalds all the iget() crap anyway */ 3401da177e4SLinus Torvalds 3411da177e4SLinus Torvalds if (ic->state == INO_STATE_GC) { 3421da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3431da177e4SLinus Torvalds 3441da177e4SLinus Torvalds ret = jffs2_garbage_collect_pristine(c, ic, raw); 3451da177e4SLinus Torvalds 3461da177e4SLinus Torvalds spin_lock(&c->inocache_lock); 3471da177e4SLinus Torvalds ic->state = INO_STATE_CHECKEDABSENT; 3481da177e4SLinus Torvalds wake_up(&c->inocache_wq); 3491da177e4SLinus Torvalds 3501da177e4SLinus Torvalds if (ret != -EBADFD) { 3511da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3521da177e4SLinus Torvalds goto release_sem; 3531da177e4SLinus Torvalds } 3541da177e4SLinus Torvalds 3551da177e4SLinus Torvalds /* Fall through if it wanted us to, with inocache_lock held */ 3561da177e4SLinus Torvalds } 3571da177e4SLinus Torvalds 3581da177e4SLinus Torvalds /* Prevent the fairly unlikely race where the gcblock is 3591da177e4SLinus Torvalds entirely obsoleted by the final close of a file which had 3601da177e4SLinus Torvalds the only valid nodes in the block, followed by erasure, 3611da177e4SLinus Torvalds followed by freeing of the ic because the erased block(s) 3621da177e4SLinus Torvalds held _all_ the nodes of that inode.... never been seen but 3631da177e4SLinus Torvalds it's vaguely possible. */ 3641da177e4SLinus Torvalds 3651da177e4SLinus Torvalds inum = ic->ino; 3661da177e4SLinus Torvalds nlink = ic->nlink; 3671da177e4SLinus Torvalds spin_unlock(&c->inocache_lock); 3681da177e4SLinus Torvalds 3691da177e4SLinus Torvalds f = jffs2_gc_fetch_inode(c, inum, nlink); 3701da177e4SLinus Torvalds if (IS_ERR(f)) { 3711da177e4SLinus Torvalds ret = PTR_ERR(f); 3721da177e4SLinus Torvalds goto release_sem; 3731da177e4SLinus Torvalds } 3741da177e4SLinus Torvalds if (!f) { 3751da177e4SLinus Torvalds ret = 0; 3761da177e4SLinus Torvalds goto release_sem; 3771da177e4SLinus Torvalds } 3781da177e4SLinus Torvalds 3791da177e4SLinus Torvalds ret = jffs2_garbage_collect_live(c, jeb, raw, f); 3801da177e4SLinus Torvalds 3811da177e4SLinus Torvalds jffs2_gc_release_inode(c, f); 3821da177e4SLinus Torvalds 3831da177e4SLinus Torvalds release_sem: 3841da177e4SLinus Torvalds up(&c->alloc_sem); 3851da177e4SLinus Torvalds 3861da177e4SLinus Torvalds eraseit_lock: 3871da177e4SLinus Torvalds /* If we've finished this block, start it erasing */ 3881da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3891da177e4SLinus Torvalds 3901da177e4SLinus Torvalds eraseit: 3911da177e4SLinus Torvalds if (c->gcblock && !c->gcblock->used_size) { 3921da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Block at 0x%08x completely obsoleted by GC. Moving to erase_pending_list\n", c->gcblock->offset)); 3931da177e4SLinus Torvalds /* We're GC'ing an empty block? */ 3941da177e4SLinus Torvalds list_add_tail(&c->gcblock->list, &c->erase_pending_list); 3951da177e4SLinus Torvalds c->gcblock = NULL; 3961da177e4SLinus Torvalds c->nr_erasing_blocks++; 3971da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 3981da177e4SLinus Torvalds } 3991da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4001da177e4SLinus Torvalds 4011da177e4SLinus Torvalds return ret; 4021da177e4SLinus Torvalds } 4031da177e4SLinus Torvalds 4041da177e4SLinus Torvalds static int jffs2_garbage_collect_live(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 4051da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw, struct jffs2_inode_info *f) 4061da177e4SLinus Torvalds { 4071da177e4SLinus Torvalds struct jffs2_node_frag *frag; 4081da177e4SLinus Torvalds struct jffs2_full_dnode *fn = NULL; 4091da177e4SLinus Torvalds struct jffs2_full_dirent *fd; 4101da177e4SLinus Torvalds uint32_t start = 0, end = 0, nrfrags = 0; 4111da177e4SLinus Torvalds int ret = 0; 4121da177e4SLinus Torvalds 4131da177e4SLinus Torvalds down(&f->sem); 4141da177e4SLinus Torvalds 4151da177e4SLinus Torvalds /* Now we have the lock for this inode. Check that it's still the one at the head 4161da177e4SLinus Torvalds of the list. */ 4171da177e4SLinus Torvalds 4181da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4191da177e4SLinus Torvalds 4201da177e4SLinus Torvalds if (c->gcblock != jeb) { 4211da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4221da177e4SLinus Torvalds D1(printk(KERN_DEBUG "GC block is no longer gcblock. Restart\n")); 4231da177e4SLinus Torvalds goto upnout; 4241da177e4SLinus Torvalds } 4251da177e4SLinus Torvalds if (ref_obsolete(raw)) { 4261da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4271da177e4SLinus Torvalds D1(printk(KERN_DEBUG "node to be GC'd was obsoleted in the meantime.\n")); 4281da177e4SLinus Torvalds /* They'll call again */ 4291da177e4SLinus Torvalds goto upnout; 4301da177e4SLinus Torvalds } 4311da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4321da177e4SLinus Torvalds 4331da177e4SLinus Torvalds /* OK. Looks safe. And nobody can get us now because we have the semaphore. Move the block */ 4341da177e4SLinus Torvalds if (f->metadata && f->metadata->raw == raw) { 4351da177e4SLinus Torvalds fn = f->metadata; 4361da177e4SLinus Torvalds ret = jffs2_garbage_collect_metadata(c, jeb, f, fn); 4371da177e4SLinus Torvalds goto upnout; 4381da177e4SLinus Torvalds } 4391da177e4SLinus Torvalds 4401da177e4SLinus Torvalds /* FIXME. Read node and do lookup? */ 4411da177e4SLinus Torvalds for (frag = frag_first(&f->fragtree); frag; frag = frag_next(frag)) { 4421da177e4SLinus Torvalds if (frag->node && frag->node->raw == raw) { 4431da177e4SLinus Torvalds fn = frag->node; 4441da177e4SLinus Torvalds end = frag->ofs + frag->size; 4451da177e4SLinus Torvalds if (!nrfrags++) 4461da177e4SLinus Torvalds start = frag->ofs; 4471da177e4SLinus Torvalds if (nrfrags == frag->node->frags) 4481da177e4SLinus Torvalds break; /* We've found them all */ 4491da177e4SLinus Torvalds } 4501da177e4SLinus Torvalds } 4511da177e4SLinus Torvalds if (fn) { 4521da177e4SLinus Torvalds if (ref_flags(raw) == REF_PRISTINE) { 4531da177e4SLinus Torvalds ret = jffs2_garbage_collect_pristine(c, f->inocache, raw); 4541da177e4SLinus Torvalds if (!ret) { 4551da177e4SLinus Torvalds /* Urgh. Return it sensibly. */ 4561da177e4SLinus Torvalds frag->node->raw = f->inocache->nodes; 4571da177e4SLinus Torvalds } 4581da177e4SLinus Torvalds if (ret != -EBADFD) 4591da177e4SLinus Torvalds goto upnout; 4601da177e4SLinus Torvalds } 4611da177e4SLinus Torvalds /* We found a datanode. Do the GC */ 4621da177e4SLinus Torvalds if((start >> PAGE_CACHE_SHIFT) < ((end-1) >> PAGE_CACHE_SHIFT)) { 4631da177e4SLinus Torvalds /* It crosses a page boundary. Therefore, it must be a hole. */ 4641da177e4SLinus Torvalds ret = jffs2_garbage_collect_hole(c, jeb, f, fn, start, end); 4651da177e4SLinus Torvalds } else { 4661da177e4SLinus Torvalds /* It could still be a hole. But we GC the page this way anyway */ 4671da177e4SLinus Torvalds ret = jffs2_garbage_collect_dnode(c, jeb, f, fn, start, end); 4681da177e4SLinus Torvalds } 4691da177e4SLinus Torvalds goto upnout; 4701da177e4SLinus Torvalds } 4711da177e4SLinus Torvalds 4721da177e4SLinus Torvalds /* Wasn't a dnode. Try dirent */ 4731da177e4SLinus Torvalds for (fd = f->dents; fd; fd=fd->next) { 4741da177e4SLinus Torvalds if (fd->raw == raw) 4751da177e4SLinus Torvalds break; 4761da177e4SLinus Torvalds } 4771da177e4SLinus Torvalds 4781da177e4SLinus Torvalds if (fd && fd->ino) { 4791da177e4SLinus Torvalds ret = jffs2_garbage_collect_dirent(c, jeb, f, fd); 4801da177e4SLinus Torvalds } else if (fd) { 4811da177e4SLinus Torvalds ret = jffs2_garbage_collect_deletion_dirent(c, jeb, f, fd); 4821da177e4SLinus Torvalds } else { 4831da177e4SLinus Torvalds printk(KERN_WARNING "Raw node at 0x%08x wasn't in node lists for ino #%u\n", 4841da177e4SLinus Torvalds ref_offset(raw), f->inocache->ino); 4851da177e4SLinus Torvalds if (ref_obsolete(raw)) { 4861da177e4SLinus Torvalds printk(KERN_WARNING "But it's obsolete so we don't mind too much\n"); 4871da177e4SLinus Torvalds } else { 4881da177e4SLinus Torvalds ret = -EIO; 4891da177e4SLinus Torvalds } 4901da177e4SLinus Torvalds } 4911da177e4SLinus Torvalds upnout: 4921da177e4SLinus Torvalds up(&f->sem); 4931da177e4SLinus Torvalds 4941da177e4SLinus Torvalds return ret; 4951da177e4SLinus Torvalds } 4961da177e4SLinus Torvalds 4971da177e4SLinus Torvalds static int jffs2_garbage_collect_pristine(struct jffs2_sb_info *c, 4981da177e4SLinus Torvalds struct jffs2_inode_cache *ic, 4991da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw) 5001da177e4SLinus Torvalds { 5011da177e4SLinus Torvalds union jffs2_node_union *node; 5021da177e4SLinus Torvalds struct jffs2_raw_node_ref *nraw; 5031da177e4SLinus Torvalds size_t retlen; 5041da177e4SLinus Torvalds int ret; 5051da177e4SLinus Torvalds uint32_t phys_ofs, alloclen; 5061da177e4SLinus Torvalds uint32_t crc, rawlen; 5071da177e4SLinus Torvalds int retried = 0; 5081da177e4SLinus Torvalds 5091da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Going to GC REF_PRISTINE node at 0x%08x\n", ref_offset(raw))); 5101da177e4SLinus Torvalds 5111da177e4SLinus Torvalds rawlen = ref_totlen(c, c->gcblock, raw); 5121da177e4SLinus Torvalds 5131da177e4SLinus Torvalds /* Ask for a small amount of space (or the totlen if smaller) because we 5141da177e4SLinus Torvalds don't want to force wastage of the end of a block if splitting would 5151da177e4SLinus Torvalds work. */ 5161da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, min_t(uint32_t, sizeof(struct jffs2_raw_inode) + JFFS2_MIN_DATA_LEN, 5171da177e4SLinus Torvalds rawlen), &phys_ofs, &alloclen); 5181da177e4SLinus Torvalds if (ret) 5191da177e4SLinus Torvalds return ret; 5201da177e4SLinus Torvalds 5211da177e4SLinus Torvalds if (alloclen < rawlen) { 5221da177e4SLinus Torvalds /* Doesn't fit untouched. We'll go the old route and split it */ 5231da177e4SLinus Torvalds return -EBADFD; 5241da177e4SLinus Torvalds } 5251da177e4SLinus Torvalds 5261da177e4SLinus Torvalds node = kmalloc(rawlen, GFP_KERNEL); 5271da177e4SLinus Torvalds if (!node) 5281da177e4SLinus Torvalds return -ENOMEM; 5291da177e4SLinus Torvalds 5301da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(raw), rawlen, &retlen, (char *)node); 5311da177e4SLinus Torvalds if (!ret && retlen != rawlen) 5321da177e4SLinus Torvalds ret = -EIO; 5331da177e4SLinus Torvalds if (ret) 5341da177e4SLinus Torvalds goto out_node; 5351da177e4SLinus Torvalds 5361da177e4SLinus Torvalds crc = crc32(0, node, sizeof(struct jffs2_unknown_node)-4); 5371da177e4SLinus Torvalds if (je32_to_cpu(node->u.hdr_crc) != crc) { 5381da177e4SLinus Torvalds printk(KERN_WARNING "Header CRC failed on REF_PRISTINE node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 5391da177e4SLinus Torvalds ref_offset(raw), je32_to_cpu(node->u.hdr_crc), crc); 5401da177e4SLinus Torvalds goto bail; 5411da177e4SLinus Torvalds } 5421da177e4SLinus Torvalds 5431da177e4SLinus Torvalds switch(je16_to_cpu(node->u.nodetype)) { 5441da177e4SLinus Torvalds case JFFS2_NODETYPE_INODE: 5451da177e4SLinus Torvalds crc = crc32(0, node, sizeof(node->i)-8); 5461da177e4SLinus Torvalds if (je32_to_cpu(node->i.node_crc) != crc) { 5471da177e4SLinus Torvalds printk(KERN_WARNING "Node CRC failed on REF_PRISTINE data node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 5481da177e4SLinus Torvalds ref_offset(raw), je32_to_cpu(node->i.node_crc), crc); 5491da177e4SLinus Torvalds goto bail; 5501da177e4SLinus Torvalds } 5511da177e4SLinus Torvalds 5521da177e4SLinus Torvalds if (je32_to_cpu(node->i.dsize)) { 5531da177e4SLinus Torvalds crc = crc32(0, node->i.data, je32_to_cpu(node->i.csize)); 5541da177e4SLinus Torvalds if (je32_to_cpu(node->i.data_crc) != crc) { 5551da177e4SLinus Torvalds printk(KERN_WARNING "Data CRC failed on REF_PRISTINE data node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 5561da177e4SLinus Torvalds ref_offset(raw), je32_to_cpu(node->i.data_crc), crc); 5571da177e4SLinus Torvalds goto bail; 5581da177e4SLinus Torvalds } 5591da177e4SLinus Torvalds } 5601da177e4SLinus Torvalds break; 5611da177e4SLinus Torvalds 5621da177e4SLinus Torvalds case JFFS2_NODETYPE_DIRENT: 5631da177e4SLinus Torvalds crc = crc32(0, node, sizeof(node->d)-8); 5641da177e4SLinus Torvalds if (je32_to_cpu(node->d.node_crc) != crc) { 5651da177e4SLinus Torvalds printk(KERN_WARNING "Node CRC failed on REF_PRISTINE dirent node at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 5661da177e4SLinus Torvalds ref_offset(raw), je32_to_cpu(node->d.node_crc), crc); 5671da177e4SLinus Torvalds goto bail; 5681da177e4SLinus Torvalds } 5691da177e4SLinus Torvalds 5701da177e4SLinus Torvalds if (node->d.nsize) { 5711da177e4SLinus Torvalds crc = crc32(0, node->d.name, node->d.nsize); 5721da177e4SLinus Torvalds if (je32_to_cpu(node->d.name_crc) != crc) { 5731da177e4SLinus Torvalds printk(KERN_WARNING "Name CRC failed on REF_PRISTINE dirent ode at 0x%08x: Read 0x%08x, calculated 0x%08x\n", 5741da177e4SLinus Torvalds ref_offset(raw), je32_to_cpu(node->d.name_crc), crc); 5751da177e4SLinus Torvalds goto bail; 5761da177e4SLinus Torvalds } 5771da177e4SLinus Torvalds } 5781da177e4SLinus Torvalds break; 5791da177e4SLinus Torvalds default: 5801da177e4SLinus Torvalds printk(KERN_WARNING "Unknown node type for REF_PRISTINE node at 0x%08x: 0x%04x\n", 5811da177e4SLinus Torvalds ref_offset(raw), je16_to_cpu(node->u.nodetype)); 5821da177e4SLinus Torvalds goto bail; 5831da177e4SLinus Torvalds } 5841da177e4SLinus Torvalds 5851da177e4SLinus Torvalds nraw = jffs2_alloc_raw_node_ref(); 5861da177e4SLinus Torvalds if (!nraw) { 5871da177e4SLinus Torvalds ret = -ENOMEM; 5881da177e4SLinus Torvalds goto out_node; 5891da177e4SLinus Torvalds } 5901da177e4SLinus Torvalds 5911da177e4SLinus Torvalds /* OK, all the CRCs are good; this node can just be copied as-is. */ 5921da177e4SLinus Torvalds retry: 5931da177e4SLinus Torvalds nraw->flash_offset = phys_ofs; 5941da177e4SLinus Torvalds nraw->__totlen = rawlen; 5951da177e4SLinus Torvalds nraw->next_phys = NULL; 5961da177e4SLinus Torvalds 5971da177e4SLinus Torvalds ret = jffs2_flash_write(c, phys_ofs, rawlen, &retlen, (char *)node); 5981da177e4SLinus Torvalds 5991da177e4SLinus Torvalds if (ret || (retlen != rawlen)) { 6001da177e4SLinus Torvalds printk(KERN_NOTICE "Write of %d bytes at 0x%08x failed. returned %d, retlen %zd\n", 6011da177e4SLinus Torvalds rawlen, phys_ofs, ret, retlen); 6021da177e4SLinus Torvalds if (retlen) { 6031da177e4SLinus Torvalds /* Doesn't belong to any inode */ 6041da177e4SLinus Torvalds nraw->next_in_ino = NULL; 6051da177e4SLinus Torvalds 6061da177e4SLinus Torvalds nraw->flash_offset |= REF_OBSOLETE; 6071da177e4SLinus Torvalds jffs2_add_physical_node_ref(c, nraw); 6081da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, nraw); 6091da177e4SLinus Torvalds } else { 6101da177e4SLinus Torvalds printk(KERN_NOTICE "Not marking the space at 0x%08x as dirty because the flash driver returned retlen zero\n", nraw->flash_offset); 6111da177e4SLinus Torvalds jffs2_free_raw_node_ref(nraw); 6121da177e4SLinus Torvalds } 6131da177e4SLinus Torvalds if (!retried && (nraw = jffs2_alloc_raw_node_ref())) { 6141da177e4SLinus Torvalds /* Try to reallocate space and retry */ 6151da177e4SLinus Torvalds uint32_t dummy; 6161da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = &c->blocks[phys_ofs / c->sector_size]; 6171da177e4SLinus Torvalds 6181da177e4SLinus Torvalds retried = 1; 6191da177e4SLinus Torvalds 6201da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Retrying failed write of REF_PRISTINE node.\n")); 6211da177e4SLinus Torvalds 6221da177e4SLinus Torvalds ACCT_SANITY_CHECK(c,jeb); 6231da177e4SLinus Torvalds D1(ACCT_PARANOIA_CHECK(jeb)); 6241da177e4SLinus Torvalds 6251da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, rawlen, &phys_ofs, &dummy); 6261da177e4SLinus Torvalds 6271da177e4SLinus Torvalds if (!ret) { 6281da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Allocated space at 0x%08x to retry failed write.\n", phys_ofs)); 6291da177e4SLinus Torvalds 6301da177e4SLinus Torvalds ACCT_SANITY_CHECK(c,jeb); 6311da177e4SLinus Torvalds D1(ACCT_PARANOIA_CHECK(jeb)); 6321da177e4SLinus Torvalds 6331da177e4SLinus Torvalds goto retry; 6341da177e4SLinus Torvalds } 6351da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Failed to allocate space to retry failed write: %d!\n", ret)); 6361da177e4SLinus Torvalds jffs2_free_raw_node_ref(nraw); 6371da177e4SLinus Torvalds } 6381da177e4SLinus Torvalds 6391da177e4SLinus Torvalds jffs2_free_raw_node_ref(nraw); 6401da177e4SLinus Torvalds if (!ret) 6411da177e4SLinus Torvalds ret = -EIO; 6421da177e4SLinus Torvalds goto out_node; 6431da177e4SLinus Torvalds } 6441da177e4SLinus Torvalds nraw->flash_offset |= REF_PRISTINE; 6451da177e4SLinus Torvalds jffs2_add_physical_node_ref(c, nraw); 6461da177e4SLinus Torvalds 6471da177e4SLinus Torvalds /* Link into per-inode list. This is safe because of the ic 6481da177e4SLinus Torvalds state being INO_STATE_GC. Note that if we're doing this 6491da177e4SLinus Torvalds for an inode which is in-core, the 'nraw' pointer is then 6501da177e4SLinus Torvalds going to be fetched from ic->nodes by our caller. */ 6511da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 6521da177e4SLinus Torvalds nraw->next_in_ino = ic->nodes; 6531da177e4SLinus Torvalds ic->nodes = nraw; 6541da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6551da177e4SLinus Torvalds 6561da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, raw); 6571da177e4SLinus Torvalds D1(printk(KERN_DEBUG "WHEEE! GC REF_PRISTINE node at 0x%08x succeeded\n", ref_offset(raw))); 6581da177e4SLinus Torvalds 6591da177e4SLinus Torvalds out_node: 6601da177e4SLinus Torvalds kfree(node); 6611da177e4SLinus Torvalds return ret; 6621da177e4SLinus Torvalds bail: 6631da177e4SLinus Torvalds ret = -EBADFD; 6641da177e4SLinus Torvalds goto out_node; 6651da177e4SLinus Torvalds } 6661da177e4SLinus Torvalds 6671da177e4SLinus Torvalds static int jffs2_garbage_collect_metadata(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 6681da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fn) 6691da177e4SLinus Torvalds { 6701da177e4SLinus Torvalds struct jffs2_full_dnode *new_fn; 6711da177e4SLinus Torvalds struct jffs2_raw_inode ri; 6721da177e4SLinus Torvalds jint16_t dev; 6731da177e4SLinus Torvalds char *mdata = NULL, mdatalen = 0; 6741da177e4SLinus Torvalds uint32_t alloclen, phys_ofs; 6751da177e4SLinus Torvalds int ret; 6761da177e4SLinus Torvalds 6771da177e4SLinus Torvalds if (S_ISBLK(JFFS2_F_I_MODE(f)) || 6781da177e4SLinus Torvalds S_ISCHR(JFFS2_F_I_MODE(f)) ) { 6791da177e4SLinus Torvalds /* For these, we don't actually need to read the old node */ 6801da177e4SLinus Torvalds /* FIXME: for minor or major > 255. */ 6811da177e4SLinus Torvalds dev = cpu_to_je16(((JFFS2_F_I_RDEV_MAJ(f) << 8) | 6821da177e4SLinus Torvalds JFFS2_F_I_RDEV_MIN(f))); 6831da177e4SLinus Torvalds mdata = (char *)&dev; 6841da177e4SLinus Torvalds mdatalen = sizeof(dev); 6851da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_garbage_collect_metadata(): Writing %d bytes of kdev_t\n", mdatalen)); 6861da177e4SLinus Torvalds } else if (S_ISLNK(JFFS2_F_I_MODE(f))) { 6871da177e4SLinus Torvalds mdatalen = fn->size; 6881da177e4SLinus Torvalds mdata = kmalloc(fn->size, GFP_KERNEL); 6891da177e4SLinus Torvalds if (!mdata) { 6901da177e4SLinus Torvalds printk(KERN_WARNING "kmalloc of mdata failed in jffs2_garbage_collect_metadata()\n"); 6911da177e4SLinus Torvalds return -ENOMEM; 6921da177e4SLinus Torvalds } 6931da177e4SLinus Torvalds ret = jffs2_read_dnode(c, f, fn, mdata, 0, mdatalen); 6941da177e4SLinus Torvalds if (ret) { 6951da177e4SLinus Torvalds printk(KERN_WARNING "read of old metadata failed in jffs2_garbage_collect_metadata(): %d\n", ret); 6961da177e4SLinus Torvalds kfree(mdata); 6971da177e4SLinus Torvalds return ret; 6981da177e4SLinus Torvalds } 6991da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_garbage_collect_metadata(): Writing %d bites of symlink target\n", mdatalen)); 7001da177e4SLinus Torvalds 7011da177e4SLinus Torvalds } 7021da177e4SLinus Torvalds 7031da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, sizeof(ri) + mdatalen, &phys_ofs, &alloclen); 7041da177e4SLinus Torvalds if (ret) { 7051da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_reserve_space_gc of %zd bytes for garbage_collect_metadata failed: %d\n", 7061da177e4SLinus Torvalds sizeof(ri)+ mdatalen, ret); 7071da177e4SLinus Torvalds goto out; 7081da177e4SLinus Torvalds } 7091da177e4SLinus Torvalds 7101da177e4SLinus Torvalds memset(&ri, 0, sizeof(ri)); 7111da177e4SLinus Torvalds ri.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 7121da177e4SLinus Torvalds ri.nodetype = cpu_to_je16(JFFS2_NODETYPE_INODE); 7131da177e4SLinus Torvalds ri.totlen = cpu_to_je32(sizeof(ri) + mdatalen); 7141da177e4SLinus Torvalds ri.hdr_crc = cpu_to_je32(crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4)); 7151da177e4SLinus Torvalds 7161da177e4SLinus Torvalds ri.ino = cpu_to_je32(f->inocache->ino); 7171da177e4SLinus Torvalds ri.version = cpu_to_je32(++f->highest_version); 7181da177e4SLinus Torvalds ri.mode = cpu_to_jemode(JFFS2_F_I_MODE(f)); 7191da177e4SLinus Torvalds ri.uid = cpu_to_je16(JFFS2_F_I_UID(f)); 7201da177e4SLinus Torvalds ri.gid = cpu_to_je16(JFFS2_F_I_GID(f)); 7211da177e4SLinus Torvalds ri.isize = cpu_to_je32(JFFS2_F_I_SIZE(f)); 7221da177e4SLinus Torvalds ri.atime = cpu_to_je32(JFFS2_F_I_ATIME(f)); 7231da177e4SLinus Torvalds ri.ctime = cpu_to_je32(JFFS2_F_I_CTIME(f)); 7241da177e4SLinus Torvalds ri.mtime = cpu_to_je32(JFFS2_F_I_MTIME(f)); 7251da177e4SLinus Torvalds ri.offset = cpu_to_je32(0); 7261da177e4SLinus Torvalds ri.csize = cpu_to_je32(mdatalen); 7271da177e4SLinus Torvalds ri.dsize = cpu_to_je32(mdatalen); 7281da177e4SLinus Torvalds ri.compr = JFFS2_COMPR_NONE; 7291da177e4SLinus Torvalds ri.node_crc = cpu_to_je32(crc32(0, &ri, sizeof(ri)-8)); 7301da177e4SLinus Torvalds ri.data_crc = cpu_to_je32(crc32(0, mdata, mdatalen)); 7311da177e4SLinus Torvalds 7321da177e4SLinus Torvalds new_fn = jffs2_write_dnode(c, f, &ri, mdata, mdatalen, phys_ofs, ALLOC_GC); 7331da177e4SLinus Torvalds 7341da177e4SLinus Torvalds if (IS_ERR(new_fn)) { 7351da177e4SLinus Torvalds printk(KERN_WARNING "Error writing new dnode: %ld\n", PTR_ERR(new_fn)); 7361da177e4SLinus Torvalds ret = PTR_ERR(new_fn); 7371da177e4SLinus Torvalds goto out; 7381da177e4SLinus Torvalds } 7391da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, fn->raw); 7401da177e4SLinus Torvalds jffs2_free_full_dnode(fn); 7411da177e4SLinus Torvalds f->metadata = new_fn; 7421da177e4SLinus Torvalds out: 7431da177e4SLinus Torvalds if (S_ISLNK(JFFS2_F_I_MODE(f))) 7441da177e4SLinus Torvalds kfree(mdata); 7451da177e4SLinus Torvalds return ret; 7461da177e4SLinus Torvalds } 7471da177e4SLinus Torvalds 7481da177e4SLinus Torvalds static int jffs2_garbage_collect_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 7491da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dirent *fd) 7501da177e4SLinus Torvalds { 7511da177e4SLinus Torvalds struct jffs2_full_dirent *new_fd; 7521da177e4SLinus Torvalds struct jffs2_raw_dirent rd; 7531da177e4SLinus Torvalds uint32_t alloclen, phys_ofs; 7541da177e4SLinus Torvalds int ret; 7551da177e4SLinus Torvalds 7561da177e4SLinus Torvalds rd.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 7571da177e4SLinus Torvalds rd.nodetype = cpu_to_je16(JFFS2_NODETYPE_DIRENT); 7581da177e4SLinus Torvalds rd.nsize = strlen(fd->name); 7591da177e4SLinus Torvalds rd.totlen = cpu_to_je32(sizeof(rd) + rd.nsize); 7601da177e4SLinus Torvalds rd.hdr_crc = cpu_to_je32(crc32(0, &rd, sizeof(struct jffs2_unknown_node)-4)); 7611da177e4SLinus Torvalds 7621da177e4SLinus Torvalds rd.pino = cpu_to_je32(f->inocache->ino); 7631da177e4SLinus Torvalds rd.version = cpu_to_je32(++f->highest_version); 7641da177e4SLinus Torvalds rd.ino = cpu_to_je32(fd->ino); 7651da177e4SLinus Torvalds rd.mctime = cpu_to_je32(max(JFFS2_F_I_MTIME(f), JFFS2_F_I_CTIME(f))); 7661da177e4SLinus Torvalds rd.type = fd->type; 7671da177e4SLinus Torvalds rd.node_crc = cpu_to_je32(crc32(0, &rd, sizeof(rd)-8)); 7681da177e4SLinus Torvalds rd.name_crc = cpu_to_je32(crc32(0, fd->name, rd.nsize)); 7691da177e4SLinus Torvalds 7701da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, sizeof(rd)+rd.nsize, &phys_ofs, &alloclen); 7711da177e4SLinus Torvalds if (ret) { 7721da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_reserve_space_gc of %zd bytes for garbage_collect_dirent failed: %d\n", 7731da177e4SLinus Torvalds sizeof(rd)+rd.nsize, ret); 7741da177e4SLinus Torvalds return ret; 7751da177e4SLinus Torvalds } 7761da177e4SLinus Torvalds new_fd = jffs2_write_dirent(c, f, &rd, fd->name, rd.nsize, phys_ofs, ALLOC_GC); 7771da177e4SLinus Torvalds 7781da177e4SLinus Torvalds if (IS_ERR(new_fd)) { 7791da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_write_dirent in garbage_collect_dirent failed: %ld\n", PTR_ERR(new_fd)); 7801da177e4SLinus Torvalds return PTR_ERR(new_fd); 7811da177e4SLinus Torvalds } 7821da177e4SLinus Torvalds jffs2_add_fd_to_list(c, new_fd, &f->dents); 7831da177e4SLinus Torvalds return 0; 7841da177e4SLinus Torvalds } 7851da177e4SLinus Torvalds 7861da177e4SLinus Torvalds static int jffs2_garbage_collect_deletion_dirent(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 7871da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dirent *fd) 7881da177e4SLinus Torvalds { 7891da177e4SLinus Torvalds struct jffs2_full_dirent **fdp = &f->dents; 7901da177e4SLinus Torvalds int found = 0; 7911da177e4SLinus Torvalds 7921da177e4SLinus Torvalds /* On a medium where we can't actually mark nodes obsolete 7931da177e4SLinus Torvalds pernamently, such as NAND flash, we need to work out 7941da177e4SLinus Torvalds whether this deletion dirent is still needed to actively 7951da177e4SLinus Torvalds delete a 'real' dirent with the same name that's still 7961da177e4SLinus Torvalds somewhere else on the flash. */ 7971da177e4SLinus Torvalds if (!jffs2_can_mark_obsolete(c)) { 7981da177e4SLinus Torvalds struct jffs2_raw_dirent *rd; 7991da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw; 8001da177e4SLinus Torvalds int ret; 8011da177e4SLinus Torvalds size_t retlen; 8021da177e4SLinus Torvalds int name_len = strlen(fd->name); 8031da177e4SLinus Torvalds uint32_t name_crc = crc32(0, fd->name, name_len); 8041da177e4SLinus Torvalds uint32_t rawlen = ref_totlen(c, jeb, fd->raw); 8051da177e4SLinus Torvalds 8061da177e4SLinus Torvalds rd = kmalloc(rawlen, GFP_KERNEL); 8071da177e4SLinus Torvalds if (!rd) 8081da177e4SLinus Torvalds return -ENOMEM; 8091da177e4SLinus Torvalds 8101da177e4SLinus Torvalds /* Prevent the erase code from nicking the obsolete node refs while 8111da177e4SLinus Torvalds we're looking at them. I really don't like this extra lock but 8121da177e4SLinus Torvalds can't see any alternative. Suggestions on a postcard to... */ 8131da177e4SLinus Torvalds down(&c->erase_free_sem); 8141da177e4SLinus Torvalds 8151da177e4SLinus Torvalds for (raw = f->inocache->nodes; raw != (void *)f->inocache; raw = raw->next_in_ino) { 8161da177e4SLinus Torvalds 8171da177e4SLinus Torvalds /* We only care about obsolete ones */ 8181da177e4SLinus Torvalds if (!(ref_obsolete(raw))) 8191da177e4SLinus Torvalds continue; 8201da177e4SLinus Torvalds 8211da177e4SLinus Torvalds /* Any dirent with the same name is going to have the same length... */ 8221da177e4SLinus Torvalds if (ref_totlen(c, NULL, raw) != rawlen) 8231da177e4SLinus Torvalds continue; 8241da177e4SLinus Torvalds 8251da177e4SLinus Torvalds /* Doesn't matter if there's one in the same erase block. We're going to 8261da177e4SLinus Torvalds delete it too at the same time. */ 8273be36675SAndrew Victor if (SECTOR_ADDR(raw->flash_offset) == SECTOR_ADDR(fd->raw->flash_offset)) 8281da177e4SLinus Torvalds continue; 8291da177e4SLinus Torvalds 8301da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Check potential deletion dirent at %08x\n", ref_offset(raw))); 8311da177e4SLinus Torvalds 8321da177e4SLinus Torvalds /* This is an obsolete node belonging to the same directory, and it's of the right 8331da177e4SLinus Torvalds length. We need to take a closer look...*/ 8341da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(raw), rawlen, &retlen, (char *)rd); 8351da177e4SLinus Torvalds if (ret) { 8361da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_g_c_deletion_dirent(): Read error (%d) reading obsolete node at %08x\n", ret, ref_offset(raw)); 8371da177e4SLinus Torvalds /* If we can't read it, we don't need to continue to obsolete it. Continue */ 8381da177e4SLinus Torvalds continue; 8391da177e4SLinus Torvalds } 8401da177e4SLinus Torvalds if (retlen != rawlen) { 8411da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_g_c_deletion_dirent(): Short read (%zd not %u) reading header from obsolete node at %08x\n", 8421da177e4SLinus Torvalds retlen, rawlen, ref_offset(raw)); 8431da177e4SLinus Torvalds continue; 8441da177e4SLinus Torvalds } 8451da177e4SLinus Torvalds 8461da177e4SLinus Torvalds if (je16_to_cpu(rd->nodetype) != JFFS2_NODETYPE_DIRENT) 8471da177e4SLinus Torvalds continue; 8481da177e4SLinus Torvalds 8491da177e4SLinus Torvalds /* If the name CRC doesn't match, skip */ 8501da177e4SLinus Torvalds if (je32_to_cpu(rd->name_crc) != name_crc) 8511da177e4SLinus Torvalds continue; 8521da177e4SLinus Torvalds 8531da177e4SLinus Torvalds /* If the name length doesn't match, or it's another deletion dirent, skip */ 8541da177e4SLinus Torvalds if (rd->nsize != name_len || !je32_to_cpu(rd->ino)) 8551da177e4SLinus Torvalds continue; 8561da177e4SLinus Torvalds 8571da177e4SLinus Torvalds /* OK, check the actual name now */ 8581da177e4SLinus Torvalds if (memcmp(rd->name, fd->name, name_len)) 8591da177e4SLinus Torvalds continue; 8601da177e4SLinus Torvalds 8611da177e4SLinus Torvalds /* OK. The name really does match. There really is still an older node on 8621da177e4SLinus Torvalds the flash which our deletion dirent obsoletes. So we have to write out 8631da177e4SLinus Torvalds a new deletion dirent to replace it */ 8641da177e4SLinus Torvalds up(&c->erase_free_sem); 8651da177e4SLinus Torvalds 8661da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Deletion dirent at %08x still obsoletes real dirent \"%s\" at %08x for ino #%u\n", 8671da177e4SLinus Torvalds ref_offset(fd->raw), fd->name, ref_offset(raw), je32_to_cpu(rd->ino))); 8681da177e4SLinus Torvalds kfree(rd); 8691da177e4SLinus Torvalds 8701da177e4SLinus Torvalds return jffs2_garbage_collect_dirent(c, jeb, f, fd); 8711da177e4SLinus Torvalds } 8721da177e4SLinus Torvalds 8731da177e4SLinus Torvalds up(&c->erase_free_sem); 8741da177e4SLinus Torvalds kfree(rd); 8751da177e4SLinus Torvalds } 8761da177e4SLinus Torvalds 8771da177e4SLinus Torvalds /* No need for it any more. Just mark it obsolete and remove it from the list */ 8781da177e4SLinus Torvalds while (*fdp) { 8791da177e4SLinus Torvalds if ((*fdp) == fd) { 8801da177e4SLinus Torvalds found = 1; 8811da177e4SLinus Torvalds *fdp = fd->next; 8821da177e4SLinus Torvalds break; 8831da177e4SLinus Torvalds } 8841da177e4SLinus Torvalds fdp = &(*fdp)->next; 8851da177e4SLinus Torvalds } 8861da177e4SLinus Torvalds if (!found) { 8871da177e4SLinus Torvalds printk(KERN_WARNING "Deletion dirent \"%s\" not found in list for ino #%u\n", fd->name, f->inocache->ino); 8881da177e4SLinus Torvalds } 8891da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, fd->raw); 8901da177e4SLinus Torvalds jffs2_free_full_dirent(fd); 8911da177e4SLinus Torvalds return 0; 8921da177e4SLinus Torvalds } 8931da177e4SLinus Torvalds 8941da177e4SLinus Torvalds static int jffs2_garbage_collect_hole(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 8951da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fn, 8961da177e4SLinus Torvalds uint32_t start, uint32_t end) 8971da177e4SLinus Torvalds { 8981da177e4SLinus Torvalds struct jffs2_raw_inode ri; 8991da177e4SLinus Torvalds struct jffs2_node_frag *frag; 9001da177e4SLinus Torvalds struct jffs2_full_dnode *new_fn; 9011da177e4SLinus Torvalds uint32_t alloclen, phys_ofs; 9021da177e4SLinus Torvalds int ret; 9031da177e4SLinus Torvalds 9041da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Writing replacement hole node for ino #%u from offset 0x%x to 0x%x\n", 9051da177e4SLinus Torvalds f->inocache->ino, start, end)); 9061da177e4SLinus Torvalds 9071da177e4SLinus Torvalds memset(&ri, 0, sizeof(ri)); 9081da177e4SLinus Torvalds 9091da177e4SLinus Torvalds if(fn->frags > 1) { 9101da177e4SLinus Torvalds size_t readlen; 9111da177e4SLinus Torvalds uint32_t crc; 9121da177e4SLinus Torvalds /* It's partially obsoleted by a later write. So we have to 9131da177e4SLinus Torvalds write it out again with the _same_ version as before */ 9141da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(fn->raw), sizeof(ri), &readlen, (char *)&ri); 9151da177e4SLinus Torvalds if (readlen != sizeof(ri) || ret) { 9161da177e4SLinus Torvalds printk(KERN_WARNING "Node read failed in jffs2_garbage_collect_hole. Ret %d, retlen %zd. Data will be lost by writing new hole node\n", ret, readlen); 9171da177e4SLinus Torvalds goto fill; 9181da177e4SLinus Torvalds } 9191da177e4SLinus Torvalds if (je16_to_cpu(ri.nodetype) != JFFS2_NODETYPE_INODE) { 9201da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had node type 0x%04x instead of JFFS2_NODETYPE_INODE(0x%04x)\n", 9211da177e4SLinus Torvalds ref_offset(fn->raw), 9221da177e4SLinus Torvalds je16_to_cpu(ri.nodetype), JFFS2_NODETYPE_INODE); 9231da177e4SLinus Torvalds return -EIO; 9241da177e4SLinus Torvalds } 9251da177e4SLinus Torvalds if (je32_to_cpu(ri.totlen) != sizeof(ri)) { 9261da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had totlen 0x%x instead of expected 0x%zx\n", 9271da177e4SLinus Torvalds ref_offset(fn->raw), 9281da177e4SLinus Torvalds je32_to_cpu(ri.totlen), sizeof(ri)); 9291da177e4SLinus Torvalds return -EIO; 9301da177e4SLinus Torvalds } 9311da177e4SLinus Torvalds crc = crc32(0, &ri, sizeof(ri)-8); 9321da177e4SLinus Torvalds if (crc != je32_to_cpu(ri.node_crc)) { 9331da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Node at 0x%08x had CRC 0x%08x which doesn't match calculated CRC 0x%08x\n", 9341da177e4SLinus Torvalds ref_offset(fn->raw), 9351da177e4SLinus Torvalds je32_to_cpu(ri.node_crc), crc); 9361da177e4SLinus Torvalds /* FIXME: We could possibly deal with this by writing new holes for each frag */ 9371da177e4SLinus Torvalds printk(KERN_WARNING "Data in the range 0x%08x to 0x%08x of inode #%u will be lost\n", 9381da177e4SLinus Torvalds start, end, f->inocache->ino); 9391da177e4SLinus Torvalds goto fill; 9401da177e4SLinus Torvalds } 9411da177e4SLinus Torvalds if (ri.compr != JFFS2_COMPR_ZERO) { 9421da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Node 0x%08x wasn't a hole node!\n", ref_offset(fn->raw)); 9431da177e4SLinus Torvalds printk(KERN_WARNING "Data in the range 0x%08x to 0x%08x of inode #%u will be lost\n", 9441da177e4SLinus Torvalds start, end, f->inocache->ino); 9451da177e4SLinus Torvalds goto fill; 9461da177e4SLinus Torvalds } 9471da177e4SLinus Torvalds } else { 9481da177e4SLinus Torvalds fill: 9491da177e4SLinus Torvalds ri.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 9501da177e4SLinus Torvalds ri.nodetype = cpu_to_je16(JFFS2_NODETYPE_INODE); 9511da177e4SLinus Torvalds ri.totlen = cpu_to_je32(sizeof(ri)); 9521da177e4SLinus Torvalds ri.hdr_crc = cpu_to_je32(crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4)); 9531da177e4SLinus Torvalds 9541da177e4SLinus Torvalds ri.ino = cpu_to_je32(f->inocache->ino); 9551da177e4SLinus Torvalds ri.version = cpu_to_je32(++f->highest_version); 9561da177e4SLinus Torvalds ri.offset = cpu_to_je32(start); 9571da177e4SLinus Torvalds ri.dsize = cpu_to_je32(end - start); 9581da177e4SLinus Torvalds ri.csize = cpu_to_je32(0); 9591da177e4SLinus Torvalds ri.compr = JFFS2_COMPR_ZERO; 9601da177e4SLinus Torvalds } 9611da177e4SLinus Torvalds ri.mode = cpu_to_jemode(JFFS2_F_I_MODE(f)); 9621da177e4SLinus Torvalds ri.uid = cpu_to_je16(JFFS2_F_I_UID(f)); 9631da177e4SLinus Torvalds ri.gid = cpu_to_je16(JFFS2_F_I_GID(f)); 9641da177e4SLinus Torvalds ri.isize = cpu_to_je32(JFFS2_F_I_SIZE(f)); 9651da177e4SLinus Torvalds ri.atime = cpu_to_je32(JFFS2_F_I_ATIME(f)); 9661da177e4SLinus Torvalds ri.ctime = cpu_to_je32(JFFS2_F_I_CTIME(f)); 9671da177e4SLinus Torvalds ri.mtime = cpu_to_je32(JFFS2_F_I_MTIME(f)); 9681da177e4SLinus Torvalds ri.data_crc = cpu_to_je32(0); 9691da177e4SLinus Torvalds ri.node_crc = cpu_to_je32(crc32(0, &ri, sizeof(ri)-8)); 9701da177e4SLinus Torvalds 9711da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, sizeof(ri), &phys_ofs, &alloclen); 9721da177e4SLinus Torvalds if (ret) { 9731da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_reserve_space_gc of %zd bytes for garbage_collect_hole failed: %d\n", 9741da177e4SLinus Torvalds sizeof(ri), ret); 9751da177e4SLinus Torvalds return ret; 9761da177e4SLinus Torvalds } 9771da177e4SLinus Torvalds new_fn = jffs2_write_dnode(c, f, &ri, NULL, 0, phys_ofs, ALLOC_GC); 9781da177e4SLinus Torvalds 9791da177e4SLinus Torvalds if (IS_ERR(new_fn)) { 9801da177e4SLinus Torvalds printk(KERN_WARNING "Error writing new hole node: %ld\n", PTR_ERR(new_fn)); 9811da177e4SLinus Torvalds return PTR_ERR(new_fn); 9821da177e4SLinus Torvalds } 9831da177e4SLinus Torvalds if (je32_to_cpu(ri.version) == f->highest_version) { 9841da177e4SLinus Torvalds jffs2_add_full_dnode_to_inode(c, f, new_fn); 9851da177e4SLinus Torvalds if (f->metadata) { 9861da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 9871da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 9881da177e4SLinus Torvalds f->metadata = NULL; 9891da177e4SLinus Torvalds } 9901da177e4SLinus Torvalds return 0; 9911da177e4SLinus Torvalds } 9921da177e4SLinus Torvalds 9931da177e4SLinus Torvalds /* 9941da177e4SLinus Torvalds * We should only get here in the case where the node we are 9951da177e4SLinus Torvalds * replacing had more than one frag, so we kept the same version 9961da177e4SLinus Torvalds * number as before. (Except in case of error -- see 'goto fill;' 9971da177e4SLinus Torvalds * above.) 9981da177e4SLinus Torvalds */ 9991da177e4SLinus Torvalds D1(if(unlikely(fn->frags <= 1)) { 10001da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Replacing fn with %d frag(s) but new ver %d != highest_version %d of ino #%d\n", 10011da177e4SLinus Torvalds fn->frags, je32_to_cpu(ri.version), f->highest_version, 10021da177e4SLinus Torvalds je32_to_cpu(ri.ino)); 10031da177e4SLinus Torvalds }); 10041da177e4SLinus Torvalds 10051da177e4SLinus Torvalds /* This is a partially-overlapped hole node. Mark it REF_NORMAL not REF_PRISTINE */ 10061da177e4SLinus Torvalds mark_ref_normal(new_fn->raw); 10071da177e4SLinus Torvalds 10081da177e4SLinus Torvalds for (frag = jffs2_lookup_node_frag(&f->fragtree, fn->ofs); 10091da177e4SLinus Torvalds frag; frag = frag_next(frag)) { 10101da177e4SLinus Torvalds if (frag->ofs > fn->size + fn->ofs) 10111da177e4SLinus Torvalds break; 10121da177e4SLinus Torvalds if (frag->node == fn) { 10131da177e4SLinus Torvalds frag->node = new_fn; 10141da177e4SLinus Torvalds new_fn->frags++; 10151da177e4SLinus Torvalds fn->frags--; 10161da177e4SLinus Torvalds } 10171da177e4SLinus Torvalds } 10181da177e4SLinus Torvalds if (fn->frags) { 10191da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: Old node still has frags!\n"); 10201da177e4SLinus Torvalds BUG(); 10211da177e4SLinus Torvalds } 10221da177e4SLinus Torvalds if (!new_fn->frags) { 10231da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_garbage_collect_hole: New node has no frags!\n"); 10241da177e4SLinus Torvalds BUG(); 10251da177e4SLinus Torvalds } 10261da177e4SLinus Torvalds 10271da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, fn->raw); 10281da177e4SLinus Torvalds jffs2_free_full_dnode(fn); 10291da177e4SLinus Torvalds 10301da177e4SLinus Torvalds return 0; 10311da177e4SLinus Torvalds } 10321da177e4SLinus Torvalds 10331da177e4SLinus Torvalds static int jffs2_garbage_collect_dnode(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, 10341da177e4SLinus Torvalds struct jffs2_inode_info *f, struct jffs2_full_dnode *fn, 10351da177e4SLinus Torvalds uint32_t start, uint32_t end) 10361da177e4SLinus Torvalds { 10371da177e4SLinus Torvalds struct jffs2_full_dnode *new_fn; 10381da177e4SLinus Torvalds struct jffs2_raw_inode ri; 10391da177e4SLinus Torvalds uint32_t alloclen, phys_ofs, offset, orig_end, orig_start; 10401da177e4SLinus Torvalds int ret = 0; 10411da177e4SLinus Torvalds unsigned char *comprbuf = NULL, *writebuf; 10421da177e4SLinus Torvalds unsigned long pg; 10431da177e4SLinus Torvalds unsigned char *pg_ptr; 10441da177e4SLinus Torvalds 10451da177e4SLinus Torvalds memset(&ri, 0, sizeof(ri)); 10461da177e4SLinus Torvalds 10471da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Writing replacement dnode for ino #%u from offset 0x%x to 0x%x\n", 10481da177e4SLinus Torvalds f->inocache->ino, start, end)); 10491da177e4SLinus Torvalds 10501da177e4SLinus Torvalds orig_end = end; 10511da177e4SLinus Torvalds orig_start = start; 10521da177e4SLinus Torvalds 10531da177e4SLinus Torvalds if (c->nr_free_blocks + c->nr_erasing_blocks > c->resv_blocks_gcmerge) { 10541da177e4SLinus Torvalds /* Attempt to do some merging. But only expand to cover logically 10551da177e4SLinus Torvalds adjacent frags if the block containing them is already considered 10561da177e4SLinus Torvalds to be dirty. Otherwise we end up with GC just going round in 10571da177e4SLinus Torvalds circles dirtying the nodes it already wrote out, especially 10581da177e4SLinus Torvalds on NAND where we have small eraseblocks and hence a much higher 10591da177e4SLinus Torvalds chance of nodes having to be split to cross boundaries. */ 10601da177e4SLinus Torvalds 10611da177e4SLinus Torvalds struct jffs2_node_frag *frag; 10621da177e4SLinus Torvalds uint32_t min, max; 10631da177e4SLinus Torvalds 10641da177e4SLinus Torvalds min = start & ~(PAGE_CACHE_SIZE-1); 10651da177e4SLinus Torvalds max = min + PAGE_CACHE_SIZE; 10661da177e4SLinus Torvalds 10671da177e4SLinus Torvalds frag = jffs2_lookup_node_frag(&f->fragtree, start); 10681da177e4SLinus Torvalds 10691da177e4SLinus Torvalds /* BUG_ON(!frag) but that'll happen anyway... */ 10701da177e4SLinus Torvalds 10711da177e4SLinus Torvalds BUG_ON(frag->ofs != start); 10721da177e4SLinus Torvalds 10731da177e4SLinus Torvalds /* First grow down... */ 10741da177e4SLinus Torvalds while((frag = frag_prev(frag)) && frag->ofs >= min) { 10751da177e4SLinus Torvalds 10761da177e4SLinus Torvalds /* If the previous frag doesn't even reach the beginning, there's 10771da177e4SLinus Torvalds excessive fragmentation. Just merge. */ 10781da177e4SLinus Torvalds if (frag->ofs > min) { 10791da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding down to cover partial frag (0x%x-0x%x)\n", 10801da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size)); 10811da177e4SLinus Torvalds start = frag->ofs; 10821da177e4SLinus Torvalds continue; 10831da177e4SLinus Torvalds } 10841da177e4SLinus Torvalds /* OK. This frag holds the first byte of the page. */ 10851da177e4SLinus Torvalds if (!frag->node || !frag->node->raw) { 10861da177e4SLinus Torvalds D1(printk(KERN_DEBUG "First frag in page is hole (0x%x-0x%x). Not expanding down.\n", 10871da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size)); 10881da177e4SLinus Torvalds break; 10891da177e4SLinus Torvalds } else { 10901da177e4SLinus Torvalds 10911da177e4SLinus Torvalds /* OK, it's a frag which extends to the beginning of the page. Does it live 10921da177e4SLinus Torvalds in a block which is still considered clean? If so, don't obsolete it. 10931da177e4SLinus Torvalds If not, cover it anyway. */ 10941da177e4SLinus Torvalds 10951da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw = frag->node->raw; 10961da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 10971da177e4SLinus Torvalds 10981da177e4SLinus Torvalds jeb = &c->blocks[raw->flash_offset / c->sector_size]; 10991da177e4SLinus Torvalds 11001da177e4SLinus Torvalds if (jeb == c->gcblock) { 11011da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding down to cover frag (0x%x-0x%x) in gcblock at %08x\n", 11021da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, ref_offset(raw))); 11031da177e4SLinus Torvalds start = frag->ofs; 11041da177e4SLinus Torvalds break; 11051da177e4SLinus Torvalds } 11061da177e4SLinus Torvalds if (!ISDIRTY(jeb->dirty_size + jeb->wasted_size)) { 11071da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Not expanding down to cover frag (0x%x-0x%x) in clean block %08x\n", 11081da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, jeb->offset)); 11091da177e4SLinus Torvalds break; 11101da177e4SLinus Torvalds } 11111da177e4SLinus Torvalds 11121da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding down to cover frag (0x%x-0x%x) in dirty block %08x\n", 11131da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, jeb->offset)); 11141da177e4SLinus Torvalds start = frag->ofs; 11151da177e4SLinus Torvalds break; 11161da177e4SLinus Torvalds } 11171da177e4SLinus Torvalds } 11181da177e4SLinus Torvalds 11191da177e4SLinus Torvalds /* ... then up */ 11201da177e4SLinus Torvalds 11211da177e4SLinus Torvalds /* Find last frag which is actually part of the node we're to GC. */ 11221da177e4SLinus Torvalds frag = jffs2_lookup_node_frag(&f->fragtree, end-1); 11231da177e4SLinus Torvalds 11241da177e4SLinus Torvalds while((frag = frag_next(frag)) && frag->ofs+frag->size <= max) { 11251da177e4SLinus Torvalds 11261da177e4SLinus Torvalds /* If the previous frag doesn't even reach the beginning, there's lots 11271da177e4SLinus Torvalds of fragmentation. Just merge. */ 11281da177e4SLinus Torvalds if (frag->ofs+frag->size < max) { 11291da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding up to cover partial frag (0x%x-0x%x)\n", 11301da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size)); 11311da177e4SLinus Torvalds end = frag->ofs + frag->size; 11321da177e4SLinus Torvalds continue; 11331da177e4SLinus Torvalds } 11341da177e4SLinus Torvalds 11351da177e4SLinus Torvalds if (!frag->node || !frag->node->raw) { 11361da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Last frag in page is hole (0x%x-0x%x). Not expanding up.\n", 11371da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size)); 11381da177e4SLinus Torvalds break; 11391da177e4SLinus Torvalds } else { 11401da177e4SLinus Torvalds 11411da177e4SLinus Torvalds /* OK, it's a frag which extends to the beginning of the page. Does it live 11421da177e4SLinus Torvalds in a block which is still considered clean? If so, don't obsolete it. 11431da177e4SLinus Torvalds If not, cover it anyway. */ 11441da177e4SLinus Torvalds 11451da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw = frag->node->raw; 11461da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 11471da177e4SLinus Torvalds 11481da177e4SLinus Torvalds jeb = &c->blocks[raw->flash_offset / c->sector_size]; 11491da177e4SLinus Torvalds 11501da177e4SLinus Torvalds if (jeb == c->gcblock) { 11511da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding up to cover frag (0x%x-0x%x) in gcblock at %08x\n", 11521da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, ref_offset(raw))); 11531da177e4SLinus Torvalds end = frag->ofs + frag->size; 11541da177e4SLinus Torvalds break; 11551da177e4SLinus Torvalds } 11561da177e4SLinus Torvalds if (!ISDIRTY(jeb->dirty_size + jeb->wasted_size)) { 11571da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Not expanding up to cover frag (0x%x-0x%x) in clean block %08x\n", 11581da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, jeb->offset)); 11591da177e4SLinus Torvalds break; 11601da177e4SLinus Torvalds } 11611da177e4SLinus Torvalds 11621da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanding up to cover frag (0x%x-0x%x) in dirty block %08x\n", 11631da177e4SLinus Torvalds frag->ofs, frag->ofs+frag->size, jeb->offset)); 11641da177e4SLinus Torvalds end = frag->ofs + frag->size; 11651da177e4SLinus Torvalds break; 11661da177e4SLinus Torvalds } 11671da177e4SLinus Torvalds } 11681da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Expanded dnode to write from (0x%x-0x%x) to (0x%x-0x%x)\n", 11691da177e4SLinus Torvalds orig_start, orig_end, start, end)); 11701da177e4SLinus Torvalds 11711da177e4SLinus Torvalds BUG_ON(end > JFFS2_F_I_SIZE(f)); 11721da177e4SLinus Torvalds BUG_ON(end < orig_end); 11731da177e4SLinus Torvalds BUG_ON(start > orig_start); 11741da177e4SLinus Torvalds } 11751da177e4SLinus Torvalds 11761da177e4SLinus Torvalds /* First, use readpage() to read the appropriate page into the page cache */ 11771da177e4SLinus Torvalds /* Q: What happens if we actually try to GC the _same_ page for which commit_write() 11781da177e4SLinus Torvalds * triggered garbage collection in the first place? 11791da177e4SLinus Torvalds * A: I _think_ it's OK. read_cache_page shouldn't deadlock, we'll write out the 11801da177e4SLinus Torvalds * page OK. We'll actually write it out again in commit_write, which is a little 11811da177e4SLinus Torvalds * suboptimal, but at least we're correct. 11821da177e4SLinus Torvalds */ 11831da177e4SLinus Torvalds pg_ptr = jffs2_gc_fetch_page(c, f, start, &pg); 11841da177e4SLinus Torvalds 11851da177e4SLinus Torvalds if (IS_ERR(pg_ptr)) { 11861da177e4SLinus Torvalds printk(KERN_WARNING "read_cache_page() returned error: %ld\n", PTR_ERR(pg_ptr)); 11871da177e4SLinus Torvalds return PTR_ERR(pg_ptr); 11881da177e4SLinus Torvalds } 11891da177e4SLinus Torvalds 11901da177e4SLinus Torvalds offset = start; 11911da177e4SLinus Torvalds while(offset < orig_end) { 11921da177e4SLinus Torvalds uint32_t datalen; 11931da177e4SLinus Torvalds uint32_t cdatalen; 11941da177e4SLinus Torvalds uint16_t comprtype = JFFS2_COMPR_NONE; 11951da177e4SLinus Torvalds 11961da177e4SLinus Torvalds ret = jffs2_reserve_space_gc(c, sizeof(ri) + JFFS2_MIN_DATA_LEN, &phys_ofs, &alloclen); 11971da177e4SLinus Torvalds 11981da177e4SLinus Torvalds if (ret) { 11991da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_reserve_space_gc of %zd bytes for garbage_collect_dnode failed: %d\n", 12001da177e4SLinus Torvalds sizeof(ri)+ JFFS2_MIN_DATA_LEN, ret); 12011da177e4SLinus Torvalds break; 12021da177e4SLinus Torvalds } 12031da177e4SLinus Torvalds cdatalen = min_t(uint32_t, alloclen - sizeof(ri), end - offset); 12041da177e4SLinus Torvalds datalen = end - offset; 12051da177e4SLinus Torvalds 12061da177e4SLinus Torvalds writebuf = pg_ptr + (offset & (PAGE_CACHE_SIZE -1)); 12071da177e4SLinus Torvalds 12081da177e4SLinus Torvalds comprtype = jffs2_compress(c, f, writebuf, &comprbuf, &datalen, &cdatalen); 12091da177e4SLinus Torvalds 12101da177e4SLinus Torvalds ri.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 12111da177e4SLinus Torvalds ri.nodetype = cpu_to_je16(JFFS2_NODETYPE_INODE); 12121da177e4SLinus Torvalds ri.totlen = cpu_to_je32(sizeof(ri) + cdatalen); 12131da177e4SLinus Torvalds ri.hdr_crc = cpu_to_je32(crc32(0, &ri, sizeof(struct jffs2_unknown_node)-4)); 12141da177e4SLinus Torvalds 12151da177e4SLinus Torvalds ri.ino = cpu_to_je32(f->inocache->ino); 12161da177e4SLinus Torvalds ri.version = cpu_to_je32(++f->highest_version); 12171da177e4SLinus Torvalds ri.mode = cpu_to_jemode(JFFS2_F_I_MODE(f)); 12181da177e4SLinus Torvalds ri.uid = cpu_to_je16(JFFS2_F_I_UID(f)); 12191da177e4SLinus Torvalds ri.gid = cpu_to_je16(JFFS2_F_I_GID(f)); 12201da177e4SLinus Torvalds ri.isize = cpu_to_je32(JFFS2_F_I_SIZE(f)); 12211da177e4SLinus Torvalds ri.atime = cpu_to_je32(JFFS2_F_I_ATIME(f)); 12221da177e4SLinus Torvalds ri.ctime = cpu_to_je32(JFFS2_F_I_CTIME(f)); 12231da177e4SLinus Torvalds ri.mtime = cpu_to_je32(JFFS2_F_I_MTIME(f)); 12241da177e4SLinus Torvalds ri.offset = cpu_to_je32(offset); 12251da177e4SLinus Torvalds ri.csize = cpu_to_je32(cdatalen); 12261da177e4SLinus Torvalds ri.dsize = cpu_to_je32(datalen); 12271da177e4SLinus Torvalds ri.compr = comprtype & 0xff; 12281da177e4SLinus Torvalds ri.usercompr = (comprtype >> 8) & 0xff; 12291da177e4SLinus Torvalds ri.node_crc = cpu_to_je32(crc32(0, &ri, sizeof(ri)-8)); 12301da177e4SLinus Torvalds ri.data_crc = cpu_to_je32(crc32(0, comprbuf, cdatalen)); 12311da177e4SLinus Torvalds 12321da177e4SLinus Torvalds new_fn = jffs2_write_dnode(c, f, &ri, comprbuf, cdatalen, phys_ofs, ALLOC_GC); 12331da177e4SLinus Torvalds 12341da177e4SLinus Torvalds jffs2_free_comprbuf(comprbuf, writebuf); 12351da177e4SLinus Torvalds 12361da177e4SLinus Torvalds if (IS_ERR(new_fn)) { 12371da177e4SLinus Torvalds printk(KERN_WARNING "Error writing new dnode: %ld\n", PTR_ERR(new_fn)); 12381da177e4SLinus Torvalds ret = PTR_ERR(new_fn); 12391da177e4SLinus Torvalds break; 12401da177e4SLinus Torvalds } 12411da177e4SLinus Torvalds ret = jffs2_add_full_dnode_to_inode(c, f, new_fn); 12421da177e4SLinus Torvalds offset += datalen; 12431da177e4SLinus Torvalds if (f->metadata) { 12441da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, f->metadata->raw); 12451da177e4SLinus Torvalds jffs2_free_full_dnode(f->metadata); 12461da177e4SLinus Torvalds f->metadata = NULL; 12471da177e4SLinus Torvalds } 12481da177e4SLinus Torvalds } 12491da177e4SLinus Torvalds 12501da177e4SLinus Torvalds jffs2_gc_release_page(c, pg_ptr, &pg); 12511da177e4SLinus Torvalds return ret; 12521da177e4SLinus Torvalds } 12531da177e4SLinus Torvalds 1254