11da177e4SLinus Torvalds /* 21da177e4SLinus Torvalds * JFFS2 -- Journalling Flash File System, Version 2. 31da177e4SLinus Torvalds * 4c00c310eSDavid Woodhouse * Copyright © 2001-2007 Red Hat, Inc. 5c00c310eSDavid Woodhouse * Copyright © 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 * 121da177e4SLinus Torvalds */ 131da177e4SLinus Torvalds 141da177e4SLinus Torvalds #include <linux/kernel.h> 151da177e4SLinus Torvalds #include <linux/slab.h> 161da177e4SLinus Torvalds #include <linux/mtd/mtd.h> 171da177e4SLinus Torvalds #include <linux/crc32.h> 181da177e4SLinus Torvalds #include <linux/mtd/nand.h> 194e57b681STim Schmielau #include <linux/jiffies.h> 20914e2637SAl Viro #include <linux/sched.h> 214e57b681STim Schmielau 221da177e4SLinus Torvalds #include "nodelist.h" 231da177e4SLinus Torvalds 241da177e4SLinus Torvalds /* For testing write failures */ 251da177e4SLinus Torvalds #undef BREAKME 261da177e4SLinus Torvalds #undef BREAKMEHEADER 271da177e4SLinus Torvalds 281da177e4SLinus Torvalds #ifdef BREAKME 291da177e4SLinus Torvalds static unsigned char *brokenbuf; 301da177e4SLinus Torvalds #endif 311da177e4SLinus Torvalds 32daba5cc4SArtem B. Bityutskiy #define PAGE_DIV(x) ( ((unsigned long)(x) / (unsigned long)(c->wbuf_pagesize)) * (unsigned long)(c->wbuf_pagesize) ) 33daba5cc4SArtem B. Bityutskiy #define PAGE_MOD(x) ( (unsigned long)(x) % (unsigned long)(c->wbuf_pagesize) ) 34daba5cc4SArtem B. Bityutskiy 351da177e4SLinus Torvalds /* max. erase failures before we mark a block bad */ 361da177e4SLinus Torvalds #define MAX_ERASE_FAILURES 2 371da177e4SLinus Torvalds 381da177e4SLinus Torvalds struct jffs2_inodirty { 391da177e4SLinus Torvalds uint32_t ino; 401da177e4SLinus Torvalds struct jffs2_inodirty *next; 411da177e4SLinus Torvalds }; 421da177e4SLinus Torvalds 431da177e4SLinus Torvalds static struct jffs2_inodirty inodirty_nomem; 441da177e4SLinus Torvalds 451da177e4SLinus Torvalds static int jffs2_wbuf_pending_for_ino(struct jffs2_sb_info *c, uint32_t ino) 461da177e4SLinus Torvalds { 471da177e4SLinus Torvalds struct jffs2_inodirty *this = c->wbuf_inodes; 481da177e4SLinus Torvalds 491da177e4SLinus Torvalds /* If a malloc failed, consider _everything_ dirty */ 501da177e4SLinus Torvalds if (this == &inodirty_nomem) 511da177e4SLinus Torvalds return 1; 521da177e4SLinus Torvalds 531da177e4SLinus Torvalds /* If ino == 0, _any_ non-GC writes mean 'yes' */ 541da177e4SLinus Torvalds if (this && !ino) 551da177e4SLinus Torvalds return 1; 561da177e4SLinus Torvalds 571da177e4SLinus Torvalds /* Look to see if the inode in question is pending in the wbuf */ 581da177e4SLinus Torvalds while (this) { 591da177e4SLinus Torvalds if (this->ino == ino) 601da177e4SLinus Torvalds return 1; 611da177e4SLinus Torvalds this = this->next; 621da177e4SLinus Torvalds } 631da177e4SLinus Torvalds return 0; 641da177e4SLinus Torvalds } 651da177e4SLinus Torvalds 661da177e4SLinus Torvalds static void jffs2_clear_wbuf_ino_list(struct jffs2_sb_info *c) 671da177e4SLinus Torvalds { 681da177e4SLinus Torvalds struct jffs2_inodirty *this; 691da177e4SLinus Torvalds 701da177e4SLinus Torvalds this = c->wbuf_inodes; 711da177e4SLinus Torvalds 721da177e4SLinus Torvalds if (this != &inodirty_nomem) { 731da177e4SLinus Torvalds while (this) { 741da177e4SLinus Torvalds struct jffs2_inodirty *next = this->next; 751da177e4SLinus Torvalds kfree(this); 761da177e4SLinus Torvalds this = next; 771da177e4SLinus Torvalds } 781da177e4SLinus Torvalds } 791da177e4SLinus Torvalds c->wbuf_inodes = NULL; 801da177e4SLinus Torvalds } 811da177e4SLinus Torvalds 821da177e4SLinus Torvalds static void jffs2_wbuf_dirties_inode(struct jffs2_sb_info *c, uint32_t ino) 831da177e4SLinus Torvalds { 841da177e4SLinus Torvalds struct jffs2_inodirty *new; 851da177e4SLinus Torvalds 861da177e4SLinus Torvalds /* Mark the superblock dirty so that kupdated will flush... */ 874d952709SArtem B. Bityuckiy jffs2_erase_pending_trigger(c); 881da177e4SLinus Torvalds 891da177e4SLinus Torvalds if (jffs2_wbuf_pending_for_ino(c, ino)) 901da177e4SLinus Torvalds return; 911da177e4SLinus Torvalds 921da177e4SLinus Torvalds new = kmalloc(sizeof(*new), GFP_KERNEL); 931da177e4SLinus Torvalds if (!new) { 941da177e4SLinus Torvalds D1(printk(KERN_DEBUG "No memory to allocate inodirty. Fallback to all considered dirty\n")); 951da177e4SLinus Torvalds jffs2_clear_wbuf_ino_list(c); 961da177e4SLinus Torvalds c->wbuf_inodes = &inodirty_nomem; 971da177e4SLinus Torvalds return; 981da177e4SLinus Torvalds } 991da177e4SLinus Torvalds new->ino = ino; 1001da177e4SLinus Torvalds new->next = c->wbuf_inodes; 1011da177e4SLinus Torvalds c->wbuf_inodes = new; 1021da177e4SLinus Torvalds return; 1031da177e4SLinus Torvalds } 1041da177e4SLinus Torvalds 1051da177e4SLinus Torvalds static inline void jffs2_refile_wbuf_blocks(struct jffs2_sb_info *c) 1061da177e4SLinus Torvalds { 1071da177e4SLinus Torvalds struct list_head *this, *next; 1081da177e4SLinus Torvalds static int n; 1091da177e4SLinus Torvalds 1101da177e4SLinus Torvalds if (list_empty(&c->erasable_pending_wbuf_list)) 1111da177e4SLinus Torvalds return; 1121da177e4SLinus Torvalds 1131da177e4SLinus Torvalds list_for_each_safe(this, next, &c->erasable_pending_wbuf_list) { 1141da177e4SLinus Torvalds struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list); 1151da177e4SLinus Torvalds 1161da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Removing eraseblock at 0x%08x from erasable_pending_wbuf_list...\n", jeb->offset)); 1171da177e4SLinus Torvalds list_del(this); 1181da177e4SLinus Torvalds if ((jiffies + (n++)) & 127) { 1191da177e4SLinus Torvalds /* Most of the time, we just erase it immediately. Otherwise we 1201da177e4SLinus Torvalds spend ages scanning it on mount, etc. */ 1211da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n")); 1221da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erase_pending_list); 1231da177e4SLinus Torvalds c->nr_erasing_blocks++; 1241da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1251da177e4SLinus Torvalds } else { 1261da177e4SLinus Torvalds /* Sometimes, however, we leave it elsewhere so it doesn't get 1271da177e4SLinus Torvalds immediately reused, and we spread the load a bit. */ 1281da177e4SLinus Torvalds D1(printk(KERN_DEBUG "...and adding to erasable_list\n")); 1291da177e4SLinus Torvalds list_add_tail(&jeb->list, &c->erasable_list); 1301da177e4SLinus Torvalds } 1311da177e4SLinus Torvalds } 1321da177e4SLinus Torvalds } 1331da177e4SLinus Torvalds 1347f716cf3SEstelle Hammache #define REFILE_NOTEMPTY 0 1357f716cf3SEstelle Hammache #define REFILE_ANYWAY 1 1367f716cf3SEstelle Hammache 1377f716cf3SEstelle Hammache static void jffs2_block_refile(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int allow_empty) 1381da177e4SLinus Torvalds { 1391da177e4SLinus Torvalds D1(printk("About to refile bad block at %08x\n", jeb->offset)); 1401da177e4SLinus Torvalds 1411da177e4SLinus Torvalds /* File the existing block on the bad_used_list.... */ 1421da177e4SLinus Torvalds if (c->nextblock == jeb) 1431da177e4SLinus Torvalds c->nextblock = NULL; 1441da177e4SLinus Torvalds else /* Not sure this should ever happen... need more coffee */ 1451da177e4SLinus Torvalds list_del(&jeb->list); 1461da177e4SLinus Torvalds if (jeb->first_node) { 1471da177e4SLinus Torvalds D1(printk("Refiling block at %08x to bad_used_list\n", jeb->offset)); 1481da177e4SLinus Torvalds list_add(&jeb->list, &c->bad_used_list); 1491da177e4SLinus Torvalds } else { 1509b88f473SEstelle Hammache BUG_ON(allow_empty == REFILE_NOTEMPTY); 1511da177e4SLinus Torvalds /* It has to have had some nodes or we couldn't be here */ 1521da177e4SLinus Torvalds D1(printk("Refiling block at %08x to erase_pending_list\n", jeb->offset)); 1531da177e4SLinus Torvalds list_add(&jeb->list, &c->erase_pending_list); 1541da177e4SLinus Torvalds c->nr_erasing_blocks++; 1551da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 1561da177e4SLinus Torvalds } 1571da177e4SLinus Torvalds 1589bfeb691SDavid Woodhouse if (!jffs2_prealloc_raw_node_refs(c, jeb, 1)) { 1599bfeb691SDavid Woodhouse uint32_t oldfree = jeb->free_size; 1609bfeb691SDavid Woodhouse 1619bfeb691SDavid Woodhouse jffs2_link_node_ref(c, jeb, 1629bfeb691SDavid Woodhouse (jeb->offset+c->sector_size-oldfree) | REF_OBSOLETE, 1639bfeb691SDavid Woodhouse oldfree, NULL); 1649bfeb691SDavid Woodhouse /* convert to wasted */ 1659bfeb691SDavid Woodhouse c->wasted_size += oldfree; 1669bfeb691SDavid Woodhouse jeb->wasted_size += oldfree; 1679bfeb691SDavid Woodhouse c->dirty_size -= oldfree; 1689bfeb691SDavid Woodhouse jeb->dirty_size -= oldfree; 1699bfeb691SDavid Woodhouse } 1701da177e4SLinus Torvalds 171e0c8e42fSArtem B. Bityutskiy jffs2_dbg_dump_block_lists_nolock(c); 172e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c,jeb); 173e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 1741da177e4SLinus Torvalds } 1751da177e4SLinus Torvalds 1769bfeb691SDavid Woodhouse static struct jffs2_raw_node_ref **jffs2_incore_replace_raw(struct jffs2_sb_info *c, 1779bfeb691SDavid Woodhouse struct jffs2_inode_info *f, 1789bfeb691SDavid Woodhouse struct jffs2_raw_node_ref *raw, 1799bfeb691SDavid Woodhouse union jffs2_node_union *node) 1809bfeb691SDavid Woodhouse { 1819bfeb691SDavid Woodhouse struct jffs2_node_frag *frag; 1829bfeb691SDavid Woodhouse struct jffs2_full_dirent *fd; 1839bfeb691SDavid Woodhouse 1849bfeb691SDavid Woodhouse dbg_noderef("incore_replace_raw: node at %p is {%04x,%04x}\n", 1859bfeb691SDavid Woodhouse node, je16_to_cpu(node->u.magic), je16_to_cpu(node->u.nodetype)); 1869bfeb691SDavid Woodhouse 1879bfeb691SDavid Woodhouse BUG_ON(je16_to_cpu(node->u.magic) != 0x1985 && 1889bfeb691SDavid Woodhouse je16_to_cpu(node->u.magic) != 0); 1899bfeb691SDavid Woodhouse 1909bfeb691SDavid Woodhouse switch (je16_to_cpu(node->u.nodetype)) { 1919bfeb691SDavid Woodhouse case JFFS2_NODETYPE_INODE: 192ddc58bd6SDavid Woodhouse if (f->metadata && f->metadata->raw == raw) { 193ddc58bd6SDavid Woodhouse dbg_noderef("Will replace ->raw in f->metadata at %p\n", f->metadata); 194ddc58bd6SDavid Woodhouse return &f->metadata->raw; 195ddc58bd6SDavid Woodhouse } 1969bfeb691SDavid Woodhouse frag = jffs2_lookup_node_frag(&f->fragtree, je32_to_cpu(node->i.offset)); 1979bfeb691SDavid Woodhouse BUG_ON(!frag); 1989bfeb691SDavid Woodhouse /* Find a frag which refers to the full_dnode we want to modify */ 1999bfeb691SDavid Woodhouse while (!frag->node || frag->node->raw != raw) { 2009bfeb691SDavid Woodhouse frag = frag_next(frag); 2019bfeb691SDavid Woodhouse BUG_ON(!frag); 2029bfeb691SDavid Woodhouse } 2039bfeb691SDavid Woodhouse dbg_noderef("Will replace ->raw in full_dnode at %p\n", frag->node); 2049bfeb691SDavid Woodhouse return &frag->node->raw; 2059bfeb691SDavid Woodhouse 2069bfeb691SDavid Woodhouse case JFFS2_NODETYPE_DIRENT: 2079bfeb691SDavid Woodhouse for (fd = f->dents; fd; fd = fd->next) { 2089bfeb691SDavid Woodhouse if (fd->raw == raw) { 2099bfeb691SDavid Woodhouse dbg_noderef("Will replace ->raw in full_dirent at %p\n", fd); 2109bfeb691SDavid Woodhouse return &fd->raw; 2119bfeb691SDavid Woodhouse } 2129bfeb691SDavid Woodhouse } 2139bfeb691SDavid Woodhouse BUG(); 214ddc58bd6SDavid Woodhouse 2159bfeb691SDavid Woodhouse default: 2169bfeb691SDavid Woodhouse dbg_noderef("Don't care about replacing raw for nodetype %x\n", 2179bfeb691SDavid Woodhouse je16_to_cpu(node->u.nodetype)); 2189bfeb691SDavid Woodhouse break; 2199bfeb691SDavid Woodhouse } 2209bfeb691SDavid Woodhouse return NULL; 2219bfeb691SDavid Woodhouse } 2229bfeb691SDavid Woodhouse 2231da177e4SLinus Torvalds /* Recover from failure to write wbuf. Recover the nodes up to the 2241da177e4SLinus Torvalds * wbuf, not the one which we were starting to try to write. */ 2251da177e4SLinus Torvalds 2261da177e4SLinus Torvalds static void jffs2_wbuf_recover(struct jffs2_sb_info *c) 2271da177e4SLinus Torvalds { 2281da177e4SLinus Torvalds struct jffs2_eraseblock *jeb, *new_jeb; 2299bfeb691SDavid Woodhouse struct jffs2_raw_node_ref *raw, *next, *first_raw = NULL; 2301da177e4SLinus Torvalds size_t retlen; 2311da177e4SLinus Torvalds int ret; 2329bfeb691SDavid Woodhouse int nr_refile = 0; 2331da177e4SLinus Torvalds unsigned char *buf; 2341da177e4SLinus Torvalds uint32_t start, end, ofs, len; 2351da177e4SLinus Torvalds 236046b8b98SDavid Woodhouse jeb = &c->blocks[c->wbuf_ofs / c->sector_size]; 237046b8b98SDavid Woodhouse 2381da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 239180bfb31SVitaly Wool if (c->wbuf_ofs % c->mtd->erasesize) 2407f716cf3SEstelle Hammache jffs2_block_refile(c, jeb, REFILE_NOTEMPTY); 241180bfb31SVitaly Wool else 242180bfb31SVitaly Wool jffs2_block_refile(c, jeb, REFILE_ANYWAY); 2439bfeb691SDavid Woodhouse spin_unlock(&c->erase_completion_lock); 2449bfeb691SDavid Woodhouse 2459bfeb691SDavid Woodhouse BUG_ON(!ref_obsolete(jeb->last_node)); 2461da177e4SLinus Torvalds 2471da177e4SLinus Torvalds /* Find the first node to be recovered, by skipping over every 2481da177e4SLinus Torvalds node which ends before the wbuf starts, or which is obsolete. */ 2499bfeb691SDavid Woodhouse for (next = raw = jeb->first_node; next; raw = next) { 2509bfeb691SDavid Woodhouse next = ref_next(raw); 2519bfeb691SDavid Woodhouse 2529bfeb691SDavid Woodhouse if (ref_obsolete(raw) || 2539bfeb691SDavid Woodhouse (next && ref_offset(next) <= c->wbuf_ofs)) { 2549bfeb691SDavid Woodhouse dbg_noderef("Skipping node at 0x%08x(%d)-0x%08x which is either before 0x%08x or obsolete\n", 2559bfeb691SDavid Woodhouse ref_offset(raw), ref_flags(raw), 2569bfeb691SDavid Woodhouse (ref_offset(raw) + ref_totlen(c, jeb, raw)), 2579bfeb691SDavid Woodhouse c->wbuf_ofs); 2589bfeb691SDavid Woodhouse continue; 2599bfeb691SDavid Woodhouse } 2609bfeb691SDavid Woodhouse dbg_noderef("First node to be recovered is at 0x%08x(%d)-0x%08x\n", 2619bfeb691SDavid Woodhouse ref_offset(raw), ref_flags(raw), 2629bfeb691SDavid Woodhouse (ref_offset(raw) + ref_totlen(c, jeb, raw))); 2639bfeb691SDavid Woodhouse 2649bfeb691SDavid Woodhouse first_raw = raw; 2659bfeb691SDavid Woodhouse break; 2661da177e4SLinus Torvalds } 2671da177e4SLinus Torvalds 2689bfeb691SDavid Woodhouse if (!first_raw) { 2691da177e4SLinus Torvalds /* All nodes were obsolete. Nothing to recover. */ 2701da177e4SLinus Torvalds D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n")); 2719bfeb691SDavid Woodhouse c->wbuf_len = 0; 2721da177e4SLinus Torvalds return; 2731da177e4SLinus Torvalds } 2741da177e4SLinus Torvalds 2759bfeb691SDavid Woodhouse start = ref_offset(first_raw); 2769bfeb691SDavid Woodhouse end = ref_offset(jeb->last_node); 2779bfeb691SDavid Woodhouse nr_refile = 1; 2781da177e4SLinus Torvalds 2799bfeb691SDavid Woodhouse /* Count the number of refs which need to be copied */ 2809bfeb691SDavid Woodhouse while ((raw = ref_next(raw)) != jeb->last_node) 2819bfeb691SDavid Woodhouse nr_refile++; 2821da177e4SLinus Torvalds 2839bfeb691SDavid Woodhouse dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n", 2849bfeb691SDavid Woodhouse start, end, end - start, nr_refile); 2851da177e4SLinus Torvalds 2861da177e4SLinus Torvalds buf = NULL; 2871da177e4SLinus Torvalds if (start < c->wbuf_ofs) { 2881da177e4SLinus Torvalds /* First affected node was already partially written. 2891da177e4SLinus Torvalds * Attempt to reread the old data into our buffer. */ 2901da177e4SLinus Torvalds 2911da177e4SLinus Torvalds buf = kmalloc(end - start, GFP_KERNEL); 2921da177e4SLinus Torvalds if (!buf) { 2931da177e4SLinus Torvalds printk(KERN_CRIT "Malloc failure in wbuf recovery. Data loss ensues.\n"); 2941da177e4SLinus Torvalds 2951da177e4SLinus Torvalds goto read_failed; 2961da177e4SLinus Torvalds } 2971da177e4SLinus Torvalds 2981da177e4SLinus Torvalds /* Do the read... */ 2991da177e4SLinus Torvalds ret = c->mtd->read(c->mtd, start, c->wbuf_ofs - start, &retlen, buf); 3001da177e4SLinus Torvalds 3019a1fcdfdSThomas Gleixner /* ECC recovered ? */ 3029a1fcdfdSThomas Gleixner if ((ret == -EUCLEAN || ret == -EBADMSG) && 3039a1fcdfdSThomas Gleixner (retlen == c->wbuf_ofs - start)) 3041da177e4SLinus Torvalds ret = 0; 3059a1fcdfdSThomas Gleixner 3061da177e4SLinus Torvalds if (ret || retlen != c->wbuf_ofs - start) { 3071da177e4SLinus Torvalds printk(KERN_CRIT "Old data are already lost in wbuf recovery. Data loss ensues.\n"); 3081da177e4SLinus Torvalds 3091da177e4SLinus Torvalds kfree(buf); 3101da177e4SLinus Torvalds buf = NULL; 3111da177e4SLinus Torvalds read_failed: 3129bfeb691SDavid Woodhouse first_raw = ref_next(first_raw); 3139bfeb691SDavid Woodhouse nr_refile--; 3149bfeb691SDavid Woodhouse while (first_raw && ref_obsolete(first_raw)) { 3159bfeb691SDavid Woodhouse first_raw = ref_next(first_raw); 3169bfeb691SDavid Woodhouse nr_refile--; 3179bfeb691SDavid Woodhouse } 3189bfeb691SDavid Woodhouse 3191da177e4SLinus Torvalds /* If this was the only node to be recovered, give up */ 3209bfeb691SDavid Woodhouse if (!first_raw) { 3219bfeb691SDavid Woodhouse c->wbuf_len = 0; 3221da177e4SLinus Torvalds return; 3239bfeb691SDavid Woodhouse } 3241da177e4SLinus Torvalds 3251da177e4SLinus Torvalds /* It wasn't. Go on and try to recover nodes complete in the wbuf */ 3269bfeb691SDavid Woodhouse start = ref_offset(first_raw); 3279bfeb691SDavid Woodhouse dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n", 3289bfeb691SDavid Woodhouse start, end, end - start, nr_refile); 3299bfeb691SDavid Woodhouse 3301da177e4SLinus Torvalds } else { 3311da177e4SLinus Torvalds /* Read succeeded. Copy the remaining data from the wbuf */ 3321da177e4SLinus Torvalds memcpy(buf + (c->wbuf_ofs - start), c->wbuf, end - c->wbuf_ofs); 3331da177e4SLinus Torvalds } 3341da177e4SLinus Torvalds } 3351da177e4SLinus Torvalds /* OK... we're to rewrite (end-start) bytes of data from first_raw onwards. 3361da177e4SLinus Torvalds Either 'buf' contains the data, or we find it in the wbuf */ 3371da177e4SLinus Torvalds 3381da177e4SLinus Torvalds /* ... and get an allocation of space from a shiny new block instead */ 3399fe4854cSDavid Woodhouse ret = jffs2_reserve_space_gc(c, end-start, &len, JFFS2_SUMMARY_NOSUM_SIZE); 3401da177e4SLinus Torvalds if (ret) { 3411da177e4SLinus Torvalds printk(KERN_WARNING "Failed to allocate space for wbuf recovery. Data loss ensues.\n"); 3421da177e4SLinus Torvalds kfree(buf); 3431da177e4SLinus Torvalds return; 3441da177e4SLinus Torvalds } 3459bfeb691SDavid Woodhouse 3467f762ab2SAdrian Hunter /* The summary is not recovered, so it must be disabled for this erase block */ 3477f762ab2SAdrian Hunter jffs2_sum_disable_collecting(c->summary); 3487f762ab2SAdrian Hunter 3499bfeb691SDavid Woodhouse ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, nr_refile); 3509bfeb691SDavid Woodhouse if (ret) { 3519bfeb691SDavid Woodhouse printk(KERN_WARNING "Failed to allocate node refs for wbuf recovery. Data loss ensues.\n"); 3529bfeb691SDavid Woodhouse kfree(buf); 3539bfeb691SDavid Woodhouse return; 3549bfeb691SDavid Woodhouse } 3559bfeb691SDavid Woodhouse 3569fe4854cSDavid Woodhouse ofs = write_ofs(c); 3579fe4854cSDavid Woodhouse 3581da177e4SLinus Torvalds if (end-start >= c->wbuf_pagesize) { 3597f716cf3SEstelle Hammache /* Need to do another write immediately, but it's possible 3607f716cf3SEstelle Hammache that this is just because the wbuf itself is completely 3617f716cf3SEstelle Hammache full, and there's nothing earlier read back from the 3627f716cf3SEstelle Hammache flash. Hence 'buf' isn't necessarily what we're writing 3637f716cf3SEstelle Hammache from. */ 3647f716cf3SEstelle Hammache unsigned char *rewrite_buf = buf?:c->wbuf; 3651da177e4SLinus Torvalds uint32_t towrite = (end-start) - ((end-start)%c->wbuf_pagesize); 3661da177e4SLinus Torvalds 3671da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Write 0x%x bytes at 0x%08x in wbuf recover\n", 3681da177e4SLinus Torvalds towrite, ofs)); 3691da177e4SLinus Torvalds 3701da177e4SLinus Torvalds #ifdef BREAKMEHEADER 3711da177e4SLinus Torvalds static int breakme; 3721da177e4SLinus Torvalds if (breakme++ == 20) { 3731da177e4SLinus Torvalds printk(KERN_NOTICE "Faking write error at 0x%08x\n", ofs); 3741da177e4SLinus Torvalds breakme = 0; 3759223a456SThomas Gleixner c->mtd->write(c->mtd, ofs, towrite, &retlen, 3769223a456SThomas Gleixner brokenbuf); 3771da177e4SLinus Torvalds ret = -EIO; 3781da177e4SLinus Torvalds } else 3791da177e4SLinus Torvalds #endif 3809223a456SThomas Gleixner ret = c->mtd->write(c->mtd, ofs, towrite, &retlen, 3819223a456SThomas Gleixner rewrite_buf); 3821da177e4SLinus Torvalds 3831da177e4SLinus Torvalds if (ret || retlen != towrite) { 3841da177e4SLinus Torvalds /* Argh. We tried. Really we did. */ 3851da177e4SLinus Torvalds printk(KERN_CRIT "Recovery of wbuf failed due to a second write error\n"); 3861da177e4SLinus Torvalds kfree(buf); 3871da177e4SLinus Torvalds 3882f785402SDavid Woodhouse if (retlen) 3899bfeb691SDavid Woodhouse jffs2_add_physical_node_ref(c, ofs | REF_OBSOLETE, ref_totlen(c, jeb, first_raw), NULL); 3901da177e4SLinus Torvalds 3911da177e4SLinus Torvalds return; 3921da177e4SLinus Torvalds } 3931da177e4SLinus Torvalds printk(KERN_NOTICE "Recovery of wbuf succeeded to %08x\n", ofs); 3941da177e4SLinus Torvalds 3951da177e4SLinus Torvalds c->wbuf_len = (end - start) - towrite; 3961da177e4SLinus Torvalds c->wbuf_ofs = ofs + towrite; 3977f716cf3SEstelle Hammache memmove(c->wbuf, rewrite_buf + towrite, c->wbuf_len); 3981da177e4SLinus Torvalds /* Don't muck about with c->wbuf_inodes. False positives are harmless. */ 3991da177e4SLinus Torvalds } else { 4001da177e4SLinus Torvalds /* OK, now we're left with the dregs in whichever buffer we're using */ 4011da177e4SLinus Torvalds if (buf) { 4021da177e4SLinus Torvalds memcpy(c->wbuf, buf, end-start); 4031da177e4SLinus Torvalds } else { 4041da177e4SLinus Torvalds memmove(c->wbuf, c->wbuf + (start - c->wbuf_ofs), end - start); 4051da177e4SLinus Torvalds } 4061da177e4SLinus Torvalds c->wbuf_ofs = ofs; 4071da177e4SLinus Torvalds c->wbuf_len = end - start; 4081da177e4SLinus Torvalds } 4091da177e4SLinus Torvalds 4101da177e4SLinus Torvalds /* Now sort out the jffs2_raw_node_refs, moving them from the old to the next block */ 4111da177e4SLinus Torvalds new_jeb = &c->blocks[ofs / c->sector_size]; 4121da177e4SLinus Torvalds 4131da177e4SLinus Torvalds spin_lock(&c->erase_completion_lock); 4149bfeb691SDavid Woodhouse for (raw = first_raw; raw != jeb->last_node; raw = ref_next(raw)) { 4159bfeb691SDavid Woodhouse uint32_t rawlen = ref_totlen(c, jeb, raw); 4169bfeb691SDavid Woodhouse struct jffs2_inode_cache *ic; 4179bfeb691SDavid Woodhouse struct jffs2_raw_node_ref *new_ref; 4189bfeb691SDavid Woodhouse struct jffs2_raw_node_ref **adjust_ref = NULL; 4199bfeb691SDavid Woodhouse struct jffs2_inode_info *f = NULL; 4201da177e4SLinus Torvalds 4211da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Refiling block of %08x at %08x(%d) to %08x\n", 4229bfeb691SDavid Woodhouse rawlen, ref_offset(raw), ref_flags(raw), ofs)); 4231da177e4SLinus Torvalds 4249bfeb691SDavid Woodhouse ic = jffs2_raw_ref_to_ic(raw); 4259bfeb691SDavid Woodhouse 4269bfeb691SDavid Woodhouse /* Ick. This XATTR mess should be fixed shortly... */ 4279bfeb691SDavid Woodhouse if (ic && ic->class == RAWNODE_CLASS_XATTR_DATUM) { 4289bfeb691SDavid Woodhouse struct jffs2_xattr_datum *xd = (void *)ic; 4299bfeb691SDavid Woodhouse BUG_ON(xd->node != raw); 4309bfeb691SDavid Woodhouse adjust_ref = &xd->node; 4319bfeb691SDavid Woodhouse raw->next_in_ino = NULL; 4329bfeb691SDavid Woodhouse ic = NULL; 4339bfeb691SDavid Woodhouse } else if (ic && ic->class == RAWNODE_CLASS_XATTR_REF) { 4349bfeb691SDavid Woodhouse struct jffs2_xattr_datum *xr = (void *)ic; 4359bfeb691SDavid Woodhouse BUG_ON(xr->node != raw); 4369bfeb691SDavid Woodhouse adjust_ref = &xr->node; 4379bfeb691SDavid Woodhouse raw->next_in_ino = NULL; 4389bfeb691SDavid Woodhouse ic = NULL; 4399bfeb691SDavid Woodhouse } else if (ic && ic->class == RAWNODE_CLASS_INODE_CACHE) { 4409bfeb691SDavid Woodhouse struct jffs2_raw_node_ref **p = &ic->nodes; 4419bfeb691SDavid Woodhouse 4429bfeb691SDavid Woodhouse /* Remove the old node from the per-inode list */ 4439bfeb691SDavid Woodhouse while (*p && *p != (void *)ic) { 4449bfeb691SDavid Woodhouse if (*p == raw) { 4459bfeb691SDavid Woodhouse (*p) = (raw->next_in_ino); 4469bfeb691SDavid Woodhouse raw->next_in_ino = NULL; 4479bfeb691SDavid Woodhouse break; 4489bfeb691SDavid Woodhouse } 4499bfeb691SDavid Woodhouse p = &((*p)->next_in_ino); 4509bfeb691SDavid Woodhouse } 4519bfeb691SDavid Woodhouse 4529bfeb691SDavid Woodhouse if (ic->state == INO_STATE_PRESENT && !ref_obsolete(raw)) { 4539bfeb691SDavid Woodhouse /* If it's an in-core inode, then we have to adjust any 4549bfeb691SDavid Woodhouse full_dirent or full_dnode structure to point to the 4559bfeb691SDavid Woodhouse new version instead of the old */ 4569bfeb691SDavid Woodhouse f = jffs2_gc_fetch_inode(c, ic->ino, ic->nlink); 4579bfeb691SDavid Woodhouse if (IS_ERR(f)) { 4589bfeb691SDavid Woodhouse /* Should never happen; it _must_ be present */ 4599bfeb691SDavid Woodhouse JFFS2_ERROR("Failed to iget() ino #%u, err %ld\n", 4609bfeb691SDavid Woodhouse ic->ino, PTR_ERR(f)); 4619bfeb691SDavid Woodhouse BUG(); 4629bfeb691SDavid Woodhouse } 4639bfeb691SDavid Woodhouse /* We don't lock f->sem. There's a number of ways we could 4649bfeb691SDavid Woodhouse end up in here with it already being locked, and nobody's 4659bfeb691SDavid Woodhouse going to modify it on us anyway because we hold the 4669bfeb691SDavid Woodhouse alloc_sem. We're only changing one ->raw pointer too, 4679bfeb691SDavid Woodhouse which we can get away with without upsetting readers. */ 4689bfeb691SDavid Woodhouse adjust_ref = jffs2_incore_replace_raw(c, f, raw, 4699bfeb691SDavid Woodhouse (void *)(buf?:c->wbuf) + (ref_offset(raw) - start)); 4709bfeb691SDavid Woodhouse } else if (unlikely(ic->state != INO_STATE_PRESENT && 4719bfeb691SDavid Woodhouse ic->state != INO_STATE_CHECKEDABSENT && 4729bfeb691SDavid Woodhouse ic->state != INO_STATE_GC)) { 4739bfeb691SDavid Woodhouse JFFS2_ERROR("Inode #%u is in strange state %d!\n", ic->ino, ic->state); 4749bfeb691SDavid Woodhouse BUG(); 4759bfeb691SDavid Woodhouse } 4769bfeb691SDavid Woodhouse } 4779bfeb691SDavid Woodhouse 4789bfeb691SDavid Woodhouse new_ref = jffs2_link_node_ref(c, new_jeb, ofs | ref_flags(raw), rawlen, ic); 4799bfeb691SDavid Woodhouse 4809bfeb691SDavid Woodhouse if (adjust_ref) { 4819bfeb691SDavid Woodhouse BUG_ON(*adjust_ref != raw); 4829bfeb691SDavid Woodhouse *adjust_ref = new_ref; 4839bfeb691SDavid Woodhouse } 4849bfeb691SDavid Woodhouse if (f) 4859bfeb691SDavid Woodhouse jffs2_gc_release_inode(c, f); 4869bfeb691SDavid Woodhouse 4879bfeb691SDavid Woodhouse if (!ref_obsolete(raw)) { 4881da177e4SLinus Torvalds jeb->dirty_size += rawlen; 4891da177e4SLinus Torvalds jeb->used_size -= rawlen; 4901da177e4SLinus Torvalds c->dirty_size += rawlen; 4919bfeb691SDavid Woodhouse c->used_size -= rawlen; 4929bfeb691SDavid Woodhouse raw->flash_offset = ref_offset(raw) | REF_OBSOLETE; 4939bfeb691SDavid Woodhouse BUG_ON(raw->next_in_ino); 4941da177e4SLinus Torvalds } 4951da177e4SLinus Torvalds ofs += rawlen; 4961da177e4SLinus Torvalds } 4971da177e4SLinus Torvalds 4989bfeb691SDavid Woodhouse kfree(buf); 4999bfeb691SDavid Woodhouse 5001da177e4SLinus Torvalds /* Fix up the original jeb now it's on the bad_list */ 5019bfeb691SDavid Woodhouse if (first_raw == jeb->first_node) { 5021da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Failing block at %08x is now empty. Moving to erase_pending_list\n", jeb->offset)); 503f116629dSAkinobu Mita list_move(&jeb->list, &c->erase_pending_list); 5041da177e4SLinus Torvalds c->nr_erasing_blocks++; 5051da177e4SLinus Torvalds jffs2_erase_pending_trigger(c); 5061da177e4SLinus Torvalds } 5071da177e4SLinus Torvalds 508e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, jeb); 509e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, jeb); 5101da177e4SLinus Torvalds 511e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_sanity_check_nolock(c, new_jeb); 512e0c8e42fSArtem B. Bityutskiy jffs2_dbg_acct_paranoia_check_nolock(c, new_jeb); 5131da177e4SLinus Torvalds 5141da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 5151da177e4SLinus Torvalds 5169bfeb691SDavid Woodhouse D1(printk(KERN_DEBUG "wbuf recovery completed OK. wbuf_ofs 0x%08x, len 0x%x\n", c->wbuf_ofs, c->wbuf_len)); 5179bfeb691SDavid Woodhouse 5181da177e4SLinus Torvalds } 5191da177e4SLinus Torvalds 5201da177e4SLinus Torvalds /* Meaning of pad argument: 5211da177e4SLinus Torvalds 0: Do not pad. Probably pointless - we only ever use this when we can't pad anyway. 5221da177e4SLinus Torvalds 1: Pad, do not adjust nextblock free_size 5231da177e4SLinus Torvalds 2: Pad, adjust nextblock free_size 5241da177e4SLinus Torvalds */ 5251da177e4SLinus Torvalds #define NOPAD 0 5261da177e4SLinus Torvalds #define PAD_NOACCOUNT 1 5271da177e4SLinus Torvalds #define PAD_ACCOUNTING 2 5281da177e4SLinus Torvalds 5291da177e4SLinus Torvalds static int __jffs2_flush_wbuf(struct jffs2_sb_info *c, int pad) 5301da177e4SLinus Torvalds { 5319bfeb691SDavid Woodhouse struct jffs2_eraseblock *wbuf_jeb; 5321da177e4SLinus Torvalds int ret; 5331da177e4SLinus Torvalds size_t retlen; 5341da177e4SLinus Torvalds 5353be36675SAndrew Victor /* Nothing to do if not write-buffering the flash. In particular, we shouldn't 5361da177e4SLinus Torvalds del_timer() the timer we never initialised. */ 5373be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 5381da177e4SLinus Torvalds return 0; 5391da177e4SLinus Torvalds 5401da177e4SLinus Torvalds if (!down_trylock(&c->alloc_sem)) { 5411da177e4SLinus Torvalds up(&c->alloc_sem); 5421da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf() called with alloc_sem not locked!\n"); 5431da177e4SLinus Torvalds BUG(); 5441da177e4SLinus Torvalds } 5451da177e4SLinus Torvalds 5463be36675SAndrew Victor if (!c->wbuf_len) /* already checked c->wbuf above */ 5471da177e4SLinus Torvalds return 0; 5481da177e4SLinus Torvalds 5499bfeb691SDavid Woodhouse wbuf_jeb = &c->blocks[c->wbuf_ofs / c->sector_size]; 5509bfeb691SDavid Woodhouse if (jffs2_prealloc_raw_node_refs(c, wbuf_jeb, c->nextblock->allocated_refs + 1)) 5512f785402SDavid Woodhouse return -ENOMEM; 5522f785402SDavid Woodhouse 5531da177e4SLinus Torvalds /* claim remaining space on the page 5541da177e4SLinus Torvalds this happens, if we have a change to a new block, 5551da177e4SLinus Torvalds or if fsync forces us to flush the writebuffer. 5561da177e4SLinus Torvalds if we have a switch to next page, we will not have 5571da177e4SLinus Torvalds enough remaining space for this. 5581da177e4SLinus Torvalds */ 559daba5cc4SArtem B. Bityutskiy if (pad ) { 5601da177e4SLinus Torvalds c->wbuf_len = PAD(c->wbuf_len); 5611da177e4SLinus Torvalds 5621da177e4SLinus Torvalds /* Pad with JFFS2_DIRTY_BITMASK initially. this helps out ECC'd NOR 5631da177e4SLinus Torvalds with 8 byte page size */ 5641da177e4SLinus Torvalds memset(c->wbuf + c->wbuf_len, 0, c->wbuf_pagesize - c->wbuf_len); 5651da177e4SLinus Torvalds 5661da177e4SLinus Torvalds if ( c->wbuf_len + sizeof(struct jffs2_unknown_node) < c->wbuf_pagesize) { 5671da177e4SLinus Torvalds struct jffs2_unknown_node *padnode = (void *)(c->wbuf + c->wbuf_len); 5681da177e4SLinus Torvalds padnode->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK); 5691da177e4SLinus Torvalds padnode->nodetype = cpu_to_je16(JFFS2_NODETYPE_PADDING); 5701da177e4SLinus Torvalds padnode->totlen = cpu_to_je32(c->wbuf_pagesize - c->wbuf_len); 5711da177e4SLinus Torvalds padnode->hdr_crc = cpu_to_je32(crc32(0, padnode, sizeof(*padnode)-4)); 5721da177e4SLinus Torvalds } 5731da177e4SLinus Torvalds } 5741da177e4SLinus Torvalds /* else jffs2_flash_writev has actually filled in the rest of the 5751da177e4SLinus Torvalds buffer for us, and will deal with the node refs etc. later. */ 5761da177e4SLinus Torvalds 5771da177e4SLinus Torvalds #ifdef BREAKME 5781da177e4SLinus Torvalds static int breakme; 5791da177e4SLinus Torvalds if (breakme++ == 20) { 5801da177e4SLinus Torvalds printk(KERN_NOTICE "Faking write error at 0x%08x\n", c->wbuf_ofs); 5811da177e4SLinus Torvalds breakme = 0; 5829223a456SThomas Gleixner c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, 5839223a456SThomas Gleixner brokenbuf); 5841da177e4SLinus Torvalds ret = -EIO; 5851da177e4SLinus Torvalds } else 5861da177e4SLinus Torvalds #endif 5871da177e4SLinus Torvalds 5881da177e4SLinus Torvalds ret = c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf); 5891da177e4SLinus Torvalds 5901da177e4SLinus Torvalds if (ret || retlen != c->wbuf_pagesize) { 5911da177e4SLinus Torvalds if (ret) 5921da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_flush_wbuf(): Write failed with %d\n",ret); 5931da177e4SLinus Torvalds else { 5941da177e4SLinus Torvalds printk(KERN_WARNING "jffs2_flush_wbuf(): Write was short: %zd instead of %d\n", 5951da177e4SLinus Torvalds retlen, c->wbuf_pagesize); 5961da177e4SLinus Torvalds ret = -EIO; 5971da177e4SLinus Torvalds } 5981da177e4SLinus Torvalds 5991da177e4SLinus Torvalds jffs2_wbuf_recover(c); 6001da177e4SLinus Torvalds 6011da177e4SLinus Torvalds return ret; 6021da177e4SLinus Torvalds } 6031da177e4SLinus Torvalds 6041da177e4SLinus Torvalds /* Adjust free size of the block if we padded. */ 605daba5cc4SArtem B. Bityutskiy if (pad) { 6060bcc099dSDavid Woodhouse uint32_t waste = c->wbuf_pagesize - c->wbuf_len; 6071da177e4SLinus Torvalds 6081da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf() adjusting free_size of %sblock at %08x\n", 6099bfeb691SDavid Woodhouse (wbuf_jeb==c->nextblock)?"next":"", wbuf_jeb->offset)); 6101da177e4SLinus Torvalds 6111da177e4SLinus Torvalds /* wbuf_pagesize - wbuf_len is the amount of space that's to be 6121da177e4SLinus Torvalds padded. If there is less free space in the block than that, 6131da177e4SLinus Torvalds something screwed up */ 6149bfeb691SDavid Woodhouse if (wbuf_jeb->free_size < waste) { 6151da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf(): Accounting error. wbuf at 0x%08x has 0x%03x bytes, 0x%03x left.\n", 6160bcc099dSDavid Woodhouse c->wbuf_ofs, c->wbuf_len, waste); 6171da177e4SLinus Torvalds printk(KERN_CRIT "jffs2_flush_wbuf(): But free_size for block at 0x%08x is only 0x%08x\n", 6189bfeb691SDavid Woodhouse wbuf_jeb->offset, wbuf_jeb->free_size); 6191da177e4SLinus Torvalds BUG(); 6201da177e4SLinus Torvalds } 6210bcc099dSDavid Woodhouse 6220bcc099dSDavid Woodhouse spin_lock(&c->erase_completion_lock); 6230bcc099dSDavid Woodhouse 6249bfeb691SDavid Woodhouse jffs2_link_node_ref(c, wbuf_jeb, (c->wbuf_ofs + c->wbuf_len) | REF_OBSOLETE, waste, NULL); 6250bcc099dSDavid Woodhouse /* FIXME: that made it count as dirty. Convert to wasted */ 6269bfeb691SDavid Woodhouse wbuf_jeb->dirty_size -= waste; 6270bcc099dSDavid Woodhouse c->dirty_size -= waste; 6289bfeb691SDavid Woodhouse wbuf_jeb->wasted_size += waste; 6290bcc099dSDavid Woodhouse c->wasted_size += waste; 6300bcc099dSDavid Woodhouse } else 6310bcc099dSDavid Woodhouse spin_lock(&c->erase_completion_lock); 6321da177e4SLinus Torvalds 6331da177e4SLinus Torvalds /* Stick any now-obsoleted blocks on the erase_pending_list */ 6341da177e4SLinus Torvalds jffs2_refile_wbuf_blocks(c); 6351da177e4SLinus Torvalds jffs2_clear_wbuf_ino_list(c); 6361da177e4SLinus Torvalds spin_unlock(&c->erase_completion_lock); 6371da177e4SLinus Torvalds 6381da177e4SLinus Torvalds memset(c->wbuf,0xff,c->wbuf_pagesize); 6391da177e4SLinus Torvalds /* adjust write buffer offset, else we get a non contiguous write bug */ 6401da177e4SLinus Torvalds c->wbuf_ofs += c->wbuf_pagesize; 6411da177e4SLinus Torvalds c->wbuf_len = 0; 6421da177e4SLinus Torvalds return 0; 6431da177e4SLinus Torvalds } 6441da177e4SLinus Torvalds 6451da177e4SLinus Torvalds /* Trigger garbage collection to flush the write-buffer. 6461da177e4SLinus Torvalds If ino arg is zero, do it if _any_ real (i.e. not GC) writes are 6471da177e4SLinus Torvalds outstanding. If ino arg non-zero, do it only if a write for the 6481da177e4SLinus Torvalds given inode is outstanding. */ 6491da177e4SLinus Torvalds int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino) 6501da177e4SLinus Torvalds { 6511da177e4SLinus Torvalds uint32_t old_wbuf_ofs; 6521da177e4SLinus Torvalds uint32_t old_wbuf_len; 6531da177e4SLinus Torvalds int ret = 0; 6541da177e4SLinus Torvalds 6551da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() called for ino #%u...\n", ino)); 6561da177e4SLinus Torvalds 6578aee6ac1SDavid Woodhouse if (!c->wbuf) 6588aee6ac1SDavid Woodhouse return 0; 6598aee6ac1SDavid Woodhouse 6601da177e4SLinus Torvalds down(&c->alloc_sem); 6611da177e4SLinus Torvalds if (!jffs2_wbuf_pending_for_ino(c, ino)) { 6621da177e4SLinus Torvalds D1(printk(KERN_DEBUG "Ino #%d not pending in wbuf. Returning\n", ino)); 6631da177e4SLinus Torvalds up(&c->alloc_sem); 6641da177e4SLinus Torvalds return 0; 6651da177e4SLinus Torvalds } 6661da177e4SLinus Torvalds 6671da177e4SLinus Torvalds old_wbuf_ofs = c->wbuf_ofs; 6681da177e4SLinus Torvalds old_wbuf_len = c->wbuf_len; 6691da177e4SLinus Torvalds 6701da177e4SLinus Torvalds if (c->unchecked_size) { 6711da177e4SLinus Torvalds /* GC won't make any progress for a while */ 6721da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() padding. Not finished checking\n")); 6731da177e4SLinus Torvalds down_write(&c->wbuf_sem); 6741da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 6757f716cf3SEstelle Hammache /* retry flushing wbuf in case jffs2_wbuf_recover 6767f716cf3SEstelle Hammache left some data in the wbuf */ 6777f716cf3SEstelle Hammache if (ret) 6787f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 6791da177e4SLinus Torvalds up_write(&c->wbuf_sem); 6801da177e4SLinus Torvalds } else while (old_wbuf_len && 6811da177e4SLinus Torvalds old_wbuf_ofs == c->wbuf_ofs) { 6821da177e4SLinus Torvalds 6831da177e4SLinus Torvalds up(&c->alloc_sem); 6841da177e4SLinus Torvalds 6851da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() calls gc pass\n")); 6861da177e4SLinus Torvalds 6871da177e4SLinus Torvalds ret = jffs2_garbage_collect_pass(c); 6881da177e4SLinus Torvalds if (ret) { 6891da177e4SLinus Torvalds /* GC failed. Flush it with padding instead */ 6901da177e4SLinus Torvalds down(&c->alloc_sem); 6911da177e4SLinus Torvalds down_write(&c->wbuf_sem); 6921da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 6937f716cf3SEstelle Hammache /* retry flushing wbuf in case jffs2_wbuf_recover 6947f716cf3SEstelle Hammache left some data in the wbuf */ 6957f716cf3SEstelle Hammache if (ret) 6967f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING); 6971da177e4SLinus Torvalds up_write(&c->wbuf_sem); 6981da177e4SLinus Torvalds break; 6991da177e4SLinus Torvalds } 7001da177e4SLinus Torvalds down(&c->alloc_sem); 7011da177e4SLinus Torvalds } 7021da177e4SLinus Torvalds 7031da177e4SLinus Torvalds D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() ends...\n")); 7041da177e4SLinus Torvalds 7051da177e4SLinus Torvalds up(&c->alloc_sem); 7061da177e4SLinus Torvalds return ret; 7071da177e4SLinus Torvalds } 7081da177e4SLinus Torvalds 7091da177e4SLinus Torvalds /* Pad write-buffer to end and write it, wasting space. */ 7101da177e4SLinus Torvalds int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c) 7111da177e4SLinus Torvalds { 7121da177e4SLinus Torvalds int ret; 7131da177e4SLinus Torvalds 7148aee6ac1SDavid Woodhouse if (!c->wbuf) 7158aee6ac1SDavid Woodhouse return 0; 7168aee6ac1SDavid Woodhouse 7171da177e4SLinus Torvalds down_write(&c->wbuf_sem); 7181da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 7197f716cf3SEstelle Hammache /* retry - maybe wbuf recover left some data in wbuf. */ 7207f716cf3SEstelle Hammache if (ret) 7217f716cf3SEstelle Hammache ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 7221da177e4SLinus Torvalds up_write(&c->wbuf_sem); 7231da177e4SLinus Torvalds 7241da177e4SLinus Torvalds return ret; 7251da177e4SLinus Torvalds } 7261da177e4SLinus Torvalds 727dcb09328SThomas Gleixner static size_t jffs2_fill_wbuf(struct jffs2_sb_info *c, const uint8_t *buf, 728dcb09328SThomas Gleixner size_t len) 729dcb09328SThomas Gleixner { 730dcb09328SThomas Gleixner if (len && !c->wbuf_len && (len >= c->wbuf_pagesize)) 731dcb09328SThomas Gleixner return 0; 732dcb09328SThomas Gleixner 733dcb09328SThomas Gleixner if (len > (c->wbuf_pagesize - c->wbuf_len)) 734dcb09328SThomas Gleixner len = c->wbuf_pagesize - c->wbuf_len; 735dcb09328SThomas Gleixner memcpy(c->wbuf + c->wbuf_len, buf, len); 736dcb09328SThomas Gleixner c->wbuf_len += (uint32_t) len; 737dcb09328SThomas Gleixner return len; 738dcb09328SThomas Gleixner } 739dcb09328SThomas Gleixner 740dcb09328SThomas Gleixner int jffs2_flash_writev(struct jffs2_sb_info *c, const struct kvec *invecs, 741dcb09328SThomas Gleixner unsigned long count, loff_t to, size_t *retlen, 742dcb09328SThomas Gleixner uint32_t ino) 743dcb09328SThomas Gleixner { 744dcb09328SThomas Gleixner struct jffs2_eraseblock *jeb; 745dcb09328SThomas Gleixner size_t wbuf_retlen, donelen = 0; 746dcb09328SThomas Gleixner uint32_t outvec_to = to; 747dcb09328SThomas Gleixner int ret, invec; 748dcb09328SThomas Gleixner 749dcb09328SThomas Gleixner /* If not writebuffered flash, don't bother */ 7503be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 7511da177e4SLinus Torvalds return jffs2_flash_direct_writev(c, invecs, count, to, retlen); 7521da177e4SLinus Torvalds 7531da177e4SLinus Torvalds down_write(&c->wbuf_sem); 7541da177e4SLinus Torvalds 7551da177e4SLinus Torvalds /* If wbuf_ofs is not initialized, set it to target address */ 7561da177e4SLinus Torvalds if (c->wbuf_ofs == 0xFFFFFFFF) { 7571da177e4SLinus Torvalds c->wbuf_ofs = PAGE_DIV(to); 7581da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 7591da177e4SLinus Torvalds memset(c->wbuf,0xff,c->wbuf_pagesize); 7601da177e4SLinus Torvalds } 7611da177e4SLinus Torvalds 762dcb09328SThomas Gleixner /* 763dcb09328SThomas Gleixner * Sanity checks on target address. It's permitted to write 764dcb09328SThomas Gleixner * at PAD(c->wbuf_len+c->wbuf_ofs), and it's permitted to 765dcb09328SThomas Gleixner * write at the beginning of a new erase block. Anything else, 766dcb09328SThomas Gleixner * and you die. New block starts at xxx000c (0-b = block 767dcb09328SThomas Gleixner * header) 7681da177e4SLinus Torvalds */ 7693be36675SAndrew Victor if (SECTOR_ADDR(to) != SECTOR_ADDR(c->wbuf_ofs)) { 7701da177e4SLinus Torvalds /* It's a write to a new block */ 7711da177e4SLinus Torvalds if (c->wbuf_len) { 772dcb09328SThomas Gleixner D1(printk(KERN_DEBUG "jffs2_flash_writev() to 0x%lx " 773dcb09328SThomas Gleixner "causes flush of wbuf at 0x%08x\n", 774dcb09328SThomas Gleixner (unsigned long)to, c->wbuf_ofs)); 7751da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT); 776dcb09328SThomas Gleixner if (ret) 777dcb09328SThomas Gleixner goto outerr; 7781da177e4SLinus Torvalds } 7791da177e4SLinus Torvalds /* set pointer to new block */ 7801da177e4SLinus Torvalds c->wbuf_ofs = PAGE_DIV(to); 7811da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 7821da177e4SLinus Torvalds } 7831da177e4SLinus Torvalds 7841da177e4SLinus Torvalds if (to != PAD(c->wbuf_ofs + c->wbuf_len)) { 7851da177e4SLinus Torvalds /* We're not writing immediately after the writebuffer. Bad. */ 786dcb09328SThomas Gleixner printk(KERN_CRIT "jffs2_flash_writev(): Non-contiguous write " 787dcb09328SThomas Gleixner "to %08lx\n", (unsigned long)to); 7881da177e4SLinus Torvalds if (c->wbuf_len) 7891da177e4SLinus Torvalds printk(KERN_CRIT "wbuf was previously %08x-%08x\n", 7901da177e4SLinus Torvalds c->wbuf_ofs, c->wbuf_ofs+c->wbuf_len); 7911da177e4SLinus Torvalds BUG(); 7921da177e4SLinus Torvalds } 7931da177e4SLinus Torvalds 7941da177e4SLinus Torvalds /* adjust alignment offset */ 7951da177e4SLinus Torvalds if (c->wbuf_len != PAGE_MOD(to)) { 7961da177e4SLinus Torvalds c->wbuf_len = PAGE_MOD(to); 7971da177e4SLinus Torvalds /* take care of alignment to next page */ 798dcb09328SThomas Gleixner if (!c->wbuf_len) { 7991da177e4SLinus Torvalds c->wbuf_len = c->wbuf_pagesize; 8001da177e4SLinus Torvalds ret = __jffs2_flush_wbuf(c, NOPAD); 801dcb09328SThomas Gleixner if (ret) 802dcb09328SThomas Gleixner goto outerr; 8031da177e4SLinus Torvalds } 8041da177e4SLinus Torvalds } 8051da177e4SLinus Torvalds 806dcb09328SThomas Gleixner for (invec = 0; invec < count; invec++) { 807dcb09328SThomas Gleixner int vlen = invecs[invec].iov_len; 808dcb09328SThomas Gleixner uint8_t *v = invecs[invec].iov_base; 8091da177e4SLinus Torvalds 810dcb09328SThomas Gleixner wbuf_retlen = jffs2_fill_wbuf(c, v, vlen); 8111da177e4SLinus Torvalds 812dcb09328SThomas Gleixner if (c->wbuf_len == c->wbuf_pagesize) { 813dcb09328SThomas Gleixner ret = __jffs2_flush_wbuf(c, NOPAD); 814dcb09328SThomas Gleixner if (ret) 815dcb09328SThomas Gleixner goto outerr; 8161da177e4SLinus Torvalds } 817dcb09328SThomas Gleixner vlen -= wbuf_retlen; 818dcb09328SThomas Gleixner outvec_to += wbuf_retlen; 8191da177e4SLinus Torvalds donelen += wbuf_retlen; 820dcb09328SThomas Gleixner v += wbuf_retlen; 8211da177e4SLinus Torvalds 822dcb09328SThomas Gleixner if (vlen >= c->wbuf_pagesize) { 823dcb09328SThomas Gleixner ret = c->mtd->write(c->mtd, outvec_to, PAGE_DIV(vlen), 824dcb09328SThomas Gleixner &wbuf_retlen, v); 825dcb09328SThomas Gleixner if (ret < 0 || wbuf_retlen != PAGE_DIV(vlen)) 826dcb09328SThomas Gleixner goto outfile; 827dcb09328SThomas Gleixner 828dcb09328SThomas Gleixner vlen -= wbuf_retlen; 829dcb09328SThomas Gleixner outvec_to += wbuf_retlen; 830dcb09328SThomas Gleixner c->wbuf_ofs = outvec_to; 831dcb09328SThomas Gleixner donelen += wbuf_retlen; 832dcb09328SThomas Gleixner v += wbuf_retlen; 8331da177e4SLinus Torvalds } 8341da177e4SLinus Torvalds 835dcb09328SThomas Gleixner wbuf_retlen = jffs2_fill_wbuf(c, v, vlen); 836dcb09328SThomas Gleixner if (c->wbuf_len == c->wbuf_pagesize) { 837dcb09328SThomas Gleixner ret = __jffs2_flush_wbuf(c, NOPAD); 838dcb09328SThomas Gleixner if (ret) 839dcb09328SThomas Gleixner goto outerr; 8401da177e4SLinus Torvalds } 8411da177e4SLinus Torvalds 842dcb09328SThomas Gleixner outvec_to += wbuf_retlen; 843dcb09328SThomas Gleixner donelen += wbuf_retlen; 8441da177e4SLinus Torvalds } 8451da177e4SLinus Torvalds 846dcb09328SThomas Gleixner /* 847dcb09328SThomas Gleixner * If there's a remainder in the wbuf and it's a non-GC write, 848dcb09328SThomas Gleixner * remember that the wbuf affects this ino 849dcb09328SThomas Gleixner */ 8501da177e4SLinus Torvalds *retlen = donelen; 8511da177e4SLinus Torvalds 852e631ddbaSFerenc Havasi if (jffs2_sum_active()) { 853e631ddbaSFerenc Havasi int res = jffs2_sum_add_kvec(c, invecs, count, (uint32_t) to); 854e631ddbaSFerenc Havasi if (res) 855e631ddbaSFerenc Havasi return res; 856e631ddbaSFerenc Havasi } 857e631ddbaSFerenc Havasi 8581da177e4SLinus Torvalds if (c->wbuf_len && ino) 8591da177e4SLinus Torvalds jffs2_wbuf_dirties_inode(c, ino); 8601da177e4SLinus Torvalds 8611da177e4SLinus Torvalds ret = 0; 862dcb09328SThomas Gleixner up_write(&c->wbuf_sem); 863dcb09328SThomas Gleixner return ret; 8641da177e4SLinus Torvalds 865dcb09328SThomas Gleixner outfile: 866dcb09328SThomas Gleixner /* 867dcb09328SThomas Gleixner * At this point we have no problem, c->wbuf is empty. However 868dcb09328SThomas Gleixner * refile nextblock to avoid writing again to same address. 869dcb09328SThomas Gleixner */ 870dcb09328SThomas Gleixner 871dcb09328SThomas Gleixner spin_lock(&c->erase_completion_lock); 872dcb09328SThomas Gleixner 873dcb09328SThomas Gleixner jeb = &c->blocks[outvec_to / c->sector_size]; 874dcb09328SThomas Gleixner jffs2_block_refile(c, jeb, REFILE_ANYWAY); 875dcb09328SThomas Gleixner 876dcb09328SThomas Gleixner spin_unlock(&c->erase_completion_lock); 877dcb09328SThomas Gleixner 878dcb09328SThomas Gleixner outerr: 879dcb09328SThomas Gleixner *retlen = 0; 8801da177e4SLinus Torvalds up_write(&c->wbuf_sem); 8811da177e4SLinus Torvalds return ret; 8821da177e4SLinus Torvalds } 8831da177e4SLinus Torvalds 8841da177e4SLinus Torvalds /* 8851da177e4SLinus Torvalds * This is the entry for flash write. 8861da177e4SLinus Torvalds * Check, if we work on NAND FLASH, if so build an kvec and write it via vritev 8871da177e4SLinus Torvalds */ 8889bfeb691SDavid Woodhouse int jffs2_flash_write(struct jffs2_sb_info *c, loff_t ofs, size_t len, 8899bfeb691SDavid Woodhouse size_t *retlen, const u_char *buf) 8901da177e4SLinus Torvalds { 8911da177e4SLinus Torvalds struct kvec vecs[1]; 8921da177e4SLinus Torvalds 8933be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 894e631ddbaSFerenc Havasi return jffs2_flash_direct_write(c, ofs, len, retlen, buf); 8951da177e4SLinus Torvalds 8961da177e4SLinus Torvalds vecs[0].iov_base = (unsigned char *) buf; 8971da177e4SLinus Torvalds vecs[0].iov_len = len; 8981da177e4SLinus Torvalds return jffs2_flash_writev(c, vecs, 1, ofs, retlen, 0); 8991da177e4SLinus Torvalds } 9001da177e4SLinus Torvalds 9011da177e4SLinus Torvalds /* 9021da177e4SLinus Torvalds Handle readback from writebuffer and ECC failure return 9031da177e4SLinus Torvalds */ 9041da177e4SLinus Torvalds int jffs2_flash_read(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, u_char *buf) 9051da177e4SLinus Torvalds { 9061da177e4SLinus Torvalds loff_t orbf = 0, owbf = 0, lwbf = 0; 9071da177e4SLinus Torvalds int ret; 9081da177e4SLinus Torvalds 9093be36675SAndrew Victor if (!jffs2_is_writebuffered(c)) 9103be36675SAndrew Victor return c->mtd->read(c->mtd, ofs, len, retlen, buf); 9111da177e4SLinus Torvalds 9123be36675SAndrew Victor /* Read flash */ 913894214d1SArtem B. Bityuckiy down_read(&c->wbuf_sem); 9141da177e4SLinus Torvalds ret = c->mtd->read(c->mtd, ofs, len, retlen, buf); 9151da177e4SLinus Torvalds 9169a1fcdfdSThomas Gleixner if ( (ret == -EBADMSG || ret == -EUCLEAN) && (*retlen == len) ) { 9179a1fcdfdSThomas Gleixner if (ret == -EBADMSG) 9189a1fcdfdSThomas Gleixner printk(KERN_WARNING "mtd->read(0x%zx bytes from 0x%llx)" 9199a1fcdfdSThomas Gleixner " returned ECC error\n", len, ofs); 9201da177e4SLinus Torvalds /* 9219a1fcdfdSThomas Gleixner * We have the raw data without ECC correction in the buffer, 9229a1fcdfdSThomas Gleixner * maybe we are lucky and all data or parts are correct. We 9239a1fcdfdSThomas Gleixner * check the node. If data are corrupted node check will sort 9249a1fcdfdSThomas Gleixner * it out. We keep this block, it will fail on write or erase 9259a1fcdfdSThomas Gleixner * and the we mark it bad. Or should we do that now? But we 9269a1fcdfdSThomas Gleixner * should give him a chance. Maybe we had a system crash or 9279a1fcdfdSThomas Gleixner * power loss before the ecc write or a erase was completed. 9281da177e4SLinus Torvalds * So we return success. :) 9291da177e4SLinus Torvalds */ 9301da177e4SLinus Torvalds ret = 0; 9311da177e4SLinus Torvalds } 9321da177e4SLinus Torvalds 9331da177e4SLinus Torvalds /* if no writebuffer available or write buffer empty, return */ 9341da177e4SLinus Torvalds if (!c->wbuf_pagesize || !c->wbuf_len) 935894214d1SArtem B. Bityuckiy goto exit; 9361da177e4SLinus Torvalds 9371da177e4SLinus Torvalds /* if we read in a different block, return */ 9383be36675SAndrew Victor if (SECTOR_ADDR(ofs) != SECTOR_ADDR(c->wbuf_ofs)) 939894214d1SArtem B. Bityuckiy goto exit; 9401da177e4SLinus Torvalds 9411da177e4SLinus Torvalds if (ofs >= c->wbuf_ofs) { 9421da177e4SLinus Torvalds owbf = (ofs - c->wbuf_ofs); /* offset in write buffer */ 9431da177e4SLinus Torvalds if (owbf > c->wbuf_len) /* is read beyond write buffer ? */ 9441da177e4SLinus Torvalds goto exit; 9451da177e4SLinus Torvalds lwbf = c->wbuf_len - owbf; /* number of bytes to copy */ 9461da177e4SLinus Torvalds if (lwbf > len) 9471da177e4SLinus Torvalds lwbf = len; 9481da177e4SLinus Torvalds } else { 9491da177e4SLinus Torvalds orbf = (c->wbuf_ofs - ofs); /* offset in read buffer */ 9501da177e4SLinus Torvalds if (orbf > len) /* is write beyond write buffer ? */ 9511da177e4SLinus Torvalds goto exit; 9521da177e4SLinus Torvalds lwbf = len - orbf; /* number of bytes to copy */ 9531da177e4SLinus Torvalds if (lwbf > c->wbuf_len) 9541da177e4SLinus Torvalds lwbf = c->wbuf_len; 9551da177e4SLinus Torvalds } 9561da177e4SLinus Torvalds if (lwbf > 0) 9571da177e4SLinus Torvalds memcpy(buf+orbf,c->wbuf+owbf,lwbf); 9581da177e4SLinus Torvalds 9591da177e4SLinus Torvalds exit: 9601da177e4SLinus Torvalds up_read(&c->wbuf_sem); 9611da177e4SLinus Torvalds return ret; 9621da177e4SLinus Torvalds } 9631da177e4SLinus Torvalds 9648593fbc6SThomas Gleixner #define NR_OOB_SCAN_PAGES 4 9658593fbc6SThomas Gleixner 966a7a6ace1SArtem Bityutskiy /* For historical reasons we use only 12 bytes for OOB clean marker */ 967a7a6ace1SArtem Bityutskiy #define OOB_CM_SIZE 12 968a7a6ace1SArtem Bityutskiy 969a7a6ace1SArtem Bityutskiy static const struct jffs2_unknown_node oob_cleanmarker = 970a7a6ace1SArtem Bityutskiy { 971566865a2SDavid Woodhouse .magic = constant_cpu_to_je16(JFFS2_MAGIC_BITMASK), 972566865a2SDavid Woodhouse .nodetype = constant_cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER), 973566865a2SDavid Woodhouse .totlen = constant_cpu_to_je32(8) 974a7a6ace1SArtem Bityutskiy }; 975a7a6ace1SArtem Bityutskiy 9761da177e4SLinus Torvalds /* 977a7a6ace1SArtem Bityutskiy * Check, if the out of band area is empty. This function knows about the clean 978a7a6ace1SArtem Bityutskiy * marker and if it is present in OOB, treats the OOB as empty anyway. 9791da177e4SLinus Torvalds */ 9808593fbc6SThomas Gleixner int jffs2_check_oob_empty(struct jffs2_sb_info *c, 9818593fbc6SThomas Gleixner struct jffs2_eraseblock *jeb, int mode) 9821da177e4SLinus Torvalds { 983a7a6ace1SArtem Bityutskiy int i, ret; 984a7a6ace1SArtem Bityutskiy int cmlen = min_t(int, c->oobavail, OOB_CM_SIZE); 9858593fbc6SThomas Gleixner struct mtd_oob_ops ops; 9861da177e4SLinus Torvalds 987a7a6ace1SArtem Bityutskiy ops.mode = MTD_OOB_AUTO; 988a7a6ace1SArtem Bityutskiy ops.ooblen = NR_OOB_SCAN_PAGES * c->oobavail; 9898593fbc6SThomas Gleixner ops.oobbuf = c->oobbuf; 990a7a6ace1SArtem Bityutskiy ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0; 9918593fbc6SThomas Gleixner ops.datbuf = NULL; 9928593fbc6SThomas Gleixner 9938593fbc6SThomas Gleixner ret = c->mtd->read_oob(c->mtd, jeb->offset, &ops); 994a7a6ace1SArtem Bityutskiy if (ret || ops.oobretlen != ops.ooblen) { 9957be26bfbSAndrew Morton printk(KERN_ERR "cannot read OOB for EB at %08x, requested %zd" 9967be26bfbSAndrew Morton " bytes, read %zd bytes, error %d\n", 9977be26bfbSAndrew Morton jeb->offset, ops.ooblen, ops.oobretlen, ret); 998a7a6ace1SArtem Bityutskiy if (!ret) 999a7a6ace1SArtem Bityutskiy ret = -EIO; 10008593fbc6SThomas Gleixner return ret; 10011da177e4SLinus Torvalds } 10021da177e4SLinus Torvalds 1003a7a6ace1SArtem Bityutskiy for(i = 0; i < ops.ooblen; i++) { 1004a7a6ace1SArtem Bityutskiy if (mode && i < cmlen) 1005a7a6ace1SArtem Bityutskiy /* Yeah, we know about the cleanmarker */ 10061da177e4SLinus Torvalds continue; 10071da177e4SLinus Torvalds 10088593fbc6SThomas Gleixner if (ops.oobbuf[i] != 0xFF) { 10098593fbc6SThomas Gleixner D2(printk(KERN_DEBUG "Found %02x at %x in OOB for " 10108593fbc6SThomas Gleixner "%08x\n", ops.oobbuf[i], i, jeb->offset)); 10118593fbc6SThomas Gleixner return 1; 10121da177e4SLinus Torvalds } 10131da177e4SLinus Torvalds } 10141da177e4SLinus Torvalds 10158593fbc6SThomas Gleixner return 0; 10161da177e4SLinus Torvalds } 10171da177e4SLinus Torvalds 10181da177e4SLinus Torvalds /* 1019a7a6ace1SArtem Bityutskiy * Check for a valid cleanmarker. 1020a7a6ace1SArtem Bityutskiy * Returns: 0 if a valid cleanmarker was found 1021a7a6ace1SArtem Bityutskiy * 1 if no cleanmarker was found 1022a7a6ace1SArtem Bityutskiy * negative error code if an error occurred 10231da177e4SLinus Torvalds */ 10248593fbc6SThomas Gleixner int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c, 10258593fbc6SThomas Gleixner struct jffs2_eraseblock *jeb) 10261da177e4SLinus Torvalds { 10278593fbc6SThomas Gleixner struct mtd_oob_ops ops; 1028a7a6ace1SArtem Bityutskiy int ret, cmlen = min_t(int, c->oobavail, OOB_CM_SIZE); 10291da177e4SLinus Torvalds 1030a7a6ace1SArtem Bityutskiy ops.mode = MTD_OOB_AUTO; 1031a7a6ace1SArtem Bityutskiy ops.ooblen = cmlen; 10328593fbc6SThomas Gleixner ops.oobbuf = c->oobbuf; 1033a7a6ace1SArtem Bityutskiy ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0; 10348593fbc6SThomas Gleixner ops.datbuf = NULL; 10358593fbc6SThomas Gleixner 1036a7a6ace1SArtem Bityutskiy ret = c->mtd->read_oob(c->mtd, jeb->offset, &ops); 1037a7a6ace1SArtem Bityutskiy if (ret || ops.oobretlen != ops.ooblen) { 10387be26bfbSAndrew Morton printk(KERN_ERR "cannot read OOB for EB at %08x, requested %zd" 10397be26bfbSAndrew Morton " bytes, read %zd bytes, error %d\n", 10407be26bfbSAndrew Morton jeb->offset, ops.ooblen, ops.oobretlen, ret); 1041a7a6ace1SArtem Bityutskiy if (!ret) 1042a7a6ace1SArtem Bityutskiy ret = -EIO; 10431da177e4SLinus Torvalds return ret; 10441da177e4SLinus Torvalds } 10458593fbc6SThomas Gleixner 1046a7a6ace1SArtem Bityutskiy return !!memcmp(&oob_cleanmarker, c->oobbuf, cmlen); 10471da177e4SLinus Torvalds } 10481da177e4SLinus Torvalds 10498593fbc6SThomas Gleixner int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, 10508593fbc6SThomas Gleixner struct jffs2_eraseblock *jeb) 10511da177e4SLinus Torvalds { 10521da177e4SLinus Torvalds int ret; 10538593fbc6SThomas Gleixner struct mtd_oob_ops ops; 1054a7a6ace1SArtem Bityutskiy int cmlen = min_t(int, c->oobavail, OOB_CM_SIZE); 10551da177e4SLinus Torvalds 1056a7a6ace1SArtem Bityutskiy ops.mode = MTD_OOB_AUTO; 1057a7a6ace1SArtem Bityutskiy ops.ooblen = cmlen; 1058a7a6ace1SArtem Bityutskiy ops.oobbuf = (uint8_t *)&oob_cleanmarker; 1059a7a6ace1SArtem Bityutskiy ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0; 10608593fbc6SThomas Gleixner ops.datbuf = NULL; 10618593fbc6SThomas Gleixner 10628593fbc6SThomas Gleixner ret = c->mtd->write_oob(c->mtd, jeb->offset, &ops); 1063a7a6ace1SArtem Bityutskiy if (ret || ops.oobretlen != ops.ooblen) { 10647be26bfbSAndrew Morton printk(KERN_ERR "cannot write OOB for EB at %08x, requested %zd" 10657be26bfbSAndrew Morton " bytes, read %zd bytes, error %d\n", 10667be26bfbSAndrew Morton jeb->offset, ops.ooblen, ops.oobretlen, ret); 1067a7a6ace1SArtem Bityutskiy if (!ret) 1068a7a6ace1SArtem Bityutskiy ret = -EIO; 10691da177e4SLinus Torvalds return ret; 10701da177e4SLinus Torvalds } 1071a7a6ace1SArtem Bityutskiy 10721da177e4SLinus Torvalds return 0; 10731da177e4SLinus Torvalds } 10741da177e4SLinus Torvalds 10751da177e4SLinus Torvalds /* 10761da177e4SLinus Torvalds * On NAND we try to mark this block bad. If the block was erased more 10771da177e4SLinus Torvalds * than MAX_ERASE_FAILURES we mark it finaly bad. 10781da177e4SLinus Torvalds * Don't care about failures. This block remains on the erase-pending 10791da177e4SLinus Torvalds * or badblock list as long as nobody manipulates the flash with 10801da177e4SLinus Torvalds * a bootloader or something like that. 10811da177e4SLinus Torvalds */ 10821da177e4SLinus Torvalds 10831da177e4SLinus Torvalds int jffs2_write_nand_badblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset) 10841da177e4SLinus Torvalds { 10851da177e4SLinus Torvalds int ret; 10861da177e4SLinus Torvalds 10871da177e4SLinus Torvalds /* if the count is < max, we try to write the counter to the 2nd page oob area */ 10881da177e4SLinus Torvalds if( ++jeb->bad_count < MAX_ERASE_FAILURES) 10891da177e4SLinus Torvalds return 0; 10901da177e4SLinus Torvalds 10911da177e4SLinus Torvalds if (!c->mtd->block_markbad) 10921da177e4SLinus Torvalds return 1; // What else can we do? 10931da177e4SLinus Torvalds 10940feba829SArtem Bityutskiy printk(KERN_WARNING "JFFS2: marking eraseblock at %08x\n as bad", bad_offset); 10951da177e4SLinus Torvalds ret = c->mtd->block_markbad(c->mtd, bad_offset); 10961da177e4SLinus Torvalds 10971da177e4SLinus Torvalds if (ret) { 10981da177e4SLinus Torvalds D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Write failed for block at %08x: error %d\n", jeb->offset, ret)); 10991da177e4SLinus Torvalds return ret; 11001da177e4SLinus Torvalds } 11011da177e4SLinus Torvalds return 1; 11021da177e4SLinus Torvalds } 11031da177e4SLinus Torvalds 1104a7a6ace1SArtem Bityutskiy int jffs2_nand_flash_setup(struct jffs2_sb_info *c) 11051da177e4SLinus Torvalds { 11065bd34c09SThomas Gleixner struct nand_ecclayout *oinfo = c->mtd->ecclayout; 11071da177e4SLinus Torvalds 11081da177e4SLinus Torvalds if (!c->mtd->oobsize) 11091da177e4SLinus Torvalds return 0; 11101da177e4SLinus Torvalds 11111da177e4SLinus Torvalds /* Cleanmarker is out-of-band, so inline size zero */ 11121da177e4SLinus Torvalds c->cleanmarker_size = 0; 11131da177e4SLinus Torvalds 1114a7a6ace1SArtem Bityutskiy if (!oinfo || oinfo->oobavail == 0) { 1115a7a6ace1SArtem Bityutskiy printk(KERN_ERR "inconsistent device description\n"); 11161da177e4SLinus Torvalds return -EINVAL; 11171da177e4SLinus Torvalds } 11185bd34c09SThomas Gleixner 1119a7a6ace1SArtem Bityutskiy D1(printk(KERN_DEBUG "JFFS2 using OOB on NAND\n")); 11205bd34c09SThomas Gleixner 1121a7a6ace1SArtem Bityutskiy c->oobavail = oinfo->oobavail; 11221da177e4SLinus Torvalds 11231da177e4SLinus Torvalds /* Initialise write buffer */ 11241da177e4SLinus Torvalds init_rwsem(&c->wbuf_sem); 112528318776SJoern Engel c->wbuf_pagesize = c->mtd->writesize; 11261da177e4SLinus Torvalds c->wbuf_ofs = 0xFFFFFFFF; 11271da177e4SLinus Torvalds 11281da177e4SLinus Torvalds c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 11291da177e4SLinus Torvalds if (!c->wbuf) 11301da177e4SLinus Torvalds return -ENOMEM; 11311da177e4SLinus Torvalds 1132a7a6ace1SArtem Bityutskiy c->oobbuf = kmalloc(NR_OOB_SCAN_PAGES * c->oobavail, GFP_KERNEL); 1133a7a6ace1SArtem Bityutskiy if (!c->oobbuf) { 11341da177e4SLinus Torvalds kfree(c->wbuf); 11351da177e4SLinus Torvalds return -ENOMEM; 11361da177e4SLinus Torvalds } 1137a7a6ace1SArtem Bityutskiy 1138a7a6ace1SArtem Bityutskiy return 0; 11391da177e4SLinus Torvalds } 11401da177e4SLinus Torvalds 11411da177e4SLinus Torvalds void jffs2_nand_flash_cleanup(struct jffs2_sb_info *c) 11421da177e4SLinus Torvalds { 11431da177e4SLinus Torvalds kfree(c->wbuf); 11448593fbc6SThomas Gleixner kfree(c->oobbuf); 11451da177e4SLinus Torvalds } 11461da177e4SLinus Torvalds 11478f15fd55SAndrew Victor int jffs2_dataflash_setup(struct jffs2_sb_info *c) { 11488f15fd55SAndrew Victor c->cleanmarker_size = 0; /* No cleanmarkers needed */ 11498f15fd55SAndrew Victor 11508f15fd55SAndrew Victor /* Initialize write buffer */ 11518f15fd55SAndrew Victor init_rwsem(&c->wbuf_sem); 11528f15fd55SAndrew Victor 1153daba5cc4SArtem B. Bityutskiy 1154daba5cc4SArtem B. Bityutskiy c->wbuf_pagesize = c->mtd->erasesize; 1155daba5cc4SArtem B. Bityutskiy 1156daba5cc4SArtem B. Bityutskiy /* Find a suitable c->sector_size 1157daba5cc4SArtem B. Bityutskiy * - Not too much sectors 1158daba5cc4SArtem B. Bityutskiy * - Sectors have to be at least 4 K + some bytes 1159daba5cc4SArtem B. Bityutskiy * - All known dataflashes have erase sizes of 528 or 1056 1160daba5cc4SArtem B. Bityutskiy * - we take at least 8 eraseblocks and want to have at least 8K size 1161daba5cc4SArtem B. Bityutskiy * - The concatenation should be a power of 2 1162daba5cc4SArtem B. Bityutskiy */ 1163daba5cc4SArtem B. Bityutskiy 1164daba5cc4SArtem B. Bityutskiy c->sector_size = 8 * c->mtd->erasesize; 1165daba5cc4SArtem B. Bityutskiy 1166daba5cc4SArtem B. Bityutskiy while (c->sector_size < 8192) { 1167daba5cc4SArtem B. Bityutskiy c->sector_size *= 2; 1168daba5cc4SArtem B. Bityutskiy } 1169daba5cc4SArtem B. Bityutskiy 1170daba5cc4SArtem B. Bityutskiy /* It may be necessary to adjust the flash size */ 1171daba5cc4SArtem B. Bityutskiy c->flash_size = c->mtd->size; 1172daba5cc4SArtem B. Bityutskiy 1173daba5cc4SArtem B. Bityutskiy if ((c->flash_size % c->sector_size) != 0) { 1174daba5cc4SArtem B. Bityutskiy c->flash_size = (c->flash_size / c->sector_size) * c->sector_size; 1175daba5cc4SArtem B. Bityutskiy printk(KERN_WARNING "JFFS2 flash size adjusted to %dKiB\n", c->flash_size); 1176daba5cc4SArtem B. Bityutskiy }; 1177daba5cc4SArtem B. Bityutskiy 1178daba5cc4SArtem B. Bityutskiy c->wbuf_ofs = 0xFFFFFFFF; 11798f15fd55SAndrew Victor c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 11808f15fd55SAndrew Victor if (!c->wbuf) 11818f15fd55SAndrew Victor return -ENOMEM; 11828f15fd55SAndrew Victor 1183daba5cc4SArtem B. Bityutskiy printk(KERN_INFO "JFFS2 write-buffering enabled buffer (%d) erasesize (%d)\n", c->wbuf_pagesize, c->sector_size); 11848f15fd55SAndrew Victor 11858f15fd55SAndrew Victor return 0; 11868f15fd55SAndrew Victor } 11878f15fd55SAndrew Victor 11888f15fd55SAndrew Victor void jffs2_dataflash_cleanup(struct jffs2_sb_info *c) { 11898f15fd55SAndrew Victor kfree(c->wbuf); 11908f15fd55SAndrew Victor } 11918f15fd55SAndrew Victor 119259da721aSNicolas Pitre int jffs2_nor_wbuf_flash_setup(struct jffs2_sb_info *c) { 1193c8b229deSJoern Engel /* Cleanmarker currently occupies whole programming regions, 1194c8b229deSJoern Engel * either one or 2 for 8Byte STMicro flashes. */ 1195c8b229deSJoern Engel c->cleanmarker_size = max(16u, c->mtd->writesize); 119659da721aSNicolas Pitre 119759da721aSNicolas Pitre /* Initialize write buffer */ 119859da721aSNicolas Pitre init_rwsem(&c->wbuf_sem); 119928318776SJoern Engel c->wbuf_pagesize = c->mtd->writesize; 120059da721aSNicolas Pitre c->wbuf_ofs = 0xFFFFFFFF; 120159da721aSNicolas Pitre 120259da721aSNicolas Pitre c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL); 120359da721aSNicolas Pitre if (!c->wbuf) 120459da721aSNicolas Pitre return -ENOMEM; 120559da721aSNicolas Pitre 120659da721aSNicolas Pitre return 0; 120759da721aSNicolas Pitre } 120859da721aSNicolas Pitre 120959da721aSNicolas Pitre void jffs2_nor_wbuf_flash_cleanup(struct jffs2_sb_info *c) { 121059da721aSNicolas Pitre kfree(c->wbuf); 121159da721aSNicolas Pitre } 1212