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 121da177e4SLinus Torvalds #include <linux/kernel.h> 131da177e4SLinus Torvalds #include <linux/slab.h> 141da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 151da177e4SLinus Torvalds #include <linux/compiler.h> 161da177e4SLinus Torvalds #include <linux/sched.h> /* For cond_resched() */ 171da177e4SLinus Torvalds #include "nodelist.h" 18e631ddbaSFerenc Havasi #include "debug.h" 191da177e4SLinus Torvalds 201da177e4SLinus Torvalds /** 211da177e4SLinus Torvalds * jffs2_reserve_space - request physical space to write nodes to flash 221da177e4SLinus Torvalds * @c: superblock info 231da177e4SLinus Torvalds * @minsize: Minimum acceptable size of allocation 241da177e4SLinus Torvalds * @len: Returned value of allocation length 251da177e4SLinus Torvalds * @prio: Allocation type - ALLOC_{NORMAL,DELETION} 261da177e4SLinus Torvalds * 271da177e4SLinus Torvalds * Requests a block of physical space on the flash. Returns zero for success 289fe4854cSDavid Woodhouse * and puts 'len' into the appropriate place, or returns -ENOSPC or other 299fe4854cSDavid Woodhouse * error if appropriate. Doesn't return len since that's 301da177e4SLinus Torvalds * 311da177e4SLinus Torvalds * If it returns zero, jffs2_reserve_space() also downs the per-filesystem 321da177e4SLinus Torvalds * allocation semaphore, to prevent more than one allocation from being 331da177e4SLinus Torvalds * active at any time. The semaphore is later released by jffs2_commit_allocation() 341da177e4SLinus Torvalds * 351da177e4SLinus Torvalds * jffs2_reserve_space() may trigger garbage collection in order to make room 361da177e4SLinus Torvalds * for the requested allocation. 371da177e4SLinus Torvalds */ 381da177e4SLinus Torvalds 39e631ddbaSFerenc Havasi static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 409fe4854cSDavid Woodhouse uint32_t *len, uint32_t sumsize); 411da177e4SLinus Torvalds 429fe4854cSDavid Woodhouse int jffs2_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 43e631ddbaSFerenc Havasi uint32_t *len, int prio, uint32_t sumsize) 441da177e4SLinus Torvalds { 451da177e4SLinus Torvalds int ret = -EAGAIN; 461da177e4SLinus Torvalds int blocksneeded = c->resv_blocks_write; 471da177e4SLinus Torvalds /* align it */ 481da177e4SLinus Torvalds minsize = PAD(minsize); 491da177e4SLinus Torvalds 501da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space(): Requested 0x%x bytes\n", minsize)); 511da177e4SLinus Torvalds down(&c->alloc_sem); 521da177e4SLinus Torvalds 531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space(): alloc sem got\n")); 541da177e4SLinus Torvalds 551da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 561da177e4SLinus Torvalds 571da177e4SLinus Torvalds /* this needs a little more thought (true <tglx> :)) */ 581da177e4SLinus Torvalds while(ret == -EAGAIN) { 591da177e4SLinus Torvalds while(c->nr_free_blocks + c->nr_erasing_blocks < blocksneeded) { 601da177e4SLinus Torvalds int ret; 611da177e4SLinus Torvalds uint32_t dirty, avail; 621da177e4SLinus Torvalds 631da177e4SLinus Torvalds /* calculate real dirty size 641da177e4SLinus Torvalds * dirty_size contains blocks on erase_pending_list 651da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 661da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 671da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 681da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 691da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 701da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 711da177e4SLinus Torvalds * We add unchecked_size here, as we hopefully will find some space to use. 721da177e4SLinus Torvalds * This will affect the sum only once, as gc first finishes checking 731da177e4SLinus Torvalds * of nodes. 741da177e4SLinus Torvalds */ 751da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size + c->unchecked_size; 761da177e4SLinus Torvalds if (dirty < c->nospc_dirty_size) { 771da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 784132ace8SArtem B. Bityuckiy D1(printk(KERN_NOTICE "jffs2_reserve_space(): Low on dirty space to GC, but it's a deletion. Allowing...\n")); 791da177e4SLinus Torvalds break; 801da177e4SLinus Torvalds } 811da177e4SLinus Torvalds D1(printk(KERN_DEBUG "dirty size 0x%08x + unchecked_size 0x%08x < nospc_dirty_size 0x%08x, returning -ENOSPC\n", 821da177e4SLinus Torvalds dirty, c->unchecked_size, c->sector_size)); 831da177e4SLinus Torvalds 841da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 851da177e4SLinus Torvalds up(&c->alloc_sem); 861da177e4SLinus Torvalds return -ENOSPC; 871da177e4SLinus Torvalds } 881da177e4SLinus Torvalds 891da177e4SLinus Torvalds /* Calc possibly available space. Possibly available means that we 901da177e4SLinus Torvalds * don't know, if unchecked size contains obsoleted nodes, which could give us some 911da177e4SLinus Torvalds * more usable space. This will affect the sum only once, as gc first finishes checking 921da177e4SLinus Torvalds * of nodes. 931da177e4SLinus Torvalds + Return -ENOSPC, if the maximum possibly available space is less or equal than 941da177e4SLinus Torvalds * blocksneeded * sector_size. 951da177e4SLinus Torvalds * This blocks endless gc looping on a filesystem, which is nearly full, even if 961da177e4SLinus Torvalds * the check above passes. 971da177e4SLinus Torvalds */ 981da177e4SLinus Torvalds avail = c->free_size + c->dirty_size + c->erasing_size + c->unchecked_size; 991da177e4SLinus Torvalds if ( (avail / c->sector_size) <= blocksneeded) { 1001da177e4SLinus Torvalds if (prio == ALLOC_DELETION && c->nr_free_blocks + c->nr_erasing_blocks >= c->resv_blocks_deletion) { 1014132ace8SArtem B. Bityuckiy D1(printk(KERN_NOTICE "jffs2_reserve_space(): Low on possibly available space, but it's a deletion. Allowing...\n")); 1021da177e4SLinus Torvalds break; 1031da177e4SLinus Torvalds } 1041da177e4SLinus Torvalds 1051da177e4SLinus Torvalds D1(printk(KERN_DEBUG "max. available size 0x%08x < blocksneeded * sector_size 0x%08x, returning -ENOSPC\n", 1061da177e4SLinus Torvalds avail, blocksneeded * c->sector_size)); 1071da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1081da177e4SLinus Torvalds up(&c->alloc_sem); 1091da177e4SLinus Torvalds return -ENOSPC; 1101da177e4SLinus Torvalds } 1111da177e4SLinus Torvalds 1121da177e4SLinus Torvalds up(&c->alloc_sem); 1131da177e4SLinus Torvalds 1141da177e4SLinus 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", 1151da177e4SLinus 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, 1161da177e4SLinus Torvalds c->free_size + c->dirty_size + c->wasted_size + c->used_size + c->erasing_size + c->bad_size, c->flash_size)); 1171da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1181da177e4SLinus Torvalds 1191da177e4SLinus Torvalds ret = jffs2_garbage_collect_pass(c); 1201da177e4SLinus Torvalds if (ret) 1211da177e4SLinus Torvalds return ret; 1221da177e4SLinus Torvalds 1231da177e4SLinus Torvalds cond_resched(); 1241da177e4SLinus Torvalds 1251da177e4SLinus Torvalds if (signal_pending(current)) 1261da177e4SLinus Torvalds return -EINTR; 1271da177e4SLinus Torvalds 1281da177e4SLinus Torvalds down(&c->alloc_sem); 1291da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1301da177e4SLinus Torvalds } 1311da177e4SLinus Torvalds 1329fe4854cSDavid Woodhouse ret = jffs2_do_reserve_space(c, minsize, len, sumsize); 1331da177e4SLinus Torvalds if (ret) { 1341da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space: ret is %d\n", ret)); 1351da177e4SLinus Torvalds } 1361da177e4SLinus Torvalds } 1371da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1382f785402SDavid Woodhouse if (!ret) 139046b8b98SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 1401da177e4SLinus Torvalds if (ret) 1411da177e4SLinus Torvalds up(&c->alloc_sem); 1421da177e4SLinus Torvalds return ret; 1431da177e4SLinus Torvalds } 1441da177e4SLinus Torvalds 1459fe4854cSDavid Woodhouse int jffs2_reserve_space_gc(struct jffs2_sb_info *c, uint32_t minsize, 146e631ddbaSFerenc Havasi uint32_t *len, uint32_t sumsize) 1471da177e4SLinus Torvalds { 1481da177e4SLinus Torvalds int ret = -EAGAIN; 1491da177e4SLinus Torvalds minsize = PAD(minsize); 1501da177e4SLinus Torvalds 1511da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space_gc(): Requested 0x%x bytes\n", minsize)); 1521da177e4SLinus Torvalds 1531da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1541da177e4SLinus Torvalds while(ret == -EAGAIN) { 1559fe4854cSDavid Woodhouse ret = jffs2_do_reserve_space(c, minsize, len, sumsize); 1561da177e4SLinus Torvalds if (ret) { 1571da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_reserve_space_gc: looping, ret is %d\n", ret)); 1581da177e4SLinus Torvalds } 1591da177e4SLinus Torvalds } 1601da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1612f785402SDavid Woodhouse if (!ret) 162046b8b98SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, 1); 1632f785402SDavid Woodhouse 1641da177e4SLinus Torvalds return ret; 1651da177e4SLinus Torvalds } 1661da177e4SLinus Torvalds 1671da177e4SLinus Torvalds 168e631ddbaSFerenc Havasi /* Classify nextblock (clean, dirty of verydirty) and force to select an other one */ 169e631ddbaSFerenc Havasi 170e631ddbaSFerenc Havasi static void jffs2_close_nextblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 171e631ddbaSFerenc Havasi { 1721da177e4SLinus Torvalds 17399c2594fSAdrian Hunter if (c->nextblock == NULL) { 17499c2594fSAdrian Hunter D1(printk(KERN_DEBUG "jffs2_close_nextblock: Erase block at 0x%08x has already been placed in a list\n", 17599c2594fSAdrian Hunter jeb->offset)); 17699c2594fSAdrian Hunter return; 17799c2594fSAdrian Hunter } 1781da177e4SLinus Torvalds /* Check, if we have a dirty block now, or if it was dirty already */ 1791da177e4SLinus Torvalds if (ISDIRTY (jeb->wasted_size + jeb->dirty_size)) { 1801da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 1811da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 1821da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 1831da177e4SLinus Torvalds jeb->wasted_size = 0; 1841da177e4SLinus Torvalds if (VERYDIRTY(c, jeb->dirty_size)) { 1851da177e4SLinus 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", 1861da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1871da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 1881da177e4SLinus Torvalds } else { 1891da177e4SLinus 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", 1901da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1911da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 1921da177e4SLinus Torvalds } 1931da177e4SLinus Torvalds } else { 1941da177e4SLinus 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", 1951da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 1961da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 1971da177e4SLinus Torvalds } 198e631ddbaSFerenc Havasi c->nextblock = NULL; 199e631ddbaSFerenc Havasi 2001da177e4SLinus Torvalds } 2011da177e4SLinus Torvalds 202e631ddbaSFerenc Havasi /* Select a new jeb for nextblock */ 203e631ddbaSFerenc Havasi 204e631ddbaSFerenc Havasi static int jffs2_find_nextblock(struct jffs2_sb_info *c) 205e631ddbaSFerenc Havasi { 2061da177e4SLinus Torvalds struct list_head *next; 207e631ddbaSFerenc Havasi 2081da177e4SLinus Torvalds /* Take the next block off the 'free' list */ 2091da177e4SLinus Torvalds 2101da177e4SLinus Torvalds if (list_empty(&c->free_list)) { 2111da177e4SLinus Torvalds 2121da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2131da177e4SLinus Torvalds !list_empty(&c->erasable_list)) { 2141da177e4SLinus Torvalds struct jffs2_eraseblock *ejeb; 2151da177e4SLinus Torvalds 2161da177e4SLinus Torvalds ejeb = list_entry(c->erasable_list.next, struct jffs2_eraseblock, list); 217f116629dSAkinobu Mita list_move_tail(&ejeb->list, &c->erase_pending_list); 2181da177e4SLinus Torvalds c->nr_erasing_blocks++; 2191da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 220e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock: Triggering erase of erasable block at 0x%08x\n", 2211da177e4SLinus Torvalds ejeb->offset)); 2221da177e4SLinus Torvalds } 2231da177e4SLinus Torvalds 2241da177e4SLinus Torvalds if (!c->nr_erasing_blocks && 2251da177e4SLinus Torvalds !list_empty(&c->erasable_pending_wbuf_list)) { 226e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock: Flushing write buffer\n")); 2271da177e4SLinus Torvalds /* c->nextblock is NULL, no update to c->nextblock allowed */ 2281da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2291da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 2301da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 2311da177e4SLinus Torvalds /* Have another go. It'll be on the erasable_list now */ 2321da177e4SLinus Torvalds return -EAGAIN; 2331da177e4SLinus Torvalds } 2341da177e4SLinus Torvalds 2351da177e4SLinus Torvalds if (!c->nr_erasing_blocks) { 2361da177e4SLinus Torvalds /* Ouch. We're in GC, or we wouldn't have got here. 2371da177e4SLinus Torvalds And there's no space left. At all. */ 2381da177e4SLinus 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", 2391da177e4SLinus Torvalds c->nr_erasing_blocks, c->nr_free_blocks, list_empty(&c->erasable_list)?"yes":"no", 2401da177e4SLinus Torvalds list_empty(&c->erasing_list)?"yes":"no", list_empty(&c->erase_pending_list)?"yes":"no"); 2411da177e4SLinus Torvalds return -ENOSPC; 2421da177e4SLinus Torvalds } 2431da177e4SLinus Torvalds 2441da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2451da177e4SLinus Torvalds /* Don't wait for it; just erase one right now */ 2461da177e4SLinus Torvalds jffs2_erase_pending_blocks(c, 1); 2471da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 2481da177e4SLinus Torvalds 2491da177e4SLinus Torvalds /* An erase may have failed, decreasing the 2501da177e4SLinus Torvalds amount of free space available. So we must 2511da177e4SLinus Torvalds restart from the beginning */ 2521da177e4SLinus Torvalds return -EAGAIN; 2531da177e4SLinus Torvalds } 2541da177e4SLinus Torvalds 2551da177e4SLinus Torvalds next = c->free_list.next; 2561da177e4SLinus Torvalds list_del(next); 257e631ddbaSFerenc Havasi c->nextblock = list_entry(next, struct jffs2_eraseblock, list); 2581da177e4SLinus Torvalds c->nr_free_blocks--; 2591da177e4SLinus Torvalds 260e631ddbaSFerenc Havasi jffs2_sum_reset_collected(c->summary); /* reset collected summary */ 261e631ddbaSFerenc Havasi 262e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_find_nextblock(): new nextblock = 0x%08x\n", c->nextblock->offset)); 263e631ddbaSFerenc Havasi 264e631ddbaSFerenc Havasi return 0; 265e631ddbaSFerenc Havasi } 266e631ddbaSFerenc Havasi 267e631ddbaSFerenc Havasi /* Called with alloc sem _and_ erase_completion_lock */ 2689fe4854cSDavid Woodhouse static int jffs2_do_reserve_space(struct jffs2_sb_info *c, uint32_t minsize, 2699fe4854cSDavid Woodhouse uint32_t *len, uint32_t sumsize) 270e631ddbaSFerenc Havasi { 271e631ddbaSFerenc Havasi struct jffs2_eraseblock *jeb = c->nextblock; 272e631ddbaSFerenc Havasi uint32_t reserved_size; /* for summary information at the end of the jeb */ 273e631ddbaSFerenc Havasi int ret; 274e631ddbaSFerenc Havasi 275e631ddbaSFerenc Havasi restart: 276e631ddbaSFerenc Havasi reserved_size = 0; 277e631ddbaSFerenc Havasi 278e631ddbaSFerenc Havasi if (jffs2_sum_active() && (sumsize != JFFS2_SUMMARY_NOSUM_SIZE)) { 279e631ddbaSFerenc Havasi /* NOSUM_SIZE means not to generate summary */ 280e631ddbaSFerenc Havasi 281e631ddbaSFerenc Havasi if (jeb) { 282e631ddbaSFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 283733802d9SArtem B. Bityutskiy dbg_summary("minsize=%d , jeb->free=%d ," 284e631ddbaSFerenc Havasi "summary->size=%d , sumsize=%d\n", 285e631ddbaSFerenc Havasi minsize, jeb->free_size, 286e631ddbaSFerenc Havasi c->summary->sum_size, sumsize); 287e631ddbaSFerenc Havasi } 288e631ddbaSFerenc Havasi 289e631ddbaSFerenc Havasi /* Is there enough space for writing out the current node, or we have to 290e631ddbaSFerenc Havasi write out summary information now, close this jeb and select new nextblock? */ 291e631ddbaSFerenc Havasi if (jeb && (PAD(minsize) + PAD(c->summary->sum_size + sumsize + 292e631ddbaSFerenc Havasi JFFS2_SUMMARY_FRAME_SIZE) > jeb->free_size)) { 293e631ddbaSFerenc Havasi 294e631ddbaSFerenc Havasi /* Has summary been disabled for this jeb? */ 295e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 296e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 297e631ddbaSFerenc Havasi goto restart; 298e631ddbaSFerenc Havasi } 299e631ddbaSFerenc Havasi 300e631ddbaSFerenc Havasi /* Writing out the collected summary information */ 301733802d9SArtem B. Bityutskiy dbg_summary("generating summary for 0x%08x.\n", jeb->offset); 302e631ddbaSFerenc Havasi ret = jffs2_sum_write_sumnode(c); 303e631ddbaSFerenc Havasi 304e631ddbaSFerenc Havasi if (ret) 305e631ddbaSFerenc Havasi return ret; 306e631ddbaSFerenc Havasi 307e631ddbaSFerenc Havasi if (jffs2_sum_is_disabled(c->summary)) { 308e631ddbaSFerenc Havasi /* jffs2_write_sumnode() couldn't write out the summary information 309e631ddbaSFerenc Havasi diabling summary for this jeb and free the collected information 310e631ddbaSFerenc Havasi */ 311e631ddbaSFerenc Havasi sumsize = JFFS2_SUMMARY_NOSUM_SIZE; 312e631ddbaSFerenc Havasi goto restart; 313e631ddbaSFerenc Havasi } 314e631ddbaSFerenc Havasi 315e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 316e631ddbaSFerenc Havasi jeb = NULL; 31734c0e906SFerenc Havasi /* keep always valid value in reserved_size */ 31834c0e906SFerenc Havasi reserved_size = PAD(sumsize + c->summary->sum_size + JFFS2_SUMMARY_FRAME_SIZE); 319e631ddbaSFerenc Havasi } 320e631ddbaSFerenc Havasi } else { 321e631ddbaSFerenc Havasi if (jeb && minsize > jeb->free_size) { 322fc6612f6SDavid Woodhouse uint32_t waste; 323fc6612f6SDavid Woodhouse 324e631ddbaSFerenc Havasi /* Skip the end of this block and file it as having some dirty space */ 325e631ddbaSFerenc Havasi /* If there's a pending write to it, flush now */ 326e631ddbaSFerenc Havasi 327e631ddbaSFerenc Havasi if (jffs2_wbuf_dirty(c)) { 328e631ddbaSFerenc Havasi spin_unlock(&c->erase_completion_lock); 329e631ddbaSFerenc Havasi D1(printk(KERN_DEBUG "jffs2_do_reserve_space: Flushing write buffer\n")); 330e631ddbaSFerenc Havasi jffs2_flush_wbuf_pad(c); 331e631ddbaSFerenc Havasi spin_lock(&c->erase_completion_lock); 332e631ddbaSFerenc Havasi jeb = c->nextblock; 333e631ddbaSFerenc Havasi goto restart; 334e631ddbaSFerenc Havasi } 335e631ddbaSFerenc Havasi 336fc6612f6SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 337fc6612f6SDavid Woodhouse 338fc6612f6SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, jeb, 1); 339fc6612f6SDavid Woodhouse if (ret) 340fc6612f6SDavid Woodhouse return ret; 341fc6612f6SDavid Woodhouse /* Just lock it again and continue. Nothing much can change because 342fc6612f6SDavid Woodhouse we hold c->alloc_sem anyway. In fact, it's not entirely clear why 343fc6612f6SDavid Woodhouse we hold c->erase_completion_lock in the majority of this function... 344fc6612f6SDavid Woodhouse but that's a question for another (more caffeine-rich) day. */ 345fc6612f6SDavid Woodhouse spin_lock(&c->erase_completion_lock); 346fc6612f6SDavid Woodhouse 347fc6612f6SDavid Woodhouse waste = jeb->free_size; 348fc6612f6SDavid Woodhouse jffs2_link_node_ref(c, jeb, 349fc6612f6SDavid Woodhouse (jeb->offset + c->sector_size - waste) | REF_OBSOLETE, 350fc6612f6SDavid Woodhouse waste, NULL); 351fc6612f6SDavid Woodhouse /* FIXME: that made it count as dirty. Convert to wasted */ 352fc6612f6SDavid Woodhouse jeb->dirty_size -= waste; 353fc6612f6SDavid Woodhouse c->dirty_size -= waste; 354fc6612f6SDavid Woodhouse jeb->wasted_size += waste; 355fc6612f6SDavid Woodhouse c->wasted_size += waste; 356e631ddbaSFerenc Havasi 357e631ddbaSFerenc Havasi jffs2_close_nextblock(c, jeb); 358e631ddbaSFerenc Havasi jeb = NULL; 359e631ddbaSFerenc Havasi } 360e631ddbaSFerenc Havasi } 361e631ddbaSFerenc Havasi 362e631ddbaSFerenc Havasi if (!jeb) { 363e631ddbaSFerenc Havasi 364e631ddbaSFerenc Havasi ret = jffs2_find_nextblock(c); 365e631ddbaSFerenc Havasi if (ret) 366e631ddbaSFerenc Havasi return ret; 367e631ddbaSFerenc Havasi 368e631ddbaSFerenc Havasi jeb = c->nextblock; 369e631ddbaSFerenc Havasi 3701da177e4SLinus Torvalds if (jeb->free_size != c->sector_size - c->cleanmarker_size) { 3711da177e4SLinus Torvalds printk(KERN_WARNING "Eep. Block 0x%08x taken from free_list had free_size of 0x%08x!!\n", jeb->offset, jeb->free_size); 3721da177e4SLinus Torvalds goto restart; 3731da177e4SLinus Torvalds } 3741da177e4SLinus Torvalds } 3751da177e4SLinus Torvalds /* OK, jeb (==c->nextblock) is now pointing at a block which definitely has 3761da177e4SLinus Torvalds enough space */ 377e631ddbaSFerenc Havasi *len = jeb->free_size - reserved_size; 3781da177e4SLinus Torvalds 3791da177e4SLinus Torvalds if (c->cleanmarker_size && jeb->used_size == c->cleanmarker_size && 3801da177e4SLinus Torvalds !jeb->first_node->next_in_ino) { 3811da177e4SLinus Torvalds /* Only node in it beforehand was a CLEANMARKER node (we think). 3821da177e4SLinus Torvalds So mark it obsolete now that there's going to be another node 3831da177e4SLinus Torvalds in the block. This will reduce used_size to zero but We've 3841da177e4SLinus Torvalds already set c->nextblock so that jffs2_mark_node_obsolete() 3851da177e4SLinus Torvalds won't try to refile it to the dirty_list. 3861da177e4SLinus Torvalds */ 3871da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 3881da177e4SLinus Torvalds jffs2_mark_node_obsolete(c, jeb->first_node); 3891da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3901da177e4SLinus Torvalds } 3911da177e4SLinus Torvalds 3929fe4854cSDavid Woodhouse D1(printk(KERN_DEBUG "jffs2_do_reserve_space(): Giving 0x%x bytes at 0x%x\n", 3939fe4854cSDavid Woodhouse *len, jeb->offset + (c->sector_size - jeb->free_size))); 3941da177e4SLinus Torvalds return 0; 3951da177e4SLinus Torvalds } 3961da177e4SLinus Torvalds 3971da177e4SLinus Torvalds /** 3981da177e4SLinus Torvalds * jffs2_add_physical_node_ref - add a physical node reference to the list 3991da177e4SLinus Torvalds * @c: superblock info 4001da177e4SLinus Torvalds * @new: new node reference to add 4011da177e4SLinus Torvalds * @len: length of this physical node 4021da177e4SLinus Torvalds * 4031da177e4SLinus Torvalds * Should only be used to report nodes for which space has been allocated 4041da177e4SLinus Torvalds * by jffs2_reserve_space. 4051da177e4SLinus Torvalds * 4061da177e4SLinus Torvalds * Must be called with the alloc_sem held. 4071da177e4SLinus Torvalds */ 4081da177e4SLinus Torvalds 4092f785402SDavid Woodhouse struct jffs2_raw_node_ref *jffs2_add_physical_node_ref(struct jffs2_sb_info *c, 4102f785402SDavid Woodhouse uint32_t ofs, uint32_t len, 4112f785402SDavid Woodhouse struct jffs2_inode_cache *ic) 4121da177e4SLinus Torvalds { 4131da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 4142f785402SDavid Woodhouse struct jffs2_raw_node_ref *new; 4151da177e4SLinus Torvalds 4162f785402SDavid Woodhouse jeb = &c->blocks[ofs / c->sector_size]; 4171da177e4SLinus Torvalds 4182f785402SDavid Woodhouse D1(printk(KERN_DEBUG "jffs2_add_physical_node_ref(): Node at 0x%x(%d), size 0x%x\n", 4192f785402SDavid Woodhouse ofs & ~3, ofs & 3, len)); 4201da177e4SLinus Torvalds #if 1 4212f785402SDavid Woodhouse /* Allow non-obsolete nodes only to be added at the end of c->nextblock, 4222f785402SDavid Woodhouse if c->nextblock is set. Note that wbuf.c will file obsolete nodes 4232f785402SDavid Woodhouse even after refiling c->nextblock */ 4242f785402SDavid Woodhouse if ((c->nextblock || ((ofs & 3) != REF_OBSOLETE)) 4252f785402SDavid Woodhouse && (jeb != c->nextblock || (ofs & ~3) != jeb->offset + (c->sector_size - jeb->free_size))) { 4261da177e4SLinus Torvalds printk(KERN_WARNING "argh. node added in wrong place\n"); 4272f785402SDavid Woodhouse return ERR_PTR(-EINVAL); 4281da177e4SLinus Torvalds } 4291da177e4SLinus Torvalds #endif 4301da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4311da177e4SLinus Torvalds 4322f785402SDavid Woodhouse new = jffs2_link_node_ref(c, jeb, ofs, len, ic); 4331da177e4SLinus Torvalds 4349b88f473SEstelle Hammache if (!jeb->free_size && !jeb->dirty_size && !ISDIRTY(jeb->wasted_size)) { 4351da177e4SLinus Torvalds /* If it lives on the dirty_list, jffs2_reserve_space will put it there */ 4361da177e4SLinus 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", 4371da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 4381da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 4391da177e4SLinus Torvalds /* Flush the last write in the block if it's outstanding */ 4401da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4411da177e4SLinus Torvalds jffs2_flush_wbuf_pad(c); 4421da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4431da177e4SLinus Torvalds } 4441da177e4SLinus Torvalds 4451da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->clean_list); 4461da177e4SLinus Torvalds c->nextblock = NULL; 4471da177e4SLinus Torvalds } 448e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 449e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 4501da177e4SLinus Torvalds 4511da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4521da177e4SLinus Torvalds 4532f785402SDavid Woodhouse return new; 4541da177e4SLinus Torvalds } 4551da177e4SLinus Torvalds 4561da177e4SLinus Torvalds 4571da177e4SLinus Torvalds void jffs2_complete_reservation(struct jffs2_sb_info *c) 4581da177e4SLinus Torvalds { 4591da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_complete_reservation()\n")); 4601da177e4SLinus Torvalds jffs2_garbage_collect_trigger(c); 4611da177e4SLinus Torvalds up(&c->alloc_sem); 4621da177e4SLinus Torvalds } 4631da177e4SLinus Torvalds 4641da177e4SLinus Torvalds static inline int on_list(struct list_head *obj, struct list_head *head) 4651da177e4SLinus Torvalds { 4661da177e4SLinus Torvalds struct list_head *this; 4671da177e4SLinus Torvalds 4681da177e4SLinus Torvalds list_for_each(this, head) { 4691da177e4SLinus Torvalds if (this == obj) { 4701da177e4SLinus Torvalds D1(printk("%p is on list at %p\n", obj, head)); 4711da177e4SLinus Torvalds return 1; 4721da177e4SLinus Torvalds 4731da177e4SLinus Torvalds } 4741da177e4SLinus Torvalds } 4751da177e4SLinus Torvalds return 0; 4761da177e4SLinus Torvalds } 4771da177e4SLinus Torvalds 4781da177e4SLinus Torvalds void jffs2_mark_node_obsolete(struct jffs2_sb_info *c, struct jffs2_raw_node_ref *ref) 4791da177e4SLinus Torvalds { 4801da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 4811da177e4SLinus Torvalds int blocknr; 4821da177e4SLinus Torvalds struct jffs2_unknown_node n; 4831da177e4SLinus Torvalds int ret, addedsize; 4841da177e4SLinus Torvalds size_t retlen; 4851417fc44SDavid Woodhouse uint32_t freed_len; 4861da177e4SLinus Torvalds 4879bfeb691SDavid Woodhouse if(unlikely(!ref)) { 4881da177e4SLinus Torvalds printk(KERN_NOTICE "EEEEEK. jffs2_mark_node_obsolete called with NULL node\n"); 4891da177e4SLinus Torvalds return; 4901da177e4SLinus Torvalds } 4911da177e4SLinus Torvalds if (ref_obsolete(ref)) { 4921da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_mark_node_obsolete called with already obsolete node at 0x%08x\n", ref_offset(ref))); 4931da177e4SLinus Torvalds return; 4941da177e4SLinus Torvalds } 4951da177e4SLinus Torvalds blocknr = ref->flash_offset / c->sector_size; 4961da177e4SLinus Torvalds if (blocknr >= c->nr_blocks) { 4971da177e4SLinus Torvalds printk(KERN_NOTICE "raw node at 0x%08x is off the end of device!\n", ref->flash_offset); 4981da177e4SLinus Torvalds BUG(); 4991da177e4SLinus Torvalds } 5001da177e4SLinus Torvalds jeb = &c->blocks[blocknr]; 5011da177e4SLinus Torvalds 5021da177e4SLinus Torvalds if (jffs2_can_mark_obsolete(c) && !jffs2_is_readonly(c) && 50331fbdf7aSArtem B. Bityuckiy !(c->flags & (JFFS2_SB_FLAG_SCANNING | JFFS2_SB_FLAG_BUILDING))) { 5041da177e4SLinus Torvalds /* Hm. This may confuse static lock analysis. If any of the above 5051da177e4SLinus Torvalds three conditions is false, we're going to return from this 5061da177e4SLinus Torvalds function without actually obliterating any nodes or freeing 5071da177e4SLinus Torvalds any jffs2_raw_node_refs. So we don't need to stop erases from 5081da177e4SLinus Torvalds happening, or protect against people holding an obsolete 5091da177e4SLinus Torvalds jffs2_raw_node_ref without the erase_completion_lock. */ 5101da177e4SLinus Torvalds down(&c->erase_free_sem); 5111da177e4SLinus Torvalds } 5121da177e4SLinus Torvalds 5131da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 5141da177e4SLinus Torvalds 5151417fc44SDavid Woodhouse freed_len = ref_totlen(c, jeb, ref); 5161417fc44SDavid Woodhouse 5171da177e4SLinus Torvalds if (ref_flags(ref) == REF_UNCHECKED) { 5181417fc44SDavid Woodhouse D1(if (unlikely(jeb->unchecked_size < freed_len)) { 5191da177e4SLinus 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", 5201417fc44SDavid Woodhouse freed_len, blocknr, ref->flash_offset, jeb->used_size); 5211da177e4SLinus Torvalds BUG(); 5221da177e4SLinus Torvalds }) 5231417fc44SDavid Woodhouse D1(printk(KERN_DEBUG "Obsoleting previously unchecked node at 0x%08x of len %x: ", ref_offset(ref), freed_len)); 5241417fc44SDavid Woodhouse jeb->unchecked_size -= freed_len; 5251417fc44SDavid Woodhouse c->unchecked_size -= freed_len; 5261da177e4SLinus Torvalds } else { 5271417fc44SDavid Woodhouse D1(if (unlikely(jeb->used_size < freed_len)) { 5281da177e4SLinus 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", 5291417fc44SDavid Woodhouse freed_len, blocknr, ref->flash_offset, jeb->used_size); 5301da177e4SLinus Torvalds BUG(); 5311da177e4SLinus Torvalds }) 5321417fc44SDavid Woodhouse D1(printk(KERN_DEBUG "Obsoleting node at 0x%08x of len %#x: ", ref_offset(ref), freed_len)); 5331417fc44SDavid Woodhouse jeb->used_size -= freed_len; 5341417fc44SDavid Woodhouse c->used_size -= freed_len; 5351da177e4SLinus Torvalds } 5361da177e4SLinus Torvalds 5371da177e4SLinus Torvalds // Take care, that wasted size is taken into concern 5381417fc44SDavid Woodhouse if ((jeb->dirty_size || ISDIRTY(jeb->wasted_size + freed_len)) && jeb != c->nextblock) { 539c7c16c8eSDavid Woodhouse D1(printk("Dirtying\n")); 5401417fc44SDavid Woodhouse addedsize = freed_len; 5411417fc44SDavid Woodhouse jeb->dirty_size += freed_len; 5421417fc44SDavid Woodhouse c->dirty_size += freed_len; 5431da177e4SLinus Torvalds 5441da177e4SLinus Torvalds /* Convert wasted space to dirty, if not a bad block */ 5451da177e4SLinus Torvalds if (jeb->wasted_size) { 5461da177e4SLinus Torvalds if (on_list(&jeb->list, &c->bad_used_list)) { 5471da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Leaving block at %08x on the bad_used_list\n", 5481da177e4SLinus Torvalds jeb->offset)); 5491da177e4SLinus Torvalds addedsize = 0; /* To fool the refiling code later */ 5501da177e4SLinus Torvalds } else { 5511da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Converting %d bytes of wasted space to dirty in block at %08x\n", 5521da177e4SLinus Torvalds jeb->wasted_size, jeb->offset)); 5531da177e4SLinus Torvalds addedsize += jeb->wasted_size; 5541da177e4SLinus Torvalds jeb->dirty_size += jeb->wasted_size; 5551da177e4SLinus Torvalds c->dirty_size += jeb->wasted_size; 5561da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 5571da177e4SLinus Torvalds jeb->wasted_size = 0; 5581da177e4SLinus Torvalds } 5591da177e4SLinus Torvalds } 5601da177e4SLinus Torvalds } else { 561c7c16c8eSDavid Woodhouse D1(printk("Wasting\n")); 5621da177e4SLinus Torvalds addedsize = 0; 5631417fc44SDavid Woodhouse jeb->wasted_size += freed_len; 5641417fc44SDavid Woodhouse c->wasted_size += freed_len; 5651da177e4SLinus Torvalds } 5661da177e4SLinus Torvalds ref->flash_offset = ref_offset(ref) | REF_OBSOLETE; 5671da177e4SLinus Torvalds 568e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, jeb); 569e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5701da177e4SLinus Torvalds 57131fbdf7aSArtem B. Bityuckiy if (c->flags & JFFS2_SB_FLAG_SCANNING) { 57231fbdf7aSArtem B. Bityuckiy /* Flash scanning is in progress. Don't muck about with the block 5731da177e4SLinus Torvalds lists because they're not ready yet, and don't actually 5741da177e4SLinus Torvalds obliterate nodes that look obsolete. If they weren't 5751da177e4SLinus Torvalds marked obsolete on the flash at the time they _became_ 5761da177e4SLinus Torvalds obsolete, there was probably a reason for that. */ 5771da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5781da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 5791da177e4SLinus Torvalds return; 5801da177e4SLinus Torvalds } 5811da177e4SLinus Torvalds 5821da177e4SLinus Torvalds if (jeb == c->nextblock) { 5831da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Not moving nextblock 0x%08x to dirty/erase_pending list\n", jeb->offset)); 5841da177e4SLinus Torvalds } else if (!jeb->used_size && !jeb->unchecked_size) { 5851da177e4SLinus Torvalds if (jeb == c->gcblock) { 5861da177e4SLinus Torvalds D1(printk(KERN_DEBUG "gcblock at 0x%08x completely dirtied. Clearing gcblock...\n", jeb->offset)); 5871da177e4SLinus Torvalds c->gcblock = NULL; 5881da177e4SLinus Torvalds } else { 5891da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x completely dirtied. Removing from (dirty?) list...\n", jeb->offset)); 5901da177e4SLinus Torvalds list_del(&jeb->list); 5911da177e4SLinus Torvalds } 5921da177e4SLinus Torvalds if (jffs2_wbuf_dirty(c)) { 5931da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_pending_wbuf_list\n")); 5941da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_pending_wbuf_list); 5951da177e4SLinus Torvalds } else { 5961da177e4SLinus Torvalds if (jiffies & 127) { 5971da177e4SLinus Torvalds /* Most of the time, we just erase it immediately. Otherwise we 5981da177e4SLinus Torvalds spend ages scanning it on mount, etc. */ 5991da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n")); 6001da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_pending_list); 6011da177e4SLinus Torvalds c->nr_erasing_blocks++; 6021da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 6031da177e4SLinus Torvalds } else { 6041da177e4SLinus Torvalds /* Sometimes, however, we leave it elsewhere so it doesn't get 6051da177e4SLinus Torvalds immediately reused, and we spread the load a bit. */ 6061da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 6071da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_list); 6081da177e4SLinus Torvalds } 6091da177e4SLinus Torvalds } 6101da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Done OK\n")); 6111da177e4SLinus Torvalds } else if (jeb == c->gcblock) { 6121da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Not moving gcblock 0x%08x to dirty_list\n", jeb->offset)); 6131da177e4SLinus Torvalds } else if (ISDIRTY(jeb->dirty_size) && !ISDIRTY(jeb->dirty_size - addedsize)) { 6141da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x is freshly dirtied. Removing from clean list...\n", jeb->offset)); 6151da177e4SLinus Torvalds list_del(&jeb->list); 6161da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to dirty_list\n")); 6171da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->dirty_list); 6181da177e4SLinus Torvalds } else if (VERYDIRTY(c, jeb->dirty_size) && 6191da177e4SLinus Torvalds !VERYDIRTY(c, jeb->dirty_size - addedsize)) { 6201da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x is now very dirty. Removing from dirty list...\n", jeb->offset)); 6211da177e4SLinus Torvalds list_del(&jeb->list); 6221da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to very_dirty_list\n")); 6231da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->very_dirty_list); 6241da177e4SLinus Torvalds } else { 6251da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Eraseblock at 0x%08x not moved anywhere. (free 0x%08x, dirty 0x%08x, used 0x%08x)\n", 6261da177e4SLinus Torvalds jeb->offset, jeb->free_size, jeb->dirty_size, jeb->used_size)); 6271da177e4SLinus Torvalds } 6281da177e4SLinus Torvalds 6291da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6301da177e4SLinus Torvalds 63131fbdf7aSArtem B. Bityuckiy if (!jffs2_can_mark_obsolete(c) || jffs2_is_readonly(c) || 63231fbdf7aSArtem B. Bityuckiy (c->flags & JFFS2_SB_FLAG_BUILDING)) { 6331da177e4SLinus Torvalds /* We didn't lock the erase_free_sem */ 6341da177e4SLinus Torvalds return; 6351da177e4SLinus Torvalds } 6361da177e4SLinus Torvalds 6371da177e4SLinus Torvalds /* The erase_free_sem is locked, and has been since before we marked the node obsolete 6381da177e4SLinus Torvalds and potentially put its eraseblock onto the erase_pending_list. Thus, we know that 6391da177e4SLinus Torvalds the block hasn't _already_ been erased, and that 'ref' itself hasn't been freed yet 640c38c1b61SDavid Woodhouse by jffs2_free_jeb_node_refs() in erase.c. Which is nice. */ 6411da177e4SLinus Torvalds 6421da177e4SLinus Torvalds D1(printk(KERN_DEBUG "obliterating obsoleted node at 0x%08x\n", ref_offset(ref))); 6431da177e4SLinus Torvalds ret = jffs2_flash_read(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 6441da177e4SLinus Torvalds if (ret) { 6451da177e4SLinus Torvalds printk(KERN_WARNING "Read error reading from obsoleted node at 0x%08x: %d\n", ref_offset(ref), ret); 6461da177e4SLinus Torvalds goto out_erase_sem; 6471da177e4SLinus Torvalds } 6481da177e4SLinus Torvalds if (retlen != sizeof(n)) { 6491da177e4SLinus Torvalds printk(KERN_WARNING "Short read from obsoleted node at 0x%08x: %zd\n", ref_offset(ref), retlen); 6501da177e4SLinus Torvalds goto out_erase_sem; 6511da177e4SLinus Torvalds } 6521417fc44SDavid Woodhouse if (PAD(je32_to_cpu(n.totlen)) != PAD(freed_len)) { 6531417fc44SDavid Woodhouse printk(KERN_WARNING "Node totlen on flash (0x%08x) != totlen from node ref (0x%08x)\n", je32_to_cpu(n.totlen), freed_len); 6541da177e4SLinus Torvalds goto out_erase_sem; 6551da177e4SLinus Torvalds } 6561da177e4SLinus Torvalds if (!(je16_to_cpu(n.nodetype) & JFFS2_NODE_ACCURATE)) { 6571da177e4SLinus 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))); 6581da177e4SLinus Torvalds goto out_erase_sem; 6591da177e4SLinus Torvalds } 6601da177e4SLinus Torvalds /* XXX FIXME: This is ugly now */ 6611da177e4SLinus Torvalds n.nodetype = cpu_to_je16(je16_to_cpu(n.nodetype) & ~JFFS2_NODE_ACCURATE); 6621da177e4SLinus Torvalds ret = jffs2_flash_write(c, ref_offset(ref), sizeof(n), &retlen, (char *)&n); 6631da177e4SLinus Torvalds if (ret) { 6641da177e4SLinus Torvalds printk(KERN_WARNING "Write error in obliterating obsoleted node at 0x%08x: %d\n", ref_offset(ref), ret); 6651da177e4SLinus Torvalds goto out_erase_sem; 6661da177e4SLinus Torvalds } 6671da177e4SLinus Torvalds if (retlen != sizeof(n)) { 6681da177e4SLinus Torvalds printk(KERN_WARNING "Short write in obliterating obsoleted node at 0x%08x: %zd\n", ref_offset(ref), retlen); 6691da177e4SLinus Torvalds goto out_erase_sem; 6701da177e4SLinus Torvalds } 6711da177e4SLinus Torvalds 6721da177e4SLinus Torvalds /* Nodes which have been marked obsolete no longer need to be 6731da177e4SLinus Torvalds associated with any inode. Remove them from the per-inode list. 6741da177e4SLinus Torvalds 6751da177e4SLinus Torvalds Note we can't do this for NAND at the moment because we need 6761da177e4SLinus Torvalds obsolete dirent nodes to stay on the lists, because of the 6771da177e4SLinus Torvalds horridness in jffs2_garbage_collect_deletion_dirent(). Also 6781da177e4SLinus Torvalds because we delete the inocache, and on NAND we need that to 6791da177e4SLinus Torvalds stay around until all the nodes are actually erased, in order 6801da177e4SLinus Torvalds to stop us from giving the same inode number to another newly 6811da177e4SLinus Torvalds created inode. */ 6821da177e4SLinus Torvalds if (ref->next_in_ino) { 6831da177e4SLinus Torvalds struct jffs2_inode_cache *ic; 6841da177e4SLinus Torvalds struct jffs2_raw_node_ref **p; 6851da177e4SLinus Torvalds 6861da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 6871da177e4SLinus Torvalds 6881da177e4SLinus Torvalds ic = jffs2_raw_ref_to_ic(ref); 6891da177e4SLinus Torvalds for (p = &ic->nodes; (*p) != ref; p = &((*p)->next_in_ino)) 6901da177e4SLinus Torvalds ; 6911da177e4SLinus Torvalds 6921da177e4SLinus Torvalds *p = ref->next_in_ino; 6931da177e4SLinus Torvalds ref->next_in_ino = NULL; 6941da177e4SLinus Torvalds 695c9f700f8SKaiGai Kohei switch (ic->class) { 696c9f700f8SKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 697c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_DATUM: 698c9f700f8SKaiGai Kohei jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic); 699c9f700f8SKaiGai Kohei break; 700c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_REF: 701c9f700f8SKaiGai Kohei jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic); 702c9f700f8SKaiGai Kohei break; 703c9f700f8SKaiGai Kohei #endif 704c9f700f8SKaiGai Kohei default: 705437316d9SArtem B. Bityuckiy if (ic->nodes == (void *)ic && ic->nlink == 0) 7061da177e4SLinus Torvalds jffs2_del_ino_cache(c, ic); 707c9f700f8SKaiGai Kohei break; 708c9f700f8SKaiGai Kohei } 7091da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 7101da177e4SLinus Torvalds } 7111da177e4SLinus Torvalds 7121da177e4SLinus Torvalds out_erase_sem: 7131da177e4SLinus Torvalds up(&c->erase_free_sem); 7141da177e4SLinus Torvalds } 7151da177e4SLinus Torvalds 7161da177e4SLinus Torvalds int jffs2_thread_should_wake(struct jffs2_sb_info *c) 7171da177e4SLinus Torvalds { 7181da177e4SLinus Torvalds int ret = 0; 7191da177e4SLinus Torvalds uint32_t dirty; 7201da177e4SLinus Torvalds 7211da177e4SLinus Torvalds if (c->unchecked_size) { 7221da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_thread_should_wake(): unchecked_size %d, checked_ino #%d\n", 7231da177e4SLinus Torvalds c->unchecked_size, c->checked_ino)); 7241da177e4SLinus Torvalds return 1; 7251da177e4SLinus Torvalds } 7261da177e4SLinus Torvalds 7271da177e4SLinus Torvalds /* dirty_size contains blocks on erase_pending_list 7281da177e4SLinus Torvalds * those blocks are counted in c->nr_erasing_blocks. 7291da177e4SLinus Torvalds * If one block is actually erased, it is not longer counted as dirty_space 7301da177e4SLinus Torvalds * but it is counted in c->nr_erasing_blocks, so we add it and subtract it 7311da177e4SLinus Torvalds * with c->nr_erasing_blocks * c->sector_size again. 7321da177e4SLinus Torvalds * Blocks on erasable_list are counted as dirty_size, but not in c->nr_erasing_blocks 7331da177e4SLinus Torvalds * This helps us to force gc and pick eventually a clean block to spread the load. 7341da177e4SLinus Torvalds */ 7351da177e4SLinus Torvalds dirty = c->dirty_size + c->erasing_size - c->nr_erasing_blocks * c->sector_size; 7361da177e4SLinus Torvalds 7371da177e4SLinus Torvalds if (c->nr_free_blocks + c->nr_erasing_blocks < c->resv_blocks_gctrigger && 7381da177e4SLinus Torvalds (dirty > c->nospc_dirty_size)) 7391da177e4SLinus Torvalds ret = 1; 7401da177e4SLinus Torvalds 7411da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_thread_should_wake(): nr_free_blocks %d, nr_erasing_blocks %d, dirty_size 0x%x: %s\n", 7421da177e4SLinus Torvalds c->nr_free_blocks, c->nr_erasing_blocks, c->dirty_size, ret?"yes":"no")); 7431da177e4SLinus Torvalds 7441da177e4SLinus Torvalds return ret; 7451da177e4SLinus Torvalds } 746