11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 4c00c310eSDavid Woodhouse * Copyright © 2001-2007 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 * 101da177e4SLinus Torvalds */ 111da177e4SLinus Torvalds 125a528957SJoe Perches #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt 135a528957SJoe Perches 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 161da177e4SLinus Torvalds #include <linux/compiler.h> 171da177e4SLinus Torvalds #include <linux/sched.h> /* For cond_resched() */ 181da177e4SLinus Torvalds #include "nodelist.h" 19e631ddbaSFerenc Havasi #include "debug.h" 201da177e4SLinus Torvalds 218da8ba2eSDaniel Drake /* 228da8ba2eSDaniel Drake * Check whether the user is allowed to write. 238da8ba2eSDaniel Drake */ 248da8ba2eSDaniel Drake static int jffs2_rp_can_write(struct jffs2_sb_info *c) 258da8ba2eSDaniel Drake { 268da8ba2eSDaniel Drake uint32_t avail; 278da8ba2eSDaniel Drake struct jffs2_mount_opts *opts = &c->mount_opts; 288da8ba2eSDaniel Drake 298da8ba2eSDaniel Drake avail = c->dirty_size + c->free_size + c->unchecked_size + 308da8ba2eSDaniel Drake c->erasing_size - c->resv_blocks_write * c->sector_size 318da8ba2eSDaniel Drake - c->nospc_dirty_size; 328da8ba2eSDaniel Drake 338da8ba2eSDaniel Drake if (avail < 2 * opts->rp_size) 348da8ba2eSDaniel Drake jffs2_dbg(1, "rpsize %u, dirty_size %u, free_size %u, " 358da8ba2eSDaniel Drake "erasing_size %u, unchecked_size %u, " 368da8ba2eSDaniel Drake "nr_erasing_blocks %u, avail %u, resrv %u\n", 378da8ba2eSDaniel Drake opts->rp_size, c->dirty_size, c->free_size, 388da8ba2eSDaniel Drake c->erasing_size, c->unchecked_size, 398da8ba2eSDaniel Drake c->nr_erasing_blocks, avail, c->nospc_dirty_size); 408da8ba2eSDaniel Drake 418da8ba2eSDaniel Drake if (avail > opts->rp_size) 428da8ba2eSDaniel Drake return 1; 438da8ba2eSDaniel Drake 448da8ba2eSDaniel Drake /* Always allow root */ 458da8ba2eSDaniel Drake if (capable(CAP_SYS_RESOURCE)) 468da8ba2eSDaniel Drake return 1; 478da8ba2eSDaniel Drake 488da8ba2eSDaniel Drake jffs2_dbg(1, "forbid writing\n"); 498da8ba2eSDaniel Drake return 0; 508da8ba2eSDaniel Drake } 518da8ba2eSDaniel Drake 521da177e4SLinus Torvalds /** 531da177e4SLinus Torvalds * jffs2_reserve_space - request physical space to write nodes to flash 541da177e4SLinus Torvalds * @c: superblock info 551da177e4SLinus Torvalds * @minsize: Minimum acceptable size of allocation 561da177e4SLinus Torvalds * @len: Returned value of allocation length 571da177e4SLinus Torvalds * @prio: Allocation type - ALLOC_{NORMAL,DELETION} 581da177e4SLinus Torvalds * 591da177e4SLinus Torvalds * Requests a block of physical space on the flash. Returns zero for success 609fe4854cSDavid Woodhouse * and puts 'len' into the appropriate place, or returns -ENOSPC or other 619fe4854cSDavid Woodhouse * error if appropriate. Doesn't return len since that's 621da177e4SLinus Torvalds * 631da177e4SLinus Torvalds * If it returns zero, jffs2_reserve_space() also downs the per-filesystem 641da177e4SLinus Torvalds * allocation semaphore, to prevent more than one allocation from being 651da177e4SLinus Torvalds * active at any time. The semaphore is later released by jffs2_commit_allocation() 661da177e4SLinus Torvalds * 671da177e4SLinus Torvalds * jffs2_reserve_space() may trigger garbage collection in order to make room 681da177e4SLinus Torvalds * for the requested allocation. 691da177e4SLinus Torvalds */ 701da177e4SLinus Torvalds 71e631ddbaSFerenc Havasi static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 729fe4854cSDavid Woodhouse uint32_t *len, uint32_t sumsize); 731da177e4SLinus Torvalds 749fe4854cSDavid Woodhouse int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 75e631ddbaSFerenc Havasi uint32_t *len, int prio, uint32_t sumsize) 761da177e4SLinus Torvalds { 771da177e4SLinus Torvalds int ret = -EAGAIN; 781da177e4SLinus Torvalds int blocksneeded = c->resv_blocks_write; 791da177e4SLinus Torvalds /* align it */ 801da177e4SLinus Torvalds minsize = PAD(minsize); 811da177e4SLinus Torvalds 829c261b33SJoe Perches jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize); 83ced22070SDavid Woodhouse mutex_lock(&c->alloc_sem); 841da177e4SLinus Torvalds 859c261b33SJoe Perches jffs2_dbg(1, "%s(): alloc sem got\n", __func__); 861da177e4SLinus Torvalds 871da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 881da177e4SLinus Torvalds 898da8ba2eSDaniel Drake /* 908da8ba2eSDaniel Drake * Check if the free space is greater then size of the reserved pool. 918da8ba2eSDaniel Drake * If not, only allow root to proceed with writing. 928da8ba2eSDaniel Drake */ 938da8ba2eSDaniel Drake if (prio != ALLOC_DELETION && !jffs2_rp_can_write(c)) { 948da8ba2eSDaniel Drake ret = -ENOSPC; 958da8ba2eSDaniel Drake goto out; 968da8ba2eSDaniel Drake } 978da8ba2eSDaniel Drake 981da177e4SLinus Torvalds /* this needs a little more thought (true <tglx> :)) */ 991da177e4SLinus Torvalds while(ret == -EAGAIN) { 1001da177e4SLinus Torvalds while(c->nr_free_blocks + c->nr_erasing_blocks < blocksneeded) { 1011da177e4SLinus Torvalds uint32_t dirty, avail; 1021da177e4SLinus Torvalds 1031da177e4SLinus Torvalds /* calculate real dirty size 1041da177e4SLinus Torvalds * dirty_size contains blocks on erase_pending_list 1051da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 1061da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 1071da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 1081da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 1091da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 1101da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 1111da177e4SLinus Torvalds * We add unchecked_size here, as we hopefully will find some space to use. 1121da177e4SLinus Torvalds * This will affect the sum only once, as gc first finishes checking 1131da177e4SLinus Torvalds * of nodes. 1141da177e4SLinus Torvalds */ 1151da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size + c->unchecked_size; 1161da177e4SLinus Torvalds if (dirty < c->nospc_dirty_size) { 1171da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 1189c261b33SJoe Perches jffs2_dbg(1, "%s(): Low on dirty space to GC, but it's a deletion. Allowing...\n", 1199c261b33SJoe Perches __func__); 1201da177e4SLinus Torvalds break; 1211da177e4SLinus Torvalds } 1229c261b33SJoe Perches jffs2_dbg(1, "dirty size 0x%08x + unchecked_size 0x%08x < nospc_dirty_size 0x%08x, returning -ENOSPC\n", 1239c261b33SJoe Perches dirty, c->unchecked_size, 1249c261b33SJoe Perches c->sector_size); 1251da177e4SLinus Torvalds 1261da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 127ced22070SDavid Woodhouse mutex_unlock(&c->alloc_sem); 1281da177e4SLinus Torvalds return -ENOSPC; 1291da177e4SLinus Torvalds } 1301da177e4SLinus Torvalds 1311da177e4SLinus Torvalds /* Calc possibly available space. Possibly available means that we 1321da177e4SLinus Torvalds * don't know, if unchecked size contains obsoleted nodes, which could give us some 1331da177e4SLinus Torvalds * more usable space. This will affect the sum only once, as gc first finishes checking 1341da177e4SLinus Torvalds * of nodes. 1351da177e4SLinus Torvalds + Return -ENOSPC, if the maximum possibly available space is less or equal than 1361da177e4SLinus Torvalds * blocksneeded * sector_size. 1371da177e4SLinus Torvalds * This blocks endless gc looping on a filesystem, which is nearly full, even if 1381da177e4SLinus Torvalds * the check above passes. 1391da177e4SLinus Torvalds */ 1401da177e4SLinus Torvalds avail = c->free_size + c->dirty_size + c->erasing_size + c->unchecked_size; 1411da177e4SLinus Torvalds if ( (avail / c->sector_size) <= blocksneeded) { 1421da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 1439c261b33SJoe Perches jffs2_dbg(1, "%s(): Low on possibly available space, but it's a deletion. Allowing...\n", 1449c261b33SJoe Perches __func__); 1451da177e4SLinus Torvalds break; 1461da177e4SLinus Torvalds } 1471da177e4SLinus Torvalds 1489c261b33SJoe Perches jffs2_dbg(1, "max. available size 0x%08x < blocksneeded * sector_size 0x%08x, returning -ENOSPC\n", 1499c261b33SJoe Perches avail, blocksneeded * c->sector_size); 1501da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 151ced22070SDavid Woodhouse mutex_unlock(&c->alloc_sem); 1521da177e4SLinus Torvalds return -ENOSPC; 1531da177e4SLinus Torvalds } 1541da177e4SLinus Torvalds 155ced22070SDavid Woodhouse mutex_unlock(&c->alloc_sem); 1561da177e4SLinus Torvalds 1579c261b33SJoe Perches jffs2_dbg(1, "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", 1589c261b33SJoe Perches c->nr_free_blocks, c->nr_erasing_blocks, 1599c261b33SJoe Perches c->free_size, c->dirty_size, c->wasted_size, 1609c261b33SJoe Perches c->used_size, c->erasing_size, c->bad_size, 1619c261b33SJoe Perches c->free_size + c->dirty_size + 1629c261b33SJoe Perches c->wasted_size + c->used_size + 1639c261b33SJoe Perches c->erasing_size + c->bad_size, 1649c261b33SJoe Perches c->flash_size); 1651da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1661da177e4SLinus Torvalds 1671da177e4SLinus Torvalds ret = jffs2_garbage_collect_pass(c); 168422b1202SDavid Woodhouse 1690717bf84SDavid Woodhouse if (ret == -EAGAIN) { 1700717bf84SDavid Woodhouse spin_lock(&c->erase_completion_lock); 1710717bf84SDavid Woodhouse if (c->nr_erasing_blocks && 1720717bf84SDavid Woodhouse list_empty(&c->erase_pending_list) && 1730717bf84SDavid Woodhouse list_empty(&c->erase_complete_list)) { 1740717bf84SDavid Woodhouse DECLARE_WAITQUEUE(wait, current); 1750717bf84SDavid Woodhouse set_current_state(TASK_UNINTERRUPTIBLE); 1760717bf84SDavid Woodhouse add_wait_queue(&c->erase_wait, &wait); 1779c261b33SJoe Perches jffs2_dbg(1, "%s waiting for erase to complete\n", 1789c261b33SJoe Perches __func__); 1790717bf84SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 1800717bf84SDavid Woodhouse 1810717bf84SDavid Woodhouse schedule(); 1820717bf84SDavid Woodhouse } else 1830717bf84SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 1840717bf84SDavid Woodhouse } else if (ret) 1851da177e4SLinus Torvalds return ret; 1861da177e4SLinus Torvalds 1871da177e4SLinus Torvalds cond_resched(); 1881da177e4SLinus Torvalds 1891da177e4SLinus Torvalds if (signal_pending(current)) 1901da177e4SLinus Torvalds return -EINTR; 1911da177e4SLinus Torvalds 192ced22070SDavid Woodhouse mutex_lock(&c->alloc_sem); 1931da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1941da177e4SLinus Torvalds } 1951da177e4SLinus Torvalds 1969fe4854cSDavid Woodhouse ret = jffs2_do_reserve_space(c, minsize, len, sumsize); 1971da177e4SLinus Torvalds if (ret) { 1989c261b33SJoe Perches jffs2_dbg(1, "%s(): ret is %d\n", __func__, ret); 1991da177e4SLinus Torvalds } 2001da177e4SLinus Torvalds } 2018da8ba2eSDaniel Drake 2028da8ba2eSDaniel Drake out: 2031da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2042f785402SDavid Woodhouse if (!ret) 205046b8b98SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 2061da177e4SLinus Torvalds if (ret) 207ced22070SDavid Woodhouse mutex_unlock(&c->alloc_sem); 2081da177e4SLinus Torvalds return ret; 2091da177e4SLinus Torvalds } 2101da177e4SLinus Torvalds 2119fe4854cSDavid Woodhouse int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, 212e631ddbaSFerenc Havasi uint32_t *len, uint32_t sumsize) 2131da177e4SLinus Torvalds { 2141da177e4SLinus Torvalds int ret = -EAGAIN; 2151da177e4SLinus Torvalds minsize = PAD(minsize); 2161da177e4SLinus Torvalds 2179c261b33SJoe Perches jffs2_dbg(1, "%s(): Requested 0x%x bytes\n", __func__, minsize); 2181da177e4SLinus Torvalds 2191da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 2201da177e4SLinus Torvalds while(ret == -EAGAIN) { 2219fe4854cSDavid Woodhouse ret = jffs2_do_reserve_space(c, minsize, len, sumsize); 2221da177e4SLinus Torvalds if (ret) { 2239c261b33SJoe Perches jffs2_dbg(1, "%s(): looping, ret is %d\n", 2249c261b33SJoe Perches __func__, ret); 2251da177e4SLinus Torvalds } 2261da177e4SLinus Torvalds } 2271da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2282f785402SDavid Woodhouse if (!ret) 229046b8b98SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 2302f785402SDavid Woodhouse 2311da177e4SLinus Torvalds return ret; 2321da177e4SLinus Torvalds } 2331da177e4SLinus Torvalds 2341da177e4SLinus Torvalds 235e631ddbaSFerenc Havasi /* Classify nextblock (clean, dirty of verydirty) and force to select an other one */ 236e631ddbaSFerenc Havasi 237e631ddbaSFerenc Havasi static void jffs2_close_nextblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 238e631ddbaSFerenc Havasi { 2391da177e4SLinus Torvalds 24099c2594fSAdrian Hunter if (c->nextblock == NULL) { 2419c261b33SJoe Perches jffs2_dbg(1, "%s(): Erase block at 0x%08x has already been placed in a list\n", 2429c261b33SJoe Perches __func__, jeb->offset); 24399c2594fSAdrian Hunter return; 24499c2594fSAdrian Hunter } 2451da177e4SLinus Torvalds /* Check, if we have a dirty block now, or if it was dirty already */ 2461da177e4SLinus Torvalds if (ISDIRTY (jeb->wasted_size + jeb->dirty_size)) { 2471da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 2481da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 2491da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 2501da177e4SLinus Torvalds jeb->wasted_size = 0; 2511da177e4SLinus Torvalds if (VERYDIRTY(c, jeb->dirty_size)) { 2529c261b33SJoe Perches jffs2_dbg(1, "Adding full erase block at 0x%08x to very_dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 2539c261b33SJoe Perches jeb->offset, jeb->free_size, jeb->dirty_size, 2549c261b33SJoe Perches jeb->used_size); 2551da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 2561da177e4SLinus Torvalds } else { 2579c261b33SJoe Perches jffs2_dbg(1, "Adding full erase block at 0x%08x to dirty_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 2589c261b33SJoe Perches jeb->offset, jeb->free_size, jeb->dirty_size, 2599c261b33SJoe Perches jeb->used_size); 2601da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 2611da177e4SLinus Torvalds } 2621da177e4SLinus Torvalds } else { 2639c261b33SJoe Perches jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 2649c261b33SJoe Perches jeb->offset, jeb->free_size, jeb->dirty_size, 2659c261b33SJoe Perches jeb->used_size); 2661da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 2671da177e4SLinus Torvalds } 268e631ddbaSFerenc Havasi c->nextblock = NULL; 269e631ddbaSFerenc Havasi 2701da177e4SLinus Torvalds } 2711da177e4SLinus Torvalds 272e631ddbaSFerenc Havasi /* Select a new jeb for nextblock */ 273e631ddbaSFerenc Havasi 274e631ddbaSFerenc Havasi static int jffs2_find_nextblock(struct jffs2_sb_info *c) 275e631ddbaSFerenc Havasi { 2761da177e4SLinus Torvalds struct list_head *next; 277e631ddbaSFerenc Havasi 2781da177e4SLinus Torvalds /* Take the next block off the 'free' list */ 2791da177e4SLinus Torvalds 2801da177e4SLinus Torvalds if (list_empty(&c->free_list)) { 2811da177e4SLinus Torvalds 2821da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2831da177e4SLinus Torvalds !list_empty(&c->erasable_list)) { 2841da177e4SLinus Torvalds struct jffs2_eraseblock *ejeb; 2851da177e4SLinus Torvalds 2861da177e4SLinus Torvalds ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); 287f116629dSAkinobu Mita list_move_tail(&ejeb->list, &c->erase_pending_list); 2881da177e4SLinus Torvalds c->nr_erasing_blocks++; 289ae3b6ba0SDavid Woodhouse jffs2_garbage_collect_trigger(c); 2909c261b33SJoe Perches jffs2_dbg(1, "%s(): Triggering erase of erasable block at 0x%08x\n", 2919c261b33SJoe Perches __func__, ejeb->offset); 2921da177e4SLinus Torvalds } 2931da177e4SLinus Torvalds 2941da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2951da177e4SLinus Torvalds !list_empty(&c->erasable_pending_wbuf_list)) { 2969c261b33SJoe Perches jffs2_dbg(1, "%s(): Flushing write buffer\n", 2979c261b33SJoe Perches __func__); 2981da177e4SLinus Torvalds /* c->nextblock is NULL, no update to c->nextblock allowed */ 2991da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 3001da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 3011da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3021da177e4SLinus Torvalds /* Have another go. It'll be on the erasable_list now */ 3031da177e4SLinus Torvalds return -EAGAIN; 3041da177e4SLinus Torvalds } 3051da177e4SLinus Torvalds 3061da177e4SLinus Torvalds if (!c->nr_erasing_blocks) { 3071da177e4SLinus Torvalds /* Ouch. We're in GC, or we wouldn't have got here. 3081da177e4SLinus Torvalds And there's no space left. At all. */ 309da320f05SJoe Perches pr_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", 310da320f05SJoe Perches c->nr_erasing_blocks, c->nr_free_blocks, 311da320f05SJoe Perches list_empty(&c->erasable_list) ? "yes" : "no", 312da320f05SJoe Perches list_empty(&c->erasing_list) ? "yes" : "no", 313da320f05SJoe Perches list_empty(&c->erase_pending_list) ? "yes" : "no"); 3141da177e4SLinus Torvalds return -ENOSPC; 3151da177e4SLinus Torvalds } 3161da177e4SLinus Torvalds 3171da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 3181da177e4SLinus Torvalds /* Don't wait for it; just erase one right now */ 3191da177e4SLinus Torvalds jffs2_erase_pending_blocks(c, 1); 3201da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3211da177e4SLinus Torvalds 3221da177e4SLinus Torvalds /* An erase may have failed, decreasing the 3231da177e4SLinus Torvalds amount of free space available. So we must 3241da177e4SLinus Torvalds restart from the beginning */ 3251da177e4SLinus Torvalds return -EAGAIN; 3261da177e4SLinus Torvalds } 3271da177e4SLinus Torvalds 3281da177e4SLinus Torvalds next = c->free_list.next; 3291da177e4SLinus Torvalds list_del(next); 330e631ddbaSFerenc Havasi c->nextblock = list_entry(next, struct jffs2_eraseblock, list); 3311da177e4SLinus Torvalds c->nr_free_blocks--; 3321da177e4SLinus Torvalds 333e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); /* reset collected summary */ 334e631ddbaSFerenc Havasi 335f04de505SSteve Glendinning #ifdef CONFIG_JFFS2_FS_WRITEBUFFER 3365bf17237SAlexander Belyakov /* adjust write buffer offset, else we get a non contiguous write bug */ 3375bf17237SAlexander Belyakov if (!(c->wbuf_ofs % c->sector_size) && !c->wbuf_len) 3385bf17237SAlexander Belyakov c->wbuf_ofs = 0xffffffff; 339f04de505SSteve Glendinning #endif 3405bf17237SAlexander Belyakov 3419c261b33SJoe Perches jffs2_dbg(1, "%s(): new nextblock = 0x%08x\n", 3429c261b33SJoe Perches __func__, c->nextblock->offset); 343e631ddbaSFerenc Havasi 344e631ddbaSFerenc Havasi return 0; 345e631ddbaSFerenc Havasi } 346e631ddbaSFerenc Havasi 347e631ddbaSFerenc Havasi /* Called with alloc sem _and_ erase_completion_lock */ 3489fe4854cSDavid Woodhouse static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 3499fe4854cSDavid Woodhouse uint32_t *len, uint32_t sumsize) 350e631ddbaSFerenc Havasi { 351e631ddbaSFerenc Havasi struct jffs2_eraseblock *jeb = c->nextblock; 352e631ddbaSFerenc Havasi uint32_t reserved_size; /* for summary information at the end of the jeb */ 353e631ddbaSFerenc Havasi int ret; 354e631ddbaSFerenc Havasi 355e631ddbaSFerenc Havasi restart: 356e631ddbaSFerenc Havasi reserved_size = 0; 357e631ddbaSFerenc Havasi 358e631ddbaSFerenc Havasi if (jffs2_sum_active() && (sumsize != JFFS2_SUMMARY_NOSUM_SIZE)) { 359e631ddbaSFerenc Havasi /* NOSUM_SIZE means not to generate summary */ 360e631ddbaSFerenc Havasi 361e631ddbaSFerenc Havasi if (jeb) { 362e631ddbaSFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 363733802d9SArtem B. Bityutskiy dbg_summary("minsize=%d , jeb->free=%d ," 364e631ddbaSFerenc Havasi "summary->size=%d , sumsize=%d\n", 365e631ddbaSFerenc Havasi minsize, jeb->free_size, 366e631ddbaSFerenc Havasi c->summary->sum_size, sumsize); 367e631ddbaSFerenc Havasi } 368e631ddbaSFerenc Havasi 369e631ddbaSFerenc Havasi /* Is there enough space for writing out the current node, or we have to 370e631ddbaSFerenc Havasi write out summary information now, close this jeb and select new nextblock? */ 371e631ddbaSFerenc Havasi if (jeb && (PAD(minsize) + PAD(c->summary->sum_size + sumsize + 372e631ddbaSFerenc Havasi JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size)) { 373e631ddbaSFerenc Havasi 374e631ddbaSFerenc Havasi /* Has summary been disabled for this jeb? */ 375e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 376e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 377e631ddbaSFerenc Havasi goto restart; 378e631ddbaSFerenc Havasi } 379e631ddbaSFerenc Havasi 380e631ddbaSFerenc Havasi /* Writing out the collected summary information */ 381733802d9SArtem B. Bityutskiy dbg_summary("generating summary for 0x%08x.\n", jeb->offset); 382e631ddbaSFerenc Havasi ret = jffs2_sum_write_sumnode(c); 383e631ddbaSFerenc Havasi 384e631ddbaSFerenc Havasi if (ret) 385e631ddbaSFerenc Havasi return ret; 386e631ddbaSFerenc Havasi 387e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 388e631ddbaSFerenc Havasi /* jffs2_write_sumnode() couldn't write out the summary information 389e631ddbaSFerenc Havasi diabling summary for this jeb and free the collected information 390e631ddbaSFerenc Havasi */ 391e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 392e631ddbaSFerenc Havasi goto restart; 393e631ddbaSFerenc Havasi } 394e631ddbaSFerenc Havasi 395e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 396e631ddbaSFerenc Havasi jeb = NULL; 39734c0e906SFerenc Havasi /* keep always valid value in reserved_size */ 39834c0e906SFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 399e631ddbaSFerenc Havasi } 400e631ddbaSFerenc Havasi } else { 401e631ddbaSFerenc Havasi if (jeb && minsize > jeb->free_size) { 402fc6612f6SDavid Woodhouse uint32_t waste; 403fc6612f6SDavid Woodhouse 404e631ddbaSFerenc Havasi /* Skip the end of this block and file it as having some dirty space */ 405e631ddbaSFerenc Havasi /* If there's a pending write to it, flush now */ 406e631ddbaSFerenc Havasi 407e631ddbaSFerenc Havasi if (jffs2_wbuf_dirty(c)) { 408e631ddbaSFerenc Havasi spin_unlock(&c->erase_completion_lock); 4099c261b33SJoe Perches jffs2_dbg(1, "%s(): Flushing write buffer\n", 4109c261b33SJoe Perches __func__); 411e631ddbaSFerenc Havasi jffs2_flush_wbuf_pad(c); 412e631ddbaSFerenc Havasi spin_lock(&c->erase_completion_lock); 413e631ddbaSFerenc Havasi jeb = c->nextblock; 414e631ddbaSFerenc Havasi goto restart; 415e631ddbaSFerenc Havasi } 416e631ddbaSFerenc Havasi 417fc6612f6SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 418fc6612f6SDavid Woodhouse 419fc6612f6SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, jeb, 1); 420fc6612f6SDavid Woodhouse if (ret) 421fc6612f6SDavid Woodhouse return ret; 422fc6612f6SDavid Woodhouse /* Just lock it again and continue. Nothing much can change because 423fc6612f6SDavid Woodhouse we hold c->alloc_sem anyway. In fact, it's not entirely clear why 424fc6612f6SDavid Woodhouse we hold c->erase_completion_lock in the majority of this function... 425fc6612f6SDavid Woodhouse but that's a question for another (more caffeine-rich) day. */ 426fc6612f6SDavid Woodhouse spin_lock(&c->erase_completion_lock); 427fc6612f6SDavid Woodhouse 428fc6612f6SDavid Woodhouse waste = jeb->free_size; 429fc6612f6SDavid Woodhouse jffs2_link_node_ref(c, jeb, 430fc6612f6SDavid Woodhouse (jeb->offset + c->sector_size - waste) | REF_OBSOLETE, 431fc6612f6SDavid Woodhouse waste, NULL); 432fc6612f6SDavid Woodhouse /* FIXME: that made it count as dirty. Convert to wasted */ 433fc6612f6SDavid Woodhouse jeb->dirty_size -= waste; 434fc6612f6SDavid Woodhouse c->dirty_size -= waste; 435fc6612f6SDavid Woodhouse jeb->wasted_size += waste; 436fc6612f6SDavid Woodhouse c->wasted_size += waste; 437e631ddbaSFerenc Havasi 438e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 439e631ddbaSFerenc Havasi jeb = NULL; 440e631ddbaSFerenc Havasi } 441e631ddbaSFerenc Havasi } 442e631ddbaSFerenc Havasi 443e631ddbaSFerenc Havasi if (!jeb) { 444e631ddbaSFerenc Havasi 445e631ddbaSFerenc Havasi ret = jffs2_find_nextblock(c); 446e631ddbaSFerenc Havasi if (ret) 447e631ddbaSFerenc Havasi return ret; 448e631ddbaSFerenc Havasi 449e631ddbaSFerenc Havasi jeb = c->nextblock; 450e631ddbaSFerenc Havasi 4511da177e4SLinus Torvalds if (jeb->free_size != c->sector_size - c->cleanmarker_size) { 452da320f05SJoe Perches pr_warn("Eep. Block 0x%08x taken from free_list had free_size of 0x%08x!!\n", 453da320f05SJoe Perches jeb->offset, jeb->free_size); 4541da177e4SLinus Torvalds goto restart; 4551da177e4SLinus Torvalds } 4561da177e4SLinus Torvalds } 4571da177e4SLinus Torvalds /* OK, jeb (==c->nextblock) is now pointing at a block which definitely has 4581da177e4SLinus Torvalds enough space */ 459e631ddbaSFerenc Havasi *len = jeb->free_size - reserved_size; 4601da177e4SLinus Torvalds 4611da177e4SLinus Torvalds if (c->cleanmarker_size && jeb->used_size == c->cleanmarker_size && 4621da177e4SLinus Torvalds !jeb->first_node->next_in_ino) { 4631da177e4SLinus Torvalds /* Only node in it beforehand was a CLEANMARKER node (we think). 4641da177e4SLinus Torvalds So mark it obsolete now that there's going to be another node 4651da177e4SLinus Torvalds in the block. This will reduce used_size to zero but We've 4661da177e4SLinus Torvalds already set c->nextblock so that jffs2_mark_node_obsolete() 4671da177e4SLinus Torvalds won't try to refile it to the dirty_list. 4681da177e4SLinus Torvalds */ 4691da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4701da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, jeb->first_node); 4711da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4721da177e4SLinus Torvalds } 4731da177e4SLinus Torvalds 4749c261b33SJoe Perches jffs2_dbg(1, "%s(): Giving 0x%x bytes at 0x%x\n", 4759c261b33SJoe Perches __func__, 4769c261b33SJoe Perches *len, jeb->offset + (c->sector_size - jeb->free_size)); 4771da177e4SLinus Torvalds return 0; 4781da177e4SLinus Torvalds } 4791da177e4SLinus Torvalds 4801da177e4SLinus Torvalds /** 4811da177e4SLinus Torvalds * jffs2_add_physical_node_ref - add a physical node reference to the list 4821da177e4SLinus Torvalds * @c: superblock info 4831da177e4SLinus Torvalds * @new: new node reference to add 4841da177e4SLinus Torvalds * @len: length of this physical node 4851da177e4SLinus Torvalds * 4861da177e4SLinus Torvalds * Should only be used to report nodes for which space has been allocated 4871da177e4SLinus Torvalds * by jffs2_reserve_space. 4881da177e4SLinus Torvalds * 4891da177e4SLinus Torvalds * Must be called with the alloc_sem held. 4901da177e4SLinus Torvalds */ 4911da177e4SLinus Torvalds 4922f785402SDavid Woodhouse struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c, 4932f785402SDavid Woodhouse uint32_t ofs, uint32_t len, 4942f785402SDavid Woodhouse struct jffs2_inode_cache *ic) 4951da177e4SLinus Torvalds { 4961da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 4972f785402SDavid Woodhouse struct jffs2_raw_node_ref *new; 4981da177e4SLinus Torvalds 4992f785402SDavid Woodhouse jeb = &c->blocks[ofs / c->sector_size]; 5001da177e4SLinus Torvalds 5019c261b33SJoe Perches jffs2_dbg(1, "%s(): Node at 0x%x(%d), size 0x%x\n", 5029c261b33SJoe Perches __func__, ofs & ~3, ofs & 3, len); 5031da177e4SLinus Torvalds #if 1 5042f785402SDavid Woodhouse /* Allow non-obsolete nodes only to be added at the end of c->nextblock, 5052f785402SDavid Woodhouse if c->nextblock is set. Note that wbuf.c will file obsolete nodes 5062f785402SDavid Woodhouse even after refiling c->nextblock */ 5072f785402SDavid Woodhouse if ((c->nextblock || ((ofs & 3) != REF_OBSOLETE)) 5082f785402SDavid Woodhouse && (jeb != c->nextblock || (ofs & ~3) != jeb->offset + (c->sector_size - jeb->free_size))) { 509da320f05SJoe Perches pr_warn("argh. node added in wrong place at 0x%08x(%d)\n", 510da320f05SJoe Perches ofs & ~3, ofs & 3); 51166bfaeaaSDavid Woodhouse if (c->nextblock) 512da320f05SJoe Perches pr_warn("nextblock 0x%08x", c->nextblock->offset); 51366bfaeaaSDavid Woodhouse else 514da320f05SJoe Perches pr_warn("No nextblock"); 515da320f05SJoe Perches pr_cont(", expected at %08x\n", 516da320f05SJoe Perches jeb->offset + (c->sector_size - jeb->free_size)); 5172f785402SDavid Woodhouse return ERR_PTR(-EINVAL); 5181da177e4SLinus Torvalds } 5191da177e4SLinus Torvalds #endif 5201da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 5211da177e4SLinus Torvalds 5222f785402SDavid Woodhouse new = jffs2_link_node_ref(c, jeb, ofs, len, ic); 5231da177e4SLinus Torvalds 5249b88f473SEstelle Hammache if (!jeb->free_size && !jeb->dirty_size && !ISDIRTY(jeb->wasted_size)) { 5251da177e4SLinus Torvalds /* If it lives on the dirty_list, jffs2_reserve_space will put it there */ 5269c261b33SJoe Perches jffs2_dbg(1, "Adding full erase block at 0x%08x to clean_list (free 0x%08x, dirty 0x%08x, used 0x%08x\n", 5279c261b33SJoe Perches jeb->offset, jeb->free_size, jeb->dirty_size, 5289c261b33SJoe Perches jeb->used_size); 5291da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 5301da177e4SLinus Torvalds /* Flush the last write in the block if it's outstanding */ 5311da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5321da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 5331da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 5341da177e4SLinus Torvalds } 5351da177e4SLinus Torvalds 5361da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 5371da177e4SLinus Torvalds c->nextblock = NULL; 5381da177e4SLinus Torvalds } 539e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 540e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5411da177e4SLinus Torvalds 5421da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5431da177e4SLinus Torvalds 5442f785402SDavid Woodhouse return new; 5451da177e4SLinus Torvalds } 5461da177e4SLinus Torvalds 5471da177e4SLinus Torvalds 5481da177e4SLinus Torvalds void jffs2_complete_reservation(struct jffs2_sb_info *c) 5491da177e4SLinus Torvalds { 5509c261b33SJoe Perches jffs2_dbg(1, "jffs2_complete_reservation()\n"); 551acb64a43SDavid Woodhouse spin_lock(&c->erase_completion_lock); 5521da177e4SLinus Torvalds jffs2_garbage_collect_trigger(c); 553acb64a43SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 554ced22070SDavid Woodhouse mutex_unlock(&c->alloc_sem); 5551da177e4SLinus Torvalds } 5561da177e4SLinus Torvalds 5571da177e4SLinus Torvalds static inline int on_list(struct list_head *obj, struct list_head *head) 5581da177e4SLinus Torvalds { 5591da177e4SLinus Torvalds struct list_head *this; 5601da177e4SLinus Torvalds 5611da177e4SLinus Torvalds list_for_each(this, head) { 5621da177e4SLinus Torvalds if (this == obj) { 5639c261b33SJoe Perches jffs2_dbg(1, "%p is on list at %p\n", obj, head); 5641da177e4SLinus Torvalds return 1; 5651da177e4SLinus Torvalds 5661da177e4SLinus Torvalds } 5671da177e4SLinus Torvalds } 5681da177e4SLinus Torvalds return 0; 5691da177e4SLinus Torvalds } 5701da177e4SLinus Torvalds 5711da177e4SLinus Torvalds void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref) 5721da177e4SLinus Torvalds { 5731da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 5741da177e4SLinus Torvalds int blocknr; 5751da177e4SLinus Torvalds struct jffs2_unknown_node n; 5761da177e4SLinus Torvalds int ret, addedsize; 5771da177e4SLinus Torvalds size_t retlen; 5781417fc44SDavid Woodhouse uint32_t freed_len; 5791da177e4SLinus Torvalds 5809bfeb691SDavid Woodhouse if(unlikely(!ref)) { 581da320f05SJoe Perches pr_notice("EEEEEK. jffs2_mark_node_obsolete called with NULL node\n"); 5821da177e4SLinus Torvalds return; 5831da177e4SLinus Torvalds } 5841da177e4SLinus Torvalds if (ref_obsolete(ref)) { 5859c261b33SJoe Perches jffs2_dbg(1, "%s(): called with already obsolete node at 0x%08x\n", 5869c261b33SJoe Perches __func__, ref_offset(ref)); 5871da177e4SLinus Torvalds return; 5881da177e4SLinus Torvalds } 5891da177e4SLinus Torvalds blocknr = ref->flash_offset / c->sector_size; 5901da177e4SLinus Torvalds if (blocknr >= c->nr_blocks) { 591da320f05SJoe Perches pr_notice("raw node at 0x%08x is off the end of device!\n", 592da320f05SJoe Perches ref->flash_offset); 5931da177e4SLinus Torvalds BUG(); 5941da177e4SLinus Torvalds } 5951da177e4SLinus Torvalds jeb = &c->blocks[blocknr]; 5961da177e4SLinus Torvalds 5971da177e4SLinus Torvalds if (jffs2_can_mark_obsolete(c) && !jffs2_is_readonly(c) && 59831fbdf7aSArtem B. Bityuckiy !(c->flags & (JFFS2_SB_FLAG_SCANNING | JFFS2_SB_FLAG_BUILDING))) { 5991da177e4SLinus Torvalds /* Hm. This may confuse static lock analysis. If any of the above 6001da177e4SLinus Torvalds three conditions is false, we're going to return from this 6011da177e4SLinus Torvalds function without actually obliterating any nodes or freeing 6021da177e4SLinus Torvalds any jffs2_raw_node_refs. So we don't need to stop erases from 6031da177e4SLinus Torvalds happening, or protect against people holding an obsolete 6041da177e4SLinus Torvalds jffs2_raw_node_ref without the erase_completion_lock. */ 605ced22070SDavid Woodhouse mutex_lock(&c->erase_free_sem); 6061da177e4SLinus Torvalds } 6071da177e4SLinus Torvalds 6081da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 6091da177e4SLinus Torvalds 6101417fc44SDavid Woodhouse freed_len = ref_totlen(c, jeb, ref); 6111417fc44SDavid Woodhouse 6121da177e4SLinus Torvalds if (ref_flags(ref) == REF_UNCHECKED) { 6131417fc44SDavid Woodhouse D1(if (unlikely(jeb->unchecked_size < freed_len)) { 614da320f05SJoe Perches pr_notice("raw unchecked node of size 0x%08x freed from erase block %d at 0x%08x, but unchecked_size was already 0x%08x\n", 615da320f05SJoe Perches freed_len, blocknr, 616da320f05SJoe Perches ref->flash_offset, jeb->used_size); 6171da177e4SLinus Torvalds BUG(); 6181da177e4SLinus Torvalds }) 6199c261b33SJoe Perches jffs2_dbg(1, "Obsoleting previously unchecked node at 0x%08x of len %x\n", 6209c261b33SJoe Perches ref_offset(ref), freed_len); 6211417fc44SDavid Woodhouse jeb->unchecked_size -= freed_len; 6221417fc44SDavid Woodhouse c->unchecked_size -= freed_len; 6231da177e4SLinus Torvalds } else { 6241417fc44SDavid Woodhouse D1(if (unlikely(jeb->used_size < freed_len)) { 625da320f05SJoe Perches pr_notice("raw node of size 0x%08x freed from erase block %d at 0x%08x, but used_size was already 0x%08x\n", 626da320f05SJoe Perches freed_len, blocknr, 627da320f05SJoe Perches ref->flash_offset, jeb->used_size); 6281da177e4SLinus Torvalds BUG(); 6291da177e4SLinus Torvalds }) 6309c261b33SJoe Perches jffs2_dbg(1, "Obsoleting node at 0x%08x of len %#x: ", 6319c261b33SJoe Perches ref_offset(ref), freed_len); 6321417fc44SDavid Woodhouse jeb->used_size -= freed_len; 6331417fc44SDavid Woodhouse c->used_size -= freed_len; 6341da177e4SLinus Torvalds } 6351da177e4SLinus Torvalds 6361da177e4SLinus Torvalds // Take care, that wasted size is taken into concern 6371417fc44SDavid Woodhouse if ((jeb->dirty_size || ISDIRTY(jeb->wasted_size + freed_len)) && jeb != c->nextblock) { 6389c261b33SJoe Perches jffs2_dbg(1, "Dirtying\n"); 6391417fc44SDavid Woodhouse addedsize = freed_len; 6401417fc44SDavid Woodhouse jeb->dirty_size += freed_len; 6411417fc44SDavid Woodhouse c->dirty_size += freed_len; 6421da177e4SLinus Torvalds 6431da177e4SLinus Torvalds /* Convert wasted space to dirty, if not a bad block */ 6441da177e4SLinus Torvalds if (jeb->wasted_size) { 6451da177e4SLinus Torvalds if (on_list(&jeb->list, &c->bad_used_list)) { 6469c261b33SJoe Perches jffs2_dbg(1, "Leaving block at %08x on the bad_used_list\n", 6479c261b33SJoe Perches jeb->offset); 6481da177e4SLinus Torvalds addedsize = 0; /* To fool the refiling code later */ 6491da177e4SLinus Torvalds } else { 6509c261b33SJoe Perches jffs2_dbg(1, "Converting %d bytes of wasted space to dirty in block at %08x\n", 6519c261b33SJoe Perches jeb->wasted_size, jeb->offset); 6521da177e4SLinus Torvalds addedsize += jeb->wasted_size; 6531da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 6541da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 6551da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 6561da177e4SLinus Torvalds jeb->wasted_size = 0; 6571da177e4SLinus Torvalds } 6581da177e4SLinus Torvalds } 6591da177e4SLinus Torvalds } else { 6609c261b33SJoe Perches jffs2_dbg(1, "Wasting\n"); 6611da177e4SLinus Torvalds addedsize = 0; 6621417fc44SDavid Woodhouse jeb->wasted_size += freed_len; 6631417fc44SDavid Woodhouse c->wasted_size += freed_len; 6641da177e4SLinus Torvalds } 6651da177e4SLinus Torvalds ref->flash_offset = ref_offset(ref) | REF_OBSOLETE; 6661da177e4SLinus Torvalds 667e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, jeb); 668e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 6691da177e4SLinus Torvalds 67031fbdf7aSArtem B. Bityuckiy if (c->flags & JFFS2_SB_FLAG_SCANNING) { 67131fbdf7aSArtem B. Bityuckiy /* Flash scanning is in progress. Don't muck about with the block 6721da177e4SLinus Torvalds lists because they're not ready yet, and don't actually 6731da177e4SLinus Torvalds obliterate nodes that look obsolete. If they weren't 6741da177e4SLinus Torvalds marked obsolete on the flash at the time they _became_ 6751da177e4SLinus Torvalds obsolete, there was probably a reason for that. */ 6761da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6771da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 6781da177e4SLinus Torvalds return; 6791da177e4SLinus Torvalds } 6801da177e4SLinus Torvalds 6811da177e4SLinus Torvalds if (jeb == c->nextblock) { 6829c261b33SJoe Perches jffs2_dbg(2, "Not moving nextblock 0x%08x to dirty/erase_pending list\n", 6839c261b33SJoe Perches jeb->offset); 6841da177e4SLinus Torvalds } else if (!jeb->used_size && !jeb->unchecked_size) { 6851da177e4SLinus Torvalds if (jeb == c->gcblock) { 6869c261b33SJoe Perches jffs2_dbg(1, "gcblock at 0x%08x completely dirtied. Clearing gcblock...\n", 6879c261b33SJoe Perches jeb->offset); 6881da177e4SLinus Torvalds c->gcblock = NULL; 6891da177e4SLinus Torvalds } else { 6909c261b33SJoe Perches jffs2_dbg(1, "Eraseblock at 0x%08x completely dirtied. Removing from (dirty?) list...\n", 6919c261b33SJoe Perches jeb->offset); 6921da177e4SLinus Torvalds list_del(&jeb->list); 6931da177e4SLinus Torvalds } 6941da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 6959c261b33SJoe Perches jffs2_dbg(1, "...and adding to erasable_pending_wbuf_list\n"); 6961da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list); 6971da177e4SLinus Torvalds } else { 6981da177e4SLinus Torvalds if (jiffies & 127) { 6991da177e4SLinus Torvalds /* Most of the time, we just erase it immediately. Otherwise we 7001da177e4SLinus Torvalds spend ages scanning it on mount, etc. */ 7019c261b33SJoe Perches jffs2_dbg(1, "...and adding to erase_pending_list\n"); 7021da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_pending_list); 7031da177e4SLinus Torvalds c->nr_erasing_blocks++; 704ae3b6ba0SDavid Woodhouse jffs2_garbage_collect_trigger(c); 7051da177e4SLinus Torvalds } else { 7061da177e4SLinus Torvalds /* Sometimes, however, we leave it elsewhere so it doesn't get 7071da177e4SLinus Torvalds immediately reused, and we spread the load a bit. */ 7089c261b33SJoe Perches jffs2_dbg(1, "...and adding to erasable_list\n"); 7091da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_list); 7101da177e4SLinus Torvalds } 7111da177e4SLinus Torvalds } 7129c261b33SJoe Perches jffs2_dbg(1, "Done OK\n"); 7131da177e4SLinus Torvalds } else if (jeb == c->gcblock) { 7149c261b33SJoe Perches jffs2_dbg(2, "Not moving gcblock 0x%08x to dirty_list\n", 7159c261b33SJoe Perches jeb->offset); 7161da177e4SLinus Torvalds } else if (ISDIRTY(jeb->dirty_size) && !ISDIRTY(jeb->dirty_size - addedsize)) { 7179c261b33SJoe Perches jffs2_dbg(1, "Eraseblock at 0x%08x is freshly dirtied. Removing from clean list...\n", 7189c261b33SJoe Perches jeb->offset); 7191da177e4SLinus Torvalds list_del(&jeb->list); 7209c261b33SJoe Perches jffs2_dbg(1, "...and adding to dirty_list\n"); 7211da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 7221da177e4SLinus Torvalds } else if (VERYDIRTY(c, jeb->dirty_size) && 7231da177e4SLinus Torvalds !VERYDIRTY(c, jeb->dirty_size - addedsize)) { 7249c261b33SJoe Perches jffs2_dbg(1, "Eraseblock at 0x%08x is now very dirty. Removing from dirty list...\n", 7259c261b33SJoe Perches jeb->offset); 7261da177e4SLinus Torvalds list_del(&jeb->list); 7279c261b33SJoe Perches jffs2_dbg(1, "...and adding to very_dirty_list\n"); 7281da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 7291da177e4SLinus Torvalds } else { 7309c261b33SJoe Perches jffs2_dbg(1, "Eraseblock at 0x%08x not moved anywhere. (free 0x%08x, dirty 0x%08x, used 0x%08x)\n", 7319c261b33SJoe Perches jeb->offset, jeb->free_size, jeb->dirty_size, 7329c261b33SJoe Perches jeb->used_size); 7331da177e4SLinus Torvalds } 7341da177e4SLinus Torvalds 7351da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 7361da177e4SLinus Torvalds 73731fbdf7aSArtem B. Bityuckiy if (!jffs2_can_mark_obsolete(c) || jffs2_is_readonly(c) || 73831fbdf7aSArtem B. Bityuckiy (c->flags & JFFS2_SB_FLAG_BUILDING)) { 7391da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 7401da177e4SLinus Torvalds return; 7411da177e4SLinus Torvalds } 7421da177e4SLinus Torvalds 7431da177e4SLinus Torvalds /* The erase_free_sem is locked, and has been since before we marked the node obsolete 7441da177e4SLinus Torvalds and potentially put its eraseblock onto the erase_pending_list. Thus, we know that 7451da177e4SLinus Torvalds the block hasn't _already_ been erased, and that 'ref' itself hasn't been freed yet 746c38c1b61SDavid Woodhouse by jffs2_free_jeb_node_refs() in erase.c. Which is nice. */ 7471da177e4SLinus Torvalds 7489c261b33SJoe Perches jffs2_dbg(1, "obliterating obsoleted node at 0x%08x\n", 7499c261b33SJoe Perches ref_offset(ref)); 7501da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 7511da177e4SLinus Torvalds if (ret) { 752da320f05SJoe Perches pr_warn("Read error reading from obsoleted node at 0x%08x: %d\n", 753da320f05SJoe Perches ref_offset(ref), ret); 7541da177e4SLinus Torvalds goto out_erase_sem; 7551da177e4SLinus Torvalds } 7561da177e4SLinus Torvalds if (retlen != sizeof(n)) { 757da320f05SJoe Perches pr_warn("Short read from obsoleted node at 0x%08x: %zd\n", 758da320f05SJoe Perches ref_offset(ref), retlen); 7591da177e4SLinus Torvalds goto out_erase_sem; 7601da177e4SLinus Torvalds } 7611417fc44SDavid Woodhouse if (PAD(je32_to_cpu(n.totlen)) != PAD(freed_len)) { 762da320f05SJoe Perches pr_warn("Node totlen on flash (0x%08x) != totlen from node ref (0x%08x)\n", 763da320f05SJoe Perches je32_to_cpu(n.totlen), freed_len); 7641da177e4SLinus Torvalds goto out_erase_sem; 7651da177e4SLinus Torvalds } 7661da177e4SLinus Torvalds if (!(je16_to_cpu(n.nodetype) & JFFS2_NODE_ACCURATE)) { 7679c261b33SJoe Perches jffs2_dbg(1, "Node at 0x%08x was already marked obsolete (nodetype 0x%04x)\n", 7689c261b33SJoe Perches ref_offset(ref), je16_to_cpu(n.nodetype)); 7691da177e4SLinus Torvalds goto out_erase_sem; 7701da177e4SLinus Torvalds } 7711da177e4SLinus Torvalds /* XXX FIXME: This is ugly now */ 7721da177e4SLinus Torvalds n.nodetype = cpu_to_je16(je16_to_cpu(n.nodetype) & ~JFFS2_NODE_ACCURATE); 7731da177e4SLinus Torvalds ret = jffs2_flash_write(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 7741da177e4SLinus Torvalds if (ret) { 775da320f05SJoe Perches pr_warn("Write error in obliterating obsoleted node at 0x%08x: %d\n", 776da320f05SJoe Perches ref_offset(ref), ret); 7771da177e4SLinus Torvalds goto out_erase_sem; 7781da177e4SLinus Torvalds } 7791da177e4SLinus Torvalds if (retlen != sizeof(n)) { 780da320f05SJoe Perches pr_warn("Short write in obliterating obsoleted node at 0x%08x: %zd\n", 781da320f05SJoe Perches ref_offset(ref), retlen); 7821da177e4SLinus Torvalds goto out_erase_sem; 7831da177e4SLinus Torvalds } 7841da177e4SLinus Torvalds 7851da177e4SLinus Torvalds /* Nodes which have been marked obsolete no longer need to be 7861da177e4SLinus Torvalds associated with any inode. Remove them from the per-inode list. 7871da177e4SLinus Torvalds 7881da177e4SLinus Torvalds Note we can't do this for NAND at the moment because we need 7891da177e4SLinus Torvalds obsolete dirent nodes to stay on the lists, because of the 7901da177e4SLinus Torvalds horridness in jffs2_garbage_collect_deletion_dirent(). Also 7911da177e4SLinus Torvalds because we delete the inocache, and on NAND we need that to 7921da177e4SLinus Torvalds stay around until all the nodes are actually erased, in order 7931da177e4SLinus Torvalds to stop us from giving the same inode number to another newly 7941da177e4SLinus Torvalds created inode. */ 7951da177e4SLinus Torvalds if (ref->next_in_ino) { 7961da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 7971da177e4SLinus Torvalds struct jffs2_raw_node_ref **p; 7981da177e4SLinus Torvalds 7991da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 8001da177e4SLinus Torvalds 8011da177e4SLinus Torvalds ic = jffs2_raw_ref_to_ic(ref); 8021da177e4SLinus Torvalds for (p = &ic->nodes; (*p) != ref; p = &((*p)->next_in_ino)) 8031da177e4SLinus Torvalds ; 8041da177e4SLinus Torvalds 8051da177e4SLinus Torvalds *p = ref->next_in_ino; 8061da177e4SLinus Torvalds ref->next_in_ino = NULL; 8071da177e4SLinus Torvalds 808c9f700f8SKaiGai Kohei switch (ic->class) { 809c9f700f8SKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 810c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_DATUM: 811c9f700f8SKaiGai Kohei jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic); 812c9f700f8SKaiGai Kohei break; 813c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_REF: 814c9f700f8SKaiGai Kohei jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic); 815c9f700f8SKaiGai Kohei break; 816c9f700f8SKaiGai Kohei #endif 817c9f700f8SKaiGai Kohei default: 81827c72b04SDavid Woodhouse if (ic->nodes == (void *)ic && ic->pino_nlink == 0) 8191da177e4SLinus Torvalds jffs2_del_ino_cache(c, ic); 820c9f700f8SKaiGai Kohei break; 821c9f700f8SKaiGai Kohei } 8221da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 8231da177e4SLinus Torvalds } 8241da177e4SLinus Torvalds 8251da177e4SLinus Torvalds out_erase_sem: 826ced22070SDavid Woodhouse mutex_unlock(&c->erase_free_sem); 8271da177e4SLinus Torvalds } 8281da177e4SLinus Torvalds 8291da177e4SLinus Torvalds int jffs2_thread_should_wake(struct jffs2_sb_info *c) 8301da177e4SLinus Torvalds { 8311da177e4SLinus Torvalds int ret = 0; 8321da177e4SLinus Torvalds uint32_t dirty; 8338fb870dfSDavid Woodhouse int nr_very_dirty = 0; 8348fb870dfSDavid Woodhouse struct jffs2_eraseblock *jeb; 8351da177e4SLinus Torvalds 836d6ce1710SJoakim Tjernlund if (!list_empty(&c->erase_complete_list) || 837d6ce1710SJoakim Tjernlund !list_empty(&c->erase_pending_list)) 838d6ce1710SJoakim Tjernlund return 1; 839d6ce1710SJoakim Tjernlund 8401da177e4SLinus Torvalds if (c->unchecked_size) { 8419c261b33SJoe Perches jffs2_dbg(1, "jffs2_thread_should_wake(): unchecked_size %d, checked_ino #%d\n", 8429c261b33SJoe Perches c->unchecked_size, c->checked_ino); 8431da177e4SLinus Torvalds return 1; 8441da177e4SLinus Torvalds } 8451da177e4SLinus Torvalds 8461da177e4SLinus Torvalds /* dirty_size contains blocks on erase_pending_list 8471da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 8481da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 8491da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 8501da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 8511da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 8521da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 8531da177e4SLinus Torvalds */ 8541da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size; 8551da177e4SLinus Torvalds 8561da177e4SLinus Torvalds if (c->nr_free_blocks + c->nr_erasing_blocks < c->resv_blocks_gctrigger && 8571da177e4SLinus Torvalds (dirty > c->nospc_dirty_size)) 8581da177e4SLinus Torvalds ret = 1; 8591da177e4SLinus Torvalds 8608fb870dfSDavid Woodhouse list_for_each_entry(jeb, &c->very_dirty_list, list) { 8618fb870dfSDavid Woodhouse nr_very_dirty++; 8628fb870dfSDavid Woodhouse if (nr_very_dirty == c->vdirty_blocks_gctrigger) { 8638fb870dfSDavid Woodhouse ret = 1; 864a8c68f32SDavid Woodhouse /* In debug mode, actually go through and count them all */ 865a8c68f32SDavid Woodhouse D1(continue); 866a8c68f32SDavid Woodhouse break; 8678fb870dfSDavid Woodhouse } 8688fb870dfSDavid Woodhouse } 8698fb870dfSDavid Woodhouse 8709c261b33SJoe Perches jffs2_dbg(1, "%s(): nr_free_blocks %d, nr_erasing_blocks %d, dirty_size 0x%x, vdirty_blocks %d: %s\n", 8719c261b33SJoe Perches __func__, c->nr_free_blocks, c->nr_erasing_blocks, 8729c261b33SJoe Perches c->dirty_size, nr_very_dirty, ret ? "yes" : "no"); 8731da177e4SLinus Torvalds 8741da177e4SLinus Torvalds return ret; 8751da177e4SLinus Torvalds } 876