11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 41da177e4SLinus Torvalds * Copyright (C) 2001-2003 Red Hat, Inc. 51da177e4SLinus Torvalds * Copyright (C) 2004 Thomas Gleixner <tglx@linutronix.de> 61da177e4SLinus Torvalds * 71da177e4SLinus Torvalds * Created by David Woodhouse <dwmw2@infradead.org> 81da177e4SLinus Torvalds * Modified debugged and enhanced by Thomas Gleixner <tglx@linutronix.de> 91da177e4SLinus Torvalds * 101da177e4SLinus Torvalds * For licensing information, see the file 'LICENCE' in this directory. 111da177e4SLinus Torvalds * 12daba5cc4SArtem B. Bityutskiy * $Id: wbuf.c,v 1.100 2005/09/30 13:59:13 dedekind Exp $ 131da177e4SLinus Torvalds * 141da177e4SLinus Torvalds */ 151da177e4SLinus Torvalds 161da177e4SLinus Torvalds #include <linux/kernel.h> 171da177e4SLinus Torvalds #include <linux/slab.h> 181da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 191da177e4SLinus Torvalds #include <linux/crc32.h> 201da177e4SLinus Torvalds #include <linux/mtd/nand.h> 214e57b681STim Schmielau #include <linux/jiffies.h> 224e57b681STim Schmielau 231da177e4SLinus Torvalds #include "nodelist.h" 241da177e4SLinus Torvalds 251da177e4SLinus Torvalds /* For testing write failures */ 261da177e4SLinus Torvalds #undef BREAKME 271da177e4SLinus Torvalds #undef BREAKMEHEADER 281da177e4SLinus Torvalds 291da177e4SLinus Torvalds #ifdef BREAKME 301da177e4SLinus Torvalds static unsigned char *brokenbuf; 311da177e4SLinus Torvalds #endif 321da177e4SLinus Torvalds 33daba5cc4SArtem B. Bityutskiy #define PAGE_DIV(x) ( ((unsigned long)(x) / (unsigned long)(c->wbuf_pagesize)) * (unsigned long)(c->wbuf_pagesize) ) 34daba5cc4SArtem B. Bityutskiy #define PAGE_MOD(x) ( (unsigned long)(x) % (unsigned long)(c->wbuf_pagesize) ) 35daba5cc4SArtem B. Bityutskiy 361da177e4SLinus Torvalds /* max. erase failures before we mark a block bad */ 371da177e4SLinus Torvalds #define MAX_ERASE_FAILURES 2 381da177e4SLinus Torvalds 391da177e4SLinus Torvalds struct jffs2_inodirty { 401da177e4SLinus Torvalds uint32_t ino; 411da177e4SLinus Torvalds struct jffs2_inodirty *next; 421da177e4SLinus Torvalds }; 431da177e4SLinus Torvalds 441da177e4SLinus Torvalds static struct jffs2_inodirty inodirty_nomem; 451da177e4SLinus Torvalds 461da177e4SLinus Torvalds static int jffs2_wbuf_pending_for_ino(struct jffs2_sb_info *c, uint32_t ino) 471da177e4SLinus Torvalds { 481da177e4SLinus Torvalds struct jffs2_inodirty *this = c->wbuf_inodes; 491da177e4SLinus Torvalds 501da177e4SLinus Torvalds /* If a malloc failed, consider _everything_ dirty */ 511da177e4SLinus Torvalds if (this == &inodirty_nomem) 521da177e4SLinus Torvalds return 1; 531da177e4SLinus Torvalds 541da177e4SLinus Torvalds /* If ino == 0, _any_ non-GC writes mean 'yes' */ 551da177e4SLinus Torvalds if (this && !ino) 561da177e4SLinus Torvalds return 1; 571da177e4SLinus Torvalds 581da177e4SLinus Torvalds /* Look to see if the inode in question is pending in the wbuf */ 591da177e4SLinus Torvalds while (this) { 601da177e4SLinus Torvalds if (this->ino == ino) 611da177e4SLinus Torvalds return 1; 621da177e4SLinus Torvalds this = this->next; 631da177e4SLinus Torvalds } 641da177e4SLinus Torvalds return 0; 651da177e4SLinus Torvalds } 661da177e4SLinus Torvalds 671da177e4SLinus Torvalds static void jffs2_clear_wbuf_ino_list(struct jffs2_sb_info *c) 681da177e4SLinus Torvalds { 691da177e4SLinus Torvalds struct jffs2_inodirty *this; 701da177e4SLinus Torvalds 711da177e4SLinus Torvalds this = c->wbuf_inodes; 721da177e4SLinus Torvalds 731da177e4SLinus Torvalds if (this != &inodirty_nomem) { 741da177e4SLinus Torvalds while (this) { 751da177e4SLinus Torvalds struct jffs2_inodirty *next = this->next; 761da177e4SLinus Torvalds kfree(this); 771da177e4SLinus Torvalds this = next; 781da177e4SLinus Torvalds } 791da177e4SLinus Torvalds } 801da177e4SLinus Torvalds c->wbuf_inodes = NULL; 811da177e4SLinus Torvalds } 821da177e4SLinus Torvalds 831da177e4SLinus Torvalds static void jffs2_wbuf_dirties_inode(struct jffs2_sb_info *c, uint32_t ino) 841da177e4SLinus Torvalds { 851da177e4SLinus Torvalds struct jffs2_inodirty *new; 861da177e4SLinus Torvalds 871da177e4SLinus Torvalds /* Mark the superblock dirty so that kupdated will flush... */ 884d952709SArtem B. Bityuckiy jffs2_erase_pending_trigger(c); 891da177e4SLinus Torvalds 901da177e4SLinus Torvalds if (jffs2_wbuf_pending_for_ino(c, ino)) 911da177e4SLinus Torvalds return; 921da177e4SLinus Torvalds 931da177e4SLinus Torvalds new = kmalloc(sizeof(*new), GFP_KERNEL); 941da177e4SLinus Torvalds if (!new) { 951da177e4SLinus Torvalds D1(printk(KERN_DEBUG "No memory to allocate inodirty. Fallback to all considered dirty\n")); 961da177e4SLinus Torvalds jffs2_clear_wbuf_ino_list(c); 971da177e4SLinus Torvalds c->wbuf_inodes = &inodirty_nomem; 981da177e4SLinus Torvalds return; 991da177e4SLinus Torvalds } 1001da177e4SLinus Torvalds new->ino = ino; 1011da177e4SLinus Torvalds new->next = c->wbuf_inodes; 1021da177e4SLinus Torvalds c->wbuf_inodes = new; 1031da177e4SLinus Torvalds return; 1041da177e4SLinus Torvalds } 1051da177e4SLinus Torvalds 1061da177e4SLinus Torvalds static inline void jffs2_refile_wbuf_blocks(struct jffs2_sb_info *c) 1071da177e4SLinus Torvalds { 1081da177e4SLinus Torvalds struct list_head *this, *next; 1091da177e4SLinus Torvalds static int n; 1101da177e4SLinus Torvalds 1111da177e4SLinus Torvalds if (list_empty(&c->erasable_pending_wbuf_list)) 1121da177e4SLinus Torvalds return; 1131da177e4SLinus Torvalds 1141da177e4SLinus Torvalds list_for_each_safe(this, next, &c->erasable_pending_wbuf_list) { 1151da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list); 1161da177e4SLinus Torvalds 1171da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Removing eraseblock at 0x%08x from erasable_pending_wbuf_list...\n", jeb->offset)); 1181da177e4SLinus Torvalds list_del(this); 1191da177e4SLinus Torvalds if ((jiffies + (n++)) & 127) { 1201da177e4SLinus Torvalds /* Most of the time, we just erase it immediately. Otherwise we 1211da177e4SLinus Torvalds spend ages scanning it on mount, etc. */ 1221da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n")); 1231da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_pending_list); 1241da177e4SLinus Torvalds c->nr_erasing_blocks++; 1251da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1261da177e4SLinus Torvalds } else { 1271da177e4SLinus Torvalds /* Sometimes, however, we leave it elsewhere so it doesn't get 1281da177e4SLinus Torvalds immediately reused, and we spread the load a bit. */ 1291da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 1301da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_list); 1311da177e4SLinus Torvalds } 1321da177e4SLinus Torvalds } 1331da177e4SLinus Torvalds } 1341da177e4SLinus Torvalds 1357f716cf3SEstelle Hammache #define REFILE_NOTEMPTY 0 1367f716cf3SEstelle Hammache #define REFILE_ANYWAY 1 1377f716cf3SEstelle Hammache 1387f716cf3SEstelle Hammache static void jffs2_block_refile(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int allow_empty) 1391da177e4SLinus Torvalds { 1401da177e4SLinus Torvalds D1(printk("About to refile bad block at %08x\n", jeb->offset)); 1411da177e4SLinus Torvalds 1421da177e4SLinus Torvalds /* File the existing block on the bad_used_list.... */ 1431da177e4SLinus Torvalds if (c->nextblock == jeb) 1441da177e4SLinus Torvalds c->nextblock = NULL; 1451da177e4SLinus Torvalds else /* Not sure this should ever happen... need more coffee */ 1461da177e4SLinus Torvalds list_del(&jeb->list); 1471da177e4SLinus Torvalds if (jeb->first_node) { 1481da177e4SLinus Torvalds D1(printk("Refiling block at %08x to bad_used_list\n", jeb->offset)); 1491da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_used_list); 1501da177e4SLinus Torvalds } else { 1519b88f473SEstelle Hammache BUG_ON(allow_empty == REFILE_NOTEMPTY); 1521da177e4SLinus Torvalds /* It has to have had some nodes or we couldn't be here */ 1531da177e4SLinus Torvalds D1(printk("Refiling block at %08x to erase_pending_list\n", jeb->offset)); 1541da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1551da177e4SLinus Torvalds c->nr_erasing_blocks++; 1561da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1571da177e4SLinus Torvalds } 1581da177e4SLinus Torvalds 1591da177e4SLinus Torvalds /* Adjust its size counts accordingly */ 1601da177e4SLinus Torvalds c->wasted_size += jeb->free_size; 1611da177e4SLinus Torvalds c->free_size -= jeb->free_size; 1621da177e4SLinus Torvalds jeb->wasted_size += jeb->free_size; 1631da177e4SLinus Torvalds jeb->free_size = 0; 1641da177e4SLinus Torvalds 165e0c8e42fSArtem B. Bityutskiy jffs2_dbg_dump_block_lists_nolock(c); 166e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 167e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 1681da177e4SLinus Torvalds } 1691da177e4SLinus Torvalds 1701da177e4SLinus Torvalds /* Recover from failure to write wbuf. Recover the nodes up to the 1711da177e4SLinus Torvalds * wbuf, not the one which we were starting to try to write. */ 1721da177e4SLinus Torvalds 1731da177e4SLinus Torvalds static void jffs2_wbuf_recover(struct jffs2_sb_info *c) 1741da177e4SLinus Torvalds { 1751da177e4SLinus Torvalds struct jffs2_eraseblock *jeb, *new_jeb; 1761da177e4SLinus Torvalds struct jffs2_raw_node_ref **first_raw, **raw; 1771da177e4SLinus Torvalds size_t retlen; 1781da177e4SLinus Torvalds int ret; 1791da177e4SLinus Torvalds unsigned char *buf; 1801da177e4SLinus Torvalds uint32_t start, end, ofs, len; 1811da177e4SLinus Torvalds 1821da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 1831da177e4SLinus Torvalds 1841da177e4SLinus Torvalds jeb = &c->blocks[c->wbuf_ofs / c->sector_size]; 1851da177e4SLinus Torvalds 1867f716cf3SEstelle Hammache jffs2_block_refile(c, jeb, REFILE_NOTEMPTY); 1871da177e4SLinus Torvalds 1881da177e4SLinus Torvalds /* Find the first node to be recovered, by skipping over every 1891da177e4SLinus Torvalds node which ends before the wbuf starts, or which is obsolete. */ 1901da177e4SLinus Torvalds first_raw = &jeb->first_node; 1911da177e4SLinus Torvalds while (*first_raw && 1921da177e4SLinus Torvalds (ref_obsolete(*first_raw) || 1931da177e4SLinus Torvalds (ref_offset(*first_raw)+ref_totlen(c, jeb, *first_raw)) < c->wbuf_ofs)) { 1941da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Skipping node at 0x%08x(%d)-0x%08x which is either before 0x%08x or obsolete\n", 1951da177e4SLinus Torvalds ref_offset(*first_raw), ref_flags(*first_raw), 1961da177e4SLinus Torvalds (ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw)), 1971da177e4SLinus Torvalds c->wbuf_ofs)); 1981da177e4SLinus Torvalds first_raw = &(*first_raw)->next_phys; 1991da177e4SLinus Torvalds } 2001da177e4SLinus Torvalds 2011da177e4SLinus Torvalds if (!*first_raw) { 2021da177e4SLinus Torvalds /* All nodes were obsolete. Nothing to recover. */ 2031da177e4SLinus Torvalds D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n")); 2041da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2051da177e4SLinus Torvalds return; 2061da177e4SLinus Torvalds } 2071da177e4SLinus Torvalds 2081da177e4SLinus Torvalds start = ref_offset(*first_raw); 2091da177e4SLinus Torvalds end = ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw); 2101da177e4SLinus Torvalds 2111da177e4SLinus Torvalds /* Find the last node to be recovered */ 2121da177e4SLinus Torvalds raw = first_raw; 2131da177e4SLinus Torvalds while ((*raw)) { 2141da177e4SLinus Torvalds if (!ref_obsolete(*raw)) 2151da177e4SLinus Torvalds end = ref_offset(*raw) + ref_totlen(c, jeb, *raw); 2161da177e4SLinus Torvalds 2171da177e4SLinus Torvalds raw = &(*raw)->next_phys; 2181da177e4SLinus Torvalds } 2191da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 2201da177e4SLinus Torvalds 2211da177e4SLinus Torvalds D1(printk(KERN_DEBUG "wbuf recover %08x-%08x\n", start, end)); 2221da177e4SLinus Torvalds 2231da177e4SLinus Torvalds buf = NULL; 2241da177e4SLinus Torvalds if (start < c->wbuf_ofs) { 2251da177e4SLinus Torvalds /* First affected node was already partially written. 2261da177e4SLinus Torvalds * Attempt to reread the old data into our buffer. */ 2271da177e4SLinus Torvalds 2281da177e4SLinus Torvalds buf = kmalloc(end - start, GFP_KERNEL); 2291da177e4SLinus Torvalds if (!buf) { 2301da177e4SLinus Torvalds printk(KERN_CRIT "Malloc failure in wbuf recovery. Data loss ensues.\n"); 2311da177e4SLinus Torvalds 2321da177e4SLinus Torvalds goto read_failed; 2331da177e4SLinus Torvalds } 2341da177e4SLinus Torvalds 2351da177e4SLinus Torvalds /* Do the read... */ 2361da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 2371da177e4SLinus Torvalds ret = c->mtd->read_ecc(c->mtd, start, c->wbuf_ofs - start, &retlen, buf, NULL, c->oobinfo); 2381da177e4SLinus Torvalds else 2391da177e4SLinus Torvalds ret = c->mtd->read(c->mtd, start, c->wbuf_ofs - start, &retlen, buf); 2401da177e4SLinus Torvalds 2411da177e4SLinus Torvalds if (ret == -EBADMSG && retlen == c->wbuf_ofs - start) { 2421da177e4SLinus Torvalds /* ECC recovered */ 2431da177e4SLinus Torvalds ret = 0; 2441da177e4SLinus Torvalds } 2451da177e4SLinus Torvalds if (ret || retlen != c->wbuf_ofs - start) { 2461da177e4SLinus Torvalds printk(KERN_CRIT "Old data are already lost in wbuf recovery. Data loss ensues.\n"); 2471da177e4SLinus Torvalds 2481da177e4SLinus Torvalds kfree(buf); 2491da177e4SLinus Torvalds buf = NULL; 2501da177e4SLinus Torvalds read_failed: 2511da177e4SLinus Torvalds first_raw = &(*first_raw)->next_phys; 2521da177e4SLinus Torvalds /* If this was the only node to be recovered, give up */ 2531da177e4SLinus Torvalds if (!(*first_raw)) 2541da177e4SLinus Torvalds return; 2551da177e4SLinus Torvalds 2561da177e4SLinus Torvalds /* It wasn't. Go on and try to recover nodes complete in the wbuf */ 2571da177e4SLinus Torvalds start = ref_offset(*first_raw); 2581da177e4SLinus Torvalds } else { 2591da177e4SLinus Torvalds /* Read succeeded. Copy the remaining data from the wbuf */ 2601da177e4SLinus Torvalds memcpy(buf + (c->wbuf_ofs - start), c->wbuf, end - c->wbuf_ofs); 2611da177e4SLinus Torvalds } 2621da177e4SLinus Torvalds } 2631da177e4SLinus Torvalds /* OK... we're to rewrite (end-start) bytes of data from first_raw onwards. 2641da177e4SLinus Torvalds Either 'buf' contains the data, or we find it in the wbuf */ 2651da177e4SLinus Torvalds 2661da177e4SLinus Torvalds 2671da177e4SLinus Torvalds /* ... and get an allocation of space from a shiny new block instead */ 268e631ddbaSFerenc Havasi ret = jffs2_reserve_space_gc(c, end-start, &ofs, &len, JFFS2_SUMMARY_NOSUM_SIZE); 2691da177e4SLinus Torvalds if (ret) { 2701da177e4SLinus Torvalds printk(KERN_WARNING "Failed to allocate space for wbuf recovery. Data loss ensues.\n"); 2711da177e4SLinus Torvalds kfree(buf); 2721da177e4SLinus Torvalds return; 2731da177e4SLinus Torvalds } 2741da177e4SLinus Torvalds if (end-start >= c->wbuf_pagesize) { 2757f716cf3SEstelle Hammache /* Need to do another write immediately, but it's possible 2767f716cf3SEstelle Hammache that this is just because the wbuf itself is completely 2777f716cf3SEstelle Hammache full, and there's nothing earlier read back from the 2787f716cf3SEstelle Hammache flash. Hence 'buf' isn't necessarily what we're writing 2797f716cf3SEstelle Hammache from. */ 2807f716cf3SEstelle Hammache unsigned char *rewrite_buf = buf?:c->wbuf; 2811da177e4SLinus Torvalds uint32_t towrite = (end-start) - ((end-start)%c->wbuf_pagesize); 2821da177e4SLinus Torvalds 2831da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Write 0x%x bytes at 0x%08x in wbuf recover\n", 2841da177e4SLinus Torvalds towrite, ofs)); 2851da177e4SLinus Torvalds 2861da177e4SLinus Torvalds #ifdef BREAKMEHEADER 2871da177e4SLinus Torvalds static int breakme; 2881da177e4SLinus Torvalds if (breakme++ == 20) { 2891da177e4SLinus Torvalds printk(KERN_NOTICE "Faking write error at 0x%08x\n", ofs); 2901da177e4SLinus Torvalds breakme = 0; 2911da177e4SLinus Torvalds c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen, 2921da177e4SLinus Torvalds brokenbuf, NULL, c->oobinfo); 2931da177e4SLinus Torvalds ret = -EIO; 2941da177e4SLinus Torvalds } else 2951da177e4SLinus Torvalds #endif 2961da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 2971da177e4SLinus Torvalds ret = c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen, 2987f716cf3SEstelle Hammache rewrite_buf, NULL, c->oobinfo); 2991da177e4SLinus Torvalds else 3007f716cf3SEstelle Hammache ret = c->mtd->write(c->mtd, ofs, towrite, &retlen, rewrite_buf); 3011da177e4SLinus Torvalds 3021da177e4SLinus Torvalds if (ret || retlen != towrite) { 3031da177e4SLinus Torvalds /* Argh. We tried. Really we did. */ 3041da177e4SLinus Torvalds printk(KERN_CRIT "Recovery of wbuf failed due to a second write error\n"); 3051da177e4SLinus Torvalds kfree(buf); 3061da177e4SLinus Torvalds 3071da177e4SLinus Torvalds if (retlen) { 3081da177e4SLinus Torvalds struct jffs2_raw_node_ref *raw2; 3091da177e4SLinus Torvalds 3101da177e4SLinus Torvalds raw2 = jffs2_alloc_raw_node_ref(); 3111da177e4SLinus Torvalds if (!raw2) 3121da177e4SLinus Torvalds return; 3131da177e4SLinus Torvalds 3141da177e4SLinus Torvalds raw2->flash_offset = ofs | REF_OBSOLETE; 3151da177e4SLinus Torvalds 316fcb75787SDavid Woodhouse jffs2_add_physical_node_ref(c, raw2, ref_totlen(c, jeb, *first_raw), NULL); 3171da177e4SLinus Torvalds } 3181da177e4SLinus Torvalds return; 3191da177e4SLinus Torvalds } 3201da177e4SLinus Torvalds printk(KERN_NOTICE "Recovery of wbuf succeeded to %08x\n", ofs); 3211da177e4SLinus Torvalds 3221da177e4SLinus Torvalds c->wbuf_len = (end - start) - towrite; 3231da177e4SLinus Torvalds c->wbuf_ofs = ofs + towrite; 3247f716cf3SEstelle Hammache memmove(c->wbuf, rewrite_buf + towrite, c->wbuf_len); 3251da177e4SLinus Torvalds /* Don't muck about with c->wbuf_inodes. False positives are harmless. */ 3261da177e4SLinus Torvalds kfree(buf); 3271da177e4SLinus Torvalds } else { 3281da177e4SLinus Torvalds /* OK, now we're left with the dregs in whichever buffer we're using */ 3291da177e4SLinus Torvalds if (buf) { 3301da177e4SLinus Torvalds memcpy(c->wbuf, buf, end-start); 3311da177e4SLinus Torvalds kfree(buf); 3321da177e4SLinus Torvalds } else { 3331da177e4SLinus Torvalds memmove(c->wbuf, c->wbuf + (start - c->wbuf_ofs), end - start); 3341da177e4SLinus Torvalds } 3351da177e4SLinus Torvalds c->wbuf_ofs = ofs; 3361da177e4SLinus Torvalds c->wbuf_len = end - start; 3371da177e4SLinus Torvalds } 3381da177e4SLinus Torvalds 3391da177e4SLinus Torvalds /* Now sort out the jffs2_raw_node_refs, moving them from the old to the next block */ 3401da177e4SLinus Torvalds new_jeb = &c->blocks[ofs / c->sector_size]; 3411da177e4SLinus Torvalds 3421da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 3431da177e4SLinus Torvalds if (new_jeb->first_node) { 3441da177e4SLinus Torvalds /* Odd, but possible with ST flash later maybe */ 3451da177e4SLinus Torvalds new_jeb->last_node->next_phys = *first_raw; 3461da177e4SLinus Torvalds } else { 3471da177e4SLinus Torvalds new_jeb->first_node = *first_raw; 3481da177e4SLinus Torvalds } 3491da177e4SLinus Torvalds 3501da177e4SLinus Torvalds raw = first_raw; 3511da177e4SLinus Torvalds while (*raw) { 3521da177e4SLinus Torvalds uint32_t rawlen = ref_totlen(c, jeb, *raw); 3531da177e4SLinus Torvalds 3541da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Refiling block of %08x at %08x(%d) to %08x\n", 3551da177e4SLinus Torvalds rawlen, ref_offset(*raw), ref_flags(*raw), ofs)); 3561da177e4SLinus Torvalds 3571da177e4SLinus Torvalds if (ref_obsolete(*raw)) { 3581da177e4SLinus Torvalds /* Shouldn't really happen much */ 3591da177e4SLinus Torvalds new_jeb->dirty_size += rawlen; 3601da177e4SLinus Torvalds new_jeb->free_size -= rawlen; 3611da177e4SLinus Torvalds c->dirty_size += rawlen; 3621da177e4SLinus Torvalds } else { 3631da177e4SLinus Torvalds new_jeb->used_size += rawlen; 3641da177e4SLinus Torvalds new_jeb->free_size -= rawlen; 3651da177e4SLinus Torvalds jeb->dirty_size += rawlen; 3661da177e4SLinus Torvalds jeb->used_size -= rawlen; 3671da177e4SLinus Torvalds c->dirty_size += rawlen; 3681da177e4SLinus Torvalds } 3691da177e4SLinus Torvalds c->free_size -= rawlen; 3701da177e4SLinus Torvalds (*raw)->flash_offset = ofs | ref_flags(*raw); 3711da177e4SLinus Torvalds ofs += rawlen; 3721da177e4SLinus Torvalds new_jeb->last_node = *raw; 3731da177e4SLinus Torvalds 3741da177e4SLinus Torvalds raw = &(*raw)->next_phys; 3751da177e4SLinus Torvalds } 3761da177e4SLinus Torvalds 3771da177e4SLinus Torvalds /* Fix up the original jeb now it's on the bad_list */ 3781da177e4SLinus Torvalds *first_raw = NULL; 3791da177e4SLinus Torvalds if (first_raw == &jeb->first_node) { 3801da177e4SLinus Torvalds jeb->last_node = NULL; 3811da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Failing block at %08x is now empty. Moving to erase_pending_list\n", jeb->offset)); 3821da177e4SLinus Torvalds list_del(&jeb->list); 3831da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 3841da177e4SLinus Torvalds c->nr_erasing_blocks++; 3851da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 3861da177e4SLinus Torvalds } 3871da177e4SLinus Torvalds else 3881da177e4SLinus Torvalds jeb->last_node = container_of(first_raw, struct jffs2_raw_node_ref, next_phys); 3891da177e4SLinus Torvalds 390e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, jeb); 391e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 3921da177e4SLinus Torvalds 393e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, new_jeb); 394e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, new_jeb); 3951da177e4SLinus Torvalds 3961da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 3971da177e4SLinus Torvalds 3981da177e4SLinus Torvalds D1(printk(KERN_DEBUG "wbuf recovery completed OK\n")); 3991da177e4SLinus Torvalds } 4001da177e4SLinus Torvalds 4011da177e4SLinus Torvalds /* Meaning of pad argument: 4021da177e4SLinus Torvalds 0: Do not pad. Probably pointless - we only ever use this when we can't pad anyway. 4031da177e4SLinus Torvalds 1: Pad, do not adjust nextblock free_size 4041da177e4SLinus Torvalds 2: Pad, adjust nextblock free_size 4051da177e4SLinus Torvalds */ 4061da177e4SLinus Torvalds #define NOPAD 0 4071da177e4SLinus Torvalds #define PAD_NOACCOUNT 1 4081da177e4SLinus Torvalds #define PAD_ACCOUNTING 2 4091da177e4SLinus Torvalds 4101da177e4SLinus Torvalds static int __jffs2_flush_wbuf(struct jffs2_sb_info *c, int pad) 4111da177e4SLinus Torvalds { 4121da177e4SLinus Torvalds int ret; 4131da177e4SLinus Torvalds size_t retlen; 4141da177e4SLinus Torvalds 4153be36675SAndrew Victor /* Nothing to do if not write-buffering the flash. In particular, we shouldn't 4161da177e4SLinus Torvalds del_timer() the timer we never initialised. */ 4173be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 4181da177e4SLinus Torvalds return 0; 4191da177e4SLinus Torvalds 4201da177e4SLinus Torvalds if (!down_trylock(&c->alloc_sem)) { 4211da177e4SLinus Torvalds up(&c->alloc_sem); 4221da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf() called with alloc_sem not locked!\n"); 4231da177e4SLinus Torvalds BUG(); 4241da177e4SLinus Torvalds } 4251da177e4SLinus Torvalds 4263be36675SAndrew Victor if (!c->wbuf_len) /* already checked c->wbuf above */ 4271da177e4SLinus Torvalds return 0; 4281da177e4SLinus Torvalds 4291da177e4SLinus Torvalds /* claim remaining space on the page 4301da177e4SLinus Torvalds this happens, if we have a change to a new block, 4311da177e4SLinus Torvalds or if fsync forces us to flush the writebuffer. 4321da177e4SLinus Torvalds if we have a switch to next page, we will not have 4331da177e4SLinus Torvalds enough remaining space for this. 4341da177e4SLinus Torvalds */ 435daba5cc4SArtem B. Bityutskiy if (pad ) { 4361da177e4SLinus Torvalds c->wbuf_len = PAD(c->wbuf_len); 4371da177e4SLinus Torvalds 4381da177e4SLinus Torvalds /* Pad with JFFS2_DIRTY_BITMASK initially. this helps out ECC'd NOR 4391da177e4SLinus Torvalds with 8 byte page size */ 4401da177e4SLinus Torvalds memset(c->wbuf + c->wbuf_len, 0, c->wbuf_pagesize - c->wbuf_len); 4411da177e4SLinus Torvalds 4421da177e4SLinus Torvalds if ( c->wbuf_len + sizeof(struct jffs2_unknown_node) < c->wbuf_pagesize) { 4431da177e4SLinus Torvalds struct jffs2_unknown_node *padnode = (void *)(c->wbuf + c->wbuf_len); 4441da177e4SLinus Torvalds padnode->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 4451da177e4SLinus Torvalds padnode->nodetype = cpu_to_je16(JFFS2_NODETYPE_PADDING); 4461da177e4SLinus Torvalds padnode->totlen = cpu_to_je32(c->wbuf_pagesize - c->wbuf_len); 4471da177e4SLinus Torvalds padnode->hdr_crc = cpu_to_je32(crc32(0, padnode, sizeof(*padnode)-4)); 4481da177e4SLinus Torvalds } 4491da177e4SLinus Torvalds } 4501da177e4SLinus Torvalds /* else jffs2_flash_writev has actually filled in the rest of the 4511da177e4SLinus Torvalds buffer for us, and will deal with the node refs etc. later. */ 4521da177e4SLinus Torvalds 4531da177e4SLinus Torvalds #ifdef BREAKME 4541da177e4SLinus Torvalds static int breakme; 4551da177e4SLinus Torvalds if (breakme++ == 20) { 4561da177e4SLinus Torvalds printk(KERN_NOTICE "Faking write error at 0x%08x\n", c->wbuf_ofs); 4571da177e4SLinus Torvalds breakme = 0; 4581da177e4SLinus Torvalds c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, 4591da177e4SLinus Torvalds &retlen, brokenbuf, NULL, c->oobinfo); 4601da177e4SLinus Torvalds ret = -EIO; 4611da177e4SLinus Torvalds } else 4621da177e4SLinus Torvalds #endif 4631da177e4SLinus Torvalds 4641da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 4651da177e4SLinus Torvalds ret = c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf, NULL, c->oobinfo); 4661da177e4SLinus Torvalds else 4671da177e4SLinus Torvalds ret = c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf); 4681da177e4SLinus Torvalds 4691da177e4SLinus Torvalds if (ret || retlen != c->wbuf_pagesize) { 4701da177e4SLinus Torvalds if (ret) 4711da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_flush_wbuf(): Write failed with %d\n",ret); 4721da177e4SLinus Torvalds else { 4731da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_flush_wbuf(): Write was short: %zd instead of %d\n", 4741da177e4SLinus Torvalds retlen, c->wbuf_pagesize); 4751da177e4SLinus Torvalds ret = -EIO; 4761da177e4SLinus Torvalds } 4771da177e4SLinus Torvalds 4781da177e4SLinus Torvalds jffs2_wbuf_recover(c); 4791da177e4SLinus Torvalds 4801da177e4SLinus Torvalds return ret; 4811da177e4SLinus Torvalds } 4821da177e4SLinus Torvalds 4831da177e4SLinus Torvalds /* Adjust free size of the block if we padded. */ 484daba5cc4SArtem B. Bityutskiy if (pad) { 4851da177e4SLinus Torvalds struct jffs2_eraseblock *jeb; 4860bcc099dSDavid Woodhouse struct jffs2_raw_node_ref *ref; 4870bcc099dSDavid Woodhouse uint32_t waste = c->wbuf_pagesize - c->wbuf_len; 4881da177e4SLinus Torvalds 4891da177e4SLinus Torvalds jeb = &c->blocks[c->wbuf_ofs / c->sector_size]; 4901da177e4SLinus Torvalds 4911da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf() adjusting free_size of %sblock at %08x\n", 4921da177e4SLinus Torvalds (jeb==c->nextblock)?"next":"", jeb->offset)); 4931da177e4SLinus Torvalds 4941da177e4SLinus Torvalds /* wbuf_pagesize - wbuf_len is the amount of space that's to be 4951da177e4SLinus Torvalds padded. If there is less free space in the block than that, 4961da177e4SLinus Torvalds something screwed up */ 4970bcc099dSDavid Woodhouse if (jeb->free_size < waste) { 4981da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf(): Accounting error. wbuf at 0x%08x has 0x%03x bytes, 0x%03x left.\n", 4990bcc099dSDavid Woodhouse c->wbuf_ofs, c->wbuf_len, waste); 5001da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf(): But free_size for block at 0x%08x is only 0x%08x\n", 5011da177e4SLinus Torvalds jeb->offset, jeb->free_size); 5021da177e4SLinus Torvalds BUG(); 5031da177e4SLinus Torvalds } 5040bcc099dSDavid Woodhouse ref = jffs2_alloc_raw_node_ref(); 5050bcc099dSDavid Woodhouse if (!ref) 5060bcc099dSDavid Woodhouse return -ENOMEM; 5070bcc099dSDavid Woodhouse ref->flash_offset = c->wbuf_ofs + c->wbuf_len; 5080bcc099dSDavid Woodhouse ref->flash_offset |= REF_OBSOLETE; 5090bcc099dSDavid Woodhouse 5100bcc099dSDavid Woodhouse spin_lock(&c->erase_completion_lock); 5110bcc099dSDavid Woodhouse 512fcb75787SDavid Woodhouse jffs2_link_node_ref(c, jeb, ref, waste, NULL); 5130bcc099dSDavid Woodhouse /* FIXME: that made it count as dirty. Convert to wasted */ 5140bcc099dSDavid Woodhouse jeb->dirty_size -= waste; 5150bcc099dSDavid Woodhouse c->dirty_size -= waste; 5160bcc099dSDavid Woodhouse jeb->wasted_size += waste; 5170bcc099dSDavid Woodhouse c->wasted_size += waste; 5180bcc099dSDavid Woodhouse } else 5190bcc099dSDavid Woodhouse spin_lock(&c->erase_completion_lock); 5201da177e4SLinus Torvalds 5211da177e4SLinus Torvalds /* Stick any now-obsoleted blocks on the erase_pending_list */ 5221da177e4SLinus Torvalds jffs2_refile_wbuf_blocks(c); 5231da177e4SLinus Torvalds jffs2_clear_wbuf_ino_list(c); 5241da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5251da177e4SLinus Torvalds 5261da177e4SLinus Torvalds memset(c->wbuf,0xff,c->wbuf_pagesize); 5271da177e4SLinus Torvalds /* adjust write buffer offset, else we get a non contiguous write bug */ 5281da177e4SLinus Torvalds c->wbuf_ofs += c->wbuf_pagesize; 5291da177e4SLinus Torvalds c->wbuf_len = 0; 5301da177e4SLinus Torvalds return 0; 5311da177e4SLinus Torvalds } 5321da177e4SLinus Torvalds 5331da177e4SLinus Torvalds /* Trigger garbage collection to flush the write-buffer. 5341da177e4SLinus Torvalds If ino arg is zero, do it if _any_ real (i.e. not GC) writes are 5351da177e4SLinus Torvalds outstanding. If ino arg non-zero, do it only if a write for the 5361da177e4SLinus Torvalds given inode is outstanding. */ 5371da177e4SLinus Torvalds int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino) 5381da177e4SLinus Torvalds { 5391da177e4SLinus Torvalds uint32_t old_wbuf_ofs; 5401da177e4SLinus Torvalds uint32_t old_wbuf_len; 5411da177e4SLinus Torvalds int ret = 0; 5421da177e4SLinus Torvalds 5431da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() called for ino #%u...\n", ino)); 5441da177e4SLinus Torvalds 5458aee6ac1SDavid Woodhouse if (!c->wbuf) 5468aee6ac1SDavid Woodhouse return 0; 5478aee6ac1SDavid Woodhouse 5481da177e4SLinus Torvalds down(&c->alloc_sem); 5491da177e4SLinus Torvalds if (!jffs2_wbuf_pending_for_ino(c, ino)) { 5501da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Ino #%d not pending in wbuf. Returning\n", ino)); 5511da177e4SLinus Torvalds up(&c->alloc_sem); 5521da177e4SLinus Torvalds return 0; 5531da177e4SLinus Torvalds } 5541da177e4SLinus Torvalds 5551da177e4SLinus Torvalds old_wbuf_ofs = c->wbuf_ofs; 5561da177e4SLinus Torvalds old_wbuf_len = c->wbuf_len; 5571da177e4SLinus Torvalds 5581da177e4SLinus Torvalds if (c->unchecked_size) { 5591da177e4SLinus Torvalds /* GC won't make any progress for a while */ 5601da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() padding. Not finished checking\n")); 5611da177e4SLinus Torvalds down_write(&c->wbuf_sem); 5621da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 5637f716cf3SEstelle Hammache /* retry flushing wbuf in case jffs2_wbuf_recover 5647f716cf3SEstelle Hammache left some data in the wbuf */ 5657f716cf3SEstelle Hammache if (ret) 5667f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 5671da177e4SLinus Torvalds up_write(&c->wbuf_sem); 5681da177e4SLinus Torvalds } else while (old_wbuf_len && 5691da177e4SLinus Torvalds old_wbuf_ofs == c->wbuf_ofs) { 5701da177e4SLinus Torvalds 5711da177e4SLinus Torvalds up(&c->alloc_sem); 5721da177e4SLinus Torvalds 5731da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() calls gc pass\n")); 5741da177e4SLinus Torvalds 5751da177e4SLinus Torvalds ret = jffs2_garbage_collect_pass(c); 5761da177e4SLinus Torvalds if (ret) { 5771da177e4SLinus Torvalds /* GC failed. Flush it with padding instead */ 5781da177e4SLinus Torvalds down(&c->alloc_sem); 5791da177e4SLinus Torvalds down_write(&c->wbuf_sem); 5801da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 5817f716cf3SEstelle Hammache /* retry flushing wbuf in case jffs2_wbuf_recover 5827f716cf3SEstelle Hammache left some data in the wbuf */ 5837f716cf3SEstelle Hammache if (ret) 5847f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 5851da177e4SLinus Torvalds up_write(&c->wbuf_sem); 5861da177e4SLinus Torvalds break; 5871da177e4SLinus Torvalds } 5881da177e4SLinus Torvalds down(&c->alloc_sem); 5891da177e4SLinus Torvalds } 5901da177e4SLinus Torvalds 5911da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() ends...\n")); 5921da177e4SLinus Torvalds 5931da177e4SLinus Torvalds up(&c->alloc_sem); 5941da177e4SLinus Torvalds return ret; 5951da177e4SLinus Torvalds } 5961da177e4SLinus Torvalds 5971da177e4SLinus Torvalds /* Pad write-buffer to end and write it, wasting space. */ 5981da177e4SLinus Torvalds int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c) 5991da177e4SLinus Torvalds { 6001da177e4SLinus Torvalds int ret; 6011da177e4SLinus Torvalds 6028aee6ac1SDavid Woodhouse if (!c->wbuf) 6038aee6ac1SDavid Woodhouse return 0; 6048aee6ac1SDavid Woodhouse 6051da177e4SLinus Torvalds down_write(&c->wbuf_sem); 6061da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 6077f716cf3SEstelle Hammache /* retry - maybe wbuf recover left some data in wbuf. */ 6087f716cf3SEstelle Hammache if (ret) 6097f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 6101da177e4SLinus Torvalds up_write(&c->wbuf_sem); 6111da177e4SLinus Torvalds 6121da177e4SLinus Torvalds return ret; 6131da177e4SLinus Torvalds } 6141da177e4SLinus Torvalds int jffs2_flash_writev(struct jffs2_sb_info *c, const struct kvec *invecs, unsigned long count, loff_t to, size_t *retlen, uint32_t ino) 6151da177e4SLinus Torvalds { 6161da177e4SLinus Torvalds struct kvec outvecs[3]; 6171da177e4SLinus Torvalds uint32_t totlen = 0; 6181da177e4SLinus Torvalds uint32_t split_ofs = 0; 6191da177e4SLinus Torvalds uint32_t old_totlen; 6201da177e4SLinus Torvalds int ret, splitvec = -1; 6211da177e4SLinus Torvalds int invec, outvec; 6221da177e4SLinus Torvalds size_t wbuf_retlen; 6231da177e4SLinus Torvalds unsigned char *wbuf_ptr; 6241da177e4SLinus Torvalds size_t donelen = 0; 6251da177e4SLinus Torvalds uint32_t outvec_to = to; 6261da177e4SLinus Torvalds 6271da177e4SLinus Torvalds /* If not NAND flash, don't bother */ 6283be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 6291da177e4SLinus Torvalds return jffs2_flash_direct_writev(c, invecs, count, to, retlen); 6301da177e4SLinus Torvalds 6311da177e4SLinus Torvalds down_write(&c->wbuf_sem); 6321da177e4SLinus Torvalds 6331da177e4SLinus Torvalds /* If wbuf_ofs is not initialized, set it to target address */ 6341da177e4SLinus Torvalds if (c->wbuf_ofs == 0xFFFFFFFF) { 6351da177e4SLinus Torvalds c->wbuf_ofs = PAGE_DIV(to); 6361da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 6371da177e4SLinus Torvalds memset(c->wbuf,0xff,c->wbuf_pagesize); 6381da177e4SLinus Torvalds } 6391da177e4SLinus Torvalds 6401da177e4SLinus Torvalds /* Sanity checks on target address. 6411da177e4SLinus Torvalds It's permitted to write at PAD(c->wbuf_len+c->wbuf_ofs), 6421da177e4SLinus Torvalds and it's permitted to write at the beginning of a new 6431da177e4SLinus Torvalds erase block. Anything else, and you die. 6441da177e4SLinus Torvalds New block starts at xxx000c (0-b = block header) 6451da177e4SLinus Torvalds */ 6463be36675SAndrew Victor if (SECTOR_ADDR(to) != SECTOR_ADDR(c->wbuf_ofs)) { 6471da177e4SLinus Torvalds /* It's a write to a new block */ 6481da177e4SLinus Torvalds if (c->wbuf_len) { 6491da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flash_writev() to 0x%lx causes flush of wbuf at 0x%08x\n", (unsigned long)to, c->wbuf_ofs)); 6501da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 6511da177e4SLinus Torvalds if (ret) { 6521da177e4SLinus Torvalds /* the underlying layer has to check wbuf_len to do the cleanup */ 6531da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_flush_wbuf() called from jffs2_flash_writev() failed %d\n", ret)); 6541da177e4SLinus Torvalds *retlen = 0; 6551da177e4SLinus Torvalds goto exit; 6561da177e4SLinus Torvalds } 6571da177e4SLinus Torvalds } 6581da177e4SLinus Torvalds /* set pointer to new block */ 6591da177e4SLinus Torvalds c->wbuf_ofs = PAGE_DIV(to); 6601da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 6611da177e4SLinus Torvalds } 6621da177e4SLinus Torvalds 6631da177e4SLinus Torvalds if (to != PAD(c->wbuf_ofs + c->wbuf_len)) { 6641da177e4SLinus Torvalds /* We're not writing immediately after the writebuffer. Bad. */ 6651da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flash_writev(): Non-contiguous write to %08lx\n", (unsigned long)to); 6661da177e4SLinus Torvalds if (c->wbuf_len) 6671da177e4SLinus Torvalds printk(KERN_CRIT "wbuf was previously %08x-%08x\n", 6681da177e4SLinus Torvalds c->wbuf_ofs, c->wbuf_ofs+c->wbuf_len); 6691da177e4SLinus Torvalds BUG(); 6701da177e4SLinus Torvalds } 6711da177e4SLinus Torvalds 6721da177e4SLinus Torvalds /* Note outvecs[3] above. We know count is never greater than 2 */ 6731da177e4SLinus Torvalds if (count > 2) { 6741da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flash_writev(): count is %ld\n", count); 6751da177e4SLinus Torvalds BUG(); 6761da177e4SLinus Torvalds } 6771da177e4SLinus Torvalds 6781da177e4SLinus Torvalds invec = 0; 6791da177e4SLinus Torvalds outvec = 0; 6801da177e4SLinus Torvalds 6811da177e4SLinus Torvalds /* Fill writebuffer first, if already in use */ 6821da177e4SLinus Torvalds if (c->wbuf_len) { 6831da177e4SLinus Torvalds uint32_t invec_ofs = 0; 6841da177e4SLinus Torvalds 6851da177e4SLinus Torvalds /* adjust alignment offset */ 6861da177e4SLinus Torvalds if (c->wbuf_len != PAGE_MOD(to)) { 6871da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 6881da177e4SLinus Torvalds /* take care of alignment to next page */ 6891da177e4SLinus Torvalds if (!c->wbuf_len) 6901da177e4SLinus Torvalds c->wbuf_len = c->wbuf_pagesize; 6911da177e4SLinus Torvalds } 6921da177e4SLinus Torvalds 6931da177e4SLinus Torvalds while(c->wbuf_len < c->wbuf_pagesize) { 6941da177e4SLinus Torvalds uint32_t thislen; 6951da177e4SLinus Torvalds 6961da177e4SLinus Torvalds if (invec == count) 6971da177e4SLinus Torvalds goto alldone; 6981da177e4SLinus Torvalds 6991da177e4SLinus Torvalds thislen = c->wbuf_pagesize - c->wbuf_len; 7001da177e4SLinus Torvalds 7011da177e4SLinus Torvalds if (thislen >= invecs[invec].iov_len) 7021da177e4SLinus Torvalds thislen = invecs[invec].iov_len; 7031da177e4SLinus Torvalds 7041da177e4SLinus Torvalds invec_ofs = thislen; 7051da177e4SLinus Torvalds 7061da177e4SLinus Torvalds memcpy(c->wbuf + c->wbuf_len, invecs[invec].iov_base, thislen); 7071da177e4SLinus Torvalds c->wbuf_len += thislen; 7081da177e4SLinus Torvalds donelen += thislen; 7091da177e4SLinus Torvalds /* Get next invec, if actual did not fill the buffer */ 7101da177e4SLinus Torvalds if (c->wbuf_len < c->wbuf_pagesize) 7111da177e4SLinus Torvalds invec++; 7121da177e4SLinus Torvalds } 7131da177e4SLinus Torvalds 7141da177e4SLinus Torvalds /* write buffer is full, flush buffer */ 7151da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, NOPAD); 7161da177e4SLinus Torvalds if (ret) { 7171da177e4SLinus Torvalds /* the underlying layer has to check wbuf_len to do the cleanup */ 7181da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_flush_wbuf() called from jffs2_flash_writev() failed %d\n", ret)); 7191da177e4SLinus Torvalds /* Retlen zero to make sure our caller doesn't mark the space dirty. 7201da177e4SLinus Torvalds We've already done everything that's necessary */ 7211da177e4SLinus Torvalds *retlen = 0; 7221da177e4SLinus Torvalds goto exit; 7231da177e4SLinus Torvalds } 7241da177e4SLinus Torvalds outvec_to += donelen; 7251da177e4SLinus Torvalds c->wbuf_ofs = outvec_to; 7261da177e4SLinus Torvalds 7271da177e4SLinus Torvalds /* All invecs done ? */ 7281da177e4SLinus Torvalds if (invec == count) 7291da177e4SLinus Torvalds goto alldone; 7301da177e4SLinus Torvalds 7311da177e4SLinus Torvalds /* Set up the first outvec, containing the remainder of the 7321da177e4SLinus Torvalds invec we partially used */ 7331da177e4SLinus Torvalds if (invecs[invec].iov_len > invec_ofs) { 7341da177e4SLinus Torvalds outvecs[0].iov_base = invecs[invec].iov_base+invec_ofs; 7351da177e4SLinus Torvalds totlen = outvecs[0].iov_len = invecs[invec].iov_len-invec_ofs; 7361da177e4SLinus Torvalds if (totlen > c->wbuf_pagesize) { 7371da177e4SLinus Torvalds splitvec = outvec; 7381da177e4SLinus Torvalds split_ofs = outvecs[0].iov_len - PAGE_MOD(totlen); 7391da177e4SLinus Torvalds } 7401da177e4SLinus Torvalds outvec++; 7411da177e4SLinus Torvalds } 7421da177e4SLinus Torvalds invec++; 7431da177e4SLinus Torvalds } 7441da177e4SLinus Torvalds 7451da177e4SLinus Torvalds /* OK, now we've flushed the wbuf and the start of the bits 7461da177e4SLinus Torvalds we have been asked to write, now to write the rest.... */ 7471da177e4SLinus Torvalds 7481da177e4SLinus Torvalds /* totlen holds the amount of data still to be written */ 7491da177e4SLinus Torvalds old_totlen = totlen; 7501da177e4SLinus Torvalds for ( ; invec < count; invec++,outvec++ ) { 7511da177e4SLinus Torvalds outvecs[outvec].iov_base = invecs[invec].iov_base; 7521da177e4SLinus Torvalds totlen += outvecs[outvec].iov_len = invecs[invec].iov_len; 7531da177e4SLinus Torvalds if (PAGE_DIV(totlen) != PAGE_DIV(old_totlen)) { 7541da177e4SLinus Torvalds splitvec = outvec; 7551da177e4SLinus Torvalds split_ofs = outvecs[outvec].iov_len - PAGE_MOD(totlen); 7561da177e4SLinus Torvalds old_totlen = totlen; 7571da177e4SLinus Torvalds } 7581da177e4SLinus Torvalds } 7591da177e4SLinus Torvalds 7601da177e4SLinus Torvalds /* Now the outvecs array holds all the remaining data to write */ 7611da177e4SLinus Torvalds /* Up to splitvec,split_ofs is to be written immediately. The rest 7621da177e4SLinus Torvalds goes into the (now-empty) wbuf */ 7631da177e4SLinus Torvalds 7641da177e4SLinus Torvalds if (splitvec != -1) { 7651da177e4SLinus Torvalds uint32_t remainder; 7661da177e4SLinus Torvalds 7671da177e4SLinus Torvalds remainder = outvecs[splitvec].iov_len - split_ofs; 7681da177e4SLinus Torvalds outvecs[splitvec].iov_len = split_ofs; 7691da177e4SLinus Torvalds 7701da177e4SLinus Torvalds /* We did cross a page boundary, so we write some now */ 7711da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 7721da177e4SLinus Torvalds ret = c->mtd->writev_ecc(c->mtd, outvecs, splitvec+1, outvec_to, &wbuf_retlen, NULL, c->oobinfo); 7731da177e4SLinus Torvalds else 7741da177e4SLinus Torvalds ret = jffs2_flash_direct_writev(c, outvecs, splitvec+1, outvec_to, &wbuf_retlen); 7751da177e4SLinus Torvalds 7761da177e4SLinus Torvalds if (ret < 0 || wbuf_retlen != PAGE_DIV(totlen)) { 7771da177e4SLinus Torvalds /* At this point we have no problem, 7787f716cf3SEstelle Hammache c->wbuf is empty. However refile nextblock to avoid 7797f716cf3SEstelle Hammache writing again to same address. 7801da177e4SLinus Torvalds */ 7817f716cf3SEstelle Hammache struct jffs2_eraseblock *jeb; 7827f716cf3SEstelle Hammache 7837f716cf3SEstelle Hammache spin_lock(&c->erase_completion_lock); 7847f716cf3SEstelle Hammache 7857f716cf3SEstelle Hammache jeb = &c->blocks[outvec_to / c->sector_size]; 7867f716cf3SEstelle Hammache jffs2_block_refile(c, jeb, REFILE_ANYWAY); 7877f716cf3SEstelle Hammache 7887f716cf3SEstelle Hammache *retlen = 0; 7897f716cf3SEstelle Hammache spin_unlock(&c->erase_completion_lock); 7901da177e4SLinus Torvalds goto exit; 7911da177e4SLinus Torvalds } 7921da177e4SLinus Torvalds 7931da177e4SLinus Torvalds donelen += wbuf_retlen; 7941da177e4SLinus Torvalds c->wbuf_ofs = PAGE_DIV(outvec_to) + PAGE_DIV(totlen); 7951da177e4SLinus Torvalds 7961da177e4SLinus Torvalds if (remainder) { 7971da177e4SLinus Torvalds outvecs[splitvec].iov_base += split_ofs; 7981da177e4SLinus Torvalds outvecs[splitvec].iov_len = remainder; 7991da177e4SLinus Torvalds } else { 8001da177e4SLinus Torvalds splitvec++; 8011da177e4SLinus Torvalds } 8021da177e4SLinus Torvalds 8031da177e4SLinus Torvalds } else { 8041da177e4SLinus Torvalds splitvec = 0; 8051da177e4SLinus Torvalds } 8061da177e4SLinus Torvalds 8071da177e4SLinus Torvalds /* Now splitvec points to the start of the bits we have to copy 8081da177e4SLinus Torvalds into the wbuf */ 8091da177e4SLinus Torvalds wbuf_ptr = c->wbuf; 8101da177e4SLinus Torvalds 8111da177e4SLinus Torvalds for ( ; splitvec < outvec; splitvec++) { 8121da177e4SLinus Torvalds /* Don't copy the wbuf into itself */ 8131da177e4SLinus Torvalds if (outvecs[splitvec].iov_base == c->wbuf) 8141da177e4SLinus Torvalds continue; 8151da177e4SLinus Torvalds memcpy(wbuf_ptr, outvecs[splitvec].iov_base, outvecs[splitvec].iov_len); 8161da177e4SLinus Torvalds wbuf_ptr += outvecs[splitvec].iov_len; 8171da177e4SLinus Torvalds donelen += outvecs[splitvec].iov_len; 8181da177e4SLinus Torvalds } 8191da177e4SLinus Torvalds c->wbuf_len = wbuf_ptr - c->wbuf; 8201da177e4SLinus Torvalds 8211da177e4SLinus Torvalds /* If there's a remainder in the wbuf and it's a non-GC write, 8221da177e4SLinus Torvalds remember that the wbuf affects this ino */ 8231da177e4SLinus Torvalds alldone: 8241da177e4SLinus Torvalds *retlen = donelen; 8251da177e4SLinus Torvalds 826e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 827e631ddbaSFerenc Havasi int res = jffs2_sum_add_kvec(c, invecs, count, (uint32_t) to); 828e631ddbaSFerenc Havasi if (res) 829e631ddbaSFerenc Havasi return res; 830e631ddbaSFerenc Havasi } 831e631ddbaSFerenc Havasi 8321da177e4SLinus Torvalds if (c->wbuf_len && ino) 8331da177e4SLinus Torvalds jffs2_wbuf_dirties_inode(c, ino); 8341da177e4SLinus Torvalds 8351da177e4SLinus Torvalds ret = 0; 8361da177e4SLinus Torvalds 8371da177e4SLinus Torvalds exit: 8381da177e4SLinus Torvalds up_write(&c->wbuf_sem); 8391da177e4SLinus Torvalds return ret; 8401da177e4SLinus Torvalds } 8411da177e4SLinus Torvalds 8421da177e4SLinus Torvalds /* 8431da177e4SLinus Torvalds * This is the entry for flash write. 8441da177e4SLinus Torvalds * Check, if we work on NAND FLASH, if so build an kvec and write it via vritev 8451da177e4SLinus Torvalds */ 8461da177e4SLinus Torvalds int jffs2_flash_write(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, const u_char *buf) 8471da177e4SLinus Torvalds { 8481da177e4SLinus Torvalds struct kvec vecs[1]; 8491da177e4SLinus Torvalds 8503be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 851e631ddbaSFerenc Havasi return jffs2_flash_direct_write(c, ofs, len, retlen, buf); 8521da177e4SLinus Torvalds 8531da177e4SLinus Torvalds vecs[0].iov_base = (unsigned char *) buf; 8541da177e4SLinus Torvalds vecs[0].iov_len = len; 8551da177e4SLinus Torvalds return jffs2_flash_writev(c, vecs, 1, ofs, retlen, 0); 8561da177e4SLinus Torvalds } 8571da177e4SLinus Torvalds 8581da177e4SLinus Torvalds /* 8591da177e4SLinus Torvalds Handle readback from writebuffer and ECC failure return 8601da177e4SLinus Torvalds */ 8611da177e4SLinus Torvalds int jffs2_flash_read(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, u_char *buf) 8621da177e4SLinus Torvalds { 8631da177e4SLinus Torvalds loff_t orbf = 0, owbf = 0, lwbf = 0; 8641da177e4SLinus Torvalds int ret; 8651da177e4SLinus Torvalds 8663be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 8673be36675SAndrew Victor return c->mtd->read(c->mtd, ofs, len, retlen, buf); 8681da177e4SLinus Torvalds 8693be36675SAndrew Victor /* Read flash */ 870894214d1SArtem B. Bityuckiy down_read(&c->wbuf_sem); 8711da177e4SLinus Torvalds if (jffs2_cleanmarker_oob(c)) 8721da177e4SLinus Torvalds ret = c->mtd->read_ecc(c->mtd, ofs, len, retlen, buf, NULL, c->oobinfo); 8731da177e4SLinus Torvalds else 8741da177e4SLinus Torvalds ret = c->mtd->read(c->mtd, ofs, len, retlen, buf); 8751da177e4SLinus Torvalds 8761da177e4SLinus Torvalds if ( (ret == -EBADMSG) && (*retlen == len) ) { 8771da177e4SLinus Torvalds printk(KERN_WARNING "mtd->read(0x%zx bytes from 0x%llx) returned ECC error\n", 8781da177e4SLinus Torvalds len, ofs); 8791da177e4SLinus Torvalds /* 8801da177e4SLinus Torvalds * We have the raw data without ECC correction in the buffer, maybe 8811da177e4SLinus Torvalds * we are lucky and all data or parts are correct. We check the node. 8821da177e4SLinus Torvalds * If data are corrupted node check will sort it out. 8831da177e4SLinus Torvalds * We keep this block, it will fail on write or erase and the we 8841da177e4SLinus Torvalds * mark it bad. Or should we do that now? But we should give him a chance. 8851da177e4SLinus Torvalds * Maybe we had a system crash or power loss before the ecc write or 8861da177e4SLinus Torvalds * a erase was completed. 8871da177e4SLinus Torvalds * So we return success. :) 8881da177e4SLinus Torvalds */ 8891da177e4SLinus Torvalds ret = 0; 8901da177e4SLinus Torvalds } 8911da177e4SLinus Torvalds 8921da177e4SLinus Torvalds /* if no writebuffer available or write buffer empty, return */ 8931da177e4SLinus Torvalds if (!c->wbuf_pagesize || !c->wbuf_len) 894894214d1SArtem B. Bityuckiy goto exit; 8951da177e4SLinus Torvalds 8961da177e4SLinus Torvalds /* if we read in a different block, return */ 8973be36675SAndrew Victor if (SECTOR_ADDR(ofs) != SECTOR_ADDR(c->wbuf_ofs)) 898894214d1SArtem B. Bityuckiy goto exit; 8991da177e4SLinus Torvalds 9001da177e4SLinus Torvalds if (ofs >= c->wbuf_ofs) { 9011da177e4SLinus Torvalds owbf = (ofs - c->wbuf_ofs); /* offset in write buffer */ 9021da177e4SLinus Torvalds if (owbf > c->wbuf_len) /* is read beyond write buffer ? */ 9031da177e4SLinus Torvalds goto exit; 9041da177e4SLinus Torvalds lwbf = c->wbuf_len - owbf; /* number of bytes to copy */ 9051da177e4SLinus Torvalds if (lwbf > len) 9061da177e4SLinus Torvalds lwbf = len; 9071da177e4SLinus Torvalds } else { 9081da177e4SLinus Torvalds orbf = (c->wbuf_ofs - ofs); /* offset in read buffer */ 9091da177e4SLinus Torvalds if (orbf > len) /* is write beyond write buffer ? */ 9101da177e4SLinus Torvalds goto exit; 9111da177e4SLinus Torvalds lwbf = len - orbf; /* number of bytes to copy */ 9121da177e4SLinus Torvalds if (lwbf > c->wbuf_len) 9131da177e4SLinus Torvalds lwbf = c->wbuf_len; 9141da177e4SLinus Torvalds } 9151da177e4SLinus Torvalds if (lwbf > 0) 9161da177e4SLinus Torvalds memcpy(buf+orbf,c->wbuf+owbf,lwbf); 9171da177e4SLinus Torvalds 9181da177e4SLinus Torvalds exit: 9191da177e4SLinus Torvalds up_read(&c->wbuf_sem); 9201da177e4SLinus Torvalds return ret; 9211da177e4SLinus Torvalds } 9221da177e4SLinus Torvalds 9231da177e4SLinus Torvalds /* 9241da177e4SLinus Torvalds * Check, if the out of band area is empty 9251da177e4SLinus Torvalds */ 9261da177e4SLinus Torvalds int jffs2_check_oob_empty( struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int mode) 9271da177e4SLinus Torvalds { 9281da177e4SLinus Torvalds unsigned char *buf; 9291da177e4SLinus Torvalds int ret = 0; 9301da177e4SLinus Torvalds int i,len,page; 9311da177e4SLinus Torvalds size_t retlen; 9321da177e4SLinus Torvalds int oob_size; 9331da177e4SLinus Torvalds 9341da177e4SLinus Torvalds /* allocate a buffer for all oob data in this sector */ 9351da177e4SLinus Torvalds oob_size = c->mtd->oobsize; 9361da177e4SLinus Torvalds len = 4 * oob_size; 9371da177e4SLinus Torvalds buf = kmalloc(len, GFP_KERNEL); 9381da177e4SLinus Torvalds if (!buf) { 9391da177e4SLinus Torvalds printk(KERN_NOTICE "jffs2_check_oob_empty(): allocation of temporary data buffer for oob check failed\n"); 9401da177e4SLinus Torvalds return -ENOMEM; 9411da177e4SLinus Torvalds } 9421da177e4SLinus Torvalds /* 9431da177e4SLinus Torvalds * if mode = 0, we scan for a total empty oob area, else we have 9441da177e4SLinus Torvalds * to take care of the cleanmarker in the first page of the block 9451da177e4SLinus Torvalds */ 9461da177e4SLinus Torvalds ret = jffs2_flash_read_oob(c, jeb->offset, len , &retlen, buf); 9471da177e4SLinus Torvalds if (ret) { 9481da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB failed %d for block at %08x\n", ret, jeb->offset)); 9491da177e4SLinus Torvalds goto out; 9501da177e4SLinus Torvalds } 9511da177e4SLinus Torvalds 9521da177e4SLinus Torvalds if (retlen < len) { 9531da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB return short read " 9541da177e4SLinus Torvalds "(%zd bytes not %d) for block at %08x\n", retlen, len, jeb->offset)); 9551da177e4SLinus Torvalds ret = -EIO; 9561da177e4SLinus Torvalds goto out; 9571da177e4SLinus Torvalds } 9581da177e4SLinus Torvalds 9591da177e4SLinus Torvalds /* Special check for first page */ 9601da177e4SLinus Torvalds for(i = 0; i < oob_size ; i++) { 9611da177e4SLinus Torvalds /* Yeah, we know about the cleanmarker. */ 9621da177e4SLinus Torvalds if (mode && i >= c->fsdata_pos && 9631da177e4SLinus Torvalds i < c->fsdata_pos + c->fsdata_len) 9641da177e4SLinus Torvalds continue; 9651da177e4SLinus Torvalds 9661da177e4SLinus Torvalds if (buf[i] != 0xFF) { 9671da177e4SLinus Torvalds D2(printk(KERN_DEBUG "Found %02x at %x in OOB for %08x\n", 968730554d9SArtem B. Bityutskiy buf[i], i, jeb->offset)); 9691da177e4SLinus Torvalds ret = 1; 9701da177e4SLinus Torvalds goto out; 9711da177e4SLinus Torvalds } 9721da177e4SLinus Torvalds } 9731da177e4SLinus Torvalds 9741da177e4SLinus Torvalds /* we know, we are aligned :) */ 9751da177e4SLinus Torvalds for (page = oob_size; page < len; page += sizeof(long)) { 9761da177e4SLinus Torvalds unsigned long dat = *(unsigned long *)(&buf[page]); 9771da177e4SLinus Torvalds if(dat != -1) { 9781da177e4SLinus Torvalds ret = 1; 9791da177e4SLinus Torvalds goto out; 9801da177e4SLinus Torvalds } 9811da177e4SLinus Torvalds } 9821da177e4SLinus Torvalds 9831da177e4SLinus Torvalds out: 9841da177e4SLinus Torvalds kfree(buf); 9851da177e4SLinus Torvalds 9861da177e4SLinus Torvalds return ret; 9871da177e4SLinus Torvalds } 9881da177e4SLinus Torvalds 9891da177e4SLinus Torvalds /* 9901da177e4SLinus Torvalds * Scan for a valid cleanmarker and for bad blocks 9911da177e4SLinus Torvalds * For virtual blocks (concatenated physical blocks) check the cleanmarker 9921da177e4SLinus Torvalds * only in the first page of the first physical block, but scan for bad blocks in all 9931da177e4SLinus Torvalds * physical blocks 9941da177e4SLinus Torvalds */ 9951da177e4SLinus Torvalds int jffs2_check_nand_cleanmarker (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 9961da177e4SLinus Torvalds { 9971da177e4SLinus Torvalds struct jffs2_unknown_node n; 9981da177e4SLinus Torvalds unsigned char buf[2 * NAND_MAX_OOBSIZE]; 9991da177e4SLinus Torvalds unsigned char *p; 10001da177e4SLinus Torvalds int ret, i, cnt, retval = 0; 10011da177e4SLinus Torvalds size_t retlen, offset; 10021da177e4SLinus Torvalds int oob_size; 10031da177e4SLinus Torvalds 10041da177e4SLinus Torvalds offset = jeb->offset; 10051da177e4SLinus Torvalds oob_size = c->mtd->oobsize; 10061da177e4SLinus Torvalds 10071da177e4SLinus Torvalds /* Loop through the physical blocks */ 10081da177e4SLinus Torvalds for (cnt = 0; cnt < (c->sector_size / c->mtd->erasesize); cnt++) { 10091da177e4SLinus Torvalds /* Check first if the block is bad. */ 10101da177e4SLinus Torvalds if (c->mtd->block_isbad (c->mtd, offset)) { 10111da177e4SLinus Torvalds D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Bad block at %08x\n", jeb->offset)); 10121da177e4SLinus Torvalds return 2; 10131da177e4SLinus Torvalds } 10141da177e4SLinus Torvalds /* 10151da177e4SLinus Torvalds * We read oob data from page 0 and 1 of the block. 10161da177e4SLinus Torvalds * page 0 contains cleanmarker and badblock info 10171da177e4SLinus Torvalds * page 1 contains failure count of this block 10181da177e4SLinus Torvalds */ 10191da177e4SLinus Torvalds ret = c->mtd->read_oob (c->mtd, offset, oob_size << 1, &retlen, buf); 10201da177e4SLinus Torvalds 10211da177e4SLinus Torvalds if (ret) { 10221da177e4SLinus Torvalds D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Read OOB failed %d for block at %08x\n", ret, jeb->offset)); 10231da177e4SLinus Torvalds return ret; 10241da177e4SLinus Torvalds } 10251da177e4SLinus Torvalds if (retlen < (oob_size << 1)) { 10261da177e4SLinus Torvalds D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Read OOB return short read (%zd bytes not %d) for block at %08x\n", retlen, oob_size << 1, jeb->offset)); 10271da177e4SLinus Torvalds return -EIO; 10281da177e4SLinus Torvalds } 10291da177e4SLinus Torvalds 10301da177e4SLinus Torvalds /* Check cleanmarker only on the first physical block */ 10311da177e4SLinus Torvalds if (!cnt) { 10321da177e4SLinus Torvalds n.magic = cpu_to_je16 (JFFS2_MAGIC_BITMASK); 10331da177e4SLinus Torvalds n.nodetype = cpu_to_je16 (JFFS2_NODETYPE_CLEANMARKER); 10341da177e4SLinus Torvalds n.totlen = cpu_to_je32 (8); 10351da177e4SLinus Torvalds p = (unsigned char *) &n; 10361da177e4SLinus Torvalds 10371da177e4SLinus Torvalds for (i = 0; i < c->fsdata_len; i++) { 10381da177e4SLinus Torvalds if (buf[c->fsdata_pos + i] != p[i]) { 10391da177e4SLinus Torvalds retval = 1; 10401da177e4SLinus Torvalds } 10411da177e4SLinus Torvalds } 10421da177e4SLinus Torvalds D1(if (retval == 1) { 10431da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_check_nand_cleanmarker(): Cleanmarker node not detected in block at %08x\n", jeb->offset); 10441da177e4SLinus Torvalds printk(KERN_WARNING "OOB at %08x was ", offset); 10451da177e4SLinus Torvalds for (i=0; i < oob_size; i++) { 10461da177e4SLinus Torvalds printk("%02x ", buf[i]); 10471da177e4SLinus Torvalds } 10481da177e4SLinus Torvalds printk("\n"); 10491da177e4SLinus Torvalds }) 10501da177e4SLinus Torvalds } 10511da177e4SLinus Torvalds offset += c->mtd->erasesize; 10521da177e4SLinus Torvalds } 10531da177e4SLinus Torvalds return retval; 10541da177e4SLinus Torvalds } 10551da177e4SLinus Torvalds 10561da177e4SLinus Torvalds int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) 10571da177e4SLinus Torvalds { 10581da177e4SLinus Torvalds struct jffs2_unknown_node n; 10591da177e4SLinus Torvalds int ret; 10601da177e4SLinus Torvalds size_t retlen; 10611da177e4SLinus Torvalds 10621da177e4SLinus Torvalds n.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 10631da177e4SLinus Torvalds n.nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER); 10641da177e4SLinus Torvalds n.totlen = cpu_to_je32(8); 10651da177e4SLinus Torvalds 10661da177e4SLinus Torvalds ret = jffs2_flash_write_oob(c, jeb->offset + c->fsdata_pos, c->fsdata_len, &retlen, (unsigned char *)&n); 10671da177e4SLinus Torvalds 10681da177e4SLinus Torvalds if (ret) { 10691da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Write failed for block at %08x: error %d\n", jeb->offset, ret)); 10701da177e4SLinus Torvalds return ret; 10711da177e4SLinus Torvalds } 10721da177e4SLinus Torvalds if (retlen != c->fsdata_len) { 10731da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Short write for block at %08x: %zd not %d\n", jeb->offset, retlen, c->fsdata_len)); 10741da177e4SLinus Torvalds return ret; 10751da177e4SLinus Torvalds } 10761da177e4SLinus Torvalds return 0; 10771da177e4SLinus Torvalds } 10781da177e4SLinus Torvalds 10791da177e4SLinus Torvalds /* 10801da177e4SLinus Torvalds * On NAND we try to mark this block bad. If the block was erased more 10811da177e4SLinus Torvalds * than MAX_ERASE_FAILURES we mark it finaly bad. 10821da177e4SLinus Torvalds * Don't care about failures. This block remains on the erase-pending 10831da177e4SLinus Torvalds * or badblock list as long as nobody manipulates the flash with 10841da177e4SLinus Torvalds * a bootloader or something like that. 10851da177e4SLinus Torvalds */ 10861da177e4SLinus Torvalds 10871da177e4SLinus Torvalds int jffs2_write_nand_badblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset) 10881da177e4SLinus Torvalds { 10891da177e4SLinus Torvalds int ret; 10901da177e4SLinus Torvalds 10911da177e4SLinus Torvalds /* if the count is < max, we try to write the counter to the 2nd page oob area */ 10921da177e4SLinus Torvalds if( ++jeb->bad_count < MAX_ERASE_FAILURES) 10931da177e4SLinus Torvalds return 0; 10941da177e4SLinus Torvalds 10951da177e4SLinus Torvalds if (!c->mtd->block_markbad) 10961da177e4SLinus Torvalds return 1; // What else can we do? 10971da177e4SLinus Torvalds 10981da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Marking bad block at %08x\n", bad_offset)); 10991da177e4SLinus Torvalds ret = c->mtd->block_markbad(c->mtd, bad_offset); 11001da177e4SLinus Torvalds 11011da177e4SLinus Torvalds if (ret) { 11021da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Write failed for block at %08x: error %d\n", jeb->offset, ret)); 11031da177e4SLinus Torvalds return ret; 11041da177e4SLinus Torvalds } 11051da177e4SLinus Torvalds return 1; 11061da177e4SLinus Torvalds } 11071da177e4SLinus Torvalds 11081da177e4SLinus Torvalds #define NAND_JFFS2_OOB16_FSDALEN 8 11091da177e4SLinus Torvalds 11101da177e4SLinus Torvalds static struct nand_oobinfo jffs2_oobinfo_docecc = { 11111da177e4SLinus Torvalds .useecc = MTD_NANDECC_PLACE, 11121da177e4SLinus Torvalds .eccbytes = 6, 11131da177e4SLinus Torvalds .eccpos = {0,1,2,3,4,5} 11141da177e4SLinus Torvalds }; 11151da177e4SLinus Torvalds 11161da177e4SLinus Torvalds 11171da177e4SLinus Torvalds static int jffs2_nand_set_oobinfo(struct jffs2_sb_info *c) 11181da177e4SLinus Torvalds { 11191da177e4SLinus Torvalds struct nand_oobinfo *oinfo = &c->mtd->oobinfo; 11201da177e4SLinus Torvalds 11211da177e4SLinus Torvalds /* Do this only, if we have an oob buffer */ 11221da177e4SLinus Torvalds if (!c->mtd->oobsize) 11231da177e4SLinus Torvalds return 0; 11241da177e4SLinus Torvalds 11251da177e4SLinus Torvalds /* Cleanmarker is out-of-band, so inline size zero */ 11261da177e4SLinus Torvalds c->cleanmarker_size = 0; 11271da177e4SLinus Torvalds 11281da177e4SLinus Torvalds /* Should we use autoplacement ? */ 11291da177e4SLinus Torvalds if (oinfo && oinfo->useecc == MTD_NANDECC_AUTOPLACE) { 11301da177e4SLinus Torvalds D1(printk(KERN_DEBUG "JFFS2 using autoplace on NAND\n")); 11311da177e4SLinus Torvalds /* Get the position of the free bytes */ 11321da177e4SLinus Torvalds if (!oinfo->oobfree[0][1]) { 11331da177e4SLinus Torvalds printk (KERN_WARNING "jffs2_nand_set_oobinfo(): Eeep. Autoplacement selected and no empty space in oob\n"); 11341da177e4SLinus Torvalds return -ENOSPC; 11351da177e4SLinus Torvalds } 11361da177e4SLinus Torvalds c->fsdata_pos = oinfo->oobfree[0][0]; 11371da177e4SLinus Torvalds c->fsdata_len = oinfo->oobfree[0][1]; 11381da177e4SLinus Torvalds if (c->fsdata_len > 8) 11391da177e4SLinus Torvalds c->fsdata_len = 8; 11401da177e4SLinus Torvalds } else { 11411da177e4SLinus Torvalds /* This is just a legacy fallback and should go away soon */ 11421da177e4SLinus Torvalds switch(c->mtd->ecctype) { 11431da177e4SLinus Torvalds case MTD_ECC_RS_DiskOnChip: 11441da177e4SLinus Torvalds printk(KERN_WARNING "JFFS2 using DiskOnChip hardware ECC without autoplacement. Fix it!\n"); 11451da177e4SLinus Torvalds c->oobinfo = &jffs2_oobinfo_docecc; 11461da177e4SLinus Torvalds c->fsdata_pos = 6; 11471da177e4SLinus Torvalds c->fsdata_len = NAND_JFFS2_OOB16_FSDALEN; 11481da177e4SLinus Torvalds c->badblock_pos = 15; 11491da177e4SLinus Torvalds break; 11501da177e4SLinus Torvalds 11511da177e4SLinus Torvalds default: 11521da177e4SLinus Torvalds D1(printk(KERN_DEBUG "JFFS2 on NAND. No autoplacment info found\n")); 11531da177e4SLinus Torvalds return -EINVAL; 11541da177e4SLinus Torvalds } 11551da177e4SLinus Torvalds } 11561da177e4SLinus Torvalds return 0; 11571da177e4SLinus Torvalds } 11581da177e4SLinus Torvalds 11591da177e4SLinus Torvalds int jffs2_nand_flash_setup(struct jffs2_sb_info *c) 11601da177e4SLinus Torvalds { 11611da177e4SLinus Torvalds int res; 11621da177e4SLinus Torvalds 11631da177e4SLinus Torvalds /* Initialise write buffer */ 11641da177e4SLinus Torvalds init_rwsem(&c->wbuf_sem); 116528318776SJoern Engel c->wbuf_pagesize = c->mtd->writesize; 11661da177e4SLinus Torvalds c->wbuf_ofs = 0xFFFFFFFF; 11671da177e4SLinus Torvalds 11681da177e4SLinus Torvalds c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 11691da177e4SLinus Torvalds if (!c->wbuf) 11701da177e4SLinus Torvalds return -ENOMEM; 11711da177e4SLinus Torvalds 11721da177e4SLinus Torvalds res = jffs2_nand_set_oobinfo(c); 11731da177e4SLinus Torvalds 11741da177e4SLinus Torvalds #ifdef BREAKME 11751da177e4SLinus Torvalds if (!brokenbuf) 11761da177e4SLinus Torvalds brokenbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 11771da177e4SLinus Torvalds if (!brokenbuf) { 11781da177e4SLinus Torvalds kfree(c->wbuf); 11791da177e4SLinus Torvalds return -ENOMEM; 11801da177e4SLinus Torvalds } 11811da177e4SLinus Torvalds memset(brokenbuf, 0xdb, c->wbuf_pagesize); 11821da177e4SLinus Torvalds #endif 11831da177e4SLinus Torvalds return res; 11841da177e4SLinus Torvalds } 11851da177e4SLinus Torvalds 11861da177e4SLinus Torvalds void jffs2_nand_flash_cleanup(struct jffs2_sb_info *c) 11871da177e4SLinus Torvalds { 11881da177e4SLinus Torvalds kfree(c->wbuf); 11891da177e4SLinus Torvalds } 11901da177e4SLinus Torvalds 11918f15fd55SAndrew Victor int jffs2_dataflash_setup(struct jffs2_sb_info *c) { 11928f15fd55SAndrew Victor c->cleanmarker_size = 0; /* No cleanmarkers needed */ 11938f15fd55SAndrew Victor 11948f15fd55SAndrew Victor /* Initialize write buffer */ 11958f15fd55SAndrew Victor init_rwsem(&c->wbuf_sem); 11968f15fd55SAndrew Victor 1197daba5cc4SArtem B. Bityutskiy 1198daba5cc4SArtem B. Bityutskiy c->wbuf_pagesize = c->mtd->erasesize; 1199daba5cc4SArtem B. Bityutskiy 1200daba5cc4SArtem B. Bityutskiy /* Find a suitable c->sector_size 1201daba5cc4SArtem B. Bityutskiy * - Not too much sectors 1202daba5cc4SArtem B. Bityutskiy * - Sectors have to be at least 4 K + some bytes 1203daba5cc4SArtem B. Bityutskiy * - All known dataflashes have erase sizes of 528 or 1056 1204daba5cc4SArtem B. Bityutskiy * - we take at least 8 eraseblocks and want to have at least 8K size 1205daba5cc4SArtem B. Bityutskiy * - The concatenation should be a power of 2 1206daba5cc4SArtem B. Bityutskiy */ 1207daba5cc4SArtem B. Bityutskiy 1208daba5cc4SArtem B. Bityutskiy c->sector_size = 8 * c->mtd->erasesize; 1209daba5cc4SArtem B. Bityutskiy 1210daba5cc4SArtem B. Bityutskiy while (c->sector_size < 8192) { 1211daba5cc4SArtem B. Bityutskiy c->sector_size *= 2; 1212daba5cc4SArtem B. Bityutskiy } 1213daba5cc4SArtem B. Bityutskiy 1214daba5cc4SArtem B. Bityutskiy /* It may be necessary to adjust the flash size */ 1215daba5cc4SArtem B. Bityutskiy c->flash_size = c->mtd->size; 1216daba5cc4SArtem B. Bityutskiy 1217daba5cc4SArtem B. Bityutskiy if ((c->flash_size % c->sector_size) != 0) { 1218daba5cc4SArtem B. Bityutskiy c->flash_size = (c->flash_size / c->sector_size) * c->sector_size; 1219daba5cc4SArtem B. Bityutskiy printk(KERN_WARNING "JFFS2 flash size adjusted to %dKiB\n", c->flash_size); 1220daba5cc4SArtem B. Bityutskiy }; 1221daba5cc4SArtem B. Bityutskiy 1222daba5cc4SArtem B. Bityutskiy c->wbuf_ofs = 0xFFFFFFFF; 12238f15fd55SAndrew Victor c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 12248f15fd55SAndrew Victor if (!c->wbuf) 12258f15fd55SAndrew Victor return -ENOMEM; 12268f15fd55SAndrew Victor 1227daba5cc4SArtem B. Bityutskiy printk(KERN_INFO "JFFS2 write-buffering enabled buffer (%d) erasesize (%d)\n", c->wbuf_pagesize, c->sector_size); 12288f15fd55SAndrew Victor 12298f15fd55SAndrew Victor return 0; 12308f15fd55SAndrew Victor } 12318f15fd55SAndrew Victor 12328f15fd55SAndrew Victor void jffs2_dataflash_cleanup(struct jffs2_sb_info *c) { 12338f15fd55SAndrew Victor kfree(c->wbuf); 12348f15fd55SAndrew Victor } 12358f15fd55SAndrew Victor 123659da721aSNicolas Pitre int jffs2_nor_wbuf_flash_setup(struct jffs2_sb_info *c) { 1237c8b229deSJoern Engel /* Cleanmarker currently occupies whole programming regions, 1238c8b229deSJoern Engel * either one or 2 for 8Byte STMicro flashes. */ 1239c8b229deSJoern Engel c->cleanmarker_size = max(16u, c->mtd->writesize); 124059da721aSNicolas Pitre 124159da721aSNicolas Pitre /* Initialize write buffer */ 124259da721aSNicolas Pitre init_rwsem(&c->wbuf_sem); 124328318776SJoern Engel c->wbuf_pagesize = c->mtd->writesize; 124459da721aSNicolas Pitre c->wbuf_ofs = 0xFFFFFFFF; 124559da721aSNicolas Pitre 124659da721aSNicolas Pitre c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 124759da721aSNicolas Pitre if (!c->wbuf) 124859da721aSNicolas Pitre return -ENOMEM; 124959da721aSNicolas Pitre 125059da721aSNicolas Pitre return 0; 125159da721aSNicolas Pitre } 125259da721aSNicolas Pitre 125359da721aSNicolas Pitre void jffs2_nor_wbuf_flash_cleanup(struct jffs2_sb_info *c) { 125459da721aSNicolas Pitre kfree(c->wbuf); 125559da721aSNicolas Pitre } 1256