11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 Red Hat, Inc. 51da177e4SLinus Torvalds * 61da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 71da177e4SLinus Torvalds * 81da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 91da177e4SLinus Torvalds * 10*5d157885SThomas Gleixner * $Id: erase.c,v 1.80 2005/07/14 19:46:24 joern Exp $ 111da177e4SLinus Torvalds * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/slab.h> 161da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 171da177e4SLinus Torvalds #include <linux/compiler.h> 181da177e4SLinus Torvalds #include <linux/crc32.h> 191da177e4SLinus Torvalds #include <linux/sched.h> 201da177e4SLinus Torvalds #include <linux/pagemap.h> 211da177e4SLinus Torvalds #include "nodelist.h" 221da177e4SLinus Torvalds 231da177e4SLinus Torvalds struct erase_priv_struct { 241da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 251da177e4SLinus Torvalds struct jffs2_sb_info *c; 261da177e4SLinus Torvalds }; 271da177e4SLinus Torvalds 281da177e4SLinus Torvalds #ifndef __ECOS 291da177e4SLinus Torvalds static void jffs2_erase_callback(struct erase_info *); 301da177e4SLinus Torvalds #endif 311da177e4SLinus Torvalds static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset); 321da177e4SLinus Torvalds static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 331da177e4SLinus Torvalds static void jffs2_free_all_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 341da177e4SLinus Torvalds static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 351da177e4SLinus Torvalds 361da177e4SLinus Torvalds static void jffs2_erase_block(struct jffs2_sb_info *c, 371da177e4SLinus Torvalds struct jffs2_eraseblock *jeb) 381da177e4SLinus Torvalds { 391da177e4SLinus Torvalds int ret; 401da177e4SLinus Torvalds uint32_t bad_offset; 411da177e4SLinus Torvalds #ifdef __ECOS 421da177e4SLinus Torvalds ret = jffs2_flash_erase(c, jeb); 431da177e4SLinus Torvalds if (!ret) { 441da177e4SLinus Torvalds jffs2_erase_succeeded(c, jeb); 451da177e4SLinus Torvalds return; 461da177e4SLinus Torvalds } 471da177e4SLinus Torvalds bad_offset = jeb->offset; 481da177e4SLinus Torvalds #else /* Linux */ 491da177e4SLinus Torvalds struct erase_info *instr; 501da177e4SLinus Torvalds 517d27c814SThomas Gleixner D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#x (range %#x-%#x)\n", jeb->offset, jeb->offset, jeb->offset + c->sector_size)); 521da177e4SLinus Torvalds instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL); 531da177e4SLinus Torvalds if (!instr) { 541da177e4SLinus Torvalds printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n"); 551da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 561da177e4SLinus Torvalds list_del(&jeb->list); 571da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 581da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 591da177e4SLinus Torvalds c->dirty_size += c->sector_size; 601da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 611da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 621da177e4SLinus Torvalds return; 631da177e4SLinus Torvalds } 641da177e4SLinus Torvalds 651da177e4SLinus Torvalds memset(instr, 0, sizeof(*instr)); 661da177e4SLinus Torvalds 671da177e4SLinus Torvalds instr->mtd = c->mtd; 681da177e4SLinus Torvalds instr->addr = jeb->offset; 691da177e4SLinus Torvalds instr->len = c->sector_size; 701da177e4SLinus Torvalds instr->callback = jffs2_erase_callback; 711da177e4SLinus Torvalds instr->priv = (unsigned long)(&instr[1]); 721da177e4SLinus Torvalds instr->fail_addr = 0xffffffff; 731da177e4SLinus Torvalds 741da177e4SLinus Torvalds ((struct erase_priv_struct *)instr->priv)->jeb = jeb; 751da177e4SLinus Torvalds ((struct erase_priv_struct *)instr->priv)->c = c; 761da177e4SLinus Torvalds 771da177e4SLinus Torvalds ret = c->mtd->erase(c->mtd, instr); 781da177e4SLinus Torvalds if (!ret) 791da177e4SLinus Torvalds return; 801da177e4SLinus Torvalds 811da177e4SLinus Torvalds bad_offset = instr->fail_addr; 821da177e4SLinus Torvalds kfree(instr); 831da177e4SLinus Torvalds #endif /* __ECOS */ 841da177e4SLinus Torvalds 851da177e4SLinus Torvalds if (ret == -ENOMEM || ret == -EAGAIN) { 861da177e4SLinus Torvalds /* Erase failed immediately. Refile it on the list */ 871da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret)); 881da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 891da177e4SLinus Torvalds list_del(&jeb->list); 901da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 911da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 921da177e4SLinus Torvalds c->dirty_size += c->sector_size; 931da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 941da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 951da177e4SLinus Torvalds return; 961da177e4SLinus Torvalds } 971da177e4SLinus Torvalds 981da177e4SLinus Torvalds if (ret == -EROFS) 991da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n", jeb->offset); 1001da177e4SLinus Torvalds else 1011da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x failed immediately: errno %d\n", jeb->offset, ret); 1021da177e4SLinus Torvalds 1031da177e4SLinus Torvalds jffs2_erase_failed(c, jeb, bad_offset); 1041da177e4SLinus Torvalds } 1051da177e4SLinus Torvalds 1061da177e4SLinus Torvalds void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count) 1071da177e4SLinus Torvalds { 1081da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 1091da177e4SLinus Torvalds 1101da177e4SLinus Torvalds down(&c->erase_free_sem); 1111da177e4SLinus Torvalds 1121da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1131da177e4SLinus Torvalds 1141da177e4SLinus Torvalds while (!list_empty(&c->erase_complete_list) || 1151da177e4SLinus Torvalds !list_empty(&c->erase_pending_list)) { 1161da177e4SLinus Torvalds 1171da177e4SLinus Torvalds if (!list_empty(&c->erase_complete_list)) { 1181da177e4SLinus Torvalds jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); 1191da177e4SLinus Torvalds list_del(&jeb->list); 1201da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1211da177e4SLinus Torvalds jffs2_mark_erased_block(c, jeb); 1221da177e4SLinus Torvalds 1231da177e4SLinus Torvalds if (!--count) { 1241da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n")); 1251da177e4SLinus Torvalds goto done; 1261da177e4SLinus Torvalds } 1271da177e4SLinus Torvalds 1281da177e4SLinus Torvalds } else if (!list_empty(&c->erase_pending_list)) { 1291da177e4SLinus Torvalds jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); 1301da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset)); 1311da177e4SLinus Torvalds list_del(&jeb->list); 1321da177e4SLinus Torvalds c->erasing_size += c->sector_size; 1331da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 1341da177e4SLinus Torvalds c->free_size -= jeb->free_size; 1351da177e4SLinus Torvalds c->used_size -= jeb->used_size; 1361da177e4SLinus Torvalds c->dirty_size -= jeb->dirty_size; 1371da177e4SLinus Torvalds jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0; 1381da177e4SLinus Torvalds jffs2_free_all_node_refs(c, jeb); 1391da177e4SLinus Torvalds list_add(&jeb->list, &c->erasing_list); 1401da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1411da177e4SLinus Torvalds 1421da177e4SLinus Torvalds jffs2_erase_block(c, jeb); 1431da177e4SLinus Torvalds 1441da177e4SLinus Torvalds } else { 1451da177e4SLinus Torvalds BUG(); 1461da177e4SLinus Torvalds } 1471da177e4SLinus Torvalds 1481da177e4SLinus Torvalds /* Be nice */ 1491da177e4SLinus Torvalds cond_resched(); 1501da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1511da177e4SLinus Torvalds } 1521da177e4SLinus Torvalds 1531da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1541da177e4SLinus Torvalds done: 1551da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n")); 1561da177e4SLinus Torvalds 1571da177e4SLinus Torvalds up(&c->erase_free_sem); 1581da177e4SLinus Torvalds } 1591da177e4SLinus Torvalds 1601da177e4SLinus Torvalds static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 1611da177e4SLinus Torvalds { 1621da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset)); 1631da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1641da177e4SLinus Torvalds list_del(&jeb->list); 1651da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_complete_list); 1661da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1671da177e4SLinus Torvalds /* Ensure that kupdated calls us again to mark them clean */ 1681da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1691da177e4SLinus Torvalds } 1701da177e4SLinus Torvalds 1711da177e4SLinus Torvalds static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset) 1721da177e4SLinus Torvalds { 1731da177e4SLinus Torvalds /* For NAND, if the failure did not occur at the device level for a 1741da177e4SLinus Torvalds specific physical page, don't bother updating the bad block table. */ 1751da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) { 1761da177e4SLinus Torvalds /* We had a device-level failure to erase. Let's see if we've 1771da177e4SLinus Torvalds failed too many times. */ 1781da177e4SLinus Torvalds if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) { 1791da177e4SLinus Torvalds /* We'd like to give this block another try. */ 1801da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1811da177e4SLinus Torvalds list_del(&jeb->list); 1821da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1831da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 1841da177e4SLinus Torvalds c->dirty_size += c->sector_size; 1851da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 1861da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1871da177e4SLinus Torvalds return; 1881da177e4SLinus Torvalds } 1891da177e4SLinus Torvalds } 1901da177e4SLinus Torvalds 1911da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1921da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 1931da177e4SLinus Torvalds c->bad_size += c->sector_size; 1941da177e4SLinus Torvalds list_del(&jeb->list); 1951da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_list); 1961da177e4SLinus Torvalds c->nr_erasing_blocks--; 1971da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1981da177e4SLinus Torvalds wake_up(&c->erase_wait); 1991da177e4SLinus Torvalds } 2001da177e4SLinus Torvalds 2011da177e4SLinus Torvalds #ifndef __ECOS 2021da177e4SLinus Torvalds static void jffs2_erase_callback(struct erase_info *instr) 2031da177e4SLinus Torvalds { 2041da177e4SLinus Torvalds struct erase_priv_struct *priv = (void *)instr->priv; 2051da177e4SLinus Torvalds 2061da177e4SLinus Torvalds if(instr->state != MTD_ERASE_DONE) { 2071da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state); 2081da177e4SLinus Torvalds jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr); 2091da177e4SLinus Torvalds } else { 2101da177e4SLinus Torvalds jffs2_erase_succeeded(priv->c, priv->jeb); 2111da177e4SLinus Torvalds } 2121da177e4SLinus Torvalds kfree(instr); 2131da177e4SLinus Torvalds } 2141da177e4SLinus Torvalds #endif /* !__ECOS */ 2151da177e4SLinus Torvalds 2161da177e4SLinus Torvalds /* Hmmm. Maybe we should accept the extra space it takes and make 2171da177e4SLinus Torvalds this a standard doubly-linked list? */ 2181da177e4SLinus Torvalds static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c, 2191da177e4SLinus Torvalds struct jffs2_raw_node_ref *ref, struct jffs2_eraseblock *jeb) 2201da177e4SLinus Torvalds { 2211da177e4SLinus Torvalds struct jffs2_inode_cache *ic = NULL; 2221da177e4SLinus Torvalds struct jffs2_raw_node_ref **prev; 2231da177e4SLinus Torvalds 2241da177e4SLinus Torvalds prev = &ref->next_in_ino; 2251da177e4SLinus Torvalds 2261da177e4SLinus Torvalds /* Walk the inode's list once, removing any nodes from this eraseblock */ 2271da177e4SLinus Torvalds while (1) { 2281da177e4SLinus Torvalds if (!(*prev)->next_in_ino) { 2291da177e4SLinus Torvalds /* We're looking at the jffs2_inode_cache, which is 2301da177e4SLinus Torvalds at the end of the linked list. Stash it and continue 2311da177e4SLinus Torvalds from the beginning of the list */ 2321da177e4SLinus Torvalds ic = (struct jffs2_inode_cache *)(*prev); 2331da177e4SLinus Torvalds prev = &ic->nodes; 2341da177e4SLinus Torvalds continue; 2351da177e4SLinus Torvalds } 2361da177e4SLinus Torvalds 2373be36675SAndrew Victor if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { 2381da177e4SLinus Torvalds /* It's in the block we're erasing */ 2391da177e4SLinus Torvalds struct jffs2_raw_node_ref *this; 2401da177e4SLinus Torvalds 2411da177e4SLinus Torvalds this = *prev; 2421da177e4SLinus Torvalds *prev = this->next_in_ino; 2431da177e4SLinus Torvalds this->next_in_ino = NULL; 2441da177e4SLinus Torvalds 2451da177e4SLinus Torvalds if (this == ref) 2461da177e4SLinus Torvalds break; 2471da177e4SLinus Torvalds 2481da177e4SLinus Torvalds continue; 2491da177e4SLinus Torvalds } 2501da177e4SLinus Torvalds /* Not to be deleted. Skip */ 2511da177e4SLinus Torvalds prev = &((*prev)->next_in_ino); 2521da177e4SLinus Torvalds } 2531da177e4SLinus Torvalds 2541da177e4SLinus Torvalds /* PARANOIA */ 2551da177e4SLinus Torvalds if (!ic) { 2561da177e4SLinus Torvalds printk(KERN_WARNING "inode_cache not found in remove_node_refs()!!\n"); 2571da177e4SLinus Torvalds return; 2581da177e4SLinus Torvalds } 2591da177e4SLinus Torvalds 2601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n", 2611da177e4SLinus Torvalds jeb->offset, jeb->offset + c->sector_size, ic->ino)); 2621da177e4SLinus Torvalds 2631da177e4SLinus Torvalds D2({ 2641da177e4SLinus Torvalds int i=0; 2651da177e4SLinus Torvalds struct jffs2_raw_node_ref *this; 2661da177e4SLinus Torvalds printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG); 2671da177e4SLinus Torvalds 2681da177e4SLinus Torvalds this = ic->nodes; 2691da177e4SLinus Torvalds 2701da177e4SLinus Torvalds while(this) { 2711da177e4SLinus Torvalds printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this)); 2721da177e4SLinus Torvalds if (++i == 5) { 2731da177e4SLinus Torvalds printk("\n" KERN_DEBUG); 2741da177e4SLinus Torvalds i=0; 2751da177e4SLinus Torvalds } 2761da177e4SLinus Torvalds this = this->next_in_ino; 2771da177e4SLinus Torvalds } 2781da177e4SLinus Torvalds printk("\n"); 2791da177e4SLinus Torvalds }); 2801da177e4SLinus Torvalds 281437316d9SArtem B. Bityuckiy if (ic->nodes == (void *)ic && ic->nlink == 0) 2821da177e4SLinus Torvalds jffs2_del_ino_cache(c, ic); 2831da177e4SLinus Torvalds } 2841da177e4SLinus Torvalds 2851da177e4SLinus Torvalds static void jffs2_free_all_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 2861da177e4SLinus Torvalds { 2871da177e4SLinus Torvalds struct jffs2_raw_node_ref *ref; 2881da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset)); 2891da177e4SLinus Torvalds while(jeb->first_node) { 2901da177e4SLinus Torvalds ref = jeb->first_node; 2911da177e4SLinus Torvalds jeb->first_node = ref->next_phys; 2921da177e4SLinus Torvalds 2931da177e4SLinus Torvalds /* Remove from the inode-list */ 2941da177e4SLinus Torvalds if (ref->next_in_ino) 2951da177e4SLinus Torvalds jffs2_remove_node_refs_from_ino_list(c, ref, jeb); 2961da177e4SLinus Torvalds /* else it was a non-inode node or already removed, so don't bother */ 2971da177e4SLinus Torvalds 2981da177e4SLinus Torvalds jffs2_free_raw_node_ref(ref); 2991da177e4SLinus Torvalds } 3001da177e4SLinus Torvalds jeb->last_node = NULL; 3011da177e4SLinus Torvalds } 3021da177e4SLinus Torvalds 303*5d157885SThomas Gleixner static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset) 3041da177e4SLinus Torvalds { 305*5d157885SThomas Gleixner void *ebuf; 306*5d157885SThomas Gleixner uint32_t ofs; 3071da177e4SLinus Torvalds size_t retlen; 308*5d157885SThomas Gleixner int ret = -EIO; 3091da177e4SLinus Torvalds 3101da177e4SLinus Torvalds ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL); 3111da177e4SLinus Torvalds if (!ebuf) { 312*5d157885SThomas Gleixner printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset); 313*5d157885SThomas Gleixner return -EAGAIN; 314*5d157885SThomas Gleixner } 3151da177e4SLinus Torvalds 3161da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset)); 317*5d157885SThomas Gleixner 318*5d157885SThomas Gleixner for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) { 3191da177e4SLinus Torvalds uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs); 3201da177e4SLinus Torvalds int i; 3211da177e4SLinus Torvalds 322*5d157885SThomas Gleixner *bad_offset = ofs; 3231da177e4SLinus Torvalds 324*5d157885SThomas Gleixner ret = jffs2_flash_read(c, ofs, readlen, &retlen, ebuf); 3251da177e4SLinus Torvalds if (ret) { 3261da177e4SLinus Torvalds printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret); 327*5d157885SThomas Gleixner goto fail; 3281da177e4SLinus Torvalds } 3291da177e4SLinus Torvalds if (retlen != readlen) { 3301da177e4SLinus Torvalds printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen); 331*5d157885SThomas Gleixner goto fail; 3321da177e4SLinus Torvalds } 3331da177e4SLinus Torvalds for (i=0; i<readlen; i += sizeof(unsigned long)) { 3341da177e4SLinus Torvalds /* It's OK. We know it's properly aligned */ 335*5d157885SThomas Gleixner unsigned long *datum = ebuf + i; 336*5d157885SThomas Gleixner if (*datum + 1) { 337*5d157885SThomas Gleixner *bad_offset += i; 338*5d157885SThomas Gleixner printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", *datum, *bad_offset); 339*5d157885SThomas Gleixner goto fail; 3401da177e4SLinus Torvalds } 3411da177e4SLinus Torvalds } 3421da177e4SLinus Torvalds ofs += readlen; 3431da177e4SLinus Torvalds cond_resched(); 3441da177e4SLinus Torvalds } 345*5d157885SThomas Gleixner ret = 0; 346*5d157885SThomas Gleixner fail: 3471da177e4SLinus Torvalds kfree(ebuf); 348*5d157885SThomas Gleixner return ret; 3491da177e4SLinus Torvalds } 3501da177e4SLinus Torvalds 351*5d157885SThomas Gleixner static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 352*5d157885SThomas Gleixner { 353*5d157885SThomas Gleixner struct jffs2_raw_node_ref *marker_ref = NULL; 354*5d157885SThomas Gleixner size_t retlen; 355*5d157885SThomas Gleixner int ret; 356*5d157885SThomas Gleixner uint32_t bad_offset; 357*5d157885SThomas Gleixner 358*5d157885SThomas Gleixner switch (jffs2_block_check_erase(c, jeb, &bad_offset)) { 359*5d157885SThomas Gleixner case -EAGAIN: goto refile; 360*5d157885SThomas Gleixner case -EIO: goto filebad; 361*5d157885SThomas Gleixner } 3621da177e4SLinus Torvalds 3631da177e4SLinus Torvalds /* Write the erase complete marker */ 3641da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset)); 365*5d157885SThomas Gleixner bad_offset = jeb->offset; 366*5d157885SThomas Gleixner 367*5d157885SThomas Gleixner /* Cleanmarker in oob area or no cleanmarker at all ? */ 368*5d157885SThomas Gleixner if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) { 369*5d157885SThomas Gleixner 3701da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 3711da177e4SLinus Torvalds if (jffs2_write_nand_cleanmarker(c, jeb)) 372*5d157885SThomas Gleixner goto filebad; 373*5d157885SThomas Gleixner } 3741da177e4SLinus Torvalds 3751da177e4SLinus Torvalds jeb->first_node = jeb->last_node = NULL; 3761da177e4SLinus Torvalds jeb->free_size = c->sector_size; 3771da177e4SLinus Torvalds jeb->used_size = 0; 3781da177e4SLinus Torvalds jeb->dirty_size = 0; 3791da177e4SLinus Torvalds jeb->wasted_size = 0; 3808f15fd55SAndrew Victor 3811da177e4SLinus Torvalds } else { 382*5d157885SThomas Gleixner 3831da177e4SLinus Torvalds struct kvec vecs[1]; 3841da177e4SLinus Torvalds struct jffs2_unknown_node marker = { 3851da177e4SLinus Torvalds .magic = cpu_to_je16(JFFS2_MAGIC_BITMASK), 3861da177e4SLinus Torvalds .nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER), 3871da177e4SLinus Torvalds .totlen = cpu_to_je32(c->cleanmarker_size) 3881da177e4SLinus Torvalds }; 3891da177e4SLinus Torvalds 390*5d157885SThomas Gleixner marker_ref = jffs2_alloc_raw_node_ref(); 391*5d157885SThomas Gleixner if (!marker_ref) { 392*5d157885SThomas Gleixner printk(KERN_WARNING "Failed to allocate raw node ref for clean marker. Refiling\n"); 393*5d157885SThomas Gleixner goto refile; 394*5d157885SThomas Gleixner } 395*5d157885SThomas Gleixner 3961da177e4SLinus Torvalds marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4)); 3971da177e4SLinus Torvalds 3981da177e4SLinus Torvalds vecs[0].iov_base = (unsigned char *) ▮ 3991da177e4SLinus Torvalds vecs[0].iov_len = sizeof(marker); 4001da177e4SLinus Torvalds ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen); 4011da177e4SLinus Torvalds 402*5d157885SThomas Gleixner if (ret || retlen != sizeof(marker)) { 403*5d157885SThomas Gleixner if (ret) 4041da177e4SLinus Torvalds printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n", 4051da177e4SLinus Torvalds jeb->offset, ret); 406*5d157885SThomas Gleixner else 4071da177e4SLinus Torvalds printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n", 4081da177e4SLinus Torvalds jeb->offset, sizeof(marker), retlen); 409*5d157885SThomas Gleixner 410*5d157885SThomas Gleixner jffs2_free_raw_node_ref(marker_ref); 411*5d157885SThomas Gleixner goto filebad; 4121da177e4SLinus Torvalds } 4131da177e4SLinus Torvalds 4141da177e4SLinus Torvalds marker_ref->next_in_ino = NULL; 4151da177e4SLinus Torvalds marker_ref->next_phys = NULL; 4161da177e4SLinus Torvalds marker_ref->flash_offset = jeb->offset | REF_NORMAL; 4171da177e4SLinus Torvalds marker_ref->__totlen = c->cleanmarker_size; 4181da177e4SLinus Torvalds 4191da177e4SLinus Torvalds jeb->first_node = jeb->last_node = marker_ref; 4201da177e4SLinus Torvalds 4211da177e4SLinus Torvalds jeb->free_size = c->sector_size - c->cleanmarker_size; 4221da177e4SLinus Torvalds jeb->used_size = c->cleanmarker_size; 4231da177e4SLinus Torvalds jeb->dirty_size = 0; 4241da177e4SLinus Torvalds jeb->wasted_size = 0; 4251da177e4SLinus Torvalds } 4261da177e4SLinus Torvalds 4271da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4281da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 4291da177e4SLinus Torvalds c->free_size += jeb->free_size; 4301da177e4SLinus Torvalds c->used_size += jeb->used_size; 4311da177e4SLinus Torvalds 4321da177e4SLinus Torvalds ACCT_SANITY_CHECK(c,jeb); 4331da177e4SLinus Torvalds D1(ACCT_PARANOIA_CHECK(jeb)); 4341da177e4SLinus Torvalds 4351da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->free_list); 4361da177e4SLinus Torvalds c->nr_erasing_blocks--; 4371da177e4SLinus Torvalds c->nr_free_blocks++; 4381da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4391da177e4SLinus Torvalds wake_up(&c->erase_wait); 440*5d157885SThomas Gleixner return; 4411da177e4SLinus Torvalds 442*5d157885SThomas Gleixner filebad: 443*5d157885SThomas Gleixner spin_lock(&c->erase_completion_lock); 444*5d157885SThomas Gleixner /* Stick it on a list (any list) so erase_failed can take it 445*5d157885SThomas Gleixner right off again. Silly, but shouldn't happen often. */ 446*5d157885SThomas Gleixner list_add(&jeb->list, &c->erasing_list); 447*5d157885SThomas Gleixner spin_unlock(&c->erase_completion_lock); 448*5d157885SThomas Gleixner jffs2_erase_failed(c, jeb, bad_offset); 449*5d157885SThomas Gleixner return; 450*5d157885SThomas Gleixner 451*5d157885SThomas Gleixner refile: 452*5d157885SThomas Gleixner /* Stick it back on the list from whence it came and come back later */ 453*5d157885SThomas Gleixner jffs2_erase_pending_trigger(c); 454*5d157885SThomas Gleixner spin_lock(&c->erase_completion_lock); 455*5d157885SThomas Gleixner list_add(&jeb->list, &c->erase_complete_list); 456*5d157885SThomas Gleixner spin_unlock(&c->erase_completion_lock); 457*5d157885SThomas Gleixner return; 458*5d157885SThomas Gleixner } 459