blob: 0442a5753d33d0cd31d8085c8e33d0b61f91b4a2 [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
182 spin_lock(&c->erase_completion_lock);
183
184 jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
185
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000186 jffs2_block_refile(c, jeb, REFILE_NOTEMPTY);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700187
188 /* Find the first node to be recovered, by skipping over every
189 node which ends before the wbuf starts, or which is obsolete. */
190 first_raw = &jeb->first_node;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000191 while (*first_raw &&
Linus Torvalds1da177e2005-04-16 15:20:36 -0700192 (ref_obsolete(*first_raw) ||
193 (ref_offset(*first_raw)+ref_totlen(c, jeb, *first_raw)) < c->wbuf_ofs)) {
194 D1(printk(KERN_DEBUG "Skipping node at 0x%08x(%d)-0x%08x which is either before 0x%08x or obsolete\n",
195 ref_offset(*first_raw), ref_flags(*first_raw),
196 (ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw)),
197 c->wbuf_ofs));
198 first_raw = &(*first_raw)->next_phys;
199 }
200
201 if (!*first_raw) {
202 /* All nodes were obsolete. Nothing to recover. */
203 D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n"));
204 spin_unlock(&c->erase_completion_lock);
205 return;
206 }
207
208 start = ref_offset(*first_raw);
209 end = ref_offset(*first_raw) + ref_totlen(c, jeb, *first_raw);
210
211 /* Find the last node to be recovered */
212 raw = first_raw;
213 while ((*raw)) {
214 if (!ref_obsolete(*raw))
215 end = ref_offset(*raw) + ref_totlen(c, jeb, *raw);
216
217 raw = &(*raw)->next_phys;
218 }
219 spin_unlock(&c->erase_completion_lock);
220
221 D1(printk(KERN_DEBUG "wbuf recover %08x-%08x\n", start, end));
222
223 buf = NULL;
224 if (start < c->wbuf_ofs) {
225 /* First affected node was already partially written.
226 * Attempt to reread the old data into our buffer. */
227
228 buf = kmalloc(end - start, GFP_KERNEL);
229 if (!buf) {
230 printk(KERN_CRIT "Malloc failure in wbuf recovery. Data loss ensues.\n");
231
232 goto read_failed;
233 }
234
235 /* Do the read... */
236 if (jffs2_cleanmarker_oob(c))
237 ret = c->mtd->read_ecc(c->mtd, start, c->wbuf_ofs - start, &retlen, buf, NULL, c->oobinfo);
238 else
239 ret = c->mtd->read(c->mtd, start, c->wbuf_ofs - start, &retlen, buf);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000240
Linus Torvalds1da177e2005-04-16 15:20:36 -0700241 if (ret == -EBADMSG && retlen == c->wbuf_ofs - start) {
242 /* ECC recovered */
243 ret = 0;
244 }
245 if (ret || retlen != c->wbuf_ofs - start) {
246 printk(KERN_CRIT "Old data are already lost in wbuf recovery. Data loss ensues.\n");
247
248 kfree(buf);
249 buf = NULL;
250 read_failed:
251 first_raw = &(*first_raw)->next_phys;
252 /* If this was the only node to be recovered, give up */
253 if (!(*first_raw))
254 return;
255
256 /* It wasn't. Go on and try to recover nodes complete in the wbuf */
257 start = ref_offset(*first_raw);
258 } else {
259 /* Read succeeded. Copy the remaining data from the wbuf */
260 memcpy(buf + (c->wbuf_ofs - start), c->wbuf, end - c->wbuf_ofs);
261 }
262 }
263 /* OK... we're to rewrite (end-start) bytes of data from first_raw onwards.
264 Either 'buf' contains the data, or we find it in the wbuf */
265
266
267 /* ... and get an allocation of space from a shiny new block instead */
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100268 ret = jffs2_reserve_space_gc(c, end-start, &ofs, &len, JFFS2_SUMMARY_NOSUM_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 if (ret) {
270 printk(KERN_WARNING "Failed to allocate space for wbuf recovery. Data loss ensues.\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000271 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 return;
273 }
274 if (end-start >= c->wbuf_pagesize) {
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000275 /* Need to do another write immediately, but it's possible
Estelle Hammache9b88f472005-01-28 18:53:05 +0000276 that this is just because the wbuf itself is completely
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000277 full, and there's nothing earlier read back from the
278 flash. Hence 'buf' isn't necessarily what we're writing
Estelle Hammache9b88f472005-01-28 18:53:05 +0000279 from. */
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000280 unsigned char *rewrite_buf = buf?:c->wbuf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700281 uint32_t towrite = (end-start) - ((end-start)%c->wbuf_pagesize);
282
283 D1(printk(KERN_DEBUG "Write 0x%x bytes at 0x%08x in wbuf recover\n",
284 towrite, ofs));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000285
Linus Torvalds1da177e2005-04-16 15:20:36 -0700286#ifdef BREAKMEHEADER
287 static int breakme;
288 if (breakme++ == 20) {
289 printk(KERN_NOTICE "Faking write error at 0x%08x\n", ofs);
290 breakme = 0;
291 c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen,
292 brokenbuf, NULL, c->oobinfo);
293 ret = -EIO;
294 } else
295#endif
296 if (jffs2_cleanmarker_oob(c))
297 ret = c->mtd->write_ecc(c->mtd, ofs, towrite, &retlen,
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000298 rewrite_buf, NULL, c->oobinfo);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700299 else
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000300 ret = c->mtd->write(c->mtd, ofs, towrite, &retlen, rewrite_buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700301
302 if (ret || retlen != towrite) {
303 /* Argh. We tried. Really we did. */
304 printk(KERN_CRIT "Recovery of wbuf failed due to a second write error\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000305 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306
307 if (retlen) {
308 struct jffs2_raw_node_ref *raw2;
309
310 raw2 = jffs2_alloc_raw_node_ref();
311 if (!raw2)
312 return;
313
314 raw2->flash_offset = ofs | REF_OBSOLETE;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700315 raw2->next_in_ino = NULL;
316
David Woodhouseb64335f2006-05-21 04:36:45 +0100317 jffs2_add_physical_node_ref(c, raw2, ref_totlen(c, jeb, *first_raw));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700318 }
319 return;
320 }
321 printk(KERN_NOTICE "Recovery of wbuf succeeded to %08x\n", ofs);
322
323 c->wbuf_len = (end - start) - towrite;
324 c->wbuf_ofs = ofs + towrite;
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000325 memmove(c->wbuf, rewrite_buf + towrite, c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700326 /* Don't muck about with c->wbuf_inodes. False positives are harmless. */
Jesper Juhlf99d49a2005-11-07 01:01:34 -0800327 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328 } else {
329 /* OK, now we're left with the dregs in whichever buffer we're using */
330 if (buf) {
331 memcpy(c->wbuf, buf, end-start);
332 kfree(buf);
333 } else {
334 memmove(c->wbuf, c->wbuf + (start - c->wbuf_ofs), end - start);
335 }
336 c->wbuf_ofs = ofs;
337 c->wbuf_len = end - start;
338 }
339
340 /* Now sort out the jffs2_raw_node_refs, moving them from the old to the next block */
341 new_jeb = &c->blocks[ofs / c->sector_size];
342
343 spin_lock(&c->erase_completion_lock);
344 if (new_jeb->first_node) {
345 /* Odd, but possible with ST flash later maybe */
346 new_jeb->last_node->next_phys = *first_raw;
347 } else {
348 new_jeb->first_node = *first_raw;
349 }
350
351 raw = first_raw;
352 while (*raw) {
353 uint32_t rawlen = ref_totlen(c, jeb, *raw);
354
355 D1(printk(KERN_DEBUG "Refiling block of %08x at %08x(%d) to %08x\n",
356 rawlen, ref_offset(*raw), ref_flags(*raw), ofs));
357
358 if (ref_obsolete(*raw)) {
359 /* Shouldn't really happen much */
360 new_jeb->dirty_size += rawlen;
361 new_jeb->free_size -= rawlen;
362 c->dirty_size += rawlen;
363 } else {
364 new_jeb->used_size += rawlen;
365 new_jeb->free_size -= rawlen;
366 jeb->dirty_size += rawlen;
367 jeb->used_size -= rawlen;
368 c->dirty_size += rawlen;
369 }
370 c->free_size -= rawlen;
371 (*raw)->flash_offset = ofs | ref_flags(*raw);
372 ofs += rawlen;
373 new_jeb->last_node = *raw;
374
375 raw = &(*raw)->next_phys;
376 }
377
378 /* Fix up the original jeb now it's on the bad_list */
379 *first_raw = NULL;
380 if (first_raw == &jeb->first_node) {
381 jeb->last_node = NULL;
382 D1(printk(KERN_DEBUG "Failing block at %08x is now empty. Moving to erase_pending_list\n", jeb->offset));
383 list_del(&jeb->list);
384 list_add(&jeb->list, &c->erase_pending_list);
385 c->nr_erasing_blocks++;
386 jffs2_erase_pending_trigger(c);
387 }
388 else
389 jeb->last_node = container_of(first_raw, struct jffs2_raw_node_ref, next_phys);
390
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100391 jffs2_dbg_acct_sanity_check_nolock(c, jeb);
392 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700393
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100394 jffs2_dbg_acct_sanity_check_nolock(c, new_jeb);
395 jffs2_dbg_acct_paranoia_check_nolock(c, new_jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700396
397 spin_unlock(&c->erase_completion_lock);
398
399 D1(printk(KERN_DEBUG "wbuf recovery completed OK\n"));
400}
401
402/* Meaning of pad argument:
403 0: Do not pad. Probably pointless - we only ever use this when we can't pad anyway.
404 1: Pad, do not adjust nextblock free_size
405 2: Pad, adjust nextblock free_size
406*/
407#define NOPAD 0
408#define PAD_NOACCOUNT 1
409#define PAD_ACCOUNTING 2
410
411static int __jffs2_flush_wbuf(struct jffs2_sb_info *c, int pad)
412{
413 int ret;
414 size_t retlen;
415
Andrew Victor3be36672005-02-09 09:09:05 +0000416 /* Nothing to do if not write-buffering the flash. In particular, we shouldn't
Linus Torvalds1da177e2005-04-16 15:20:36 -0700417 del_timer() the timer we never initialised. */
Andrew Victor3be36672005-02-09 09:09:05 +0000418 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700419 return 0;
420
421 if (!down_trylock(&c->alloc_sem)) {
422 up(&c->alloc_sem);
423 printk(KERN_CRIT "jffs2_flush_wbuf() called with alloc_sem not locked!\n");
424 BUG();
425 }
426
Andrew Victor3be36672005-02-09 09:09:05 +0000427 if (!c->wbuf_len) /* already checked c->wbuf above */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700428 return 0;
429
430 /* claim remaining space on the page
431 this happens, if we have a change to a new block,
432 or if fsync forces us to flush the writebuffer.
433 if we have a switch to next page, we will not have
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000434 enough remaining space for this.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700435 */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100436 if (pad ) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437 c->wbuf_len = PAD(c->wbuf_len);
438
439 /* Pad with JFFS2_DIRTY_BITMASK initially. this helps out ECC'd NOR
440 with 8 byte page size */
441 memset(c->wbuf + c->wbuf_len, 0, c->wbuf_pagesize - c->wbuf_len);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000442
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 if ( c->wbuf_len + sizeof(struct jffs2_unknown_node) < c->wbuf_pagesize) {
444 struct jffs2_unknown_node *padnode = (void *)(c->wbuf + c->wbuf_len);
445 padnode->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
446 padnode->nodetype = cpu_to_je16(JFFS2_NODETYPE_PADDING);
447 padnode->totlen = cpu_to_je32(c->wbuf_pagesize - c->wbuf_len);
448 padnode->hdr_crc = cpu_to_je32(crc32(0, padnode, sizeof(*padnode)-4));
449 }
450 }
451 /* else jffs2_flash_writev has actually filled in the rest of the
452 buffer for us, and will deal with the node refs etc. later. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000453
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454#ifdef BREAKME
455 static int breakme;
456 if (breakme++ == 20) {
457 printk(KERN_NOTICE "Faking write error at 0x%08x\n", c->wbuf_ofs);
458 breakme = 0;
459 c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize,
460 &retlen, brokenbuf, NULL, c->oobinfo);
461 ret = -EIO;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000462 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463#endif
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000464
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465 if (jffs2_cleanmarker_oob(c))
466 ret = c->mtd->write_ecc(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf, NULL, c->oobinfo);
467 else
468 ret = c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf);
469
470 if (ret || retlen != c->wbuf_pagesize) {
471 if (ret)
472 printk(KERN_WARNING "jffs2_flush_wbuf(): Write failed with %d\n",ret);
473 else {
474 printk(KERN_WARNING "jffs2_flush_wbuf(): Write was short: %zd instead of %d\n",
475 retlen, c->wbuf_pagesize);
476 ret = -EIO;
477 }
478
479 jffs2_wbuf_recover(c);
480
481 return ret;
482 }
483
Linus Torvalds1da177e2005-04-16 15:20:36 -0700484 /* Adjust free size of the block if we padded. */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100485 if (pad) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700486 struct jffs2_eraseblock *jeb;
David Woodhouse0bcc0992006-05-21 13:00:54 +0100487 struct jffs2_raw_node_ref *ref;
488 uint32_t waste = c->wbuf_pagesize - c->wbuf_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700489
490 jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
491
492 D1(printk(KERN_DEBUG "jffs2_flush_wbuf() adjusting free_size of %sblock at %08x\n",
493 (jeb==c->nextblock)?"next":"", jeb->offset));
494
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000495 /* wbuf_pagesize - wbuf_len is the amount of space that's to be
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 padded. If there is less free space in the block than that,
497 something screwed up */
David Woodhouse0bcc0992006-05-21 13:00:54 +0100498 if (jeb->free_size < waste) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700499 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 +0100500 c->wbuf_ofs, c->wbuf_len, waste);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700501 printk(KERN_CRIT "jffs2_flush_wbuf(): But free_size for block at 0x%08x is only 0x%08x\n",
502 jeb->offset, jeb->free_size);
503 BUG();
504 }
David Woodhouse0bcc0992006-05-21 13:00:54 +0100505 ref = jffs2_alloc_raw_node_ref();
506 if (!ref)
507 return -ENOMEM;
508 ref->flash_offset = c->wbuf_ofs + c->wbuf_len;
509 ref->flash_offset |= REF_OBSOLETE;
David Woodhousea1b563d2006-05-22 13:55:46 +0100510 ref->next_in_ino = NULL;
David Woodhouse0bcc0992006-05-21 13:00:54 +0100511
512 spin_lock(&c->erase_completion_lock);
513
514 jffs2_link_node_ref(c, jeb, ref, waste);
515 /* FIXME: that made it count as dirty. Convert to wasted */
516 jeb->dirty_size -= waste;
517 c->dirty_size -= waste;
518 jeb->wasted_size += waste;
519 c->wasted_size += waste;
520 } else
521 spin_lock(&c->erase_completion_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700522
523 /* Stick any now-obsoleted blocks on the erase_pending_list */
524 jffs2_refile_wbuf_blocks(c);
525 jffs2_clear_wbuf_ino_list(c);
526 spin_unlock(&c->erase_completion_lock);
527
528 memset(c->wbuf,0xff,c->wbuf_pagesize);
529 /* adjust write buffer offset, else we get a non contiguous write bug */
530 c->wbuf_ofs += c->wbuf_pagesize;
531 c->wbuf_len = 0;
532 return 0;
533}
534
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000535/* Trigger garbage collection to flush the write-buffer.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 If ino arg is zero, do it if _any_ real (i.e. not GC) writes are
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000537 outstanding. If ino arg non-zero, do it only if a write for the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 given inode is outstanding. */
539int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino)
540{
541 uint32_t old_wbuf_ofs;
542 uint32_t old_wbuf_len;
543 int ret = 0;
544
545 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() called for ino #%u...\n", ino));
546
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000547 if (!c->wbuf)
548 return 0;
549
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550 down(&c->alloc_sem);
551 if (!jffs2_wbuf_pending_for_ino(c, ino)) {
552 D1(printk(KERN_DEBUG "Ino #%d not pending in wbuf. Returning\n", ino));
553 up(&c->alloc_sem);
554 return 0;
555 }
556
557 old_wbuf_ofs = c->wbuf_ofs;
558 old_wbuf_len = c->wbuf_len;
559
560 if (c->unchecked_size) {
561 /* GC won't make any progress for a while */
562 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() padding. Not finished checking\n"));
563 down_write(&c->wbuf_sem);
564 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000565 /* retry flushing wbuf in case jffs2_wbuf_recover
566 left some data in the wbuf */
567 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000568 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700569 up_write(&c->wbuf_sem);
570 } else while (old_wbuf_len &&
571 old_wbuf_ofs == c->wbuf_ofs) {
572
573 up(&c->alloc_sem);
574
575 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() calls gc pass\n"));
576
577 ret = jffs2_garbage_collect_pass(c);
578 if (ret) {
579 /* GC failed. Flush it with padding instead */
580 down(&c->alloc_sem);
581 down_write(&c->wbuf_sem);
582 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000583 /* retry flushing wbuf in case jffs2_wbuf_recover
584 left some data in the wbuf */
585 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000586 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700587 up_write(&c->wbuf_sem);
588 break;
589 }
590 down(&c->alloc_sem);
591 }
592
593 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() ends...\n"));
594
595 up(&c->alloc_sem);
596 return ret;
597}
598
599/* Pad write-buffer to end and write it, wasting space. */
600int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c)
601{
602 int ret;
603
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000604 if (!c->wbuf)
605 return 0;
606
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607 down_write(&c->wbuf_sem);
608 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000609 /* retry - maybe wbuf recover left some data in wbuf. */
610 if (ret)
611 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 up_write(&c->wbuf_sem);
613
614 return ret;
615}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700616
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200617static size_t jffs2_fill_wbuf(struct jffs2_sb_info *c, const uint8_t *buf,
618 size_t len)
619{
620 if (len && !c->wbuf_len && (len >= c->wbuf_pagesize))
621 return 0;
622
623 if (len > (c->wbuf_pagesize - c->wbuf_len))
624 len = c->wbuf_pagesize - c->wbuf_len;
625 memcpy(c->wbuf + c->wbuf_len, buf, len);
626 c->wbuf_len += (uint32_t) len;
627 return len;
628}
629
630int jffs2_flash_writev(struct jffs2_sb_info *c, const struct kvec *invecs,
631 unsigned long count, loff_t to, size_t *retlen,
632 uint32_t ino)
633{
634 struct jffs2_eraseblock *jeb;
635 size_t wbuf_retlen, donelen = 0;
636 uint32_t outvec_to = to;
637 int ret, invec;
638
639 /* If not writebuffered flash, don't bother */
Andrew Victor3be36672005-02-09 09:09:05 +0000640 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700641 return jffs2_flash_direct_writev(c, invecs, count, to, retlen);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000642
Linus Torvalds1da177e2005-04-16 15:20:36 -0700643 down_write(&c->wbuf_sem);
644
645 /* If wbuf_ofs is not initialized, set it to target address */
646 if (c->wbuf_ofs == 0xFFFFFFFF) {
647 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000648 c->wbuf_len = PAGE_MOD(to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700649 memset(c->wbuf,0xff,c->wbuf_pagesize);
650 }
651
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200652 /*
653 * Fixup the wbuf if we are moving to a new eraseblock. The
654 * checks below fail for ECC'd NOR because cleanmarker == 16,
655 * so a block starts at xxx0010.
656 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657 if (jffs2_nor_ecc(c)) {
658 if (((c->wbuf_ofs % c->sector_size) == 0) && !c->wbuf_len) {
659 c->wbuf_ofs = PAGE_DIV(to);
660 c->wbuf_len = PAGE_MOD(to);
661 memset(c->wbuf,0xff,c->wbuf_pagesize);
662 }
663 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000664
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200665 /*
666 * Sanity checks on target address. It's permitted to write
667 * at PAD(c->wbuf_len+c->wbuf_ofs), and it's permitted to
668 * write at the beginning of a new erase block. Anything else,
669 * and you die. New block starts at xxx000c (0-b = block
670 * header)
671 */
Andrew Victor3be36672005-02-09 09:09:05 +0000672 if (SECTOR_ADDR(to) != SECTOR_ADDR(c->wbuf_ofs)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673 /* It's a write to a new block */
674 if (c->wbuf_len) {
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200675 D1(printk(KERN_DEBUG "jffs2_flash_writev() to 0x%lx "
676 "causes flush of wbuf at 0x%08x\n",
677 (unsigned long)to, c->wbuf_ofs));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700678 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200679 if (ret)
680 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700681 }
682 /* set pointer to new block */
683 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000684 c->wbuf_len = PAGE_MOD(to);
685 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686
687 if (to != PAD(c->wbuf_ofs + c->wbuf_len)) {
688 /* We're not writing immediately after the writebuffer. Bad. */
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200689 printk(KERN_CRIT "jffs2_flash_writev(): Non-contiguous write "
690 "to %08lx\n", (unsigned long)to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700691 if (c->wbuf_len)
692 printk(KERN_CRIT "wbuf was previously %08x-%08x\n",
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200693 c->wbuf_ofs, c->wbuf_ofs+c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700694 BUG();
695 }
696
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200697 /* adjust alignment offset */
698 if (c->wbuf_len != PAGE_MOD(to)) {
699 c->wbuf_len = PAGE_MOD(to);
700 /* take care of alignment to next page */
701 if (!c->wbuf_len) {
702 c->wbuf_len = c->wbuf_pagesize;
703 ret = __jffs2_flush_wbuf(c, NOPAD);
704 if (ret)
705 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700706 }
707 }
708
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200709 for (invec = 0; invec < count; invec++) {
710 int vlen = invecs[invec].iov_len;
711 uint8_t *v = invecs[invec].iov_base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700712
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200713 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700714
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200715 if (c->wbuf_len == c->wbuf_pagesize) {
716 ret = __jffs2_flush_wbuf(c, NOPAD);
717 if (ret)
718 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700719 }
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200720 vlen -= wbuf_retlen;
721 outvec_to += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 donelen += wbuf_retlen;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200723 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700724
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200725 if (vlen >= c->wbuf_pagesize) {
726 ret = c->mtd->write(c->mtd, outvec_to, PAGE_DIV(vlen),
727 &wbuf_retlen, v);
728 if (ret < 0 || wbuf_retlen != PAGE_DIV(vlen))
729 goto outfile;
730
731 vlen -= wbuf_retlen;
732 outvec_to += wbuf_retlen;
733 c->wbuf_ofs = outvec_to;
734 donelen += wbuf_retlen;
735 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700736 }
737
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200738 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
739 if (c->wbuf_len == c->wbuf_pagesize) {
740 ret = __jffs2_flush_wbuf(c, NOPAD);
741 if (ret)
742 goto outerr;
743 }
744
745 outvec_to += wbuf_retlen;
746 donelen += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700747 }
748
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200749 /*
750 * If there's a remainder in the wbuf and it's a non-GC write,
751 * remember that the wbuf affects this ino
752 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753 *retlen = donelen;
754
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100755 if (jffs2_sum_active()) {
756 int res = jffs2_sum_add_kvec(c, invecs, count, (uint32_t) to);
757 if (res)
758 return res;
759 }
760
Linus Torvalds1da177e2005-04-16 15:20:36 -0700761 if (c->wbuf_len && ino)
762 jffs2_wbuf_dirties_inode(c, ino);
763
764 ret = 0;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200765 up_write(&c->wbuf_sem);
766 return ret;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000767
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200768outfile:
769 /*
770 * At this point we have no problem, c->wbuf is empty. However
771 * refile nextblock to avoid writing again to same address.
772 */
773
774 spin_lock(&c->erase_completion_lock);
775
776 jeb = &c->blocks[outvec_to / c->sector_size];
777 jffs2_block_refile(c, jeb, REFILE_ANYWAY);
778
779 spin_unlock(&c->erase_completion_lock);
780
781outerr:
782 *retlen = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783 up_write(&c->wbuf_sem);
784 return ret;
785}
786
787/*
788 * This is the entry for flash write.
789 * Check, if we work on NAND FLASH, if so build an kvec and write it via vritev
790*/
791int jffs2_flash_write(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, const u_char *buf)
792{
793 struct kvec vecs[1];
794
Andrew Victor3be36672005-02-09 09:09:05 +0000795 if (!jffs2_is_writebuffered(c))
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100796 return jffs2_flash_direct_write(c, ofs, len, retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700797
798 vecs[0].iov_base = (unsigned char *) buf;
799 vecs[0].iov_len = len;
800 return jffs2_flash_writev(c, vecs, 1, ofs, retlen, 0);
801}
802
803/*
804 Handle readback from writebuffer and ECC failure return
805*/
806int jffs2_flash_read(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, u_char *buf)
807{
808 loff_t orbf = 0, owbf = 0, lwbf = 0;
809 int ret;
810
Andrew Victor3be36672005-02-09 09:09:05 +0000811 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700812 return c->mtd->read(c->mtd, ofs, len, retlen, buf);
813
Andrew Victor3be36672005-02-09 09:09:05 +0000814 /* Read flash */
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100815 down_read(&c->wbuf_sem);
Andrew Victor3be36672005-02-09 09:09:05 +0000816 if (jffs2_cleanmarker_oob(c))
817 ret = c->mtd->read_ecc(c->mtd, ofs, len, retlen, buf, NULL, c->oobinfo);
818 else
819 ret = c->mtd->read(c->mtd, ofs, len, retlen, buf);
820
821 if ( (ret == -EBADMSG) && (*retlen == len) ) {
822 printk(KERN_WARNING "mtd->read(0x%zx bytes from 0x%llx) returned ECC error\n",
823 len, ofs);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000824 /*
825 * We have the raw data without ECC correction in the buffer, maybe
Andrew Victor3be36672005-02-09 09:09:05 +0000826 * we are lucky and all data or parts are correct. We check the node.
827 * If data are corrupted node check will sort it out.
828 * We keep this block, it will fail on write or erase and the we
829 * mark it bad. Or should we do that now? But we should give him a chance.
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000830 * Maybe we had a system crash or power loss before the ecc write or
Andrew Victor3be36672005-02-09 09:09:05 +0000831 * a erase was completed.
832 * So we return success. :)
833 */
834 ret = 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000835 }
Andrew Victor3be36672005-02-09 09:09:05 +0000836
Linus Torvalds1da177e2005-04-16 15:20:36 -0700837 /* if no writebuffer available or write buffer empty, return */
838 if (!c->wbuf_pagesize || !c->wbuf_len)
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100839 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700840
841 /* if we read in a different block, return */
Andrew Victor3be36672005-02-09 09:09:05 +0000842 if (SECTOR_ADDR(ofs) != SECTOR_ADDR(c->wbuf_ofs))
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100843 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700844
845 if (ofs >= c->wbuf_ofs) {
846 owbf = (ofs - c->wbuf_ofs); /* offset in write buffer */
847 if (owbf > c->wbuf_len) /* is read beyond write buffer ? */
848 goto exit;
849 lwbf = c->wbuf_len - owbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000850 if (lwbf > len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700851 lwbf = len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000852 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700853 orbf = (c->wbuf_ofs - ofs); /* offset in read buffer */
854 if (orbf > len) /* is write beyond write buffer ? */
855 goto exit;
856 lwbf = len - orbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000857 if (lwbf > c->wbuf_len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700858 lwbf = c->wbuf_len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000859 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700860 if (lwbf > 0)
861 memcpy(buf+orbf,c->wbuf+owbf,lwbf);
862
863exit:
864 up_read(&c->wbuf_sem);
865 return ret;
866}
867
868/*
869 * Check, if the out of band area is empty
870 */
871int jffs2_check_oob_empty( struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int mode)
872{
873 unsigned char *buf;
874 int ret = 0;
875 int i,len,page;
876 size_t retlen;
877 int oob_size;
878
879 /* allocate a buffer for all oob data in this sector */
880 oob_size = c->mtd->oobsize;
881 len = 4 * oob_size;
882 buf = kmalloc(len, GFP_KERNEL);
883 if (!buf) {
884 printk(KERN_NOTICE "jffs2_check_oob_empty(): allocation of temporary data buffer for oob check failed\n");
885 return -ENOMEM;
886 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000887 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700888 * if mode = 0, we scan for a total empty oob area, else we have
889 * to take care of the cleanmarker in the first page of the block
890 */
891 ret = jffs2_flash_read_oob(c, jeb->offset, len , &retlen, buf);
892 if (ret) {
893 D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB failed %d for block at %08x\n", ret, jeb->offset));
894 goto out;
895 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000896
Linus Torvalds1da177e2005-04-16 15:20:36 -0700897 if (retlen < len) {
898 D1(printk(KERN_WARNING "jffs2_check_oob_empty(): Read OOB return short read "
899 "(%zd bytes not %d) for block at %08x\n", retlen, len, jeb->offset));
900 ret = -EIO;
901 goto out;
902 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000903
Linus Torvalds1da177e2005-04-16 15:20:36 -0700904 /* Special check for first page */
905 for(i = 0; i < oob_size ; i++) {
906 /* Yeah, we know about the cleanmarker. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000907 if (mode && i >= c->fsdata_pos &&
Linus Torvalds1da177e2005-04-16 15:20:36 -0700908 i < c->fsdata_pos + c->fsdata_len)
909 continue;
910
911 if (buf[i] != 0xFF) {
912 D2(printk(KERN_DEBUG "Found %02x at %x in OOB for %08x\n",
Artem B. Bityutskiy730554d2005-07-17 07:56:26 +0100913 buf[i], i, jeb->offset));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000914 ret = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700915 goto out;
916 }
917 }
918
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000919 /* we know, we are aligned :) */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700920 for (page = oob_size; page < len; page += sizeof(long)) {
921 unsigned long dat = *(unsigned long *)(&buf[page]);
922 if(dat != -1) {
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000923 ret = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700924 goto out;
925 }
926 }
927
928out:
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000929 kfree(buf);
930
Linus Torvalds1da177e2005-04-16 15:20:36 -0700931 return ret;
932}
933
934/*
935* Scan for a valid cleanmarker and for bad blocks
936* For virtual blocks (concatenated physical blocks) check the cleanmarker
937* only in the first page of the first physical block, but scan for bad blocks in all
938* physical blocks
939*/
940int jffs2_check_nand_cleanmarker (struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
941{
942 struct jffs2_unknown_node n;
943 unsigned char buf[2 * NAND_MAX_OOBSIZE];
944 unsigned char *p;
945 int ret, i, cnt, retval = 0;
946 size_t retlen, offset;
947 int oob_size;
948
949 offset = jeb->offset;
950 oob_size = c->mtd->oobsize;
951
952 /* Loop through the physical blocks */
953 for (cnt = 0; cnt < (c->sector_size / c->mtd->erasesize); cnt++) {
954 /* Check first if the block is bad. */
955 if (c->mtd->block_isbad (c->mtd, offset)) {
956 D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Bad block at %08x\n", jeb->offset));
957 return 2;
958 }
959 /*
960 * We read oob data from page 0 and 1 of the block.
961 * page 0 contains cleanmarker and badblock info
962 * page 1 contains failure count of this block
963 */
964 ret = c->mtd->read_oob (c->mtd, offset, oob_size << 1, &retlen, buf);
965
966 if (ret) {
967 D1 (printk (KERN_WARNING "jffs2_check_nand_cleanmarker(): Read OOB failed %d for block at %08x\n", ret, jeb->offset));
968 return ret;
969 }
970 if (retlen < (oob_size << 1)) {
971 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));
972 return -EIO;
973 }
974
975 /* Check cleanmarker only on the first physical block */
976 if (!cnt) {
977 n.magic = cpu_to_je16 (JFFS2_MAGIC_BITMASK);
978 n.nodetype = cpu_to_je16 (JFFS2_NODETYPE_CLEANMARKER);
979 n.totlen = cpu_to_je32 (8);
980 p = (unsigned char *) &n;
981
982 for (i = 0; i < c->fsdata_len; i++) {
983 if (buf[c->fsdata_pos + i] != p[i]) {
984 retval = 1;
985 }
986 }
987 D1(if (retval == 1) {
988 printk(KERN_WARNING "jffs2_check_nand_cleanmarker(): Cleanmarker node not detected in block at %08x\n", jeb->offset);
989 printk(KERN_WARNING "OOB at %08x was ", offset);
990 for (i=0; i < oob_size; i++) {
991 printk("%02x ", buf[i]);
992 }
993 printk("\n");
994 })
995 }
996 offset += c->mtd->erasesize;
997 }
998 return retval;
999}
1000
1001int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
1002{
1003 struct jffs2_unknown_node n;
1004 int ret;
1005 size_t retlen;
1006
1007 n.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
1008 n.nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER);
1009 n.totlen = cpu_to_je32(8);
1010
1011 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 +00001012
Linus Torvalds1da177e2005-04-16 15:20:36 -07001013 if (ret) {
1014 D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Write failed for block at %08x: error %d\n", jeb->offset, ret));
1015 return ret;
1016 }
1017 if (retlen != c->fsdata_len) {
1018 D1(printk(KERN_WARNING "jffs2_write_nand_cleanmarker(): Short write for block at %08x: %zd not %d\n", jeb->offset, retlen, c->fsdata_len));
1019 return ret;
1020 }
1021 return 0;
1022}
1023
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001024/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001025 * On NAND we try to mark this block bad. If the block was erased more
1026 * than MAX_ERASE_FAILURES we mark it finaly bad.
1027 * Don't care about failures. This block remains on the erase-pending
1028 * or badblock list as long as nobody manipulates the flash with
1029 * a bootloader or something like that.
1030 */
1031
1032int jffs2_write_nand_badblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset)
1033{
1034 int ret;
1035
1036 /* if the count is < max, we try to write the counter to the 2nd page oob area */
1037 if( ++jeb->bad_count < MAX_ERASE_FAILURES)
1038 return 0;
1039
1040 if (!c->mtd->block_markbad)
1041 return 1; // What else can we do?
1042
1043 D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Marking bad block at %08x\n", bad_offset));
1044 ret = c->mtd->block_markbad(c->mtd, bad_offset);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001045
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046 if (ret) {
1047 D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Write failed for block at %08x: error %d\n", jeb->offset, ret));
1048 return ret;
1049 }
1050 return 1;
1051}
1052
1053#define NAND_JFFS2_OOB16_FSDALEN 8
1054
1055static struct nand_oobinfo jffs2_oobinfo_docecc = {
1056 .useecc = MTD_NANDECC_PLACE,
1057 .eccbytes = 6,
1058 .eccpos = {0,1,2,3,4,5}
1059};
1060
1061
1062static int jffs2_nand_set_oobinfo(struct jffs2_sb_info *c)
1063{
1064 struct nand_oobinfo *oinfo = &c->mtd->oobinfo;
1065
1066 /* Do this only, if we have an oob buffer */
1067 if (!c->mtd->oobsize)
1068 return 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001069
Linus Torvalds1da177e2005-04-16 15:20:36 -07001070 /* Cleanmarker is out-of-band, so inline size zero */
1071 c->cleanmarker_size = 0;
1072
1073 /* Should we use autoplacement ? */
1074 if (oinfo && oinfo->useecc == MTD_NANDECC_AUTOPLACE) {
1075 D1(printk(KERN_DEBUG "JFFS2 using autoplace on NAND\n"));
1076 /* Get the position of the free bytes */
1077 if (!oinfo->oobfree[0][1]) {
1078 printk (KERN_WARNING "jffs2_nand_set_oobinfo(): Eeep. Autoplacement selected and no empty space in oob\n");
1079 return -ENOSPC;
1080 }
1081 c->fsdata_pos = oinfo->oobfree[0][0];
1082 c->fsdata_len = oinfo->oobfree[0][1];
1083 if (c->fsdata_len > 8)
1084 c->fsdata_len = 8;
1085 } else {
1086 /* This is just a legacy fallback and should go away soon */
1087 switch(c->mtd->ecctype) {
1088 case MTD_ECC_RS_DiskOnChip:
1089 printk(KERN_WARNING "JFFS2 using DiskOnChip hardware ECC without autoplacement. Fix it!\n");
1090 c->oobinfo = &jffs2_oobinfo_docecc;
1091 c->fsdata_pos = 6;
1092 c->fsdata_len = NAND_JFFS2_OOB16_FSDALEN;
1093 c->badblock_pos = 15;
1094 break;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001095
Linus Torvalds1da177e2005-04-16 15:20:36 -07001096 default:
1097 D1(printk(KERN_DEBUG "JFFS2 on NAND. No autoplacment info found\n"));
1098 return -EINVAL;
1099 }
1100 }
1101 return 0;
1102}
1103
1104int jffs2_nand_flash_setup(struct jffs2_sb_info *c)
1105{
1106 int res;
1107
1108 /* Initialise write buffer */
1109 init_rwsem(&c->wbuf_sem);
1110 c->wbuf_pagesize = c->mtd->oobblock;
1111 c->wbuf_ofs = 0xFFFFFFFF;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001112
Linus Torvalds1da177e2005-04-16 15:20:36 -07001113 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1114 if (!c->wbuf)
1115 return -ENOMEM;
1116
1117 res = jffs2_nand_set_oobinfo(c);
1118
1119#ifdef BREAKME
1120 if (!brokenbuf)
1121 brokenbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1122 if (!brokenbuf) {
1123 kfree(c->wbuf);
1124 return -ENOMEM;
1125 }
1126 memset(brokenbuf, 0xdb, c->wbuf_pagesize);
1127#endif
1128 return res;
1129}
1130
1131void jffs2_nand_flash_cleanup(struct jffs2_sb_info *c)
1132{
1133 kfree(c->wbuf);
1134}
1135
Andrew Victor8f15fd52005-02-09 09:17:45 +00001136int jffs2_dataflash_setup(struct jffs2_sb_info *c) {
1137 c->cleanmarker_size = 0; /* No cleanmarkers needed */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001138
Andrew Victor8f15fd52005-02-09 09:17:45 +00001139 /* Initialize write buffer */
1140 init_rwsem(&c->wbuf_sem);
Andrew Victor8f15fd52005-02-09 09:17:45 +00001141
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001142
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001143 c->wbuf_pagesize = c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001144
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001145 /* Find a suitable c->sector_size
1146 * - Not too much sectors
1147 * - Sectors have to be at least 4 K + some bytes
1148 * - All known dataflashes have erase sizes of 528 or 1056
1149 * - we take at least 8 eraseblocks and want to have at least 8K size
1150 * - The concatenation should be a power of 2
1151 */
Andrew Victor8f15fd52005-02-09 09:17:45 +00001152
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001153 c->sector_size = 8 * c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001154
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001155 while (c->sector_size < 8192) {
1156 c->sector_size *= 2;
1157 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001158
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001159 /* It may be necessary to adjust the flash size */
1160 c->flash_size = c->mtd->size;
1161
1162 if ((c->flash_size % c->sector_size) != 0) {
1163 c->flash_size = (c->flash_size / c->sector_size) * c->sector_size;
1164 printk(KERN_WARNING "JFFS2 flash size adjusted to %dKiB\n", c->flash_size);
1165 };
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001166
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001167 c->wbuf_ofs = 0xFFFFFFFF;
Andrew Victor8f15fd52005-02-09 09:17:45 +00001168 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1169 if (!c->wbuf)
1170 return -ENOMEM;
1171
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001172 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 +00001173
1174 return 0;
1175}
1176
1177void jffs2_dataflash_cleanup(struct jffs2_sb_info *c) {
1178 kfree(c->wbuf);
1179}
Andrew Victor8f15fd52005-02-09 09:17:45 +00001180
Linus Torvalds1da177e2005-04-16 15:20:36 -07001181int jffs2_nor_ecc_flash_setup(struct jffs2_sb_info *c) {
1182 /* Cleanmarker is actually larger on the flashes */
1183 c->cleanmarker_size = 16;
1184
1185 /* Initialize write buffer */
1186 init_rwsem(&c->wbuf_sem);
1187 c->wbuf_pagesize = c->mtd->eccsize;
1188 c->wbuf_ofs = 0xFFFFFFFF;
1189
1190 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1191 if (!c->wbuf)
1192 return -ENOMEM;
1193
1194 return 0;
1195}
1196
1197void jffs2_nor_ecc_flash_cleanup(struct jffs2_sb_info *c) {
1198 kfree(c->wbuf);
1199}
Nicolas Pitre59da7212005-08-06 05:51:33 +01001200
1201int jffs2_nor_wbuf_flash_setup(struct jffs2_sb_info *c) {
1202 /* Cleanmarker currently occupies a whole programming region */
1203 c->cleanmarker_size = MTD_PROGREGION_SIZE(c->mtd);
1204
1205 /* Initialize write buffer */
1206 init_rwsem(&c->wbuf_sem);
1207 c->wbuf_pagesize = MTD_PROGREGION_SIZE(c->mtd);
1208 c->wbuf_ofs = 0xFFFFFFFF;
1209
1210 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1211 if (!c->wbuf)
1212 return -ENOMEM;
1213
1214 return 0;
1215}
1216
1217void jffs2_nor_wbuf_flash_cleanup(struct jffs2_sb_info *c) {
1218 kfree(c->wbuf);
1219}