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/crc32.h> 171da177e4SLinus Torvalds #include <linux/sched.h> 181da177e4SLinus Torvalds #include <linux/pagemap.h> 191da177e4SLinus Torvalds #include "nodelist.h" 201da177e4SLinus Torvalds 211da177e4SLinus Torvalds struct erase_priv_struct { 221da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 231da177e4SLinus Torvalds struct jffs2_sb_info *c; 241da177e4SLinus Torvalds }; 251da177e4SLinus Torvalds 261da177e4SLinus Torvalds #ifndef __ECOS 271da177e4SLinus Torvalds static void jffs2_erase_callback(struct erase_info *); 281da177e4SLinus Torvalds #endif 291da177e4SLinus Torvalds static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset); 301da177e4SLinus Torvalds static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 311da177e4SLinus Torvalds static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); 321da177e4SLinus Torvalds 331da177e4SLinus Torvalds static void jffs2_erase_block(struct jffs2_sb_info *c, 341da177e4SLinus Torvalds struct jffs2_eraseblock *jeb) 351da177e4SLinus Torvalds { 361da177e4SLinus Torvalds int ret; 371da177e4SLinus Torvalds uint32_t bad_offset; 381da177e4SLinus Torvalds #ifdef __ECOS 391da177e4SLinus Torvalds ret = jffs2_flash_erase(c, jeb); 401da177e4SLinus Torvalds if (!ret) { 411da177e4SLinus Torvalds jffs2_erase_succeeded(c, jeb); 421da177e4SLinus Torvalds return; 431da177e4SLinus Torvalds } 441da177e4SLinus Torvalds bad_offset = jeb->offset; 451da177e4SLinus Torvalds #else /* Linux */ 461da177e4SLinus Torvalds struct erase_info *instr; 471da177e4SLinus Torvalds 48e0c8e42fSArtem B. Bityutskiy D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#08x (range %#08x-%#08x)\n", 49e0c8e42fSArtem B. Bityutskiy jeb->offset, jeb->offset, jeb->offset + c->sector_size)); 501da177e4SLinus Torvalds instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL); 511da177e4SLinus Torvalds if (!instr) { 521da177e4SLinus Torvalds printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n"); 531da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 54f116629dSAkinobu Mita list_move(&jeb->list, &c->erase_pending_list); 551da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 561da177e4SLinus Torvalds c->dirty_size += c->sector_size; 571da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 581da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 591da177e4SLinus Torvalds return; 601da177e4SLinus Torvalds } 611da177e4SLinus Torvalds 621da177e4SLinus Torvalds memset(instr, 0, sizeof(*instr)); 631da177e4SLinus Torvalds 641da177e4SLinus Torvalds instr->mtd = c->mtd; 651da177e4SLinus Torvalds instr->addr = jeb->offset; 661da177e4SLinus Torvalds instr->len = c->sector_size; 671da177e4SLinus Torvalds instr->callback = jffs2_erase_callback; 681da177e4SLinus Torvalds instr->priv = (unsigned long)(&instr[1]); 691da177e4SLinus Torvalds instr->fail_addr = 0xffffffff; 701da177e4SLinus Torvalds 711da177e4SLinus Torvalds ((struct erase_priv_struct *)instr->priv)->jeb = jeb; 721da177e4SLinus Torvalds ((struct erase_priv_struct *)instr->priv)->c = c; 731da177e4SLinus Torvalds 741da177e4SLinus Torvalds ret = c->mtd->erase(c->mtd, instr); 751da177e4SLinus Torvalds if (!ret) 761da177e4SLinus Torvalds return; 771da177e4SLinus Torvalds 781da177e4SLinus Torvalds bad_offset = instr->fail_addr; 791da177e4SLinus Torvalds kfree(instr); 801da177e4SLinus Torvalds #endif /* __ECOS */ 811da177e4SLinus Torvalds 821da177e4SLinus Torvalds if (ret == -ENOMEM || ret == -EAGAIN) { 831da177e4SLinus Torvalds /* Erase failed immediately. Refile it on the list */ 841da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret)); 851da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 86f116629dSAkinobu Mita list_move(&jeb->list, &c->erase_pending_list); 871da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 881da177e4SLinus Torvalds c->dirty_size += c->sector_size; 891da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 901da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 911da177e4SLinus Torvalds return; 921da177e4SLinus Torvalds } 931da177e4SLinus Torvalds 941da177e4SLinus Torvalds if (ret == -EROFS) 951da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n", jeb->offset); 961da177e4SLinus Torvalds else 971da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x failed immediately: errno %d\n", jeb->offset, ret); 981da177e4SLinus Torvalds 991da177e4SLinus Torvalds jffs2_erase_failed(c, jeb, bad_offset); 1001da177e4SLinus Torvalds } 1011da177e4SLinus Torvalds 1021da177e4SLinus Torvalds void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count) 1031da177e4SLinus Torvalds { 1041da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 1051da177e4SLinus Torvalds 1061da177e4SLinus Torvalds down(&c->erase_free_sem); 1071da177e4SLinus Torvalds 1081da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1091da177e4SLinus Torvalds 1101da177e4SLinus Torvalds while (!list_empty(&c->erase_complete_list) || 1111da177e4SLinus Torvalds !list_empty(&c->erase_pending_list)) { 1121da177e4SLinus Torvalds 1131da177e4SLinus Torvalds if (!list_empty(&c->erase_complete_list)) { 1141da177e4SLinus Torvalds jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); 1151da177e4SLinus Torvalds list_del(&jeb->list); 1161da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1171da177e4SLinus Torvalds jffs2_mark_erased_block(c, jeb); 1181da177e4SLinus Torvalds 1191da177e4SLinus Torvalds if (!--count) { 1201da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n")); 1211da177e4SLinus Torvalds goto done; 1221da177e4SLinus Torvalds } 1231da177e4SLinus Torvalds 1241da177e4SLinus Torvalds } else if (!list_empty(&c->erase_pending_list)) { 1251da177e4SLinus Torvalds jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); 1261da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset)); 1271da177e4SLinus Torvalds list_del(&jeb->list); 1281da177e4SLinus Torvalds c->erasing_size += c->sector_size; 1291da177e4SLinus Torvalds c->wasted_size -= jeb->wasted_size; 1301da177e4SLinus Torvalds c->free_size -= jeb->free_size; 1311da177e4SLinus Torvalds c->used_size -= jeb->used_size; 1321da177e4SLinus Torvalds c->dirty_size -= jeb->dirty_size; 1331da177e4SLinus Torvalds jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0; 134c38c1b61SDavid Woodhouse jffs2_free_jeb_node_refs(c, jeb); 1351da177e4SLinus Torvalds list_add(&jeb->list, &c->erasing_list); 1361da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1371da177e4SLinus Torvalds 1381da177e4SLinus Torvalds jffs2_erase_block(c, jeb); 1391da177e4SLinus Torvalds 1401da177e4SLinus Torvalds } else { 1411da177e4SLinus Torvalds BUG(); 1421da177e4SLinus Torvalds } 1431da177e4SLinus Torvalds 1441da177e4SLinus Torvalds /* Be nice */ 145fd532490SJoakim Tjernlund yield(); 1461da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1471da177e4SLinus Torvalds } 1481da177e4SLinus Torvalds 1491da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1501da177e4SLinus Torvalds done: 1511da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n")); 1521da177e4SLinus Torvalds 1531da177e4SLinus Torvalds up(&c->erase_free_sem); 1541da177e4SLinus Torvalds } 1551da177e4SLinus Torvalds 1561da177e4SLinus Torvalds static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 1571da177e4SLinus Torvalds { 1581da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset)); 1591da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 160f116629dSAkinobu Mita list_move_tail(&jeb->list, &c->erase_complete_list); 1611da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1621da177e4SLinus Torvalds /* Ensure that kupdated calls us again to mark them clean */ 1631da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1641da177e4SLinus Torvalds } 1651da177e4SLinus Torvalds 1661da177e4SLinus Torvalds static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset) 1671da177e4SLinus Torvalds { 1681da177e4SLinus Torvalds /* For NAND, if the failure did not occur at the device level for a 1691da177e4SLinus Torvalds specific physical page, don't bother updating the bad block table. */ 1701da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) { 1711da177e4SLinus Torvalds /* We had a device-level failure to erase. Let's see if we've 1721da177e4SLinus Torvalds failed too many times. */ 1731da177e4SLinus Torvalds if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) { 1741da177e4SLinus Torvalds /* We'd like to give this block another try. */ 1751da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 176f116629dSAkinobu Mita list_move(&jeb->list, &c->erase_pending_list); 1771da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 1781da177e4SLinus Torvalds c->dirty_size += c->sector_size; 1791da177e4SLinus Torvalds jeb->dirty_size = c->sector_size; 1801da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1811da177e4SLinus Torvalds return; 1821da177e4SLinus Torvalds } 1831da177e4SLinus Torvalds } 1841da177e4SLinus Torvalds 1851da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1861da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 1871da177e4SLinus Torvalds c->bad_size += c->sector_size; 188f116629dSAkinobu Mita list_move(&jeb->list, &c->bad_list); 1891da177e4SLinus Torvalds c->nr_erasing_blocks--; 1901da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 1911da177e4SLinus Torvalds wake_up(&c->erase_wait); 1921da177e4SLinus Torvalds } 1931da177e4SLinus Torvalds 1941da177e4SLinus Torvalds #ifndef __ECOS 1951da177e4SLinus Torvalds static void jffs2_erase_callback(struct erase_info *instr) 1961da177e4SLinus Torvalds { 1971da177e4SLinus Torvalds struct erase_priv_struct *priv = (void *)instr->priv; 1981da177e4SLinus Torvalds 1991da177e4SLinus Torvalds if(instr->state != MTD_ERASE_DONE) { 2001da177e4SLinus Torvalds printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state); 2011da177e4SLinus Torvalds jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr); 2021da177e4SLinus Torvalds } else { 2031da177e4SLinus Torvalds jffs2_erase_succeeded(priv->c, priv->jeb); 2041da177e4SLinus Torvalds } 2051da177e4SLinus Torvalds kfree(instr); 2061da177e4SLinus Torvalds } 2071da177e4SLinus Torvalds #endif /* !__ECOS */ 2081da177e4SLinus Torvalds 2091da177e4SLinus Torvalds /* Hmmm. Maybe we should accept the extra space it takes and make 2101da177e4SLinus Torvalds this a standard doubly-linked list? */ 2111da177e4SLinus Torvalds static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c, 2121da177e4SLinus Torvalds struct jffs2_raw_node_ref *ref, struct jffs2_eraseblock *jeb) 2131da177e4SLinus Torvalds { 2141da177e4SLinus Torvalds struct jffs2_inode_cache *ic = NULL; 2151da177e4SLinus Torvalds struct jffs2_raw_node_ref **prev; 2161da177e4SLinus Torvalds 2171da177e4SLinus Torvalds prev = &ref->next_in_ino; 2181da177e4SLinus Torvalds 2191da177e4SLinus Torvalds /* Walk the inode's list once, removing any nodes from this eraseblock */ 2201da177e4SLinus Torvalds while (1) { 2211da177e4SLinus Torvalds if (!(*prev)->next_in_ino) { 2221da177e4SLinus Torvalds /* We're looking at the jffs2_inode_cache, which is 2231da177e4SLinus Torvalds at the end of the linked list. Stash it and continue 2241da177e4SLinus Torvalds from the beginning of the list */ 2251da177e4SLinus Torvalds ic = (struct jffs2_inode_cache *)(*prev); 2261da177e4SLinus Torvalds prev = &ic->nodes; 2271da177e4SLinus Torvalds continue; 2281da177e4SLinus Torvalds } 2291da177e4SLinus Torvalds 2303be36675SAndrew Victor if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { 2311da177e4SLinus Torvalds /* It's in the block we're erasing */ 2321da177e4SLinus Torvalds struct jffs2_raw_node_ref *this; 2331da177e4SLinus Torvalds 2341da177e4SLinus Torvalds this = *prev; 2351da177e4SLinus Torvalds *prev = this->next_in_ino; 2361da177e4SLinus Torvalds this->next_in_ino = NULL; 2371da177e4SLinus Torvalds 2381da177e4SLinus Torvalds if (this == ref) 2391da177e4SLinus Torvalds break; 2401da177e4SLinus Torvalds 2411da177e4SLinus Torvalds continue; 2421da177e4SLinus Torvalds } 2431da177e4SLinus Torvalds /* Not to be deleted. Skip */ 2441da177e4SLinus Torvalds prev = &((*prev)->next_in_ino); 2451da177e4SLinus Torvalds } 2461da177e4SLinus Torvalds 2471da177e4SLinus Torvalds /* PARANOIA */ 2481da177e4SLinus Torvalds if (!ic) { 249c9f700f8SKaiGai Kohei JFFS2_WARNING("inode_cache/xattr_datum/xattr_ref" 250c9f700f8SKaiGai Kohei " not found in remove_node_refs()!!\n"); 2511da177e4SLinus Torvalds return; 2521da177e4SLinus Torvalds } 2531da177e4SLinus Torvalds 2541da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n", 2551da177e4SLinus Torvalds jeb->offset, jeb->offset + c->sector_size, ic->ino)); 2561da177e4SLinus Torvalds 2571da177e4SLinus Torvalds D2({ 2581da177e4SLinus Torvalds int i=0; 2591da177e4SLinus Torvalds struct jffs2_raw_node_ref *this; 2601da177e4SLinus Torvalds printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG); 2611da177e4SLinus Torvalds 2621da177e4SLinus Torvalds this = ic->nodes; 2631da177e4SLinus Torvalds 2641da177e4SLinus Torvalds while(this) { 2651da177e4SLinus Torvalds printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this)); 2661da177e4SLinus Torvalds if (++i == 5) { 2671da177e4SLinus Torvalds printk("\n" KERN_DEBUG); 2681da177e4SLinus Torvalds i=0; 2691da177e4SLinus Torvalds } 2701da177e4SLinus Torvalds this = this->next_in_ino; 2711da177e4SLinus Torvalds } 2721da177e4SLinus Torvalds printk("\n"); 2731da177e4SLinus Torvalds }); 2741da177e4SLinus Torvalds 275c9f700f8SKaiGai Kohei switch (ic->class) { 276c9f700f8SKaiGai Kohei #ifdef CONFIG_JFFS2_FS_XATTR 277c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_DATUM: 278c9f700f8SKaiGai Kohei jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic); 279c9f700f8SKaiGai Kohei break; 280c9f700f8SKaiGai Kohei case RAWNODE_CLASS_XATTR_REF: 281c9f700f8SKaiGai Kohei jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic); 282c9f700f8SKaiGai Kohei break; 283c9f700f8SKaiGai Kohei #endif 284c9f700f8SKaiGai Kohei default: 285437316d9SArtem B. Bityuckiy if (ic->nodes == (void *)ic && ic->nlink == 0) 2861da177e4SLinus Torvalds jffs2_del_ino_cache(c, ic); 2871da177e4SLinus Torvalds } 288c9f700f8SKaiGai Kohei } 2891da177e4SLinus Torvalds 290c38c1b61SDavid Woodhouse void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 2911da177e4SLinus Torvalds { 2929bfeb691SDavid Woodhouse struct jffs2_raw_node_ref *block, *ref; 2931da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset)); 2941da177e4SLinus Torvalds 2959bfeb691SDavid Woodhouse block = ref = jeb->first_node; 2969bfeb691SDavid Woodhouse 2979bfeb691SDavid Woodhouse while (ref) { 2989bfeb691SDavid Woodhouse if (ref->flash_offset == REF_LINK_NODE) { 2999bfeb691SDavid Woodhouse ref = ref->next_in_ino; 3009bfeb691SDavid Woodhouse jffs2_free_refblock(block); 3019bfeb691SDavid Woodhouse block = ref; 3029bfeb691SDavid Woodhouse continue; 3039bfeb691SDavid Woodhouse } 3049bfeb691SDavid Woodhouse if (ref->flash_offset != REF_EMPTY_NODE && ref->next_in_ino) 3051da177e4SLinus Torvalds jffs2_remove_node_refs_from_ino_list(c, ref, jeb); 3061da177e4SLinus Torvalds /* else it was a non-inode node or already removed, so don't bother */ 3071da177e4SLinus Torvalds 3089bfeb691SDavid Woodhouse ref++; 3091da177e4SLinus Torvalds } 3109bfeb691SDavid Woodhouse jeb->first_node = jeb->last_node = NULL; 3111da177e4SLinus Torvalds } 3121da177e4SLinus Torvalds 3135d157885SThomas Gleixner static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset) 3141da177e4SLinus Torvalds { 3155d157885SThomas Gleixner void *ebuf; 3165d157885SThomas Gleixner uint32_t ofs; 3171da177e4SLinus Torvalds size_t retlen; 3185d157885SThomas Gleixner int ret = -EIO; 3191da177e4SLinus Torvalds 320fab2c399SJoakim Tjernlund if (c->mtd->point) { 321fab2c399SJoakim Tjernlund unsigned long *wordebuf; 322fab2c399SJoakim Tjernlund 323fab2c399SJoakim Tjernlund ret = c->mtd->point(c->mtd, jeb->offset, c->sector_size, &retlen, (unsigned char **)&ebuf); 324fab2c399SJoakim Tjernlund if (ret) { 325fab2c399SJoakim Tjernlund D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); 326fab2c399SJoakim Tjernlund goto do_flash_read; 327fab2c399SJoakim Tjernlund } 328fab2c399SJoakim Tjernlund if (retlen < c->sector_size) { 329fab2c399SJoakim Tjernlund /* Don't muck about if it won't let us point to the whole erase sector */ 330fab2c399SJoakim Tjernlund D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", retlen)); 331fab2c399SJoakim Tjernlund c->mtd->unpoint(c->mtd, ebuf, jeb->offset, c->sector_size); 332fab2c399SJoakim Tjernlund goto do_flash_read; 333fab2c399SJoakim Tjernlund } 334fab2c399SJoakim Tjernlund wordebuf = ebuf-sizeof(*wordebuf); 335fab2c399SJoakim Tjernlund retlen /= sizeof(*wordebuf); 336fab2c399SJoakim Tjernlund do { 337fab2c399SJoakim Tjernlund if (*++wordebuf != ~0) 338fab2c399SJoakim Tjernlund break; 339fab2c399SJoakim Tjernlund } while(--retlen); 340fab2c399SJoakim Tjernlund c->mtd->unpoint(c->mtd, ebuf, jeb->offset, c->sector_size); 341fab2c399SJoakim Tjernlund if (retlen) 342fab2c399SJoakim Tjernlund printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", 343fab2c399SJoakim Tjernlund *wordebuf, jeb->offset + c->sector_size-retlen*sizeof(*wordebuf)); 344fab2c399SJoakim Tjernlund return 0; 345fab2c399SJoakim Tjernlund } 346fab2c399SJoakim Tjernlund do_flash_read: 3471da177e4SLinus Torvalds ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL); 3481da177e4SLinus Torvalds if (!ebuf) { 3495d157885SThomas Gleixner printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset); 3505d157885SThomas Gleixner return -EAGAIN; 3515d157885SThomas Gleixner } 3521da177e4SLinus Torvalds 3531da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset)); 3545d157885SThomas Gleixner 3555d157885SThomas Gleixner for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) { 3561da177e4SLinus Torvalds uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs); 3571da177e4SLinus Torvalds int i; 3581da177e4SLinus Torvalds 3595d157885SThomas Gleixner *bad_offset = ofs; 3601da177e4SLinus Torvalds 361b0afbbecSArtem Bityutskiy ret = c->mtd->read(c->mtd, ofs, readlen, &retlen, ebuf); 3621da177e4SLinus Torvalds if (ret) { 3631da177e4SLinus Torvalds printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret); 3645d157885SThomas Gleixner goto fail; 3651da177e4SLinus Torvalds } 3661da177e4SLinus Torvalds if (retlen != readlen) { 3671da177e4SLinus Torvalds printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen); 3685d157885SThomas Gleixner goto fail; 3691da177e4SLinus Torvalds } 3701da177e4SLinus Torvalds for (i=0; i<readlen; i += sizeof(unsigned long)) { 3711da177e4SLinus Torvalds /* It's OK. We know it's properly aligned */ 3725d157885SThomas Gleixner unsigned long *datum = ebuf + i; 3735d157885SThomas Gleixner if (*datum + 1) { 3745d157885SThomas Gleixner *bad_offset += i; 3755d157885SThomas Gleixner printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", *datum, *bad_offset); 3765d157885SThomas Gleixner goto fail; 3771da177e4SLinus Torvalds } 3781da177e4SLinus Torvalds } 3791da177e4SLinus Torvalds ofs += readlen; 3801da177e4SLinus Torvalds cond_resched(); 3811da177e4SLinus Torvalds } 3825d157885SThomas Gleixner ret = 0; 3835d157885SThomas Gleixner fail: 3841da177e4SLinus Torvalds kfree(ebuf); 3855d157885SThomas Gleixner return ret; 3861da177e4SLinus Torvalds } 3871da177e4SLinus Torvalds 3885d157885SThomas Gleixner static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 3895d157885SThomas Gleixner { 3905d157885SThomas Gleixner size_t retlen; 3915d157885SThomas Gleixner int ret; 3925d157885SThomas Gleixner uint32_t bad_offset; 3935d157885SThomas Gleixner 3945d157885SThomas Gleixner switch (jffs2_block_check_erase(c, jeb, &bad_offset)) { 3955d157885SThomas Gleixner case -EAGAIN: goto refile; 3965d157885SThomas Gleixner case -EIO: goto filebad; 3975d157885SThomas Gleixner } 3981da177e4SLinus Torvalds 3991da177e4SLinus Torvalds /* Write the erase complete marker */ 4001da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset)); 4015d157885SThomas Gleixner bad_offset = jeb->offset; 4025d157885SThomas Gleixner 4035d157885SThomas Gleixner /* Cleanmarker in oob area or no cleanmarker at all ? */ 4045d157885SThomas Gleixner if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) { 4055d157885SThomas Gleixner 4061da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) { 4071da177e4SLinus Torvalds if (jffs2_write_nand_cleanmarker(c, jeb)) 4085d157885SThomas Gleixner goto filebad; 4095d157885SThomas Gleixner } 4101da177e4SLinus Torvalds 411f1f9671bSDavid Woodhouse /* Everything else got zeroed before the erase */ 4121da177e4SLinus Torvalds jeb->free_size = c->sector_size; 4131da177e4SLinus Torvalds } else { 4145d157885SThomas Gleixner 4151da177e4SLinus Torvalds struct kvec vecs[1]; 4161da177e4SLinus Torvalds struct jffs2_unknown_node marker = { 4171da177e4SLinus Torvalds .magic = cpu_to_je16(JFFS2_MAGIC_BITMASK), 4181da177e4SLinus Torvalds .nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER), 4191da177e4SLinus Torvalds .totlen = cpu_to_je32(c->cleanmarker_size) 4201da177e4SLinus Torvalds }; 4211da177e4SLinus Torvalds 422046b8b98SDavid Woodhouse jffs2_prealloc_raw_node_refs(c, jeb, 1); 4235d157885SThomas Gleixner 4241da177e4SLinus Torvalds marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4)); 4251da177e4SLinus Torvalds 4261da177e4SLinus Torvalds vecs[0].iov_base = (unsigned char *) ▮ 4271da177e4SLinus Torvalds vecs[0].iov_len = sizeof(marker); 4281da177e4SLinus Torvalds ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen); 4291da177e4SLinus Torvalds 4305d157885SThomas Gleixner if (ret || retlen != sizeof(marker)) { 4315d157885SThomas Gleixner if (ret) 4321da177e4SLinus Torvalds printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n", 4331da177e4SLinus Torvalds jeb->offset, ret); 4345d157885SThomas Gleixner else 4351da177e4SLinus Torvalds printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n", 4361da177e4SLinus Torvalds jeb->offset, sizeof(marker), retlen); 4375d157885SThomas Gleixner 4385d157885SThomas Gleixner goto filebad; 4391da177e4SLinus Torvalds } 4401da177e4SLinus Torvalds 441f1f9671bSDavid Woodhouse /* Everything else got zeroed before the erase */ 442f1f9671bSDavid Woodhouse jeb->free_size = c->sector_size; 4432f785402SDavid Woodhouse /* FIXME Special case for cleanmarker in empty block */ 4442f785402SDavid Woodhouse jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL); 4451da177e4SLinus Torvalds } 4461da177e4SLinus Torvalds 4471da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4481da177e4SLinus Torvalds c->erasing_size -= c->sector_size; 4491da177e4SLinus Torvalds c->free_size += jeb->free_size; 4501da177e4SLinus Torvalds c->used_size += jeb->used_size; 4511da177e4SLinus Torvalds 452e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 453e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 4541da177e4SLinus Torvalds 4551da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->free_list); 4561da177e4SLinus Torvalds c->nr_erasing_blocks--; 4571da177e4SLinus Torvalds c->nr_free_blocks++; 4581da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 4591da177e4SLinus Torvalds wake_up(&c->erase_wait); 4605d157885SThomas Gleixner return; 4611da177e4SLinus Torvalds 4625d157885SThomas Gleixner filebad: 4635d157885SThomas Gleixner spin_lock(&c->erase_completion_lock); 4645d157885SThomas Gleixner /* Stick it on a list (any list) so erase_failed can take it 4655d157885SThomas Gleixner right off again. Silly, but shouldn't happen often. */ 4665d157885SThomas Gleixner list_add(&jeb->list, &c->erasing_list); 4675d157885SThomas Gleixner spin_unlock(&c->erase_completion_lock); 4685d157885SThomas Gleixner jffs2_erase_failed(c, jeb, bad_offset); 4695d157885SThomas Gleixner return; 4705d157885SThomas Gleixner 4715d157885SThomas Gleixner refile: 4725d157885SThomas Gleixner /* Stick it back on the list from whence it came and come back later */ 4735d157885SThomas Gleixner jffs2_erase_pending_trigger(c); 4745d157885SThomas Gleixner spin_lock(&c->erase_completion_lock); 4755d157885SThomas Gleixner list_add(&jeb->list, &c->erase_complete_list); 4765d157885SThomas Gleixner spin_unlock(&c->erase_completion_lock); 4775d157885SThomas Gleixner return; 4785d157885SThomas Gleixner } 479