blob: c556e85a565cea44fbceca308514fa51e5c80c3e [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * JFFS2 -- Journalling Flash File System, Version 2.
3 *
David Woodhousec00c3102007-04-25 14:16:47 +01004 * Copyright © 2001-2007 Red Hat, Inc.
5 * Copyright © 2004 Thomas Gleixner <tglx@linutronix.de>
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 *
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 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070012 */
13
14#include <linux/kernel.h>
15#include <linux/slab.h>
16#include <linux/mtd/mtd.h>
17#include <linux/crc32.h>
18#include <linux/mtd/nand.h>
Tim Schmielau4e57b682005-10-30 15:03:48 -080019#include <linux/jiffies.h>
Al Viro914e2632006-10-18 13:55:46 -040020#include <linux/sched.h>
Tim Schmielau4e57b682005-10-30 15:03:48 -080021
Linus Torvalds1da177e2005-04-16 15:20:36 -070022#include "nodelist.h"
23
24/* For testing write failures */
25#undef BREAKME
26#undef BREAKMEHEADER
27
28#ifdef BREAKME
29static unsigned char *brokenbuf;
30#endif
31
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +010032#define PAGE_DIV(x) ( ((unsigned long)(x) / (unsigned long)(c->wbuf_pagesize)) * (unsigned long)(c->wbuf_pagesize) )
33#define PAGE_MOD(x) ( (unsigned long)(x) % (unsigned long)(c->wbuf_pagesize) )
34
Linus Torvalds1da177e2005-04-16 15:20:36 -070035/* max. erase failures before we mark a block bad */
36#define MAX_ERASE_FAILURES 2
37
Linus Torvalds1da177e2005-04-16 15:20:36 -070038struct jffs2_inodirty {
39 uint32_t ino;
40 struct jffs2_inodirty *next;
41};
42
43static struct jffs2_inodirty inodirty_nomem;
44
45static int jffs2_wbuf_pending_for_ino(struct jffs2_sb_info *c, uint32_t ino)
46{
47 struct jffs2_inodirty *this = c->wbuf_inodes;
48
49 /* If a malloc failed, consider _everything_ dirty */
50 if (this == &inodirty_nomem)
51 return 1;
52
53 /* If ino == 0, _any_ non-GC writes mean 'yes' */
54 if (this && !ino)
55 return 1;
56
57 /* Look to see if the inode in question is pending in the wbuf */
58 while (this) {
59 if (this->ino == ino)
60 return 1;
61 this = this->next;
62 }
63 return 0;
64}
65
66static void jffs2_clear_wbuf_ino_list(struct jffs2_sb_info *c)
67{
68 struct jffs2_inodirty *this;
69
70 this = c->wbuf_inodes;
71
72 if (this != &inodirty_nomem) {
73 while (this) {
74 struct jffs2_inodirty *next = this->next;
75 kfree(this);
76 this = next;
77 }
78 }
79 c->wbuf_inodes = NULL;
80}
81
82static void jffs2_wbuf_dirties_inode(struct jffs2_sb_info *c, uint32_t ino)
83{
84 struct jffs2_inodirty *new;
85
86 /* Mark the superblock dirty so that kupdated will flush... */
Artem B. Bityuckiy4d952702005-03-18 09:58:09 +000087 jffs2_erase_pending_trigger(c);
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
89 if (jffs2_wbuf_pending_for_ino(c, ino))
90 return;
91
92 new = kmalloc(sizeof(*new), GFP_KERNEL);
93 if (!new) {
94 D1(printk(KERN_DEBUG "No memory to allocate inodirty. Fallback to all considered dirty\n"));
95 jffs2_clear_wbuf_ino_list(c);
96 c->wbuf_inodes = &inodirty_nomem;
97 return;
98 }
99 new->ino = ino;
100 new->next = c->wbuf_inodes;
101 c->wbuf_inodes = new;
102 return;
103}
104
105static inline void jffs2_refile_wbuf_blocks(struct jffs2_sb_info *c)
106{
107 struct list_head *this, *next;
108 static int n;
109
110 if (list_empty(&c->erasable_pending_wbuf_list))
111 return;
112
113 list_for_each_safe(this, next, &c->erasable_pending_wbuf_list) {
114 struct jffs2_eraseblock *jeb = list_entry(this, struct jffs2_eraseblock, list);
115
116 D1(printk(KERN_DEBUG "Removing eraseblock at 0x%08x from erasable_pending_wbuf_list...\n", jeb->offset));
117 list_del(this);
118 if ((jiffies + (n++)) & 127) {
119 /* Most of the time, we just erase it immediately. Otherwise we
120 spend ages scanning it on mount, etc. */
121 D1(printk(KERN_DEBUG "...and adding to erase_pending_list\n"));
122 list_add_tail(&jeb->list, &c->erase_pending_list);
123 c->nr_erasing_blocks++;
124 jffs2_erase_pending_trigger(c);
125 } else {
126 /* Sometimes, however, we leave it elsewhere so it doesn't get
127 immediately reused, and we spread the load a bit. */
128 D1(printk(KERN_DEBUG "...and adding to erasable_list\n"));
129 list_add_tail(&jeb->list, &c->erasable_list);
130 }
131 }
132}
133
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000134#define REFILE_NOTEMPTY 0
135#define REFILE_ANYWAY 1
136
137static void jffs2_block_refile(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, int allow_empty)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700138{
139 D1(printk("About to refile bad block at %08x\n", jeb->offset));
140
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141 /* File the existing block on the bad_used_list.... */
142 if (c->nextblock == jeb)
143 c->nextblock = NULL;
144 else /* Not sure this should ever happen... need more coffee */
145 list_del(&jeb->list);
146 if (jeb->first_node) {
147 D1(printk("Refiling block at %08x to bad_used_list\n", jeb->offset));
148 list_add(&jeb->list, &c->bad_used_list);
149 } else {
Estelle Hammache9b88f472005-01-28 18:53:05 +0000150 BUG_ON(allow_empty == REFILE_NOTEMPTY);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151 /* It has to have had some nodes or we couldn't be here */
152 D1(printk("Refiling block at %08x to erase_pending_list\n", jeb->offset));
153 list_add(&jeb->list, &c->erase_pending_list);
154 c->nr_erasing_blocks++;
155 jffs2_erase_pending_trigger(c);
156 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157
David Woodhouse9bfeb692006-05-26 21:19:05 +0100158 if (!jffs2_prealloc_raw_node_refs(c, jeb, 1)) {
159 uint32_t oldfree = jeb->free_size;
160
161 jffs2_link_node_ref(c, jeb,
162 (jeb->offset+c->sector_size-oldfree) | REF_OBSOLETE,
163 oldfree, NULL);
164 /* convert to wasted */
165 c->wasted_size += oldfree;
166 jeb->wasted_size += oldfree;
167 c->dirty_size -= oldfree;
168 jeb->dirty_size -= oldfree;
169 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100171 jffs2_dbg_dump_block_lists_nolock(c);
172 jffs2_dbg_acct_sanity_check_nolock(c,jeb);
173 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174}
175
David Woodhouse9bfeb692006-05-26 21:19:05 +0100176static struct jffs2_raw_node_ref **jffs2_incore_replace_raw(struct jffs2_sb_info *c,
177 struct jffs2_inode_info *f,
178 struct jffs2_raw_node_ref *raw,
179 union jffs2_node_union *node)
180{
181 struct jffs2_node_frag *frag;
182 struct jffs2_full_dirent *fd;
183
184 dbg_noderef("incore_replace_raw: node at %p is {%04x,%04x}\n",
185 node, je16_to_cpu(node->u.magic), je16_to_cpu(node->u.nodetype));
186
187 BUG_ON(je16_to_cpu(node->u.magic) != 0x1985 &&
188 je16_to_cpu(node->u.magic) != 0);
189
190 switch (je16_to_cpu(node->u.nodetype)) {
191 case JFFS2_NODETYPE_INODE:
David Woodhouseddc58bd2006-05-27 13:15:16 +0100192 if (f->metadata && f->metadata->raw == raw) {
193 dbg_noderef("Will replace ->raw in f->metadata at %p\n", f->metadata);
194 return &f->metadata->raw;
195 }
David Woodhouse9bfeb692006-05-26 21:19:05 +0100196 frag = jffs2_lookup_node_frag(&f->fragtree, je32_to_cpu(node->i.offset));
197 BUG_ON(!frag);
198 /* Find a frag which refers to the full_dnode we want to modify */
199 while (!frag->node || frag->node->raw != raw) {
200 frag = frag_next(frag);
201 BUG_ON(!frag);
202 }
203 dbg_noderef("Will replace ->raw in full_dnode at %p\n", frag->node);
204 return &frag->node->raw;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100205
206 case JFFS2_NODETYPE_DIRENT:
207 for (fd = f->dents; fd; fd = fd->next) {
208 if (fd->raw == raw) {
209 dbg_noderef("Will replace ->raw in full_dirent at %p\n", fd);
210 return &fd->raw;
211 }
212 }
213 BUG();
David Woodhouseddc58bd2006-05-27 13:15:16 +0100214
David Woodhouse9bfeb692006-05-26 21:19:05 +0100215 default:
216 dbg_noderef("Don't care about replacing raw for nodetype %x\n",
217 je16_to_cpu(node->u.nodetype));
218 break;
219 }
220 return NULL;
221}
222
Linus Torvalds1da177e2005-04-16 15:20:36 -0700223/* Recover from failure to write wbuf. Recover the nodes up to the
224 * wbuf, not the one which we were starting to try to write. */
225
226static void jffs2_wbuf_recover(struct jffs2_sb_info *c)
227{
228 struct jffs2_eraseblock *jeb, *new_jeb;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100229 struct jffs2_raw_node_ref *raw, *next, *first_raw = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700230 size_t retlen;
231 int ret;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100232 int nr_refile = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700233 unsigned char *buf;
234 uint32_t start, end, ofs, len;
235
David Woodhouse046b8b92006-05-25 01:50:35 +0100236 jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
237
Linus Torvalds1da177e2005-04-16 15:20:36 -0700238 spin_lock(&c->erase_completion_lock);
Vitaly Wool180bfb32007-03-06 17:01:04 +0300239 if (c->wbuf_ofs % c->mtd->erasesize)
240 jffs2_block_refile(c, jeb, REFILE_NOTEMPTY);
241 else
242 jffs2_block_refile(c, jeb, REFILE_ANYWAY);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100243 spin_unlock(&c->erase_completion_lock);
244
245 BUG_ON(!ref_obsolete(jeb->last_node));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700246
247 /* Find the first node to be recovered, by skipping over every
248 node which ends before the wbuf starts, or which is obsolete. */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100249 for (next = raw = jeb->first_node; next; raw = next) {
250 next = ref_next(raw);
251
252 if (ref_obsolete(raw) ||
253 (next && ref_offset(next) <= c->wbuf_ofs)) {
254 dbg_noderef("Skipping node at 0x%08x(%d)-0x%08x which is either before 0x%08x or obsolete\n",
255 ref_offset(raw), ref_flags(raw),
256 (ref_offset(raw) + ref_totlen(c, jeb, raw)),
257 c->wbuf_ofs);
258 continue;
259 }
260 dbg_noderef("First node to be recovered is at 0x%08x(%d)-0x%08x\n",
261 ref_offset(raw), ref_flags(raw),
262 (ref_offset(raw) + ref_totlen(c, jeb, raw)));
263
264 first_raw = raw;
265 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700266 }
267
David Woodhouse9bfeb692006-05-26 21:19:05 +0100268 if (!first_raw) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 /* All nodes were obsolete. Nothing to recover. */
270 D1(printk(KERN_DEBUG "No non-obsolete nodes to be recovered. Just filing block bad\n"));
David Woodhouse9bfeb692006-05-26 21:19:05 +0100271 c->wbuf_len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700272 return;
273 }
274
David Woodhouse9bfeb692006-05-26 21:19:05 +0100275 start = ref_offset(first_raw);
276 end = ref_offset(jeb->last_node);
277 nr_refile = 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700278
David Woodhouse9bfeb692006-05-26 21:19:05 +0100279 /* Count the number of refs which need to be copied */
280 while ((raw = ref_next(raw)) != jeb->last_node)
281 nr_refile++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700282
David Woodhouse9bfeb692006-05-26 21:19:05 +0100283 dbg_noderef("wbuf recover %08x-%08x (%d bytes in %d nodes)\n",
284 start, end, end - start, nr_refile);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285
286 buf = NULL;
287 if (start < c->wbuf_ofs) {
288 /* First affected node was already partially written.
289 * Attempt to reread the old data into our buffer. */
290
291 buf = kmalloc(end - start, GFP_KERNEL);
292 if (!buf) {
293 printk(KERN_CRIT "Malloc failure in wbuf recovery. Data loss ensues.\n");
294
295 goto read_failed;
296 }
297
298 /* Do the read... */
Thomas Gleixner9223a452006-05-23 17:21:03 +0200299 ret = c->mtd->read(c->mtd, start, c->wbuf_ofs - start, &retlen, buf);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000300
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200301 /* ECC recovered ? */
302 if ((ret == -EUCLEAN || ret == -EBADMSG) &&
303 (retlen == c->wbuf_ofs - start))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304 ret = 0;
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200305
Linus Torvalds1da177e2005-04-16 15:20:36 -0700306 if (ret || retlen != c->wbuf_ofs - start) {
307 printk(KERN_CRIT "Old data are already lost in wbuf recovery. Data loss ensues.\n");
308
309 kfree(buf);
310 buf = NULL;
311 read_failed:
David Woodhouse9bfeb692006-05-26 21:19:05 +0100312 first_raw = ref_next(first_raw);
313 nr_refile--;
314 while (first_raw && ref_obsolete(first_raw)) {
315 first_raw = ref_next(first_raw);
316 nr_refile--;
317 }
318
Linus Torvalds1da177e2005-04-16 15:20:36 -0700319 /* If this was the only node to be recovered, give up */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100320 if (!first_raw) {
321 c->wbuf_len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700322 return;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100323 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700324
325 /* It wasn't. Go on and try to recover nodes complete in the wbuf */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100326 start = ref_offset(first_raw);
327 dbg_noderef("wbuf now recover %08x-%08x (%d bytes in %d nodes)\n",
328 start, end, end - start, nr_refile);
329
Linus Torvalds1da177e2005-04-16 15:20:36 -0700330 } else {
331 /* Read succeeded. Copy the remaining data from the wbuf */
332 memcpy(buf + (c->wbuf_ofs - start), c->wbuf, end - c->wbuf_ofs);
333 }
334 }
335 /* OK... we're to rewrite (end-start) bytes of data from first_raw onwards.
336 Either 'buf' contains the data, or we find it in the wbuf */
337
Linus Torvalds1da177e2005-04-16 15:20:36 -0700338 /* ... and get an allocation of space from a shiny new block instead */
David Woodhouse9fe48542006-05-23 00:38:06 +0100339 ret = jffs2_reserve_space_gc(c, end-start, &len, JFFS2_SUMMARY_NOSUM_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340 if (ret) {
341 printk(KERN_WARNING "Failed to allocate space for wbuf recovery. Data loss ensues.\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000342 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700343 return;
344 }
David Woodhouse9bfeb692006-05-26 21:19:05 +0100345
Adrian Hunter7f762ab2007-04-04 13:47:53 +0300346 /* The summary is not recovered, so it must be disabled for this erase block */
347 jffs2_sum_disable_collecting(c->summary);
348
David Woodhouse9bfeb692006-05-26 21:19:05 +0100349 ret = jffs2_prealloc_raw_node_refs(c, c->nextblock, nr_refile);
350 if (ret) {
351 printk(KERN_WARNING "Failed to allocate node refs for wbuf recovery. Data loss ensues.\n");
352 kfree(buf);
353 return;
354 }
355
David Woodhouse9fe48542006-05-23 00:38:06 +0100356 ofs = write_ofs(c);
357
Linus Torvalds1da177e2005-04-16 15:20:36 -0700358 if (end-start >= c->wbuf_pagesize) {
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000359 /* Need to do another write immediately, but it's possible
Estelle Hammache9b88f472005-01-28 18:53:05 +0000360 that this is just because the wbuf itself is completely
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000361 full, and there's nothing earlier read back from the
362 flash. Hence 'buf' isn't necessarily what we're writing
Estelle Hammache9b88f472005-01-28 18:53:05 +0000363 from. */
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000364 unsigned char *rewrite_buf = buf?:c->wbuf;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 uint32_t towrite = (end-start) - ((end-start)%c->wbuf_pagesize);
366
367 D1(printk(KERN_DEBUG "Write 0x%x bytes at 0x%08x in wbuf recover\n",
368 towrite, ofs));
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000369
Linus Torvalds1da177e2005-04-16 15:20:36 -0700370#ifdef BREAKMEHEADER
371 static int breakme;
372 if (breakme++ == 20) {
373 printk(KERN_NOTICE "Faking write error at 0x%08x\n", ofs);
374 breakme = 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200375 c->mtd->write(c->mtd, ofs, towrite, &retlen,
376 brokenbuf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700377 ret = -EIO;
378 } else
379#endif
Thomas Gleixner9223a452006-05-23 17:21:03 +0200380 ret = c->mtd->write(c->mtd, ofs, towrite, &retlen,
381 rewrite_buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700382
383 if (ret || retlen != towrite) {
384 /* Argh. We tried. Really we did. */
385 printk(KERN_CRIT "Recovery of wbuf failed due to a second write error\n");
Estelle Hammache9b88f472005-01-28 18:53:05 +0000386 kfree(buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700387
David Woodhouse2f785402006-05-24 02:04:45 +0100388 if (retlen)
David Woodhouse9bfeb692006-05-26 21:19:05 +0100389 jffs2_add_physical_node_ref(c, ofs | REF_OBSOLETE, ref_totlen(c, jeb, first_raw), NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700390
Linus Torvalds1da177e2005-04-16 15:20:36 -0700391 return;
392 }
393 printk(KERN_NOTICE "Recovery of wbuf succeeded to %08x\n", ofs);
394
395 c->wbuf_len = (end - start) - towrite;
396 c->wbuf_ofs = ofs + towrite;
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000397 memmove(c->wbuf, rewrite_buf + towrite, c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700398 /* Don't muck about with c->wbuf_inodes. False positives are harmless. */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700399 } else {
400 /* OK, now we're left with the dregs in whichever buffer we're using */
401 if (buf) {
402 memcpy(c->wbuf, buf, end-start);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700403 } else {
404 memmove(c->wbuf, c->wbuf + (start - c->wbuf_ofs), end - start);
405 }
406 c->wbuf_ofs = ofs;
407 c->wbuf_len = end - start;
408 }
409
410 /* Now sort out the jffs2_raw_node_refs, moving them from the old to the next block */
411 new_jeb = &c->blocks[ofs / c->sector_size];
412
413 spin_lock(&c->erase_completion_lock);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100414 for (raw = first_raw; raw != jeb->last_node; raw = ref_next(raw)) {
415 uint32_t rawlen = ref_totlen(c, jeb, raw);
416 struct jffs2_inode_cache *ic;
417 struct jffs2_raw_node_ref *new_ref;
418 struct jffs2_raw_node_ref **adjust_ref = NULL;
419 struct jffs2_inode_info *f = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700420
421 D1(printk(KERN_DEBUG "Refiling block of %08x at %08x(%d) to %08x\n",
David Woodhouse9bfeb692006-05-26 21:19:05 +0100422 rawlen, ref_offset(raw), ref_flags(raw), ofs));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423
David Woodhouse9bfeb692006-05-26 21:19:05 +0100424 ic = jffs2_raw_ref_to_ic(raw);
425
426 /* Ick. This XATTR mess should be fixed shortly... */
427 if (ic && ic->class == RAWNODE_CLASS_XATTR_DATUM) {
428 struct jffs2_xattr_datum *xd = (void *)ic;
429 BUG_ON(xd->node != raw);
430 adjust_ref = &xd->node;
431 raw->next_in_ino = NULL;
432 ic = NULL;
433 } else if (ic && ic->class == RAWNODE_CLASS_XATTR_REF) {
434 struct jffs2_xattr_datum *xr = (void *)ic;
435 BUG_ON(xr->node != raw);
436 adjust_ref = &xr->node;
437 raw->next_in_ino = NULL;
438 ic = NULL;
439 } else if (ic && ic->class == RAWNODE_CLASS_INODE_CACHE) {
440 struct jffs2_raw_node_ref **p = &ic->nodes;
441
442 /* Remove the old node from the per-inode list */
443 while (*p && *p != (void *)ic) {
444 if (*p == raw) {
445 (*p) = (raw->next_in_ino);
446 raw->next_in_ino = NULL;
447 break;
448 }
449 p = &((*p)->next_in_ino);
450 }
451
452 if (ic->state == INO_STATE_PRESENT && !ref_obsolete(raw)) {
453 /* If it's an in-core inode, then we have to adjust any
454 full_dirent or full_dnode structure to point to the
455 new version instead of the old */
456 f = jffs2_gc_fetch_inode(c, ic->ino, ic->nlink);
457 if (IS_ERR(f)) {
458 /* Should never happen; it _must_ be present */
459 JFFS2_ERROR("Failed to iget() ino #%u, err %ld\n",
460 ic->ino, PTR_ERR(f));
461 BUG();
462 }
463 /* We don't lock f->sem. There's a number of ways we could
464 end up in here with it already being locked, and nobody's
465 going to modify it on us anyway because we hold the
466 alloc_sem. We're only changing one ->raw pointer too,
467 which we can get away with without upsetting readers. */
468 adjust_ref = jffs2_incore_replace_raw(c, f, raw,
469 (void *)(buf?:c->wbuf) + (ref_offset(raw) - start));
470 } else if (unlikely(ic->state != INO_STATE_PRESENT &&
471 ic->state != INO_STATE_CHECKEDABSENT &&
472 ic->state != INO_STATE_GC)) {
473 JFFS2_ERROR("Inode #%u is in strange state %d!\n", ic->ino, ic->state);
474 BUG();
475 }
476 }
477
478 new_ref = jffs2_link_node_ref(c, new_jeb, ofs | ref_flags(raw), rawlen, ic);
479
480 if (adjust_ref) {
481 BUG_ON(*adjust_ref != raw);
482 *adjust_ref = new_ref;
483 }
484 if (f)
485 jffs2_gc_release_inode(c, f);
486
487 if (!ref_obsolete(raw)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700488 jeb->dirty_size += rawlen;
489 jeb->used_size -= rawlen;
490 c->dirty_size += rawlen;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100491 c->used_size -= rawlen;
492 raw->flash_offset = ref_offset(raw) | REF_OBSOLETE;
493 BUG_ON(raw->next_in_ino);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700494 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495 ofs += rawlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 }
497
David Woodhouse9bfeb692006-05-26 21:19:05 +0100498 kfree(buf);
499
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500 /* Fix up the original jeb now it's on the bad_list */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100501 if (first_raw == jeb->first_node) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700502 D1(printk(KERN_DEBUG "Failing block at %08x is now empty. Moving to erase_pending_list\n", jeb->offset));
Akinobu Mitaf1166292006-06-26 00:24:46 -0700503 list_move(&jeb->list, &c->erase_pending_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700504 c->nr_erasing_blocks++;
505 jffs2_erase_pending_trigger(c);
506 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700507
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100508 jffs2_dbg_acct_sanity_check_nolock(c, jeb);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100509 jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510
Artem B. Bityutskiye0c8e422005-07-24 16:14:17 +0100511 jffs2_dbg_acct_sanity_check_nolock(c, new_jeb);
David Woodhouse9bfeb692006-05-26 21:19:05 +0100512 jffs2_dbg_acct_paranoia_check_nolock(c, new_jeb);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513
514 spin_unlock(&c->erase_completion_lock);
515
David Woodhouse9bfeb692006-05-26 21:19:05 +0100516 D1(printk(KERN_DEBUG "wbuf recovery completed OK. wbuf_ofs 0x%08x, len 0x%x\n", c->wbuf_ofs, c->wbuf_len));
517
Linus Torvalds1da177e2005-04-16 15:20:36 -0700518}
519
520/* Meaning of pad argument:
521 0: Do not pad. Probably pointless - we only ever use this when we can't pad anyway.
522 1: Pad, do not adjust nextblock free_size
523 2: Pad, adjust nextblock free_size
524*/
525#define NOPAD 0
526#define PAD_NOACCOUNT 1
527#define PAD_ACCOUNTING 2
528
529static int __jffs2_flush_wbuf(struct jffs2_sb_info *c, int pad)
530{
David Woodhouse9bfeb692006-05-26 21:19:05 +0100531 struct jffs2_eraseblock *wbuf_jeb;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700532 int ret;
533 size_t retlen;
534
Andrew Victor3be36672005-02-09 09:09:05 +0000535 /* Nothing to do if not write-buffering the flash. In particular, we shouldn't
Linus Torvalds1da177e2005-04-16 15:20:36 -0700536 del_timer() the timer we never initialised. */
Andrew Victor3be36672005-02-09 09:09:05 +0000537 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 return 0;
539
540 if (!down_trylock(&c->alloc_sem)) {
541 up(&c->alloc_sem);
542 printk(KERN_CRIT "jffs2_flush_wbuf() called with alloc_sem not locked!\n");
543 BUG();
544 }
545
Andrew Victor3be36672005-02-09 09:09:05 +0000546 if (!c->wbuf_len) /* already checked c->wbuf above */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547 return 0;
548
David Woodhouse9bfeb692006-05-26 21:19:05 +0100549 wbuf_jeb = &c->blocks[c->wbuf_ofs / c->sector_size];
550 if (jffs2_prealloc_raw_node_refs(c, wbuf_jeb, c->nextblock->allocated_refs + 1))
David Woodhouse2f785402006-05-24 02:04:45 +0100551 return -ENOMEM;
552
Linus Torvalds1da177e2005-04-16 15:20:36 -0700553 /* claim remaining space on the page
554 this happens, if we have a change to a new block,
555 or if fsync forces us to flush the writebuffer.
556 if we have a switch to next page, we will not have
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000557 enough remaining space for this.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558 */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100559 if (pad ) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560 c->wbuf_len = PAD(c->wbuf_len);
561
562 /* Pad with JFFS2_DIRTY_BITMASK initially. this helps out ECC'd NOR
563 with 8 byte page size */
564 memset(c->wbuf + c->wbuf_len, 0, c->wbuf_pagesize - c->wbuf_len);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000565
Linus Torvalds1da177e2005-04-16 15:20:36 -0700566 if ( c->wbuf_len + sizeof(struct jffs2_unknown_node) < c->wbuf_pagesize) {
567 struct jffs2_unknown_node *padnode = (void *)(c->wbuf + c->wbuf_len);
568 padnode->magic = cpu_to_je16(JFFS2_MAGIC_BITMASK);
569 padnode->nodetype = cpu_to_je16(JFFS2_NODETYPE_PADDING);
570 padnode->totlen = cpu_to_je32(c->wbuf_pagesize - c->wbuf_len);
571 padnode->hdr_crc = cpu_to_je32(crc32(0, padnode, sizeof(*padnode)-4));
572 }
573 }
574 /* else jffs2_flash_writev has actually filled in the rest of the
575 buffer for us, and will deal with the node refs etc. later. */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000576
Linus Torvalds1da177e2005-04-16 15:20:36 -0700577#ifdef BREAKME
578 static int breakme;
579 if (breakme++ == 20) {
580 printk(KERN_NOTICE "Faking write error at 0x%08x\n", c->wbuf_ofs);
581 breakme = 0;
Thomas Gleixner9223a452006-05-23 17:21:03 +0200582 c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen,
583 brokenbuf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700584 ret = -EIO;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000585 } else
Linus Torvalds1da177e2005-04-16 15:20:36 -0700586#endif
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000587
Linus Torvalds1da177e2005-04-16 15:20:36 -0700588 ret = c->mtd->write(c->mtd, c->wbuf_ofs, c->wbuf_pagesize, &retlen, c->wbuf);
589
590 if (ret || retlen != c->wbuf_pagesize) {
591 if (ret)
592 printk(KERN_WARNING "jffs2_flush_wbuf(): Write failed with %d\n",ret);
593 else {
594 printk(KERN_WARNING "jffs2_flush_wbuf(): Write was short: %zd instead of %d\n",
595 retlen, c->wbuf_pagesize);
596 ret = -EIO;
597 }
598
599 jffs2_wbuf_recover(c);
600
601 return ret;
602 }
603
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604 /* Adjust free size of the block if we padded. */
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +0100605 if (pad) {
David Woodhouse0bcc0992006-05-21 13:00:54 +0100606 uint32_t waste = c->wbuf_pagesize - c->wbuf_len;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700607
Linus Torvalds1da177e2005-04-16 15:20:36 -0700608 D1(printk(KERN_DEBUG "jffs2_flush_wbuf() adjusting free_size of %sblock at %08x\n",
David Woodhouse9bfeb692006-05-26 21:19:05 +0100609 (wbuf_jeb==c->nextblock)?"next":"", wbuf_jeb->offset));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700610
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000611 /* wbuf_pagesize - wbuf_len is the amount of space that's to be
Linus Torvalds1da177e2005-04-16 15:20:36 -0700612 padded. If there is less free space in the block than that,
613 something screwed up */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100614 if (wbuf_jeb->free_size < waste) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700615 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 +0100616 c->wbuf_ofs, c->wbuf_len, waste);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700617 printk(KERN_CRIT "jffs2_flush_wbuf(): But free_size for block at 0x%08x is only 0x%08x\n",
David Woodhouse9bfeb692006-05-26 21:19:05 +0100618 wbuf_jeb->offset, wbuf_jeb->free_size);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700619 BUG();
620 }
David Woodhouse0bcc0992006-05-21 13:00:54 +0100621
622 spin_lock(&c->erase_completion_lock);
623
David Woodhouse9bfeb692006-05-26 21:19:05 +0100624 jffs2_link_node_ref(c, wbuf_jeb, (c->wbuf_ofs + c->wbuf_len) | REF_OBSOLETE, waste, NULL);
David Woodhouse0bcc0992006-05-21 13:00:54 +0100625 /* FIXME: that made it count as dirty. Convert to wasted */
David Woodhouse9bfeb692006-05-26 21:19:05 +0100626 wbuf_jeb->dirty_size -= waste;
David Woodhouse0bcc0992006-05-21 13:00:54 +0100627 c->dirty_size -= waste;
David Woodhouse9bfeb692006-05-26 21:19:05 +0100628 wbuf_jeb->wasted_size += waste;
David Woodhouse0bcc0992006-05-21 13:00:54 +0100629 c->wasted_size += waste;
630 } else
631 spin_lock(&c->erase_completion_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700632
633 /* Stick any now-obsoleted blocks on the erase_pending_list */
634 jffs2_refile_wbuf_blocks(c);
635 jffs2_clear_wbuf_ino_list(c);
636 spin_unlock(&c->erase_completion_lock);
637
638 memset(c->wbuf,0xff,c->wbuf_pagesize);
639 /* adjust write buffer offset, else we get a non contiguous write bug */
640 c->wbuf_ofs += c->wbuf_pagesize;
641 c->wbuf_len = 0;
642 return 0;
643}
644
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000645/* Trigger garbage collection to flush the write-buffer.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700646 If ino arg is zero, do it if _any_ real (i.e. not GC) writes are
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000647 outstanding. If ino arg non-zero, do it only if a write for the
Linus Torvalds1da177e2005-04-16 15:20:36 -0700648 given inode is outstanding. */
649int jffs2_flush_wbuf_gc(struct jffs2_sb_info *c, uint32_t ino)
650{
651 uint32_t old_wbuf_ofs;
652 uint32_t old_wbuf_len;
653 int ret = 0;
654
655 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() called for ino #%u...\n", ino));
656
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000657 if (!c->wbuf)
658 return 0;
659
Linus Torvalds1da177e2005-04-16 15:20:36 -0700660 down(&c->alloc_sem);
661 if (!jffs2_wbuf_pending_for_ino(c, ino)) {
662 D1(printk(KERN_DEBUG "Ino #%d not pending in wbuf. Returning\n", ino));
663 up(&c->alloc_sem);
664 return 0;
665 }
666
667 old_wbuf_ofs = c->wbuf_ofs;
668 old_wbuf_len = c->wbuf_len;
669
670 if (c->unchecked_size) {
671 /* GC won't make any progress for a while */
672 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() padding. Not finished checking\n"));
673 down_write(&c->wbuf_sem);
674 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000675 /* retry flushing wbuf in case jffs2_wbuf_recover
676 left some data in the wbuf */
677 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000678 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700679 up_write(&c->wbuf_sem);
680 } else while (old_wbuf_len &&
681 old_wbuf_ofs == c->wbuf_ofs) {
682
683 up(&c->alloc_sem);
684
685 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() calls gc pass\n"));
686
687 ret = jffs2_garbage_collect_pass(c);
688 if (ret) {
689 /* GC failed. Flush it with padding instead */
690 down(&c->alloc_sem);
691 down_write(&c->wbuf_sem);
692 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000693 /* retry flushing wbuf in case jffs2_wbuf_recover
694 left some data in the wbuf */
695 if (ret)
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000696 ret = __jffs2_flush_wbuf(c, PAD_ACCOUNTING);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697 up_write(&c->wbuf_sem);
698 break;
699 }
700 down(&c->alloc_sem);
701 }
702
703 D1(printk(KERN_DEBUG "jffs2_flush_wbuf_gc() ends...\n"));
704
705 up(&c->alloc_sem);
706 return ret;
707}
708
709/* Pad write-buffer to end and write it, wasting space. */
710int jffs2_flush_wbuf_pad(struct jffs2_sb_info *c)
711{
712 int ret;
713
David Woodhouse8aee6ac2005-02-02 22:12:08 +0000714 if (!c->wbuf)
715 return 0;
716
Linus Torvalds1da177e2005-04-16 15:20:36 -0700717 down_write(&c->wbuf_sem);
718 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Estelle Hammache7f716cf2005-01-24 21:24:18 +0000719 /* retry - maybe wbuf recover left some data in wbuf. */
720 if (ret)
721 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 up_write(&c->wbuf_sem);
723
724 return ret;
725}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700726
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200727static size_t jffs2_fill_wbuf(struct jffs2_sb_info *c, const uint8_t *buf,
728 size_t len)
729{
730 if (len && !c->wbuf_len && (len >= c->wbuf_pagesize))
731 return 0;
732
733 if (len > (c->wbuf_pagesize - c->wbuf_len))
734 len = c->wbuf_pagesize - c->wbuf_len;
735 memcpy(c->wbuf + c->wbuf_len, buf, len);
736 c->wbuf_len += (uint32_t) len;
737 return len;
738}
739
740int jffs2_flash_writev(struct jffs2_sb_info *c, const struct kvec *invecs,
741 unsigned long count, loff_t to, size_t *retlen,
742 uint32_t ino)
743{
744 struct jffs2_eraseblock *jeb;
745 size_t wbuf_retlen, donelen = 0;
746 uint32_t outvec_to = to;
747 int ret, invec;
748
749 /* If not writebuffered flash, don't bother */
Andrew Victor3be36672005-02-09 09:09:05 +0000750 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700751 return jffs2_flash_direct_writev(c, invecs, count, to, retlen);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000752
Linus Torvalds1da177e2005-04-16 15:20:36 -0700753 down_write(&c->wbuf_sem);
754
755 /* If wbuf_ofs is not initialized, set it to target address */
756 if (c->wbuf_ofs == 0xFFFFFFFF) {
757 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000758 c->wbuf_len = PAGE_MOD(to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700759 memset(c->wbuf,0xff,c->wbuf_pagesize);
760 }
761
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200762 /*
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200763 * Sanity checks on target address. It's permitted to write
764 * at PAD(c->wbuf_len+c->wbuf_ofs), and it's permitted to
765 * write at the beginning of a new erase block. Anything else,
766 * and you die. New block starts at xxx000c (0-b = block
767 * header)
768 */
Andrew Victor3be36672005-02-09 09:09:05 +0000769 if (SECTOR_ADDR(to) != SECTOR_ADDR(c->wbuf_ofs)) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700770 /* It's a write to a new block */
771 if (c->wbuf_len) {
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200772 D1(printk(KERN_DEBUG "jffs2_flash_writev() to 0x%lx "
773 "causes flush of wbuf at 0x%08x\n",
774 (unsigned long)to, c->wbuf_ofs));
Linus Torvalds1da177e2005-04-16 15:20:36 -0700775 ret = __jffs2_flush_wbuf(c, PAD_NOACCOUNT);
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200776 if (ret)
777 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700778 }
779 /* set pointer to new block */
780 c->wbuf_ofs = PAGE_DIV(to);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000781 c->wbuf_len = PAGE_MOD(to);
782 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700783
784 if (to != PAD(c->wbuf_ofs + c->wbuf_len)) {
785 /* We're not writing immediately after the writebuffer. Bad. */
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200786 printk(KERN_CRIT "jffs2_flash_writev(): Non-contiguous write "
787 "to %08lx\n", (unsigned long)to);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700788 if (c->wbuf_len)
789 printk(KERN_CRIT "wbuf was previously %08x-%08x\n",
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200790 c->wbuf_ofs, c->wbuf_ofs+c->wbuf_len);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700791 BUG();
792 }
793
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200794 /* adjust alignment offset */
795 if (c->wbuf_len != PAGE_MOD(to)) {
796 c->wbuf_len = PAGE_MOD(to);
797 /* take care of alignment to next page */
798 if (!c->wbuf_len) {
799 c->wbuf_len = c->wbuf_pagesize;
800 ret = __jffs2_flush_wbuf(c, NOPAD);
801 if (ret)
802 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700803 }
804 }
805
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200806 for (invec = 0; invec < count; invec++) {
807 int vlen = invecs[invec].iov_len;
808 uint8_t *v = invecs[invec].iov_base;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700809
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200810 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700811
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200812 if (c->wbuf_len == c->wbuf_pagesize) {
813 ret = __jffs2_flush_wbuf(c, NOPAD);
814 if (ret)
815 goto outerr;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700816 }
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200817 vlen -= wbuf_retlen;
818 outvec_to += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700819 donelen += wbuf_retlen;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200820 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700821
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200822 if (vlen >= c->wbuf_pagesize) {
823 ret = c->mtd->write(c->mtd, outvec_to, PAGE_DIV(vlen),
824 &wbuf_retlen, v);
825 if (ret < 0 || wbuf_retlen != PAGE_DIV(vlen))
826 goto outfile;
827
828 vlen -= wbuf_retlen;
829 outvec_to += wbuf_retlen;
830 c->wbuf_ofs = outvec_to;
831 donelen += wbuf_retlen;
832 v += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700833 }
834
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200835 wbuf_retlen = jffs2_fill_wbuf(c, v, vlen);
836 if (c->wbuf_len == c->wbuf_pagesize) {
837 ret = __jffs2_flush_wbuf(c, NOPAD);
838 if (ret)
839 goto outerr;
840 }
841
842 outvec_to += wbuf_retlen;
843 donelen += wbuf_retlen;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700844 }
845
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200846 /*
847 * If there's a remainder in the wbuf and it's a non-GC write,
848 * remember that the wbuf affects this ino
849 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700850 *retlen = donelen;
851
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100852 if (jffs2_sum_active()) {
853 int res = jffs2_sum_add_kvec(c, invecs, count, (uint32_t) to);
854 if (res)
855 return res;
856 }
857
Linus Torvalds1da177e2005-04-16 15:20:36 -0700858 if (c->wbuf_len && ino)
859 jffs2_wbuf_dirties_inode(c, ino);
860
861 ret = 0;
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200862 up_write(&c->wbuf_sem);
863 return ret;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000864
Thomas Gleixnerdcb09322006-05-23 11:49:14 +0200865outfile:
866 /*
867 * At this point we have no problem, c->wbuf is empty. However
868 * refile nextblock to avoid writing again to same address.
869 */
870
871 spin_lock(&c->erase_completion_lock);
872
873 jeb = &c->blocks[outvec_to / c->sector_size];
874 jffs2_block_refile(c, jeb, REFILE_ANYWAY);
875
876 spin_unlock(&c->erase_completion_lock);
877
878outerr:
879 *retlen = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700880 up_write(&c->wbuf_sem);
881 return ret;
882}
883
884/*
885 * This is the entry for flash write.
886 * Check, if we work on NAND FLASH, if so build an kvec and write it via vritev
887*/
David Woodhouse9bfeb692006-05-26 21:19:05 +0100888int jffs2_flash_write(struct jffs2_sb_info *c, loff_t ofs, size_t len,
889 size_t *retlen, const u_char *buf)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700890{
891 struct kvec vecs[1];
892
Andrew Victor3be36672005-02-09 09:09:05 +0000893 if (!jffs2_is_writebuffered(c))
Ferenc Havasie631ddb2005-09-07 09:35:26 +0100894 return jffs2_flash_direct_write(c, ofs, len, retlen, buf);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700895
896 vecs[0].iov_base = (unsigned char *) buf;
897 vecs[0].iov_len = len;
898 return jffs2_flash_writev(c, vecs, 1, ofs, retlen, 0);
899}
900
901/*
902 Handle readback from writebuffer and ECC failure return
903*/
904int jffs2_flash_read(struct jffs2_sb_info *c, loff_t ofs, size_t len, size_t *retlen, u_char *buf)
905{
906 loff_t orbf = 0, owbf = 0, lwbf = 0;
907 int ret;
908
Andrew Victor3be36672005-02-09 09:09:05 +0000909 if (!jffs2_is_writebuffered(c))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700910 return c->mtd->read(c->mtd, ofs, len, retlen, buf);
911
Andrew Victor3be36672005-02-09 09:09:05 +0000912 /* Read flash */
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100913 down_read(&c->wbuf_sem);
Thomas Gleixner9223a452006-05-23 17:21:03 +0200914 ret = c->mtd->read(c->mtd, ofs, len, retlen, buf);
Andrew Victor3be36672005-02-09 09:09:05 +0000915
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200916 if ( (ret == -EBADMSG || ret == -EUCLEAN) && (*retlen == len) ) {
917 if (ret == -EBADMSG)
918 printk(KERN_WARNING "mtd->read(0x%zx bytes from 0x%llx)"
919 " returned ECC error\n", len, ofs);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000920 /*
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200921 * We have the raw data without ECC correction in the buffer,
922 * maybe we are lucky and all data or parts are correct. We
923 * check the node. If data are corrupted node check will sort
924 * it out. We keep this block, it will fail on write or erase
925 * and the we mark it bad. Or should we do that now? But we
926 * should give him a chance. Maybe we had a system crash or
927 * power loss before the ecc write or a erase was completed.
Andrew Victor3be36672005-02-09 09:09:05 +0000928 * So we return success. :)
929 */
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200930 ret = 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000931 }
Andrew Victor3be36672005-02-09 09:09:05 +0000932
Linus Torvalds1da177e2005-04-16 15:20:36 -0700933 /* if no writebuffer available or write buffer empty, return */
934 if (!c->wbuf_pagesize || !c->wbuf_len)
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100935 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700936
937 /* if we read in a different block, return */
Andrew Victor3be36672005-02-09 09:09:05 +0000938 if (SECTOR_ADDR(ofs) != SECTOR_ADDR(c->wbuf_ofs))
Artem B. Bityuckiy894214d2005-04-05 13:51:58 +0100939 goto exit;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700940
941 if (ofs >= c->wbuf_ofs) {
942 owbf = (ofs - c->wbuf_ofs); /* offset in write buffer */
943 if (owbf > c->wbuf_len) /* is read beyond write buffer ? */
944 goto exit;
945 lwbf = c->wbuf_len - owbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000946 if (lwbf > len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700947 lwbf = len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000948 } else {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700949 orbf = (c->wbuf_ofs - ofs); /* offset in read buffer */
950 if (orbf > len) /* is write beyond write buffer ? */
951 goto exit;
Thomas Gleixner9a1fcdf2006-05-29 14:56:39 +0200952 lwbf = len - orbf; /* number of bytes to copy */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000953 if (lwbf > c->wbuf_len)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700954 lwbf = c->wbuf_len;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +0000955 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700956 if (lwbf > 0)
957 memcpy(buf+orbf,c->wbuf+owbf,lwbf);
958
959exit:
960 up_read(&c->wbuf_sem);
961 return ret;
962}
963
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200964#define NR_OOB_SCAN_PAGES 4
965
966/* For historical reasons we use only 12 bytes for OOB clean marker */
967#define OOB_CM_SIZE 12
968
969static const struct jffs2_unknown_node oob_cleanmarker =
970{
David Woodhouse566865a2007-04-23 12:07:17 +0100971 .magic = constant_cpu_to_je16(JFFS2_MAGIC_BITMASK),
972 .nodetype = constant_cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER),
973 .totlen = constant_cpu_to_je32(8)
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200974};
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200975
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976/*
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200977 * Check, if the out of band area is empty. This function knows about the clean
978 * marker and if it is present in OOB, treats the OOB as empty anyway.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979 */
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200980int jffs2_check_oob_empty(struct jffs2_sb_info *c,
981 struct jffs2_eraseblock *jeb, int mode)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700982{
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200983 int i, ret;
984 int cmlen = min_t(int, c->oobavail, OOB_CM_SIZE);
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200985 struct mtd_oob_ops ops;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700986
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200987 ops.mode = MTD_OOB_AUTO;
988 ops.ooblen = NR_OOB_SCAN_PAGES * c->oobavail;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200989 ops.oobbuf = c->oobbuf;
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200990 ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200991 ops.datbuf = NULL;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +0200992
993 ret = c->mtd->read_oob(c->mtd, jeb->offset, &ops);
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200994 if (ret || ops.oobretlen != ops.ooblen) {
Andrew Morton7be26bfb2007-02-17 16:02:10 -0800995 printk(KERN_ERR "cannot read OOB for EB at %08x, requested %zd"
996 " bytes, read %zd bytes, error %d\n",
997 jeb->offset, ops.ooblen, ops.oobretlen, ret);
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +0200998 if (!ret)
999 ret = -EIO;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001000 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001001 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001002
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001003 for(i = 0; i < ops.ooblen; i++) {
1004 if (mode && i < cmlen)
1005 /* Yeah, we know about the cleanmarker */
Linus Torvalds1da177e2005-04-16 15:20:36 -07001006 continue;
1007
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001008 if (ops.oobbuf[i] != 0xFF) {
1009 D2(printk(KERN_DEBUG "Found %02x at %x in OOB for "
1010 "%08x\n", ops.oobbuf[i], i, jeb->offset));
1011 return 1;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001012 }
1013 }
1014
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001015 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001016}
1017
1018/*
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001019 * Check for a valid cleanmarker.
1020 * Returns: 0 if a valid cleanmarker was found
1021 * 1 if no cleanmarker was found
1022 * negative error code if an error occurred
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001023 */
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001024int jffs2_check_nand_cleanmarker(struct jffs2_sb_info *c,
1025 struct jffs2_eraseblock *jeb)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001026{
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001027 struct mtd_oob_ops ops;
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001028 int ret, cmlen = min_t(int, c->oobavail, OOB_CM_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001029
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001030 ops.mode = MTD_OOB_AUTO;
1031 ops.ooblen = cmlen;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001032 ops.oobbuf = c->oobbuf;
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001033 ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001034 ops.datbuf = NULL;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001035
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001036 ret = c->mtd->read_oob(c->mtd, jeb->offset, &ops);
1037 if (ret || ops.oobretlen != ops.ooblen) {
Andrew Morton7be26bfb2007-02-17 16:02:10 -08001038 printk(KERN_ERR "cannot read OOB for EB at %08x, requested %zd"
1039 " bytes, read %zd bytes, error %d\n",
1040 jeb->offset, ops.ooblen, ops.oobretlen, ret);
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001041 if (!ret)
1042 ret = -EIO;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001043 return ret;
1044 }
1045
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001046 return !!memcmp(&oob_cleanmarker, c->oobbuf, cmlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001047}
1048
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001049int jffs2_write_nand_cleanmarker(struct jffs2_sb_info *c,
1050 struct jffs2_eraseblock *jeb)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001051{
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001052 int ret;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001053 struct mtd_oob_ops ops;
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001054 int cmlen = min_t(int, c->oobavail, OOB_CM_SIZE);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001055
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001056 ops.mode = MTD_OOB_AUTO;
1057 ops.ooblen = cmlen;
1058 ops.oobbuf = (uint8_t *)&oob_cleanmarker;
1059 ops.len = ops.ooboffs = ops.retlen = ops.oobretlen = 0;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001060 ops.datbuf = NULL;
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001061
1062 ret = c->mtd->write_oob(c->mtd, jeb->offset, &ops);
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001063 if (ret || ops.oobretlen != ops.ooblen) {
Andrew Morton7be26bfb2007-02-17 16:02:10 -08001064 printk(KERN_ERR "cannot write OOB for EB at %08x, requested %zd"
1065 " bytes, read %zd bytes, error %d\n",
1066 jeb->offset, ops.ooblen, ops.oobretlen, ret);
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001067 if (!ret)
1068 ret = -EIO;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001069 return ret;
1070 }
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001071
Linus Torvalds1da177e2005-04-16 15:20:36 -07001072 return 0;
1073}
1074
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001075/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07001076 * On NAND we try to mark this block bad. If the block was erased more
1077 * than MAX_ERASE_FAILURES we mark it finaly bad.
1078 * Don't care about failures. This block remains on the erase-pending
1079 * or badblock list as long as nobody manipulates the flash with
1080 * a bootloader or something like that.
1081 */
1082
1083int jffs2_write_nand_badblock(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset)
1084{
1085 int ret;
1086
1087 /* if the count is < max, we try to write the counter to the 2nd page oob area */
1088 if( ++jeb->bad_count < MAX_ERASE_FAILURES)
1089 return 0;
1090
1091 if (!c->mtd->block_markbad)
1092 return 1; // What else can we do?
1093
Artem Bityutskiy0feba822007-03-08 10:35:10 +02001094 printk(KERN_WARNING "JFFS2: marking eraseblock at %08x\n as bad", bad_offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001095 ret = c->mtd->block_markbad(c->mtd, bad_offset);
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001096
Linus Torvalds1da177e2005-04-16 15:20:36 -07001097 if (ret) {
1098 D1(printk(KERN_WARNING "jffs2_write_nand_badblock(): Write failed for block at %08x: error %d\n", jeb->offset, ret));
1099 return ret;
1100 }
1101 return 1;
1102}
1103
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001104int jffs2_nand_flash_setup(struct jffs2_sb_info *c)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001105{
Thomas Gleixner5bd34c02006-05-27 22:16:10 +02001106 struct nand_ecclayout *oinfo = c->mtd->ecclayout;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001107
Linus Torvalds1da177e2005-04-16 15:20:36 -07001108 if (!c->mtd->oobsize)
1109 return 0;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001110
Linus Torvalds1da177e2005-04-16 15:20:36 -07001111 /* Cleanmarker is out-of-band, so inline size zero */
1112 c->cleanmarker_size = 0;
1113
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001114 if (!oinfo || oinfo->oobavail == 0) {
1115 printk(KERN_ERR "inconsistent device description\n");
Thomas Gleixner5bd34c02006-05-27 22:16:10 +02001116 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001117 }
Thomas Gleixner5bd34c02006-05-27 22:16:10 +02001118
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001119 D1(printk(KERN_DEBUG "JFFS2 using OOB on NAND\n"));
Thomas Gleixner5bd34c02006-05-27 22:16:10 +02001120
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001121 c->oobavail = oinfo->oobavail;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122
1123 /* Initialise write buffer */
1124 init_rwsem(&c->wbuf_sem);
Joern Engel28318772006-05-22 23:18:05 +02001125 c->wbuf_pagesize = c->mtd->writesize;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001126 c->wbuf_ofs = 0xFFFFFFFF;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001127
Linus Torvalds1da177e2005-04-16 15:20:36 -07001128 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1129 if (!c->wbuf)
1130 return -ENOMEM;
1131
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001132 c->oobbuf = kmalloc(NR_OOB_SCAN_PAGES * c->oobavail, GFP_KERNEL);
1133 if (!c->oobbuf) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001134 kfree(c->wbuf);
1135 return -ENOMEM;
1136 }
Artem Bityutskiya7a6ace12007-01-31 11:38:53 +02001137
1138 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001139}
1140
1141void jffs2_nand_flash_cleanup(struct jffs2_sb_info *c)
1142{
1143 kfree(c->wbuf);
Thomas Gleixner8593fbc2006-05-29 03:26:58 +02001144 kfree(c->oobbuf);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001145}
1146
Andrew Victor8f15fd52005-02-09 09:17:45 +00001147int jffs2_dataflash_setup(struct jffs2_sb_info *c) {
1148 c->cleanmarker_size = 0; /* No cleanmarkers needed */
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001149
Andrew Victor8f15fd52005-02-09 09:17:45 +00001150 /* Initialize write buffer */
1151 init_rwsem(&c->wbuf_sem);
Andrew Victor8f15fd52005-02-09 09:17:45 +00001152
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001153
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001154 c->wbuf_pagesize = c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001155
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001156 /* Find a suitable c->sector_size
1157 * - Not too much sectors
1158 * - Sectors have to be at least 4 K + some bytes
1159 * - All known dataflashes have erase sizes of 528 or 1056
1160 * - we take at least 8 eraseblocks and want to have at least 8K size
1161 * - The concatenation should be a power of 2
1162 */
Andrew Victor8f15fd52005-02-09 09:17:45 +00001163
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001164 c->sector_size = 8 * c->mtd->erasesize;
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001165
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001166 while (c->sector_size < 8192) {
1167 c->sector_size *= 2;
1168 }
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001169
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001170 /* It may be necessary to adjust the flash size */
1171 c->flash_size = c->mtd->size;
1172
1173 if ((c->flash_size % c->sector_size) != 0) {
1174 c->flash_size = (c->flash_size / c->sector_size) * c->sector_size;
1175 printk(KERN_WARNING "JFFS2 flash size adjusted to %dKiB\n", c->flash_size);
1176 };
Thomas Gleixner182ec4e2005-11-07 11:16:07 +00001177
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001178 c->wbuf_ofs = 0xFFFFFFFF;
Andrew Victor8f15fd52005-02-09 09:17:45 +00001179 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1180 if (!c->wbuf)
1181 return -ENOMEM;
1182
Artem B. Bityutskiydaba5cc2005-09-30 14:59:17 +01001183 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 +00001184
1185 return 0;
1186}
1187
1188void jffs2_dataflash_cleanup(struct jffs2_sb_info *c) {
1189 kfree(c->wbuf);
1190}
Andrew Victor8f15fd52005-02-09 09:17:45 +00001191
Nicolas Pitre59da7212005-08-06 05:51:33 +01001192int jffs2_nor_wbuf_flash_setup(struct jffs2_sb_info *c) {
Joern Engelc8b229d2006-05-22 23:18:12 +02001193 /* Cleanmarker currently occupies whole programming regions,
1194 * either one or 2 for 8Byte STMicro flashes. */
1195 c->cleanmarker_size = max(16u, c->mtd->writesize);
Nicolas Pitre59da7212005-08-06 05:51:33 +01001196
1197 /* Initialize write buffer */
1198 init_rwsem(&c->wbuf_sem);
Joern Engel28318772006-05-22 23:18:05 +02001199 c->wbuf_pagesize = c->mtd->writesize;
Nicolas Pitre59da7212005-08-06 05:51:33 +01001200 c->wbuf_ofs = 0xFFFFFFFF;
1201
1202 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1203 if (!c->wbuf)
1204 return -ENOMEM;
1205
1206 return 0;
1207}
1208
1209void jffs2_nor_wbuf_flash_cleanup(struct jffs2_sb_info *c) {
1210 kfree(c->wbuf);
1211}
Artem Bityutskiy0029da32006-10-04 19:15:21 +03001212
1213int jffs2_ubivol_setup(struct jffs2_sb_info *c) {
1214 c->cleanmarker_size = 0;
1215
1216 if (c->mtd->writesize == 1)
1217 /* We do not need write-buffer */
1218 return 0;
1219
1220 init_rwsem(&c->wbuf_sem);
1221
1222 c->wbuf_pagesize = c->mtd->writesize;
1223 c->wbuf_ofs = 0xFFFFFFFF;
1224 c->wbuf = kmalloc(c->wbuf_pagesize, GFP_KERNEL);
1225 if (!c->wbuf)
1226 return -ENOMEM;
1227
1228 printk(KERN_INFO "JFFS2 write-buffering enabled buffer (%d) erasesize (%d)\n", c->wbuf_pagesize, c->sector_size);
1229
1230 return 0;
1231}
1232
1233void jffs2_ubivol_cleanup(struct jffs2_sb_info *c) {
1234 kfree(c->wbuf);
1235}