blob: 0d7abb260489e603a19755f40fd3a9b9336fe727 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * JFFS2 -- Journalling Flash File System, Version 2.
3 *
4 * Copyright (C) 2001-2003 Red Hat, Inc.
5 * Copyright (C) 2004 Thomas Gleixner <tglx@linutronix.de>
6 *
7 * Created by David Woodhouse <dwmw2@infradead.org>
8 * Modified debugged and enhanced by Thomas Gleixner <tglx@linutronix.de>
9 *
10 * For licensing information, see the file 'LICENCE' in this directory.
11 *
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +010012 * $Id: wbuf.c,v 1.100 2005/09/30 13:59:13 dedekind Exp $
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
14 */
15
16#include <linux/kernel.h>
17#include <linux/slab.h>
18#include <linux/mtd/mtd.h>
19#include <linux/crc32.h>
20#include <linux/mtd/nand.h>
Tim Schmielau4e57b682005-10-30 15:03:48 -080021#include <linux/jiffies.h>
22
Linus Torvalds1da177e2005-04-16 15:20:36 -070023#include "nodelist.h"
24
25/* For testing write failures */
26#undef BREAKME
27#undef BREAKMEHEADER
28
29#ifdef BREAKME
30static unsigned char *brokenbuf;
31#endif
32
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +010033#define PAGE_DIV(x) ( ((unsigned long)(x) / (unsigned long)(c->wbuf_pagesize)) * (unsigned long)(c->wbuf_pagesize) )
34#define PAGE_MOD(x) ( (unsigned long)(x) % (unsigned long)(c->wbuf_pagesize) )
35
Linus Torvalds1da177e2005-04-16 15:20:36 -070036/* max. erase failures before we mark a block bad */
37#define MAX_ERASE_FAILURES 2
38
Linus Torvalds1da177e2005-04-16 15:20:36 -070039struct jffs2_inodirty {
40 uint32_t ino;
41 struct jffs2_inodirty *next;
42};
43
44static struct jffs2_inodirty inodirty_nomem;
45
46static int jffs2_wbuf_pending_for_ino(struct jffs2_sb_info *c, uint32_t ino)
47{
48 struct jffs2_inodirty *this = c->wbuf_inodes;
49
50 /* If a malloc failed, consider _everything_ dirty */
51 if (this == &inodirty_nomem)
52 return 1;
53
54 /* If ino == 0, _any_ non-GC writes mean 'yes' */
55 if (this && !ino)
56 return 1;
57
58 /* Look to see if the inode in question is pending in the wbuf */
59 while (this) {
60 if (this->ino == ino)
61 return 1;
62 this = this->next;
63 }
64 return 0;
65}
66
67static void jffs2_clear_wbuf_ino_list(struct jffs2_sb_info *c)
68{
69 struct jffs2_inodirty *this;
70
71 this = c->wbuf_inodes;
72
73 if (this != &inodirty_nomem) {
74 while (this) {
75 struct jffs2_inodirty *next = this->next;
76 kfree(this);
77 this = next;
78 }
79 }
80 c->wbuf_inodes = NULL;
81}
82
83static void jffs2_wbuf_dirties_inode(struct jffs2_sb_info *c, uint32_t ino)
84{
85 struct jffs2_inodirty *new;
86
87 /* Mark the superblock dirty so that kupdated will flush... */
Artem B. Bityuckiy4d952702005-03-18 09:58:09 +000088 jffs2_erase_pending_trigger(c);
Linus Torvalds1da177e2005-04-16 15:20:36 -070089
90 if (jffs2_wbuf_pending_for_ino(c, ino))
91 return;
92
93 new = kmalloc(sizeof(*new), GFP_KERNEL);
94 if (!new) {
95 D1(printk(KERN_DEBUG "No memory to allocate inodirty. Fallback to all considered dirty\n"));
96 jffs2_clear_wbuf_ino_list(c);
97 c->wbuf_inodes = &inodirty_nomem;
98 return;
99 }
100 new->ino = ino;
101 new->next = c->wbuf_inodes;
102 c->wbuf_inodes = new;
103 return;
104}
105
106static inline void jffs2_refile_wbuf_blocks(struct jffs2_sb_info *c)
107{
108 struct list_head *this, *next;
109 static int n;
110
111 if (list_empty(&c->erasable_pending_wbuf_list))
112 return;
113
114 list_for_each_safe(this, next, &c->erasable_pending_wbuf_list) {
115 struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
116
117 D1(printk(KERN_DEBUG "Removing eraseblock at 0x%08x from erasable_pending_wbuf_list...\n", jeb->offset));
118 list_del(this);
119 if ((jiffies + (n++)) & 127) {
120 /* Most of the time, we just erase it immediately. Otherwise we
121 spend ages scanning it on mount, etc. */
122 D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n"));
123 list_add_tail(&jeb->list, &c->erase_pending_list);
124 c->nr_erasing_blocks++;
125 jffs2_erase_pending_trigger(c);
126 } else {
127 /* Sometimes, however, we leave it elsewhere so it doesn't get
128 immediately reused, and we spread the load a bit. */
129 D1(printk(KERN_DEBUG "...and adding to erasable_list\n"));
130 list_add_tail(&jeb->list, &c->erasable_list);
131 }
132 }
133}
134
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000135#define REFILE_NOTEMPTY 0
136#define REFILE_ANYWAY 1
137
138static void jffs2_block_refile(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int allow_empty)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139{
140 D1(printk("About to refile bad block at %08x\n", jeb->offset));
141
Linus Torvalds1da177e2005-04-16 15:20:36 -0700142 /* File the existing block on the bad_used_list.... */
143 if (c->nextblock == jeb)
144 c->nextblock = NULL;
145 else /* Not sure this should ever happen... need more coffee */
146 list_del(&jeb->list);
147 if (jeb->first_node) {
148 D1(printk("Refiling block at %08x to bad_used_list\n", jeb->offset));
149 list_add(&jeb->list, &c->bad_used_list);
150 } else {
Estelle Hammache9b88f472005-01-28 18:53:05 +0000151 BUG_ON(allow_empty == REFILE_NOTEMPTY);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152 /* It has to have had some nodes or we couldn't be here */
153 D1(printk("Refiling block at %08x to erase_pending_list\n", jeb->offset));
154 list_add(&jeb->list, &c->erase_pending_list);
155 c->nr_erasing_blocks++;
156 jffs2_erase_pending_trigger(c);
157 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700158
159 /* Adjust its size counts accordingly */
160 c->wasted_size += jeb->free_size;
161 c->free_size -= jeb->free_size;
162 jeb->wasted_size += jeb->free_size;
163 jeb->free_size = 0;
164
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100165 jffs2_dbg_dump_block_lists_nolock(c);
166 jffs2_dbg_acct_sanity_check_nolock(c,jeb);
167 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700168}
169
170/* Recover from failure to write wbuf. Recover the nodes up to the
171 * wbuf, not the one which we were starting to try to write. */
172
173static void jffs2_wbuf_recover(struct jffs2_sb_info *c)
174{
175 struct jffs2_eraseblock *jeb, *new_jeb;
176 struct jffs2_raw_node_ref **first_raw, **raw;
177 size_t retlen;
178 int ret;
179 unsigned char *buf;
180 uint32_t start, end, ofs, len;
181
David Woodhouse2f785402006-05-24 02:04:45 +0100182 if (jffs2_prealloc_raw_node_refs(c, c->reserved_refs + 1))
183 return;
184
Linus Torvalds1da177e2005-04-16 15:20:36 -0700185 spin_lock(&c->erase_completion_lock);
186
187 jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
188
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000189 jffs2_block_refile(c, jeb, REFILE_NOTEMPTY);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
191 /* Find the first node to be recovered, by skipping over every
192 node which ends before the wbuf starts, or which is obsolete. */
193 first_raw = &jeb->first_node;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000194 while (*first_raw &&
Linus Torvalds1da177e2005-04-16 15:20:36 -0700195 (ref_obsolete(*first_raw) ||
196 (ref_offset(*first_raw)+ref_totlen(c, jeb, *first_raw)) < c->wbuf_ofs)) {
197 D1(printk(KERN_DEBUG "Skipping node at 0x%08x(%d)-0x%08x which is either before 0x%08x or obsolete\n",
198 ref_offset(*first_raw), ref_flags(*first_raw),
199 (ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw)),
200 c->wbuf_ofs));
201 first_raw = &(*first_raw)->next_phys;
202 }
203
204 if (!*first_raw) {
205 /* All nodes were obsolete. Nothing to recover. */
206 D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n"));
207 spin_unlock(&c->erase_completion_lock);
208 return;
209 }
210
211 start = ref_offset(*first_raw);
212 end = ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw);
213
214 /* Find the last node to be recovered */
215 raw = first_raw;
216 while ((*raw)) {
217 if (!ref_obsolete(*raw))
218 end = ref_offset(*raw) + ref_totlen(c, jeb, *raw);
219
220 raw = &(*raw)->next_phys;
221 }
222 spin_unlock(&c->erase_completion_lock);
223
224 D1(printk(KERN_DEBUG "wbuf recover %08x-%08x\n", start, end));
225
226 buf = NULL;
227 if (start < c->wbuf_ofs) {
228 /* First affected node was already partially written.
229 * Attempt to reread the old data into our buffer. */
230
231 buf = kmalloc(end - start, GFP_KERNEL);
232 if (!buf) {
233 printk(KERN_CRIT "Malloc failure in wbuf recovery. Data loss ensues.\n");
234
235 goto read_failed;
236 }
237
238 /* Do the read... */
239 if (jffs2_cleanmarker_oob(c))
240 ret = c->mtd->read_ecc(c->mtd, start, c->wbuf_ofs - start, &retlen, buf, NULL, c->oobinfo);
241 else
242 ret = c->mtd->read(c->mtd, start, c->wbuf_ofs - start, &retlen, buf);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000243
Linus Torvalds1da177e2005-04-16 15:20:36 -0700244 if (ret == -EBADMSG && retlen == c->wbuf_ofs - start) {
245 /* ECC recovered */
246 ret = 0;
247 }
248 if (ret || retlen != c->wbuf_ofs - start) {
249 printk(KERN_CRIT "Old data are already lost in wbuf recovery. Data loss ensues.\n");
250
251 kfree(buf);
252 buf = NULL;
253 read_failed:
254 first_raw = &(*first_raw)->next_phys;
255 /* If this was the only node to be recovered, give up */
256 if (!(*first_raw))
257 return;
258
259 /* It wasn't. Go on and try to recover nodes complete in the wbuf */
260 start = ref_offset(*first_raw);
261 } else {
262 /* Read succeeded. Copy the remaining data from the wbuf */
263 memcpy(buf + (c->wbuf_ofs - start), c->wbuf, end - c->wbuf_ofs);
264 }
265 }
266 /* OK... we're to rewrite (end-start) bytes of data from first_raw onwards.
267 Either 'buf' contains the data, or we find it in the wbuf */
268
269
270 /* ... and get an allocation of space from a shiny new block instead */
David Woodhouse9fe48542006-05-23 00:38:06 +0100271 ret = jffs2_reserve_space_gc(c, end-start, &len, JFFS2_SUMMARY_NOSUM_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 if (ret) {
273 printk(KERN_WARNING "Failed to allocate space for wbuf recovery. Data loss ensues.\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000274 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700275 return;
276 }
David Woodhouse9fe48542006-05-23 00:38:06 +0100277 ofs = write_ofs(c);
278
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279 if (end-start >= c->wbuf_pagesize) {
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000280 /* Need to do another write immediately, but it's possible
Estelle Hammache9b88f472005-01-28 18:53:05 +0000281 that this is just because the wbuf itself is completely
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000282 full, and there's nothing earlier read back from the
283 flash. Hence 'buf' isn't necessarily what we're writing
Estelle Hammache9b88f472005-01-28 18:53:05 +0000284 from. */
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000285 unsigned char *rewrite_buf = buf?:c->wbuf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286 uint32_t towrite = (end-start) - ((end-start)%c->wbuf_pagesize);
287
288 D1(printk(KERN_DEBUG "Write 0x%x bytes at 0x%08x in wbuf recover\n",
289 towrite, ofs));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000290
Linus Torvalds1da177e2005-04-16 15:20:36 -0700291#ifdef BREAKMEHEADER
292 static int breakme;
293 if (breakme++ == 20) {
294 printk(KERN_NOTICE "Faking write error at 0x%08x\n", ofs);
295 breakme = 0;
296 c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen,
297 brokenbuf, NULL, c->oobinfo);
298 ret = -EIO;
299 } else
300#endif
301 if (jffs2_cleanmarker_oob(c))
302 ret = c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen,
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000303 rewrite_buf, NULL, c->oobinfo);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 else
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000305 ret = c->mtd->write(c->mtd, ofs, towrite, &retlen, rewrite_buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
307 if (ret || retlen != towrite) {
308 /* Argh. We tried. Really we did. */
309 printk(KERN_CRIT "Recovery of wbuf failed due to a second write error\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000310 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700311
David Woodhouse2f785402006-05-24 02:04:45 +0100312 if (retlen)
313 jffs2_add_physical_node_ref(c, ofs | REF_OBSOLETE, ref_totlen(c, jeb, *first_raw), NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700314
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 return;
316 }
317 printk(KERN_NOTICE "Recovery of wbuf succeeded to %08x\n", ofs);
318
319 c->wbuf_len = (end - start) - towrite;
320 c->wbuf_ofs = ofs + towrite;
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000321 memmove(c->wbuf, rewrite_buf + towrite, c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322 /* Don't muck about with c->wbuf_inodes. False positives are harmless. */
Jesper Juhlf99d49a2005-11-07 01:01:34 -0800323 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324 } else {
325 /* OK, now we're left with the dregs in whichever buffer we're using */
326 if (buf) {
327 memcpy(c->wbuf, buf, end-start);
328 kfree(buf);
329 } else {
330 memmove(c->wbuf, c->wbuf + (start - c->wbuf_ofs), end - start);
331 }
332 c->wbuf_ofs = ofs;
333 c->wbuf_len = end - start;
334 }
335
336 /* Now sort out the jffs2_raw_node_refs, moving them from the old to the next block */
337 new_jeb = &c->blocks[ofs / c->sector_size];
338
339 spin_lock(&c->erase_completion_lock);
340 if (new_jeb->first_node) {
341 /* Odd, but possible with ST flash later maybe */
342 new_jeb->last_node->next_phys = *first_raw;
343 } else {
344 new_jeb->first_node = *first_raw;
345 }
346
347 raw = first_raw;
348 while (*raw) {
349 uint32_t rawlen = ref_totlen(c, jeb, *raw);
350
351 D1(printk(KERN_DEBUG "Refiling block of %08x at %08x(%d) to %08x\n",
352 rawlen, ref_offset(*raw), ref_flags(*raw), ofs));
353
354 if (ref_obsolete(*raw)) {
355 /* Shouldn't really happen much */
356 new_jeb->dirty_size += rawlen;
357 new_jeb->free_size -= rawlen;
358 c->dirty_size += rawlen;
359 } else {
360 new_jeb->used_size += rawlen;
361 new_jeb->free_size -= rawlen;
362 jeb->dirty_size += rawlen;
363 jeb->used_size -= rawlen;
364 c->dirty_size += rawlen;
365 }
366 c->free_size -= rawlen;
367 (*raw)->flash_offset = ofs | ref_flags(*raw);
368 ofs += rawlen;
369 new_jeb->last_node = *raw;
370
371 raw = &(*raw)->next_phys;
372 }
373
374 /* Fix up the original jeb now it's on the bad_list */
375 *first_raw = NULL;
376 if (first_raw == &jeb->first_node) {
377 jeb->last_node = NULL;
378 D1(printk(KERN_DEBUG "Failing block at %08x is now empty. Moving to erase_pending_list\n", jeb->offset));
379 list_del(&jeb->list);
380 list_add(&jeb->list, &c->erase_pending_list);
381 c->nr_erasing_blocks++;
382 jffs2_erase_pending_trigger(c);
383 }
384 else
385 jeb->last_node = container_of(first_raw, struct jffs2_raw_node_ref, next_phys);
386
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100387 jffs2_dbg_acct_sanity_check_nolock(c, jeb);
388 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700389
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100390 jffs2_dbg_acct_sanity_check_nolock(c, new_jeb);
391 jffs2_dbg_acct_paranoia_check_nolock(c, new_jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700392
393 spin_unlock(&c->erase_completion_lock);
394
395 D1(printk(KERN_DEBUG "wbuf recovery completed OK\n"));
396}
397
398/* Meaning of pad argument:
399 0: Do not pad. Probably pointless - we only ever use this when we can't pad anyway.
400 1: Pad, do not adjust nextblock free_size
401 2: Pad, adjust nextblock free_size
402*/
403#define NOPAD 0
404#define PAD_NOACCOUNT 1
405#define PAD_ACCOUNTING 2
406
407static int __jffs2_flush_wbuf(struct jffs2_sb_info *c, int pad)
408{
409 int ret;
410 size_t retlen;
411
Andrew Victor3be36672005-02-09 09:09:05 +0000412 /* Nothing to do if not write-buffering the flash. In particular, we shouldn't
Linus Torvalds1da177e2005-04-16 15:20:36 -0700413 del_timer() the timer we never initialised. */
Andrew Victor3be36672005-02-09 09:09:05 +0000414 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700415 return 0;
416
417 if (!down_trylock(&c->alloc_sem)) {
418 up(&c->alloc_sem);
419 printk(KERN_CRIT "jffs2_flush_wbuf() called with alloc_sem not locked!\n");
420 BUG();
421 }
422
Andrew Victor3be36672005-02-09 09:09:05 +0000423 if (!c->wbuf_len) /* already checked c->wbuf above */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700424 return 0;
425
David Woodhouse2f785402006-05-24 02:04:45 +0100426 if (jffs2_prealloc_raw_node_refs(c, c->reserved_refs + 1))
427 return -ENOMEM;
428
Linus Torvalds1da177e2005-04-16 15:20:36 -0700429 /* claim remaining space on the page
430 this happens, if we have a change to a new block,
431 or if fsync forces us to flush the writebuffer.
432 if we have a switch to next page, we will not have
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000433 enough remaining space for this.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700434 */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100435 if (pad ) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 c->wbuf_len = PAD(c->wbuf_len);
437
438 /* Pad with JFFS2_DIRTY_BITMASK initially. this helps out ECC'd NOR
439 with 8 byte page size */
440 memset(c->wbuf + c->wbuf_len, 0, c->wbuf_pagesize - c->wbuf_len);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000441
Linus Torvalds1da177e2005-04-16 15:20:36 -0700442 if ( c->wbuf_len + sizeof(struct jffs2_unknown_node) < c->wbuf_pagesize) {
443 struct jffs2_unknown_node *padnode = (void *)(c->wbuf + c->wbuf_len);
444 padnode->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
445 padnode->nodetype = cpu_to_je16(JFFS2_NODETYPE_PADDING);
446 padnode->totlen = cpu_to_je32(c->wbuf_pagesize - c->wbuf_len);
447 padnode->hdr_crc = cpu_to_je32(crc32(0, padnode, sizeof(*padnode)-4));
448 }
449 }
450 /* else jffs2_flash_writev has actually filled in the rest of the
451 buffer for us, and will deal with the node refs etc. later. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000452
Linus Torvalds1da177e2005-04-16 15:20:36 -0700453#ifdef BREAKME
454 static int breakme;
455 if (breakme++ == 20) {
456 printk(KERN_NOTICE "Faking write error at 0x%08x\n", c->wbuf_ofs);
457 breakme = 0;
458 c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize,
459 &retlen, brokenbuf, NULL, c->oobinfo);
460 ret = -EIO;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000461 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700462#endif
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000463
Linus Torvalds1da177e2005-04-16 15:20:36 -0700464 if (jffs2_cleanmarker_oob(c))
465 ret = c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf, NULL, c->oobinfo);
466 else
467 ret = c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf);
468
469 if (ret || retlen != c->wbuf_pagesize) {
470 if (ret)
471 printk(KERN_WARNING "jffs2_flush_wbuf(): Write failed with %d\n",ret);
472 else {
473 printk(KERN_WARNING "jffs2_flush_wbuf(): Write was short: %zd instead of %d\n",
474 retlen, c->wbuf_pagesize);
475 ret = -EIO;
476 }
477
478 jffs2_wbuf_recover(c);
479
480 return ret;
481 }
482
Linus Torvalds1da177e2005-04-16 15:20:36 -0700483 /* Adjust free size of the block if we padded. */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100484 if (pad) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700485 struct jffs2_eraseblock *jeb;
David Woodhouse0bcc0992006-05-21 13:00:54 +0100486 uint32_t waste = c->wbuf_pagesize - c->wbuf_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700487
488 jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
489
490 D1(printk(KERN_DEBUG "jffs2_flush_wbuf() adjusting free_size of %sblock at %08x\n",
491 (jeb==c->nextblock)?"next":"", jeb->offset));
492
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000493 /* wbuf_pagesize - wbuf_len is the amount of space that's to be
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494 padded. If there is less free space in the block than that,
495 something screwed up */
David Woodhouse0bcc0992006-05-21 13:00:54 +0100496 if (jeb->free_size < waste) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700497 printk(KERN_CRIT "jffs2_flush_wbuf(): Accounting error. wbuf at 0x%08x has 0x%03x bytes, 0x%03x left.\n",
David Woodhouse0bcc0992006-05-21 13:00:54 +0100498 c->wbuf_ofs, c->wbuf_len, waste);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 printk(KERN_CRIT "jffs2_flush_wbuf(): But free_size for block at 0x%08x is only 0x%08x\n",
500 jeb->offset, jeb->free_size);
501 BUG();
502 }
David Woodhouse0bcc0992006-05-21 13:00:54 +0100503
504 spin_lock(&c->erase_completion_lock);
505
David Woodhouse2f785402006-05-24 02:04:45 +0100506 jffs2_link_node_ref(c, jeb, (c->wbuf_ofs + c->wbuf_len) | REF_OBSOLETE, waste, NULL);
David Woodhouse0bcc0992006-05-21 13:00:54 +0100507 /* FIXME: that made it count as dirty. Convert to wasted */
508 jeb->dirty_size -= waste;
509 c->dirty_size -= waste;
510 jeb->wasted_size += waste;
511 c->wasted_size += waste;
512 } else
513 spin_lock(&c->erase_completion_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700514
515 /* Stick any now-obsoleted blocks on the erase_pending_list */
516 jffs2_refile_wbuf_blocks(c);
517 jffs2_clear_wbuf_ino_list(c);
518 spin_unlock(&c->erase_completion_lock);
519
520 memset(c->wbuf,0xff,c->wbuf_pagesize);
521 /* adjust write buffer offset, else we get a non contiguous write bug */
522 c->wbuf_ofs += c->wbuf_pagesize;
523 c->wbuf_len = 0;
524 return 0;
525}
526
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000527/* Trigger garbage collection to flush the write-buffer.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528 If ino arg is zero, do it if _any_ real (i.e. not GC) writes are
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000529 outstanding. If ino arg non-zero, do it only if a write for the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530 given inode is outstanding. */
531int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino)
532{
533 uint32_t old_wbuf_ofs;
534 uint32_t old_wbuf_len;
535 int ret = 0;
536
537 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() called for ino #%u...\n", ino));
538
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000539 if (!c->wbuf)
540 return 0;
541
Linus Torvalds1da177e2005-04-16 15:20:36 -0700542 down(&c->alloc_sem);
543 if (!jffs2_wbuf_pending_for_ino(c, ino)) {
544 D1(printk(KERN_DEBUG "Ino #%d not pending in wbuf. Returning\n", ino));
545 up(&c->alloc_sem);
546 return 0;
547 }
548
549 old_wbuf_ofs = c->wbuf_ofs;
550 old_wbuf_len = c->wbuf_len;
551
552 if (c->unchecked_size) {
553 /* GC won't make any progress for a while */
554 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() padding. Not finished checking\n"));
555 down_write(&c->wbuf_sem);
556 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000557 /* retry flushing wbuf in case jffs2_wbuf_recover
558 left some data in the wbuf */
559 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000560 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700561 up_write(&c->wbuf_sem);
562 } else while (old_wbuf_len &&
563 old_wbuf_ofs == c->wbuf_ofs) {
564
565 up(&c->alloc_sem);
566
567 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() calls gc pass\n"));
568
569 ret = jffs2_garbage_collect_pass(c);
570 if (ret) {
571 /* GC failed. Flush it with padding instead */
572 down(&c->alloc_sem);
573 down_write(&c->wbuf_sem);
574 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000575 /* retry flushing wbuf in case jffs2_wbuf_recover
576 left some data in the wbuf */
577 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000578 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700579 up_write(&c->wbuf_sem);
580 break;
581 }
582 down(&c->alloc_sem);
583 }
584
585 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() ends...\n"));
586
587 up(&c->alloc_sem);
588 return ret;
589}
590
591/* Pad write-buffer to end and write it, wasting space. */
592int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c)
593{
594 int ret;
595
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000596 if (!c->wbuf)
597 return 0;
598
Linus Torvalds1da177e2005-04-16 15:20:36 -0700599 down_write(&c->wbuf_sem);
600 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000601 /* retry - maybe wbuf recover left some data in wbuf. */
602 if (ret)
603 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 up_write(&c->wbuf_sem);
605
606 return ret;
607}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200609static size_t jffs2_fill_wbuf(struct jffs2_sb_info *c, const uint8_t *buf,
610 size_t len)
611{
612 if (len && !c->wbuf_len && (len >= c->wbuf_pagesize))
613 return 0;
614
615 if (len > (c->wbuf_pagesize - c->wbuf_len))
616 len = c->wbuf_pagesize - c->wbuf_len;
617 memcpy(c->wbuf + c->wbuf_len, buf, len);
618 c->wbuf_len += (uint32_t) len;
619 return len;
620}
621
622int jffs2_flash_writev(struct jffs2_sb_info *c, const struct kvec *invecs,
623 unsigned long count, loff_t to, size_t *retlen,
624 uint32_t ino)
625{
626 struct jffs2_eraseblock *jeb;
627 size_t wbuf_retlen, donelen = 0;
628 uint32_t outvec_to = to;
629 int ret, invec;
630
631 /* If not writebuffered flash, don't bother */
Andrew Victor3be36672005-02-09 09:09:05 +0000632 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700633 return jffs2_flash_direct_writev(c, invecs, count, to, retlen);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000634
Linus Torvalds1da177e2005-04-16 15:20:36 -0700635 down_write(&c->wbuf_sem);
636
637 /* If wbuf_ofs is not initialized, set it to target address */
638 if (c->wbuf_ofs == 0xFFFFFFFF) {
639 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000640 c->wbuf_len = PAGE_MOD(to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 memset(c->wbuf,0xff,c->wbuf_pagesize);
642 }
643
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200644 /*
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200645 * Sanity checks on target address. It's permitted to write
646 * at PAD(c->wbuf_len+c->wbuf_ofs), and it's permitted to
647 * write at the beginning of a new erase block. Anything else,
648 * and you die. New block starts at xxx000c (0-b = block
649 * header)
650 */
Andrew Victor3be36672005-02-09 09:09:05 +0000651 if (SECTOR_ADDR(to) != SECTOR_ADDR(c->wbuf_ofs)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700652 /* It's a write to a new block */
653 if (c->wbuf_len) {
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200654 D1(printk(KERN_DEBUG "jffs2_flash_writev() to 0x%lx "
655 "causes flush of wbuf at 0x%08x\n",
656 (unsigned long)to, c->wbuf_ofs));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200658 if (ret)
659 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700660 }
661 /* set pointer to new block */
662 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000663 c->wbuf_len = PAGE_MOD(to);
664 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665
666 if (to != PAD(c->wbuf_ofs + c->wbuf_len)) {
667 /* We're not writing immediately after the writebuffer. Bad. */
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200668 printk(KERN_CRIT "jffs2_flash_writev(): Non-contiguous write "
669 "to %08lx\n", (unsigned long)to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670 if (c->wbuf_len)
671 printk(KERN_CRIT "wbuf was previously %08x-%08x\n",
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200672 c->wbuf_ofs, c->wbuf_ofs+c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673 BUG();
674 }
675
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200676 /* adjust alignment offset */
677 if (c->wbuf_len != PAGE_MOD(to)) {
678 c->wbuf_len = PAGE_MOD(to);
679 /* take care of alignment to next page */
680 if (!c->wbuf_len) {
681 c->wbuf_len = c->wbuf_pagesize;
682 ret = __jffs2_flush_wbuf(c, NOPAD);
683 if (ret)
684 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700685 }
686 }
687
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200688 for (invec = 0; invec < count; invec++) {
689 int vlen = invecs[invec].iov_len;
690 uint8_t *v = invecs[invec].iov_base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700691
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200692 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700693
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200694 if (c->wbuf_len == c->wbuf_pagesize) {
695 ret = __jffs2_flush_wbuf(c, NOPAD);
696 if (ret)
697 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698 }
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200699 vlen -= wbuf_retlen;
700 outvec_to += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700701 donelen += wbuf_retlen;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200702 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700703
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200704 if (vlen >= c->wbuf_pagesize) {
705 ret = c->mtd->write(c->mtd, outvec_to, PAGE_DIV(vlen),
706 &wbuf_retlen, v);
707 if (ret < 0 || wbuf_retlen != PAGE_DIV(vlen))
708 goto outfile;
709
710 vlen -= wbuf_retlen;
711 outvec_to += wbuf_retlen;
712 c->wbuf_ofs = outvec_to;
713 donelen += wbuf_retlen;
714 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715 }
716
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200717 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
718 if (c->wbuf_len == c->wbuf_pagesize) {
719 ret = __jffs2_flush_wbuf(c, NOPAD);
720 if (ret)
721 goto outerr;
722 }
723
724 outvec_to += wbuf_retlen;
725 donelen += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700726 }
727
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200728 /*
729 * If there's a remainder in the wbuf and it's a non-GC write,
730 * remember that the wbuf affects this ino
731 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700732 *retlen = donelen;
733
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100734 if (jffs2_sum_active()) {
735 int res = jffs2_sum_add_kvec(c, invecs, count, (uint32_t) to);
736 if (res)
737 return res;
738 }
739
Linus Torvalds1da177e2005-04-16 15:20:36 -0700740 if (c->wbuf_len && ino)
741 jffs2_wbuf_dirties_inode(c, ino);
742
743 ret = 0;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200744 up_write(&c->wbuf_sem);
745 return ret;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000746
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200747outfile:
748 /*
749 * At this point we have no problem, c->wbuf is empty. However
750 * refile nextblock to avoid writing again to same address.
751 */
752
753 spin_lock(&c->erase_completion_lock);
754
755 jeb = &c->blocks[outvec_to / c->sector_size];
756 jffs2_block_refile(c, jeb, REFILE_ANYWAY);
757
758 spin_unlock(&c->erase_completion_lock);
759
760outerr:
761 *retlen = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700762 up_write(&c->wbuf_sem);
763 return ret;
764}
765
766/*
767 * This is the entry for flash write.
768 * Check, if we work on NAND FLASH, if so build an kvec and write it via vritev
769*/
770int jffs2_flash_write(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, const u_char *buf)
771{
772 struct kvec vecs[1];
773
Andrew Victor3be36672005-02-09 09:09:05 +0000774 if (!jffs2_is_writebuffered(c))
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100775 return jffs2_flash_direct_write(c, ofs, len, retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700776
777 vecs[0].iov_base = (unsigned char *) buf;
778 vecs[0].iov_len = len;
779 return jffs2_flash_writev(c, vecs, 1, ofs, retlen, 0);
780}
781
782/*
783 Handle readback from writebuffer and ECC failure return
784*/
785int jffs2_flash_read(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, u_char *buf)
786{
787 loff_t orbf = 0, owbf = 0, lwbf = 0;
788 int ret;
789
Andrew Victor3be36672005-02-09 09:09:05 +0000790 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791 return c->mtd->read(c->mtd, ofs, len, retlen, buf);
792
Andrew Victor3be36672005-02-09 09:09:05 +0000793 /* Read flash */
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100794 down_read(&c->wbuf_sem);
Andrew Victor3be36672005-02-09 09:09:05 +0000795 if (jffs2_cleanmarker_oob(c))
796 ret = c->mtd->read_ecc(c->mtd, ofs, len, retlen, buf, NULL, c->oobinfo);
797 else
798 ret = c->mtd->read(c->mtd, ofs, len, retlen, buf);
799
800 if ( (ret == -EBADMSG) && (*retlen == len) ) {
801 printk(KERN_WARNING "mtd->read(0x%zx bytes from 0x%llx) returned ECC error\n",
802 len, ofs);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000803 /*
804 * We have the raw data without ECC correction in the buffer, maybe
Andrew Victor3be36672005-02-09 09:09:05 +0000805 * we are lucky and all data or parts are correct. We check the node.
806 * If data are corrupted node check will sort it out.
807 * We keep this block, it will fail on write or erase and the we
808 * mark it bad. Or should we do that now? But we should give him a chance.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000809 * Maybe we had a system crash or power loss before the ecc write or
Andrew Victor3be36672005-02-09 09:09:05 +0000810 * a erase was completed.
811 * So we return success. :)
812 */
813 ret = 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000814 }
Andrew Victor3be36672005-02-09 09:09:05 +0000815
Linus Torvalds1da177e2005-04-16 15:20:36 -0700816 /* if no writebuffer available or write buffer empty, return */
817 if (!c->wbuf_pagesize || !c->wbuf_len)
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100818 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819
820 /* if we read in a different block, return */
Andrew Victor3be36672005-02-09 09:09:05 +0000821 if (SECTOR_ADDR(ofs) != SECTOR_ADDR(c->wbuf_ofs))
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100822 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700823
824 if (ofs >= c->wbuf_ofs) {
825 owbf = (ofs - c->wbuf_ofs); /* offset in write buffer */
826 if (owbf > c->wbuf_len) /* is read beyond write buffer ? */
827 goto exit;
828 lwbf = c->wbuf_len - owbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000829 if (lwbf > len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700830 lwbf = len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000831 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700832 orbf = (c->wbuf_ofs - ofs); /* offset in read buffer */
833 if (orbf > len) /* is write beyond write buffer ? */
834 goto exit;
835 lwbf = len - orbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000836 if (lwbf > c->wbuf_len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700837 lwbf = c->wbuf_len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000838 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700839 if (lwbf > 0)
840 memcpy(buf+orbf,c->wbuf+owbf,lwbf);
841
842exit:
843 up_read(&c->wbuf_sem);
844 return ret;
845}
846
847/*
848 * Check, if the out of band area is empty
849 */
850int jffs2_check_oob_empty( struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int mode)
851{
852 unsigned char *buf;
853 int ret = 0;
854 int i,len,page;
855 size_t retlen;
856 int oob_size;
857
858 /* allocate a buffer for all oob data in this sector */
859 oob_size = c->mtd->oobsize;
860 len = 4 * oob_size;
861 buf = kmalloc(len, GFP_KERNEL);
862 if (!buf) {
863 printk(KERN_NOTICE "jffs2_check_oob_empty(): allocation of temporary data buffer for oob check failed\n");
864 return -ENOMEM;
865 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000866 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700867 * if mode = 0, we scan for a total empty oob area, else we have
868 * to take care of the cleanmarker in the first page of the block
869 */
870 ret = jffs2_flash_read_oob(c, jeb->offset, len , &retlen, buf);
871 if (ret) {
872 D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB failed %d for block at %08x\n", ret, jeb->offset));
873 goto out;
874 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000875
Linus Torvalds1da177e2005-04-16 15:20:36 -0700876 if (retlen < len) {
877 D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB return short read "
878 "(%zd bytes not %d) for block at %08x\n", retlen, len, jeb->offset));
879 ret = -EIO;
880 goto out;
881 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000882
Linus Torvalds1da177e2005-04-16 15:20:36 -0700883 /* Special check for first page */
884 for(i = 0; i < oob_size ; i++) {
885 /* Yeah, we know about the cleanmarker. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000886 if (mode && i >= c->fsdata_pos &&
Linus Torvalds1da177e2005-04-16 15:20:36 -0700887 i < c->fsdata_pos + c->fsdata_len)
888 continue;
889
890 if (buf[i] != 0xFF) {
891 D2(printk(KERN_DEBUG "Found %02x at %x in OOB for %08x\n",
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100892 buf[i], i, jeb->offset));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000893 ret = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700894 goto out;
895 }
896 }
897
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000898 /* we know, we are aligned :) */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700899 for (page = oob_size; page < len; page += sizeof(long)) {
900 unsigned long dat = *(unsigned long *)(&buf[page]);
901 if(dat != -1) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000902 ret = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700903 goto out;
904 }
905 }
906
907out:
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000908 kfree(buf);
909
Linus Torvalds1da177e2005-04-16 15:20:36 -0700910 return ret;
911}
912
913/*
914* Scan for a valid cleanmarker and for bad blocks
915* For virtual blocks (concatenated physical blocks) check the cleanmarker
916* only in the first page of the first physical block, but scan for bad blocks in all
917* physical blocks
918*/
919int jffs2_check_nand_cleanmarker (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
920{
921 struct jffs2_unknown_node n;
922 unsigned char buf[2 * NAND_MAX_OOBSIZE];
923 unsigned char *p;
924 int ret, i, cnt, retval = 0;
925 size_t retlen, offset;
926 int oob_size;
927
928 offset = jeb->offset;
929 oob_size = c->mtd->oobsize;
930
931 /* Loop through the physical blocks */
932 for (cnt = 0; cnt < (c->sector_size / c->mtd->erasesize); cnt++) {
933 /* Check first if the block is bad. */
934 if (c->mtd->block_isbad (c->mtd, offset)) {
935 D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Bad block at %08x\n", jeb->offset));
936 return 2;
937 }
938 /*
939 * We read oob data from page 0 and 1 of the block.
940 * page 0 contains cleanmarker and badblock info
941 * page 1 contains failure count of this block
942 */
943 ret = c->mtd->read_oob (c->mtd, offset, oob_size << 1, &retlen, buf);
944
945 if (ret) {
946 D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Read OOB failed %d for block at %08x\n", ret, jeb->offset));
947 return ret;
948 }
949 if (retlen < (oob_size << 1)) {
950 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));
951 return -EIO;
952 }
953
954 /* Check cleanmarker only on the first physical block */
955 if (!cnt) {
956 n.magic = cpu_to_je16 (JFFS2_MAGIC_BITMASK);
957 n.nodetype = cpu_to_je16 (JFFS2_NODETYPE_CLEANMARKER);
958 n.totlen = cpu_to_je32 (8);
959 p = (unsigned char *) &n;
960
961 for (i = 0; i < c->fsdata_len; i++) {
962 if (buf[c->fsdata_pos + i] != p[i]) {
963 retval = 1;
964 }
965 }
966 D1(if (retval == 1) {
967 printk(KERN_WARNING "jffs2_check_nand_cleanmarker(): Cleanmarker node not detected in block at %08x\n", jeb->offset);
968 printk(KERN_WARNING "OOB at %08x was ", offset);
969 for (i=0; i < oob_size; i++) {
970 printk("%02x ", buf[i]);
971 }
972 printk("\n");
973 })
974 }
975 offset += c->mtd->erasesize;
976 }
977 return retval;
978}
979
980int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
981{
982 struct jffs2_unknown_node n;
983 int ret;
984 size_t retlen;
985
986 n.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
987 n.nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER);
988 n.totlen = cpu_to_je32(8);
989
990 ret = jffs2_flash_write_oob(c, jeb->offset + c->fsdata_pos, c->fsdata_len, &retlen, (unsigned char *)&n);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000991
Linus Torvalds1da177e2005-04-16 15:20:36 -0700992 if (ret) {
993 D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Write failed for block at %08x: error %d\n", jeb->offset, ret));
994 return ret;
995 }
996 if (retlen != c->fsdata_len) {
997 D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Short write for block at %08x: %zd not %d\n", jeb->offset, retlen, c->fsdata_len));
998 return ret;
999 }
1000 return 0;
1001}
1002
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001003/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004 * On NAND we try to mark this block bad. If the block was erased more
1005 * than MAX_ERASE_FAILURES we mark it finaly bad.
1006 * Don't care about failures. This block remains on the erase-pending
1007 * or badblock list as long as nobody manipulates the flash with
1008 * a bootloader or something like that.
1009 */
1010
1011int jffs2_write_nand_badblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset)
1012{
1013 int ret;
1014
1015 /* if the count is < max, we try to write the counter to the 2nd page oob area */
1016 if( ++jeb->bad_count < MAX_ERASE_FAILURES)
1017 return 0;
1018
1019 if (!c->mtd->block_markbad)
1020 return 1; // What else can we do?
1021
1022 D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Marking bad block at %08x\n", bad_offset));
1023 ret = c->mtd->block_markbad(c->mtd, bad_offset);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001024
Linus Torvalds1da177e2005-04-16 15:20:36 -07001025 if (ret) {
1026 D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Write failed for block at %08x: error %d\n", jeb->offset, ret));
1027 return ret;
1028 }
1029 return 1;
1030}
1031
1032#define NAND_JFFS2_OOB16_FSDALEN 8
1033
1034static struct nand_oobinfo jffs2_oobinfo_docecc = {
1035 .useecc = MTD_NANDECC_PLACE,
1036 .eccbytes = 6,
1037 .eccpos = {0,1,2,3,4,5}
1038};
1039
1040
1041static int jffs2_nand_set_oobinfo(struct jffs2_sb_info *c)
1042{
1043 struct nand_oobinfo *oinfo = &c->mtd->oobinfo;
1044
1045 /* Do this only, if we have an oob buffer */
1046 if (!c->mtd->oobsize)
1047 return 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001048
Linus Torvalds1da177e2005-04-16 15:20:36 -07001049 /* Cleanmarker is out-of-band, so inline size zero */
1050 c->cleanmarker_size = 0;
1051
1052 /* Should we use autoplacement ? */
1053 if (oinfo && oinfo->useecc == MTD_NANDECC_AUTOPLACE) {
1054 D1(printk(KERN_DEBUG "JFFS2 using autoplace on NAND\n"));
1055 /* Get the position of the free bytes */
1056 if (!oinfo->oobfree[0][1]) {
1057 printk (KERN_WARNING "jffs2_nand_set_oobinfo(): Eeep. Autoplacement selected and no empty space in oob\n");
1058 return -ENOSPC;
1059 }
1060 c->fsdata_pos = oinfo->oobfree[0][0];
1061 c->fsdata_len = oinfo->oobfree[0][1];
1062 if (c->fsdata_len > 8)
1063 c->fsdata_len = 8;
1064 } else {
1065 /* This is just a legacy fallback and should go away soon */
1066 switch(c->mtd->ecctype) {
1067 case MTD_ECC_RS_DiskOnChip:
1068 printk(KERN_WARNING "JFFS2 using DiskOnChip hardware ECC without autoplacement. Fix it!\n");
1069 c->oobinfo = &jffs2_oobinfo_docecc;
1070 c->fsdata_pos = 6;
1071 c->fsdata_len = NAND_JFFS2_OOB16_FSDALEN;
1072 c->badblock_pos = 15;
1073 break;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001074
Linus Torvalds1da177e2005-04-16 15:20:36 -07001075 default:
1076 D1(printk(KERN_DEBUG "JFFS2 on NAND. No autoplacment info found\n"));
1077 return -EINVAL;
1078 }
1079 }
1080 return 0;
1081}
1082
1083int jffs2_nand_flash_setup(struct jffs2_sb_info *c)
1084{
1085 int res;
1086
1087 /* Initialise write buffer */
1088 init_rwsem(&c->wbuf_sem);
Joern Engel28318772006-05-22 23:18:05 +02001089 c->wbuf_pagesize = c->mtd->writesize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001090 c->wbuf_ofs = 0xFFFFFFFF;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001091
Linus Torvalds1da177e2005-04-16 15:20:36 -07001092 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1093 if (!c->wbuf)
1094 return -ENOMEM;
1095
1096 res = jffs2_nand_set_oobinfo(c);
1097
1098#ifdef BREAKME
1099 if (!brokenbuf)
1100 brokenbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1101 if (!brokenbuf) {
1102 kfree(c->wbuf);
1103 return -ENOMEM;
1104 }
1105 memset(brokenbuf, 0xdb, c->wbuf_pagesize);
1106#endif
1107 return res;
1108}
1109
1110void jffs2_nand_flash_cleanup(struct jffs2_sb_info *c)
1111{
1112 kfree(c->wbuf);
1113}
1114
Andrew Victor8f15fd52005-02-09 09:17:45 +00001115int jffs2_dataflash_setup(struct jffs2_sb_info *c) {
1116 c->cleanmarker_size = 0; /* No cleanmarkers needed */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001117
Andrew Victor8f15fd52005-02-09 09:17:45 +00001118 /* Initialize write buffer */
1119 init_rwsem(&c->wbuf_sem);
Andrew Victor8f15fd52005-02-09 09:17:45 +00001120
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001121
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001122 c->wbuf_pagesize = c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001123
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001124 /* Find a suitable c->sector_size
1125 * - Not too much sectors
1126 * - Sectors have to be at least 4 K + some bytes
1127 * - All known dataflashes have erase sizes of 528 or 1056
1128 * - we take at least 8 eraseblocks and want to have at least 8K size
1129 * - The concatenation should be a power of 2
1130 */
Andrew Victor8f15fd52005-02-09 09:17:45 +00001131
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001132 c->sector_size = 8 * c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001133
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001134 while (c->sector_size < 8192) {
1135 c->sector_size *= 2;
1136 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001137
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001138 /* It may be necessary to adjust the flash size */
1139 c->flash_size = c->mtd->size;
1140
1141 if ((c->flash_size % c->sector_size) != 0) {
1142 c->flash_size = (c->flash_size / c->sector_size) * c->sector_size;
1143 printk(KERN_WARNING "JFFS2 flash size adjusted to %dKiB\n", c->flash_size);
1144 };
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001145
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001146 c->wbuf_ofs = 0xFFFFFFFF;
Andrew Victor8f15fd52005-02-09 09:17:45 +00001147 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1148 if (!c->wbuf)
1149 return -ENOMEM;
1150
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001151 printk(KERN_INFO "JFFS2 write-buffering enabled buffer (%d) erasesize (%d)\n", c->wbuf_pagesize, c->sector_size);
Andrew Victor8f15fd52005-02-09 09:17:45 +00001152
1153 return 0;
1154}
1155
1156void jffs2_dataflash_cleanup(struct jffs2_sb_info *c) {
1157 kfree(c->wbuf);
1158}
Andrew Victor8f15fd52005-02-09 09:17:45 +00001159
Nicolas Pitre59da7212005-08-06 05:51:33 +01001160int jffs2_nor_wbuf_flash_setup(struct jffs2_sb_info *c) {
Joern Engelc8b229d2006-05-22 23:18:12 +02001161 /* Cleanmarker currently occupies whole programming regions,
1162 * either one or 2 for 8Byte STMicro flashes. */
1163 c->cleanmarker_size = max(16u, c->mtd->writesize);
Nicolas Pitre59da7212005-08-06 05:51:33 +01001164
1165 /* Initialize write buffer */
1166 init_rwsem(&c->wbuf_sem);
Joern Engel28318772006-05-22 23:18:05 +02001167 c->wbuf_pagesize = c->mtd->writesize;
Nicolas Pitre59da7212005-08-06 05:51:33 +01001168 c->wbuf_ofs = 0xFFFFFFFF;
1169
1170 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1171 if (!c->wbuf)
1172 return -ENOMEM;
1173
1174 return 0;
1175}
1176
1177void jffs2_nor_wbuf_flash_cleanup(struct jffs2_sb_info *c) {
1178 kfree(c->wbuf);
1179}