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 * 10733802d9SArtem B. Bityutskiy * $Id: nodemgmt.c,v 1.127 2005/09/20 15:49:12 dedekind Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/slab.h> 161da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 171da177e4SLinus Torvalds #include <linux/compiler.h> 181da177e4SLinus Torvalds #include <linux/sched.h> /* For cond_resched() */ 191da177e4SLinus Torvalds #include "nodelist.h" 20e631ddbaSFerenc Havasi #include "debug.h" 211da177e4SLinus Torvalds 221da177e4SLinus Torvalds /** 231da177e4SLinus Torvalds * jffs2_reserve_space - request physical space to write nodes to flash 241da177e4SLinus Torvalds * @c: superblock info 251da177e4SLinus Torvalds * @minsize: Minimum acceptable size of allocation 261da177e4SLinus Torvalds * @ofs: Returned value of node offset 271da177e4SLinus Torvalds * @len: Returned value of allocation length 281da177e4SLinus Torvalds * @prio: Allocation type - ALLOC_{NORMAL,DELETION} 291da177e4SLinus Torvalds * 301da177e4SLinus Torvalds * Requests a block of physical space on the flash. Returns zero for success 311da177e4SLinus Torvalds * and puts 'ofs' and 'len' into the appriopriate place, or returns -ENOSPC 321da177e4SLinus Torvalds * or other error if appropriate. 331da177e4SLinus Torvalds * 341da177e4SLinus Torvalds * If it returns zero, jffs2_reserve_space() also downs the per-filesystem 351da177e4SLinus Torvalds * allocation semaphore, to prevent more than one allocation from being 361da177e4SLinus Torvalds * active at any time. The semaphore is later released by jffs2_commit_allocation() 371da177e4SLinus Torvalds * 381da177e4SLinus Torvalds * jffs2_reserve_space() may trigger garbage collection in order to make room 391da177e4SLinus Torvalds * for the requested allocation. 401da177e4SLinus Torvalds */ 411da177e4SLinus Torvalds 42e631ddbaSFerenc Havasi static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 43e631ddbaSFerenc Havasi uint32_t *ofs, uint32_t *len, uint32_t sumsize); 441da177e4SLinus Torvalds 45e631ddbaSFerenc Havasi int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs, 46e631ddbaSFerenc Havasi uint32_t *len, int prio, uint32_t sumsize) 471da177e4SLinus Torvalds { 481da177e4SLinus Torvalds int ret = -EAGAIN; 491da177e4SLinus Torvalds int blocksneeded = c->resv_blocks_write; 501da177e4SLinus Torvalds /* align it */ 511da177e4SLinus Torvalds minsize = PAD(minsize); 521da177e4SLinus Torvalds 531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space(): Requested 0x%x bytes\n", minsize)); 541da177e4SLinus Torvalds down(&c->alloc_sem); 551da177e4SLinus Torvalds 561da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space(): alloc sem got\n")); 571da177e4SLinus Torvalds 581da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 591da177e4SLinus Torvalds 601da177e4SLinus Torvalds /* this needs a little more thought (true <tglx> :)) */ 611da177e4SLinus Torvalds while(ret == -EAGAIN) { 621da177e4SLinus Torvalds while(c->nr_free_blocks + c->nr_erasing_blocks < blocksneeded) { 631da177e4SLinus Torvalds int ret; 641da177e4SLinus Torvalds uint32_t dirty, avail; 651da177e4SLinus Torvalds 661da177e4SLinus Torvalds /* calculate real dirty size 671da177e4SLinus Torvalds * dirty_size contains blocks on erase_pending_list 681da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 691da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 701da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 711da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 721da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 731da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 741da177e4SLinus Torvalds * We add unchecked_size here, as we hopefully will find some space to use. 751da177e4SLinus Torvalds * This will affect the sum only once, as gc first finishes checking 761da177e4SLinus Torvalds * of nodes. 771da177e4SLinus Torvalds */ 781da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size + c->unchecked_size; 791da177e4SLinus Torvalds if (dirty < c->nospc_dirty_size) { 801da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 814132ace8SArtem B. Bityuckiy D1(printk(KERN_NOTICE "jffs2_reserve_space(): Low on dirty space to GC, but it's a deletion. Allowing...\n")); 821da177e4SLinus Torvalds break; 831da177e4SLinus Torvalds } 841da177e4SLinus Torvalds D1(printk(KERN_DEBUG "dirty size 0x%08x + unchecked_size 0x%08x < nospc_dirty_size 0x%08x, returning -ENOSPC\n", 851da177e4SLinus Torvalds dirty, c->unchecked_size, c->sector_size)); 861da177e4SLinus Torvalds 871da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 881da177e4SLinus Torvalds up(&c->alloc_sem); 891da177e4SLinus Torvalds return -ENOSPC; 901da177e4SLinus Torvalds } 911da177e4SLinus Torvalds 921da177e4SLinus Torvalds /* Calc possibly available space. Possibly available means that we 931da177e4SLinus Torvalds * don't know, if unchecked size contains obsoleted nodes, which could give us some 941da177e4SLinus Torvalds * more usable space. This will affect the sum only once, as gc first finishes checking 951da177e4SLinus Torvalds * of nodes. 961da177e4SLinus Torvalds + Return -ENOSPC, if the maximum possibly available space is less or equal than 971da177e4SLinus Torvalds * blocksneeded * sector_size. 981da177e4SLinus Torvalds * This blocks endless gc looping on a filesystem, which is nearly full, even if 991da177e4SLinus Torvalds * the check above passes. 1001da177e4SLinus Torvalds */ 1011da177e4SLinus Torvalds avail = c->free_size + c->dirty_size + c->erasing_size + c->unchecked_size; 1021da177e4SLinus Torvalds if ( (avail / c->sector_size) <= blocksneeded) { 1031da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 1044132ace8SArtem B. Bityuckiy D1(printk(KERN_NOTICE "jffs2_reserve_space(): Low on possibly available space, but it's a deletion. Allowing...\n")); 1051da177e4SLinus Torvalds break; 1061da177e4SLinus Torvalds } 1071da177e4SLinus Torvalds 1081da177e4SLinus Torvalds D1(printk(KERN_DEBUG "max. available size 0x%08x < blocksneeded * sector_size 0x%08x, returning -ENOSPC\n", 1091da177e4SLinus Torvalds avail, blocksneeded * c->sector_size)); 1101da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1111da177e4SLinus Torvalds up(&c->alloc_sem); 1121da177e4SLinus Torvalds return -ENOSPC; 1131da177e4SLinus Torvalds } 1141da177e4SLinus Torvalds 1151da177e4SLinus Torvalds up(&c->alloc_sem); 1161da177e4SLinus Torvalds 1171da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Triggering GC pass. nr_free_blocks %d, nr_erasing_blocks %d, free_size 0x%08x, dirty_size 0x%08x, wasted_size 0x%08x, used_size 0x%08x, erasing_size 0x%08x, bad_size 0x%08x (total 0x%08x of 0x%08x)\n", 1181da177e4SLinus Torvalds c->nr_free_blocks, c->nr_erasing_blocks, c->free_size, c->dirty_size, c->wasted_size, c->used_size, c->erasing_size, c->bad_size, 1191da177e4SLinus Torvalds c->free_size + c->dirty_size + c->wasted_size + c->used_size + c->erasing_size + c->bad_size, c->flash_size)); 1201da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1211da177e4SLinus Torvalds 1221da177e4SLinus Torvalds ret = jffs2_garbage_collect_pass(c); 1231da177e4SLinus Torvalds if (ret) 1241da177e4SLinus Torvalds return ret; 1251da177e4SLinus Torvalds 1261da177e4SLinus Torvalds cond_resched(); 1271da177e4SLinus Torvalds 1281da177e4SLinus Torvalds if (signal_pending(current)) 1291da177e4SLinus Torvalds return -EINTR; 1301da177e4SLinus Torvalds 1311da177e4SLinus Torvalds down(&c->alloc_sem); 1321da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1331da177e4SLinus Torvalds } 1341da177e4SLinus Torvalds 135e631ddbaSFerenc Havasi ret = jffs2_do_reserve_space(c, minsize, ofs, len, sumsize); 1361da177e4SLinus Torvalds if (ret) { 1371da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space: ret is %d\n", ret)); 1381da177e4SLinus Torvalds } 1391da177e4SLinus Torvalds } 1401da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1411da177e4SLinus Torvalds if (ret) 1421da177e4SLinus Torvalds up(&c->alloc_sem); 1431da177e4SLinus Torvalds return ret; 1441da177e4SLinus Torvalds } 1451da177e4SLinus Torvalds 146e631ddbaSFerenc Havasi int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs, 147e631ddbaSFerenc Havasi uint32_t *len, uint32_t sumsize) 1481da177e4SLinus Torvalds { 1491da177e4SLinus Torvalds int ret = -EAGAIN; 1501da177e4SLinus Torvalds minsize = PAD(minsize); 1511da177e4SLinus Torvalds 1521da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space_gc(): Requested 0x%x bytes\n", minsize)); 1531da177e4SLinus Torvalds 1541da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1551da177e4SLinus Torvalds while(ret == -EAGAIN) { 156e631ddbaSFerenc Havasi ret = jffs2_do_reserve_space(c, minsize, ofs, len, sumsize); 1571da177e4SLinus Torvalds if (ret) { 1581da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space_gc: looping, ret is %d\n", ret)); 1591da177e4SLinus Torvalds } 1601da177e4SLinus Torvalds } 1611da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1621da177e4SLinus Torvalds return ret; 1631da177e4SLinus Torvalds } 1641da177e4SLinus Torvalds 1651da177e4SLinus Torvalds 166e631ddbaSFerenc Havasi /* Classify nextblock (clean, dirty of verydirty) and force to select an other one */ 167e631ddbaSFerenc Havasi 168e631ddbaSFerenc Havasi static void jffs2_close_nextblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 169e631ddbaSFerenc Havasi { 1701da177e4SLinus Torvalds 1711da177e4SLinus Torvalds /* Check, if we have a dirty block now, or if it was dirty already */ 1721da177e4SLinus Torvalds if (ISDIRTY (jeb->wasted_size + jeb->dirty_size)) { 1731da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 1741da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 1751da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 1761da177e4SLinus Torvalds jeb->wasted_size = 0; 1771da177e4SLinus Torvalds if (VERYDIRTY(c, jeb->dirty_size)) { 1781da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding full erase block at 0x%08x to very_dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 1791da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1801da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 1811da177e4SLinus Torvalds } else { 1821da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding full erase block at 0x%08x to dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 1831da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1841da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 1851da177e4SLinus Torvalds } 1861da177e4SLinus Torvalds } else { 1871da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 1881da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1891da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 1901da177e4SLinus Torvalds } 191e631ddbaSFerenc Havasi c->nextblock = NULL; 192e631ddbaSFerenc Havasi 1931da177e4SLinus Torvalds } 1941da177e4SLinus Torvalds 195e631ddbaSFerenc Havasi /* Select a new jeb for nextblock */ 196e631ddbaSFerenc Havasi 197e631ddbaSFerenc Havasi static int jffs2_find_nextblock(struct jffs2_sb_info *c) 198e631ddbaSFerenc Havasi { 1991da177e4SLinus Torvalds struct list_head *next; 200e631ddbaSFerenc Havasi 2011da177e4SLinus Torvalds /* Take the next block off the 'free' list */ 2021da177e4SLinus Torvalds 2031da177e4SLinus Torvalds if (list_empty(&c->free_list)) { 2041da177e4SLinus Torvalds 2051da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2061da177e4SLinus Torvalds !list_empty(&c->erasable_list)) { 2071da177e4SLinus Torvalds struct jffs2_eraseblock *ejeb; 2081da177e4SLinus Torvalds 2091da177e4SLinus Torvalds ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); 2101da177e4SLinus Torvalds list_del(&ejeb->list); 2111da177e4SLinus Torvalds list_add_tail(&ejeb->list, &c->erase_pending_list); 2121da177e4SLinus Torvalds c->nr_erasing_blocks++; 2131da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 214e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock: Triggering erase of erasable block at 0x%08x\n", 2151da177e4SLinus Torvalds ejeb->offset)); 2161da177e4SLinus Torvalds } 2171da177e4SLinus Torvalds 2181da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2191da177e4SLinus Torvalds !list_empty(&c->erasable_pending_wbuf_list)) { 220e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock: Flushing write buffer\n")); 2211da177e4SLinus Torvalds /* c->nextblock is NULL, no update to c->nextblock allowed */ 2221da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2231da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 2241da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 2251da177e4SLinus Torvalds /* Have another go. It'll be on the erasable_list now */ 2261da177e4SLinus Torvalds return -EAGAIN; 2271da177e4SLinus Torvalds } 2281da177e4SLinus Torvalds 2291da177e4SLinus Torvalds if (!c->nr_erasing_blocks) { 2301da177e4SLinus Torvalds /* Ouch. We're in GC, or we wouldn't have got here. 2311da177e4SLinus Torvalds And there's no space left. At all. */ 2321da177e4SLinus Torvalds printk(KERN_CRIT "Argh. No free space left for GC. nr_erasing_blocks is %d. nr_free_blocks is %d. (erasableempty: %s, erasingempty: %s, erasependingempty: %s)\n", 2331da177e4SLinus Torvalds c->nr_erasing_blocks, c->nr_free_blocks, list_empty(&c->erasable_list)?"yes":"no", 2341da177e4SLinus Torvalds list_empty(&c->erasing_list)?"yes":"no", list_empty(&c->erase_pending_list)?"yes":"no"); 2351da177e4SLinus Torvalds return -ENOSPC; 2361da177e4SLinus Torvalds } 2371da177e4SLinus Torvalds 2381da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2391da177e4SLinus Torvalds /* Don't wait for it; just erase one right now */ 2401da177e4SLinus Torvalds jffs2_erase_pending_blocks(c, 1); 2411da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 2421da177e4SLinus Torvalds 2431da177e4SLinus Torvalds /* An erase may have failed, decreasing the 2441da177e4SLinus Torvalds amount of free space available. So we must 2451da177e4SLinus Torvalds restart from the beginning */ 2461da177e4SLinus Torvalds return -EAGAIN; 2471da177e4SLinus Torvalds } 2481da177e4SLinus Torvalds 2491da177e4SLinus Torvalds next = c->free_list.next; 2501da177e4SLinus Torvalds list_del(next); 251e631ddbaSFerenc Havasi c->nextblock = list_entry(next, struct jffs2_eraseblock, list); 2521da177e4SLinus Torvalds c->nr_free_blocks--; 2531da177e4SLinus Torvalds 254e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); /* reset collected summary */ 255e631ddbaSFerenc Havasi 256e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock(): new nextblock = 0x%08x\n", c->nextblock->offset)); 257e631ddbaSFerenc Havasi 258e631ddbaSFerenc Havasi return 0; 259e631ddbaSFerenc Havasi } 260e631ddbaSFerenc Havasi 261e631ddbaSFerenc Havasi /* Called with alloc sem _and_ erase_completion_lock */ 262e631ddbaSFerenc Havasi static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, uint32_t *ofs, uint32_t *len, uint32_t sumsize) 263e631ddbaSFerenc Havasi { 264e631ddbaSFerenc Havasi struct jffs2_eraseblock *jeb = c->nextblock; 265e631ddbaSFerenc Havasi uint32_t reserved_size; /* for summary information at the end of the jeb */ 266e631ddbaSFerenc Havasi int ret; 267e631ddbaSFerenc Havasi 268e631ddbaSFerenc Havasi restart: 269e631ddbaSFerenc Havasi reserved_size = 0; 270e631ddbaSFerenc Havasi 271e631ddbaSFerenc Havasi if (jffs2_sum_active() && (sumsize != JFFS2_SUMMARY_NOSUM_SIZE)) { 272e631ddbaSFerenc Havasi /* NOSUM_SIZE means not to generate summary */ 273e631ddbaSFerenc Havasi 274e631ddbaSFerenc Havasi if (jeb) { 275e631ddbaSFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 276733802d9SArtem B. Bityutskiy dbg_summary("minsize=%d , jeb->free=%d ," 277e631ddbaSFerenc Havasi "summary->size=%d , sumsize=%d\n", 278e631ddbaSFerenc Havasi minsize, jeb->free_size, 279e631ddbaSFerenc Havasi c->summary->sum_size, sumsize); 280e631ddbaSFerenc Havasi } 281e631ddbaSFerenc Havasi 282e631ddbaSFerenc Havasi /* Is there enough space for writing out the current node, or we have to 283e631ddbaSFerenc Havasi write out summary information now, close this jeb and select new nextblock? */ 284e631ddbaSFerenc Havasi if (jeb && (PAD(minsize) + PAD(c->summary->sum_size + sumsize + 285e631ddbaSFerenc Havasi JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size)) { 286e631ddbaSFerenc Havasi 287e631ddbaSFerenc Havasi /* Has summary been disabled for this jeb? */ 288e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 289e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 290e631ddbaSFerenc Havasi goto restart; 291e631ddbaSFerenc Havasi } 292e631ddbaSFerenc Havasi 293e631ddbaSFerenc Havasi /* Writing out the collected summary information */ 294733802d9SArtem B. Bityutskiy dbg_summary("generating summary for 0x%08x.\n", jeb->offset); 295e631ddbaSFerenc Havasi ret = jffs2_sum_write_sumnode(c); 296e631ddbaSFerenc Havasi 297e631ddbaSFerenc Havasi if (ret) 298e631ddbaSFerenc Havasi return ret; 299e631ddbaSFerenc Havasi 300e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 301e631ddbaSFerenc Havasi /* jffs2_write_sumnode() couldn't write out the summary information 302e631ddbaSFerenc Havasi diabling summary for this jeb and free the collected information 303e631ddbaSFerenc Havasi */ 304e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 305e631ddbaSFerenc Havasi goto restart; 306e631ddbaSFerenc Havasi } 307e631ddbaSFerenc Havasi 308e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 309e631ddbaSFerenc Havasi jeb = NULL; 31034c0e906SFerenc Havasi /* keep always valid value in reserved_size */ 31134c0e906SFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 312e631ddbaSFerenc Havasi } 313e631ddbaSFerenc Havasi } else { 314e631ddbaSFerenc Havasi if (jeb && minsize > jeb->free_size) { 315e631ddbaSFerenc Havasi /* Skip the end of this block and file it as having some dirty space */ 316e631ddbaSFerenc Havasi /* If there's a pending write to it, flush now */ 317e631ddbaSFerenc Havasi 318e631ddbaSFerenc Havasi if (jffs2_wbuf_dirty(c)) { 319e631ddbaSFerenc Havasi spin_unlock(&c->erase_completion_lock); 320e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_do_reserve_space: Flushing write buffer\n")); 321e631ddbaSFerenc Havasi jffs2_flush_wbuf_pad(c); 322e631ddbaSFerenc Havasi spin_lock(&c->erase_completion_lock); 323e631ddbaSFerenc Havasi jeb = c->nextblock; 324e631ddbaSFerenc Havasi goto restart; 325e631ddbaSFerenc Havasi } 326e631ddbaSFerenc Havasi 327e631ddbaSFerenc Havasi c->wasted_size += jeb->free_size; 328e631ddbaSFerenc Havasi c->free_size -= jeb->free_size; 329e631ddbaSFerenc Havasi jeb->wasted_size += jeb->free_size; 330e631ddbaSFerenc Havasi jeb->free_size = 0; 331e631ddbaSFerenc Havasi 332e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 333e631ddbaSFerenc Havasi jeb = NULL; 334e631ddbaSFerenc Havasi } 335e631ddbaSFerenc Havasi } 336e631ddbaSFerenc Havasi 337e631ddbaSFerenc Havasi if (!jeb) { 338e631ddbaSFerenc Havasi 339e631ddbaSFerenc Havasi ret = jffs2_find_nextblock(c); 340e631ddbaSFerenc Havasi if (ret) 341e631ddbaSFerenc Havasi return ret; 342e631ddbaSFerenc Havasi 343e631ddbaSFerenc Havasi jeb = c->nextblock; 344e631ddbaSFerenc Havasi 3451da177e4SLinus Torvalds if (jeb->free_size != c->sector_size - c->cleanmarker_size) { 3461da177e4SLinus Torvalds printk(KERN_WARNING "Eep. Block 0x%08x taken from free_list had free_size of 0x%08x!!\n", jeb->offset, jeb->free_size); 3471da177e4SLinus Torvalds goto restart; 3481da177e4SLinus Torvalds } 3491da177e4SLinus Torvalds } 3501da177e4SLinus Torvalds /* OK, jeb (==c->nextblock) is now pointing at a block which definitely has 3511da177e4SLinus Torvalds enough space */ 3521da177e4SLinus Torvalds *ofs = jeb->offset + (c->sector_size - jeb->free_size); 353e631ddbaSFerenc Havasi *len = jeb->free_size - reserved_size; 3541da177e4SLinus Torvalds 3551da177e4SLinus Torvalds if (c->cleanmarker_size && jeb->used_size == c->cleanmarker_size && 3561da177e4SLinus Torvalds !jeb->first_node->next_in_ino) { 3571da177e4SLinus Torvalds /* Only node in it beforehand was a CLEANMARKER node (we think). 3581da177e4SLinus Torvalds So mark it obsolete now that there's going to be another node 3591da177e4SLinus Torvalds in the block. This will reduce used_size to zero but We've 3601da177e4SLinus Torvalds already set c->nextblock so that jffs2_mark_node_obsolete() 3611da177e4SLinus Torvalds won't try to refile it to the dirty_list. 3621da177e4SLinus Torvalds */ 3631da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 3641da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, jeb->first_node); 3651da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3661da177e4SLinus Torvalds } 3671da177e4SLinus Torvalds 3681da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_do_reserve_space(): Giving 0x%x bytes at 0x%x\n", *len, *ofs)); 3691da177e4SLinus Torvalds return 0; 3701da177e4SLinus Torvalds } 3711da177e4SLinus Torvalds 3721da177e4SLinus Torvalds /** 3731da177e4SLinus Torvalds * jffs2_add_physical_node_ref - add a physical node reference to the list 3741da177e4SLinus Torvalds * @c: superblock info 3751da177e4SLinus Torvalds * @new: new node reference to add 3761da177e4SLinus Torvalds * @len: length of this physical node 3771da177e4SLinus Torvalds * 3781da177e4SLinus Torvalds * Should only be used to report nodes for which space has been allocated 3791da177e4SLinus Torvalds * by jffs2_reserve_space. 3801da177e4SLinus Torvalds * 3811da177e4SLinus Torvalds * Must be called with the alloc_sem held. 3821da177e4SLinus Torvalds */ 3831da177e4SLinus Torvalds 384b64335f2SDavid Woodhouse int jffs2_add_physical_node_ref(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *new, uint32_t len) 3851da177e4SLinus Torvalds { 3861da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 3871da177e4SLinus Torvalds 3881da177e4SLinus Torvalds jeb = &c->blocks[new->flash_offset / c->sector_size]; 389ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 390b64335f2SDavid Woodhouse new->__totlen = len; 391ca89a517SDavid Woodhouse #endif 3921da177e4SLinus Torvalds 3931da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_add_physical_node_ref(): Node at 0x%x(%d), size 0x%x\n", ref_offset(new), ref_flags(new), len)); 3941da177e4SLinus Torvalds #if 1 3953118db3dSEstelle Hammache /* we could get some obsolete nodes after nextblock was refiled 3963118db3dSEstelle Hammache in wbuf.c */ 3973118db3dSEstelle Hammache if ((c->nextblock || !ref_obsolete(new)) 3989b88f473SEstelle Hammache &&(jeb != c->nextblock || ref_offset(new) != jeb->offset + (c->sector_size - jeb->free_size))) { 3991da177e4SLinus Torvalds printk(KERN_WARNING "argh. node added in wrong place\n"); 4001da177e4SLinus Torvalds jffs2_free_raw_node_ref(new); 4011da177e4SLinus Torvalds return -EINVAL; 4021da177e4SLinus Torvalds } 4031da177e4SLinus Torvalds #endif 4041da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4051da177e4SLinus Torvalds 406f1f9671bSDavid Woodhouse jffs2_link_node_ref(c, jeb, new, len); 4071da177e4SLinus Torvalds 4089b88f473SEstelle Hammache if (!jeb->free_size && !jeb->dirty_size && !ISDIRTY(jeb->wasted_size)) { 4091da177e4SLinus Torvalds /* If it lives on the dirty_list, jffs2_reserve_space will put it there */ 4101da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 4111da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 4121da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 4131da177e4SLinus Torvalds /* Flush the last write in the block if it's outstanding */ 4141da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4151da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 4161da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4171da177e4SLinus Torvalds } 4181da177e4SLinus Torvalds 4191da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 4201da177e4SLinus Torvalds c->nextblock = NULL; 4211da177e4SLinus Torvalds } 422e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 423e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 4241da177e4SLinus Torvalds 4251da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4261da177e4SLinus Torvalds 4271da177e4SLinus Torvalds return 0; 4281da177e4SLinus Torvalds } 4291da177e4SLinus Torvalds 4301da177e4SLinus Torvalds 4311da177e4SLinus Torvalds void jffs2_complete_reservation(struct jffs2_sb_info *c) 4321da177e4SLinus Torvalds { 4331da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_complete_reservation()\n")); 4341da177e4SLinus Torvalds jffs2_garbage_collect_trigger(c); 4351da177e4SLinus Torvalds up(&c->alloc_sem); 4361da177e4SLinus Torvalds } 4371da177e4SLinus Torvalds 4381da177e4SLinus Torvalds static inline int on_list(struct list_head *obj, struct list_head *head) 4391da177e4SLinus Torvalds { 4401da177e4SLinus Torvalds struct list_head *this; 4411da177e4SLinus Torvalds 4421da177e4SLinus Torvalds list_for_each(this, head) { 4431da177e4SLinus Torvalds if (this == obj) { 4441da177e4SLinus Torvalds D1(printk("%p is on list at %p\n", obj, head)); 4451da177e4SLinus Torvalds return 1; 4461da177e4SLinus Torvalds 4471da177e4SLinus Torvalds } 4481da177e4SLinus Torvalds } 4491da177e4SLinus Torvalds return 0; 4501da177e4SLinus Torvalds } 4511da177e4SLinus Torvalds 4521da177e4SLinus Torvalds void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref) 4531da177e4SLinus Torvalds { 4541da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 4551da177e4SLinus Torvalds int blocknr; 4561da177e4SLinus Torvalds struct jffs2_unknown_node n; 4571da177e4SLinus Torvalds int ret, addedsize; 4581da177e4SLinus Torvalds size_t retlen; 4591417fc44SDavid Woodhouse uint32_t freed_len; 4601da177e4SLinus Torvalds 4611da177e4SLinus Torvalds if(!ref) { 4621da177e4SLinus Torvalds printk(KERN_NOTICE "EEEEEK. jffs2_mark_node_obsolete called with NULL node\n"); 4631da177e4SLinus Torvalds return; 4641da177e4SLinus Torvalds } 4651da177e4SLinus Torvalds if (ref_obsolete(ref)) { 4661da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_mark_node_obsolete called with already obsolete node at 0x%08x\n", ref_offset(ref))); 4671da177e4SLinus Torvalds return; 4681da177e4SLinus Torvalds } 4691da177e4SLinus Torvalds blocknr = ref->flash_offset / c->sector_size; 4701da177e4SLinus Torvalds if (blocknr >= c->nr_blocks) { 4711da177e4SLinus Torvalds printk(KERN_NOTICE "raw node at 0x%08x is off the end of device!\n", ref->flash_offset); 4721da177e4SLinus Torvalds BUG(); 4731da177e4SLinus Torvalds } 4741da177e4SLinus Torvalds jeb = &c->blocks[blocknr]; 4751da177e4SLinus Torvalds 4761da177e4SLinus Torvalds if (jffs2_can_mark_obsolete(c) && !jffs2_is_readonly(c) && 47731fbdf7aSArtem B. Bityuckiy !(c->flags & (JFFS2_SB_FLAG_SCANNING | JFFS2_SB_FLAG_BUILDING))) { 4781da177e4SLinus Torvalds /* Hm. This may confuse static lock analysis. If any of the above 4791da177e4SLinus Torvalds three conditions is false, we're going to return from this 4801da177e4SLinus Torvalds function without actually obliterating any nodes or freeing 4811da177e4SLinus Torvalds any jffs2_raw_node_refs. So we don't need to stop erases from 4821da177e4SLinus Torvalds happening, or protect against people holding an obsolete 4831da177e4SLinus Torvalds jffs2_raw_node_ref without the erase_completion_lock. */ 4841da177e4SLinus Torvalds down(&c->erase_free_sem); 4851da177e4SLinus Torvalds } 4861da177e4SLinus Torvalds 4871da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4881da177e4SLinus Torvalds 4891417fc44SDavid Woodhouse freed_len = ref_totlen(c, jeb, ref); 4901417fc44SDavid Woodhouse 4911da177e4SLinus Torvalds if (ref_flags(ref) == REF_UNCHECKED) { 4921417fc44SDavid Woodhouse D1(if (unlikely(jeb->unchecked_size < freed_len)) { 4931da177e4SLinus Torvalds printk(KERN_NOTICE "raw unchecked node of size 0x%08x freed from erase block %d at 0x%08x, but unchecked_size was already 0x%08x\n", 4941417fc44SDavid Woodhouse freed_len, blocknr, ref->flash_offset, jeb->used_size); 4951da177e4SLinus Torvalds BUG(); 4961da177e4SLinus Torvalds }) 4971417fc44SDavid Woodhouse D1(printk(KERN_DEBUG "Obsoleting previously unchecked node at 0x%08x of len %x: ", ref_offset(ref), freed_len)); 4981417fc44SDavid Woodhouse jeb->unchecked_size -= freed_len; 4991417fc44SDavid Woodhouse c->unchecked_size -= freed_len; 5001da177e4SLinus Torvalds } else { 5011417fc44SDavid Woodhouse D1(if (unlikely(jeb->used_size < freed_len)) { 5021da177e4SLinus Torvalds printk(KERN_NOTICE "raw node of size 0x%08x freed from erase block %d at 0x%08x, but used_size was already 0x%08x\n", 5031417fc44SDavid Woodhouse freed_len, blocknr, ref->flash_offset, jeb->used_size); 5041da177e4SLinus Torvalds BUG(); 5051da177e4SLinus Torvalds }) 5061417fc44SDavid Woodhouse D1(printk(KERN_DEBUG "Obsoleting node at 0x%08x of len %#x: ", ref_offset(ref), freed_len)); 5071417fc44SDavid Woodhouse jeb->used_size -= freed_len; 5081417fc44SDavid Woodhouse c->used_size -= freed_len; 5091da177e4SLinus Torvalds } 5101da177e4SLinus Torvalds 5111da177e4SLinus Torvalds // Take care, that wasted size is taken into concern 5121417fc44SDavid Woodhouse if ((jeb->dirty_size || ISDIRTY(jeb->wasted_size + freed_len)) && jeb != c->nextblock) { 5136f401a40SArtem B. Bityuckiy D1(printk(KERN_DEBUG "Dirtying\n")); 5141417fc44SDavid Woodhouse addedsize = freed_len; 5151417fc44SDavid Woodhouse jeb->dirty_size += freed_len; 5161417fc44SDavid Woodhouse c->dirty_size += freed_len; 5171da177e4SLinus Torvalds 5181da177e4SLinus Torvalds /* Convert wasted space to dirty, if not a bad block */ 5191da177e4SLinus Torvalds if (jeb->wasted_size) { 5201da177e4SLinus Torvalds if (on_list(&jeb->list, &c->bad_used_list)) { 5211da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Leaving block at %08x on the bad_used_list\n", 5221da177e4SLinus Torvalds jeb->offset)); 5231da177e4SLinus Torvalds addedsize = 0; /* To fool the refiling code later */ 5241da177e4SLinus Torvalds } else { 5251da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Converting %d bytes of wasted space to dirty in block at %08x\n", 5261da177e4SLinus Torvalds jeb->wasted_size, jeb->offset)); 5271da177e4SLinus Torvalds addedsize += jeb->wasted_size; 5281da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 5291da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 5301da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 5311da177e4SLinus Torvalds jeb->wasted_size = 0; 5321da177e4SLinus Torvalds } 5331da177e4SLinus Torvalds } 5341da177e4SLinus Torvalds } else { 5356f401a40SArtem B. Bityuckiy D1(printk(KERN_DEBUG "Wasting\n")); 5361da177e4SLinus Torvalds addedsize = 0; 5371417fc44SDavid Woodhouse jeb->wasted_size += freed_len; 5381417fc44SDavid Woodhouse c->wasted_size += freed_len; 5391da177e4SLinus Torvalds } 5401da177e4SLinus Torvalds ref->flash_offset = ref_offset(ref) | REF_OBSOLETE; 5411da177e4SLinus Torvalds 542e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, jeb); 543e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5441da177e4SLinus Torvalds 54531fbdf7aSArtem B. Bityuckiy if (c->flags & JFFS2_SB_FLAG_SCANNING) { 54631fbdf7aSArtem B. Bityuckiy /* Flash scanning is in progress. Don't muck about with the block 5471da177e4SLinus Torvalds lists because they're not ready yet, and don't actually 5481da177e4SLinus Torvalds obliterate nodes that look obsolete. If they weren't 5491da177e4SLinus Torvalds marked obsolete on the flash at the time they _became_ 5501da177e4SLinus Torvalds obsolete, there was probably a reason for that. */ 5511da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5521da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 5531da177e4SLinus Torvalds return; 5541da177e4SLinus Torvalds } 5551da177e4SLinus Torvalds 5561da177e4SLinus Torvalds if (jeb == c->nextblock) { 5571da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Not moving nextblock 0x%08x to dirty/erase_pending list\n", jeb->offset)); 5581da177e4SLinus Torvalds } else if (!jeb->used_size && !jeb->unchecked_size) { 5591da177e4SLinus Torvalds if (jeb == c->gcblock) { 5601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "gcblock at 0x%08x completely dirtied. Clearing gcblock...\n", jeb->offset)); 5611da177e4SLinus Torvalds c->gcblock = NULL; 5621da177e4SLinus Torvalds } else { 5631da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x completely dirtied. Removing from (dirty?) list...\n", jeb->offset)); 5641da177e4SLinus Torvalds list_del(&jeb->list); 5651da177e4SLinus Torvalds } 5661da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 5671da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_pending_wbuf_list\n")); 5681da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list); 5691da177e4SLinus Torvalds } else { 5701da177e4SLinus Torvalds if (jiffies & 127) { 5711da177e4SLinus Torvalds /* Most of the time, we just erase it immediately. Otherwise we 5721da177e4SLinus Torvalds spend ages scanning it on mount, etc. */ 5731da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n")); 5741da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_pending_list); 5751da177e4SLinus Torvalds c->nr_erasing_blocks++; 5761da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 5771da177e4SLinus Torvalds } else { 5781da177e4SLinus Torvalds /* Sometimes, however, we leave it elsewhere so it doesn't get 5791da177e4SLinus Torvalds immediately reused, and we spread the load a bit. */ 5801da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 5811da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_list); 5821da177e4SLinus Torvalds } 5831da177e4SLinus Torvalds } 5841da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Done OK\n")); 5851da177e4SLinus Torvalds } else if (jeb == c->gcblock) { 5861da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Not moving gcblock 0x%08x to dirty_list\n", jeb->offset)); 5871da177e4SLinus Torvalds } else if (ISDIRTY(jeb->dirty_size) && !ISDIRTY(jeb->dirty_size - addedsize)) { 5881da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x is freshly dirtied. Removing from clean list...\n", jeb->offset)); 5891da177e4SLinus Torvalds list_del(&jeb->list); 5901da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to dirty_list\n")); 5911da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 5921da177e4SLinus Torvalds } else if (VERYDIRTY(c, jeb->dirty_size) && 5931da177e4SLinus Torvalds !VERYDIRTY(c, jeb->dirty_size - addedsize)) { 5941da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x is now very dirty. Removing from dirty list...\n", jeb->offset)); 5951da177e4SLinus Torvalds list_del(&jeb->list); 5961da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to very_dirty_list\n")); 5971da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 5981da177e4SLinus Torvalds } else { 5991da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x not moved anywhere. (free 0x%08x, dirty 0x%08x, used 0x%08x)\n", 6001da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 6011da177e4SLinus Torvalds } 6021da177e4SLinus Torvalds 6031da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6041da177e4SLinus Torvalds 60531fbdf7aSArtem B. Bityuckiy if (!jffs2_can_mark_obsolete(c) || jffs2_is_readonly(c) || 60631fbdf7aSArtem B. Bityuckiy (c->flags & JFFS2_SB_FLAG_BUILDING)) { 6071da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 6081da177e4SLinus Torvalds return; 6091da177e4SLinus Torvalds } 6101da177e4SLinus Torvalds 6111da177e4SLinus Torvalds /* The erase_free_sem is locked, and has been since before we marked the node obsolete 6121da177e4SLinus Torvalds and potentially put its eraseblock onto the erase_pending_list. Thus, we know that 6131da177e4SLinus Torvalds the block hasn't _already_ been erased, and that 'ref' itself hasn't been freed yet 6141da177e4SLinus Torvalds by jffs2_free_all_node_refs() in erase.c. Which is nice. */ 6151da177e4SLinus Torvalds 6161da177e4SLinus Torvalds D1(printk(KERN_DEBUG "obliterating obsoleted node at 0x%08x\n", ref_offset(ref))); 6171da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 6181da177e4SLinus Torvalds if (ret) { 6191da177e4SLinus Torvalds printk(KERN_WARNING "Read error reading from obsoleted node at 0x%08x: %d\n", ref_offset(ref), ret); 6201da177e4SLinus Torvalds goto out_erase_sem; 6211da177e4SLinus Torvalds } 6221da177e4SLinus Torvalds if (retlen != sizeof(n)) { 6231da177e4SLinus Torvalds printk(KERN_WARNING "Short read from obsoleted node at 0x%08x: %zd\n", ref_offset(ref), retlen); 6241da177e4SLinus Torvalds goto out_erase_sem; 6251da177e4SLinus Torvalds } 6261417fc44SDavid Woodhouse if (PAD(je32_to_cpu(n.totlen)) != PAD(freed_len)) { 6271417fc44SDavid Woodhouse printk(KERN_WARNING "Node totlen on flash (0x%08x) != totlen from node ref (0x%08x)\n", je32_to_cpu(n.totlen), freed_len); 6281da177e4SLinus Torvalds goto out_erase_sem; 6291da177e4SLinus Torvalds } 6301da177e4SLinus Torvalds if (!(je16_to_cpu(n.nodetype) & JFFS2_NODE_ACCURATE)) { 6311da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Node at 0x%08x was already marked obsolete (nodetype 0x%04x)\n", ref_offset(ref), je16_to_cpu(n.nodetype))); 6321da177e4SLinus Torvalds goto out_erase_sem; 6331da177e4SLinus Torvalds } 6341da177e4SLinus Torvalds /* XXX FIXME: This is ugly now */ 6351da177e4SLinus Torvalds n.nodetype = cpu_to_je16(je16_to_cpu(n.nodetype) & ~JFFS2_NODE_ACCURATE); 6361da177e4SLinus Torvalds ret = jffs2_flash_write(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 6371da177e4SLinus Torvalds if (ret) { 6381da177e4SLinus Torvalds printk(KERN_WARNING "Write error in obliterating obsoleted node at 0x%08x: %d\n", ref_offset(ref), ret); 6391da177e4SLinus Torvalds goto out_erase_sem; 6401da177e4SLinus Torvalds } 6411da177e4SLinus Torvalds if (retlen != sizeof(n)) { 6421da177e4SLinus Torvalds printk(KERN_WARNING "Short write in obliterating obsoleted node at 0x%08x: %zd\n", ref_offset(ref), retlen); 6431da177e4SLinus Torvalds goto out_erase_sem; 6441da177e4SLinus Torvalds } 6451da177e4SLinus Torvalds 6461da177e4SLinus Torvalds /* Nodes which have been marked obsolete no longer need to be 6471da177e4SLinus Torvalds associated with any inode. Remove them from the per-inode list. 6481da177e4SLinus Torvalds 6491da177e4SLinus Torvalds Note we can't do this for NAND at the moment because we need 6501da177e4SLinus Torvalds obsolete dirent nodes to stay on the lists, because of the 6511da177e4SLinus Torvalds horridness in jffs2_garbage_collect_deletion_dirent(). Also 6521da177e4SLinus Torvalds because we delete the inocache, and on NAND we need that to 6531da177e4SLinus Torvalds stay around until all the nodes are actually erased, in order 6541da177e4SLinus Torvalds to stop us from giving the same inode number to another newly 6551da177e4SLinus Torvalds created inode. */ 6561da177e4SLinus Torvalds if (ref->next_in_ino) { 6571da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 6581da177e4SLinus Torvalds struct jffs2_raw_node_ref **p; 6591da177e4SLinus Torvalds 6601da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 6611da177e4SLinus Torvalds 6621da177e4SLinus Torvalds ic = jffs2_raw_ref_to_ic(ref); 6631da177e4SLinus Torvalds for (p = &ic->nodes; (*p) != ref; p = &((*p)->next_in_ino)) 6641da177e4SLinus Torvalds ; 6651da177e4SLinus Torvalds 6661da177e4SLinus Torvalds *p = ref->next_in_ino; 6671da177e4SLinus Torvalds ref->next_in_ino = NULL; 6681da177e4SLinus Torvalds 669437316d9SArtem B. Bityuckiy if (ic->nodes == (void *)ic && ic->nlink == 0) 6701da177e4SLinus Torvalds jffs2_del_ino_cache(c, ic); 6711da177e4SLinus Torvalds 6721da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6731da177e4SLinus Torvalds } 6741da177e4SLinus Torvalds 6751da177e4SLinus Torvalds 6761da177e4SLinus Torvalds /* Merge with the next node in the physical list, if there is one 6771da177e4SLinus Torvalds and if it's also obsolete and if it doesn't belong to any inode */ 6781da177e4SLinus Torvalds if (ref->next_phys && ref_obsolete(ref->next_phys) && 6791da177e4SLinus Torvalds !ref->next_phys->next_in_ino) { 6801da177e4SLinus Torvalds struct jffs2_raw_node_ref *n = ref->next_phys; 6811da177e4SLinus Torvalds 6821da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 6831da177e4SLinus Torvalds 684ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 6851da177e4SLinus Torvalds ref->__totlen += n->__totlen; 686ca89a517SDavid Woodhouse #endif 6871da177e4SLinus Torvalds ref->next_phys = n->next_phys; 6881da177e4SLinus Torvalds if (jeb->last_node == n) jeb->last_node = ref; 6891da177e4SLinus Torvalds if (jeb->gc_node == n) { 6901da177e4SLinus Torvalds /* gc will be happy continuing gc on this node */ 6911da177e4SLinus Torvalds jeb->gc_node=ref; 6921da177e4SLinus Torvalds } 6931da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6941da177e4SLinus Torvalds 6951da177e4SLinus Torvalds jffs2_free_raw_node_ref(n); 6961da177e4SLinus Torvalds } 6971da177e4SLinus Torvalds 6981da177e4SLinus Torvalds /* Also merge with the previous node in the list, if there is one 6991da177e4SLinus Torvalds and that one is obsolete */ 7001da177e4SLinus Torvalds if (ref != jeb->first_node ) { 7011da177e4SLinus Torvalds struct jffs2_raw_node_ref *p = jeb->first_node; 7021da177e4SLinus Torvalds 7031da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 7041da177e4SLinus Torvalds 7051da177e4SLinus Torvalds while (p->next_phys != ref) 7061da177e4SLinus Torvalds p = p->next_phys; 7071da177e4SLinus Torvalds 7081da177e4SLinus Torvalds if (ref_obsolete(p) && !ref->next_in_ino) { 709ca89a517SDavid Woodhouse #ifdef TEST_TOTLEN 7101da177e4SLinus Torvalds p->__totlen += ref->__totlen; 711ca89a517SDavid Woodhouse #endif 7121da177e4SLinus Torvalds if (jeb->last_node == ref) { 7131da177e4SLinus Torvalds jeb->last_node = p; 7141da177e4SLinus Torvalds } 7151da177e4SLinus Torvalds if (jeb->gc_node == ref) { 7161da177e4SLinus Torvalds /* gc will be happy continuing gc on this node */ 7171da177e4SLinus Torvalds jeb->gc_node=p; 7181da177e4SLinus Torvalds } 7191da177e4SLinus Torvalds p->next_phys = ref->next_phys; 7201da177e4SLinus Torvalds jffs2_free_raw_node_ref(ref); 7211da177e4SLinus Torvalds } 7221da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 7231da177e4SLinus Torvalds } 7241da177e4SLinus Torvalds out_erase_sem: 7251da177e4SLinus Torvalds up(&c->erase_free_sem); 7261da177e4SLinus Torvalds } 7271da177e4SLinus Torvalds 7281da177e4SLinus Torvalds int jffs2_thread_should_wake(struct jffs2_sb_info *c) 7291da177e4SLinus Torvalds { 7301da177e4SLinus Torvalds int ret = 0; 7311da177e4SLinus Torvalds uint32_t dirty; 7321da177e4SLinus Torvalds 7331da177e4SLinus Torvalds if (c->unchecked_size) { 7341da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_thread_should_wake(): unchecked_size %d, checked_ino #%d\n", 7351da177e4SLinus Torvalds c->unchecked_size, c->checked_ino)); 7361da177e4SLinus Torvalds return 1; 7371da177e4SLinus Torvalds } 7381da177e4SLinus Torvalds 7391da177e4SLinus Torvalds /* dirty_size contains blocks on erase_pending_list 7401da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 7411da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 7421da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 7431da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 7441da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 7451da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 7461da177e4SLinus Torvalds */ 7471da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size; 7481da177e4SLinus Torvalds 7491da177e4SLinus Torvalds if (c->nr_free_blocks + c->nr_erasing_blocks < c->resv_blocks_gctrigger && 7501da177e4SLinus Torvalds (dirty > c->nospc_dirty_size)) 7511da177e4SLinus Torvalds ret = 1; 7521da177e4SLinus Torvalds 7531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_thread_should_wake(): nr_free_blocks %d, nr_erasing_blocks %d, dirty_size 0x%x: %s\n", 7541da177e4SLinus Torvalds c->nr_free_blocks, c->nr_erasing_blocks, c->dirty_size, ret?"yes":"no")); 7551da177e4SLinus Torvalds 7561da177e4SLinus Torvalds return ret; 7571da177e4SLinus Torvalds } 758