Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * JFFS2 -- Journalling Flash File System, Version 2. | |
3 | * | |
c00c310e | 4 | * Copyright © 2001-2007 Red Hat, Inc. |
1da177e4 LT |
5 | * |
6 | * Created by David Woodhouse <dwmw2@infradead.org> | |
7 | * | |
8 | * For licensing information, see the file 'LICENCE' in this directory. | |
9 | * | |
1da177e4 LT |
10 | */ |
11 | ||
12 | #include <linux/kernel.h> | |
13 | #include <linux/slab.h> | |
14 | #include <linux/mtd/mtd.h> | |
15 | #include <linux/compiler.h> | |
16 | #include <linux/crc32.h> | |
17 | #include <linux/sched.h> | |
18 | #include <linux/pagemap.h> | |
19 | #include "nodelist.h" | |
20 | ||
21 | struct erase_priv_struct { | |
22 | struct jffs2_eraseblock *jeb; | |
23 | struct jffs2_sb_info *c; | |
24 | }; | |
182ec4ee | 25 | |
1da177e4 LT |
26 | #ifndef __ECOS |
27 | static void jffs2_erase_callback(struct erase_info *); | |
28 | #endif | |
29 | static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset); | |
30 | static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); | |
1da177e4 LT |
31 | static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb); |
32 | ||
33 | static void jffs2_erase_block(struct jffs2_sb_info *c, | |
34 | struct jffs2_eraseblock *jeb) | |
35 | { | |
36 | int ret; | |
37 | uint32_t bad_offset; | |
38 | #ifdef __ECOS | |
39 | ret = jffs2_flash_erase(c, jeb); | |
40 | if (!ret) { | |
ef53cb02 DW |
41 | jffs2_erase_succeeded(c, jeb); |
42 | return; | |
1da177e4 LT |
43 | } |
44 | bad_offset = jeb->offset; | |
45 | #else /* Linux */ | |
46 | struct erase_info *instr; | |
47 | ||
e0c8e42f AB |
48 | D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#08x (range %#08x-%#08x)\n", |
49 | jeb->offset, jeb->offset, jeb->offset + c->sector_size)); | |
1da177e4 LT |
50 | instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL); |
51 | if (!instr) { | |
52 | printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n"); | |
ced22070 | 53 | mutex_lock(&c->erase_free_sem); |
1da177e4 | 54 | spin_lock(&c->erase_completion_lock); |
f116629d | 55 | list_move(&jeb->list, &c->erase_pending_list); |
1da177e4 LT |
56 | c->erasing_size -= c->sector_size; |
57 | c->dirty_size += c->sector_size; | |
58 | jeb->dirty_size = c->sector_size; | |
59 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 60 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
61 | return; |
62 | } | |
63 | ||
64 | memset(instr, 0, sizeof(*instr)); | |
65 | ||
66 | instr->mtd = c->mtd; | |
67 | instr->addr = jeb->offset; | |
68 | instr->len = c->sector_size; | |
69 | instr->callback = jffs2_erase_callback; | |
70 | instr->priv = (unsigned long)(&instr[1]); | |
71 | instr->fail_addr = 0xffffffff; | |
182ec4ee | 72 | |
1da177e4 LT |
73 | ((struct erase_priv_struct *)instr->priv)->jeb = jeb; |
74 | ((struct erase_priv_struct *)instr->priv)->c = c; | |
75 | ||
76 | ret = c->mtd->erase(c->mtd, instr); | |
77 | if (!ret) | |
78 | return; | |
79 | ||
80 | bad_offset = instr->fail_addr; | |
81 | kfree(instr); | |
82 | #endif /* __ECOS */ | |
83 | ||
84 | if (ret == -ENOMEM || ret == -EAGAIN) { | |
85 | /* Erase failed immediately. Refile it on the list */ | |
86 | D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret)); | |
ced22070 | 87 | mutex_lock(&c->erase_free_sem); |
1da177e4 | 88 | spin_lock(&c->erase_completion_lock); |
f116629d | 89 | list_move(&jeb->list, &c->erase_pending_list); |
1da177e4 LT |
90 | c->erasing_size -= c->sector_size; |
91 | c->dirty_size += c->sector_size; | |
92 | jeb->dirty_size = c->sector_size; | |
93 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 94 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
95 | return; |
96 | } | |
97 | ||
182ec4ee | 98 | if (ret == -EROFS) |
1da177e4 LT |
99 | printk(KERN_WARNING "Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n", jeb->offset); |
100 | else | |
101 | printk(KERN_WARNING "Erase at 0x%08x failed immediately: errno %d\n", jeb->offset, ret); | |
102 | ||
103 | jffs2_erase_failed(c, jeb, bad_offset); | |
104 | } | |
105 | ||
106 | void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count) | |
107 | { | |
108 | struct jffs2_eraseblock *jeb; | |
109 | ||
ced22070 | 110 | mutex_lock(&c->erase_free_sem); |
1da177e4 LT |
111 | |
112 | spin_lock(&c->erase_completion_lock); | |
113 | ||
114 | while (!list_empty(&c->erase_complete_list) || | |
115 | !list_empty(&c->erase_pending_list)) { | |
116 | ||
117 | if (!list_empty(&c->erase_complete_list)) { | |
118 | jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list); | |
e2bc322b | 119 | list_move(&jeb->list, &c->erase_checking_list); |
1da177e4 | 120 | spin_unlock(&c->erase_completion_lock); |
ced22070 | 121 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
122 | jffs2_mark_erased_block(c, jeb); |
123 | ||
124 | if (!--count) { | |
125 | D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n")); | |
126 | goto done; | |
127 | } | |
128 | ||
129 | } else if (!list_empty(&c->erase_pending_list)) { | |
130 | jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list); | |
131 | D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset)); | |
132 | list_del(&jeb->list); | |
133 | c->erasing_size += c->sector_size; | |
134 | c->wasted_size -= jeb->wasted_size; | |
135 | c->free_size -= jeb->free_size; | |
136 | c->used_size -= jeb->used_size; | |
137 | c->dirty_size -= jeb->dirty_size; | |
138 | jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0; | |
c38c1b61 | 139 | jffs2_free_jeb_node_refs(c, jeb); |
1da177e4 LT |
140 | list_add(&jeb->list, &c->erasing_list); |
141 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 142 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
143 | |
144 | jffs2_erase_block(c, jeb); | |
145 | ||
146 | } else { | |
147 | BUG(); | |
148 | } | |
149 | ||
150 | /* Be nice */ | |
fd532490 | 151 | yield(); |
ced22070 | 152 | mutex_lock(&c->erase_free_sem); |
1da177e4 LT |
153 | spin_lock(&c->erase_completion_lock); |
154 | } | |
155 | ||
156 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 157 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
158 | done: |
159 | D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n")); | |
1da177e4 LT |
160 | } |
161 | ||
162 | static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) | |
163 | { | |
164 | D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset)); | |
ced22070 | 165 | mutex_lock(&c->erase_free_sem); |
1da177e4 | 166 | spin_lock(&c->erase_completion_lock); |
f116629d | 167 | list_move_tail(&jeb->list, &c->erase_complete_list); |
1da177e4 | 168 | spin_unlock(&c->erase_completion_lock); |
ced22070 | 169 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
170 | /* Ensure that kupdated calls us again to mark them clean */ |
171 | jffs2_erase_pending_trigger(c); | |
172 | } | |
173 | ||
174 | static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset) | |
175 | { | |
176 | /* For NAND, if the failure did not occur at the device level for a | |
177 | specific physical page, don't bother updating the bad block table. */ | |
178 | if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) { | |
179 | /* We had a device-level failure to erase. Let's see if we've | |
180 | failed too many times. */ | |
181 | if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) { | |
182 | /* We'd like to give this block another try. */ | |
ced22070 | 183 | mutex_lock(&c->erase_free_sem); |
1da177e4 | 184 | spin_lock(&c->erase_completion_lock); |
f116629d | 185 | list_move(&jeb->list, &c->erase_pending_list); |
1da177e4 LT |
186 | c->erasing_size -= c->sector_size; |
187 | c->dirty_size += c->sector_size; | |
188 | jeb->dirty_size = c->sector_size; | |
189 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 190 | mutex_unlock(&c->erase_free_sem); |
1da177e4 LT |
191 | return; |
192 | } | |
193 | } | |
194 | ||
ced22070 | 195 | mutex_lock(&c->erase_free_sem); |
1da177e4 LT |
196 | spin_lock(&c->erase_completion_lock); |
197 | c->erasing_size -= c->sector_size; | |
198 | c->bad_size += c->sector_size; | |
f116629d | 199 | list_move(&jeb->list, &c->bad_list); |
1da177e4 LT |
200 | c->nr_erasing_blocks--; |
201 | spin_unlock(&c->erase_completion_lock); | |
ced22070 | 202 | mutex_unlock(&c->erase_free_sem); |
1da177e4 | 203 | wake_up(&c->erase_wait); |
182ec4ee | 204 | } |
1da177e4 LT |
205 | |
206 | #ifndef __ECOS | |
207 | static void jffs2_erase_callback(struct erase_info *instr) | |
208 | { | |
209 | struct erase_priv_struct *priv = (void *)instr->priv; | |
210 | ||
211 | if(instr->state != MTD_ERASE_DONE) { | |
212 | printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state); | |
213 | jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr); | |
214 | } else { | |
215 | jffs2_erase_succeeded(priv->c, priv->jeb); | |
182ec4ee | 216 | } |
1da177e4 LT |
217 | kfree(instr); |
218 | } | |
219 | #endif /* !__ECOS */ | |
220 | ||
221 | /* Hmmm. Maybe we should accept the extra space it takes and make | |
222 | this a standard doubly-linked list? */ | |
223 | static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c, | |
224 | struct jffs2_raw_node_ref *ref, struct jffs2_eraseblock *jeb) | |
225 | { | |
226 | struct jffs2_inode_cache *ic = NULL; | |
227 | struct jffs2_raw_node_ref **prev; | |
228 | ||
229 | prev = &ref->next_in_ino; | |
230 | ||
231 | /* Walk the inode's list once, removing any nodes from this eraseblock */ | |
232 | while (1) { | |
233 | if (!(*prev)->next_in_ino) { | |
182ec4ee | 234 | /* We're looking at the jffs2_inode_cache, which is |
1da177e4 LT |
235 | at the end of the linked list. Stash it and continue |
236 | from the beginning of the list */ | |
237 | ic = (struct jffs2_inode_cache *)(*prev); | |
238 | prev = &ic->nodes; | |
239 | continue; | |
182ec4ee | 240 | } |
1da177e4 | 241 | |
3be36675 | 242 | if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) { |
1da177e4 LT |
243 | /* It's in the block we're erasing */ |
244 | struct jffs2_raw_node_ref *this; | |
245 | ||
246 | this = *prev; | |
247 | *prev = this->next_in_ino; | |
248 | this->next_in_ino = NULL; | |
249 | ||
250 | if (this == ref) | |
251 | break; | |
252 | ||
253 | continue; | |
254 | } | |
255 | /* Not to be deleted. Skip */ | |
256 | prev = &((*prev)->next_in_ino); | |
257 | } | |
258 | ||
259 | /* PARANOIA */ | |
260 | if (!ic) { | |
c9f700f8 KK |
261 | JFFS2_WARNING("inode_cache/xattr_datum/xattr_ref" |
262 | " not found in remove_node_refs()!!\n"); | |
1da177e4 LT |
263 | return; |
264 | } | |
265 | ||
266 | D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n", | |
267 | jeb->offset, jeb->offset + c->sector_size, ic->ino)); | |
268 | ||
269 | D2({ | |
270 | int i=0; | |
271 | struct jffs2_raw_node_ref *this; | |
272 | printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG); | |
273 | ||
274 | this = ic->nodes; | |
182ec4ee | 275 | |
1da177e4 LT |
276 | while(this) { |
277 | printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this)); | |
278 | if (++i == 5) { | |
279 | printk("\n" KERN_DEBUG); | |
280 | i=0; | |
281 | } | |
282 | this = this->next_in_ino; | |
283 | } | |
284 | printk("\n"); | |
285 | }); | |
286 | ||
c9f700f8 KK |
287 | switch (ic->class) { |
288 | #ifdef CONFIG_JFFS2_FS_XATTR | |
289 | case RAWNODE_CLASS_XATTR_DATUM: | |
290 | jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic); | |
291 | break; | |
292 | case RAWNODE_CLASS_XATTR_REF: | |
293 | jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic); | |
294 | break; | |
295 | #endif | |
296 | default: | |
297 | if (ic->nodes == (void *)ic && ic->nlink == 0) | |
298 | jffs2_del_ino_cache(c, ic); | |
299 | } | |
1da177e4 LT |
300 | } |
301 | ||
c38c1b61 | 302 | void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) |
1da177e4 | 303 | { |
9bfeb691 | 304 | struct jffs2_raw_node_ref *block, *ref; |
1da177e4 | 305 | D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset)); |
182ec4ee | 306 | |
9bfeb691 DW |
307 | block = ref = jeb->first_node; |
308 | ||
309 | while (ref) { | |
310 | if (ref->flash_offset == REF_LINK_NODE) { | |
311 | ref = ref->next_in_ino; | |
312 | jffs2_free_refblock(block); | |
313 | block = ref; | |
314 | continue; | |
315 | } | |
316 | if (ref->flash_offset != REF_EMPTY_NODE && ref->next_in_ino) | |
1da177e4 LT |
317 | jffs2_remove_node_refs_from_ino_list(c, ref, jeb); |
318 | /* else it was a non-inode node or already removed, so don't bother */ | |
319 | ||
9bfeb691 | 320 | ref++; |
1da177e4 | 321 | } |
9bfeb691 | 322 | jeb->first_node = jeb->last_node = NULL; |
1da177e4 LT |
323 | } |
324 | ||
5d157885 | 325 | static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset) |
1da177e4 | 326 | { |
5d157885 TG |
327 | void *ebuf; |
328 | uint32_t ofs; | |
1da177e4 | 329 | size_t retlen; |
5d157885 | 330 | int ret = -EIO; |
182ec4ee | 331 | |
fab2c399 JT |
332 | if (c->mtd->point) { |
333 | unsigned long *wordebuf; | |
334 | ||
335 | ret = c->mtd->point(c->mtd, jeb->offset, c->sector_size, &retlen, (unsigned char **)&ebuf); | |
336 | if (ret) { | |
337 | D1(printk(KERN_DEBUG "MTD point failed %d\n", ret)); | |
338 | goto do_flash_read; | |
339 | } | |
340 | if (retlen < c->sector_size) { | |
341 | /* Don't muck about if it won't let us point to the whole erase sector */ | |
342 | D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", retlen)); | |
59d8235b | 343 | c->mtd->unpoint(c->mtd, ebuf, jeb->offset, retlen); |
fab2c399 JT |
344 | goto do_flash_read; |
345 | } | |
346 | wordebuf = ebuf-sizeof(*wordebuf); | |
347 | retlen /= sizeof(*wordebuf); | |
348 | do { | |
349 | if (*++wordebuf != ~0) | |
350 | break; | |
351 | } while(--retlen); | |
352 | c->mtd->unpoint(c->mtd, ebuf, jeb->offset, c->sector_size); | |
8a0f5723 | 353 | if (retlen) { |
f4e35647 | 354 | printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08tx\n", |
fab2c399 | 355 | *wordebuf, jeb->offset + c->sector_size-retlen*sizeof(*wordebuf)); |
8a0f5723 AG |
356 | return -EIO; |
357 | } | |
fab2c399 JT |
358 | return 0; |
359 | } | |
360 | do_flash_read: | |
1da177e4 LT |
361 | ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL); |
362 | if (!ebuf) { | |
5d157885 TG |
363 | printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset); |
364 | return -EAGAIN; | |
365 | } | |
1da177e4 | 366 | |
5d157885 | 367 | D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset)); |
1da177e4 | 368 | |
5d157885 TG |
369 | for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) { |
370 | uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs); | |
371 | int i; | |
1da177e4 | 372 | |
5d157885 | 373 | *bad_offset = ofs; |
894214d1 | 374 | |
b0afbbec | 375 | ret = c->mtd->read(c->mtd, ofs, readlen, &retlen, ebuf); |
5d157885 TG |
376 | if (ret) { |
377 | printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret); | |
8a0f5723 | 378 | ret = -EIO; |
5d157885 TG |
379 | goto fail; |
380 | } | |
381 | if (retlen != readlen) { | |
382 | printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen); | |
8a0f5723 | 383 | ret = -EIO; |
5d157885 TG |
384 | goto fail; |
385 | } | |
386 | for (i=0; i<readlen; i += sizeof(unsigned long)) { | |
387 | /* It's OK. We know it's properly aligned */ | |
388 | unsigned long *datum = ebuf + i; | |
389 | if (*datum + 1) { | |
390 | *bad_offset += i; | |
391 | printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", *datum, *bad_offset); | |
8a0f5723 | 392 | ret = -EIO; |
5d157885 | 393 | goto fail; |
1da177e4 | 394 | } |
1da177e4 | 395 | } |
5d157885 TG |
396 | ofs += readlen; |
397 | cond_resched(); | |
1da177e4 | 398 | } |
5d157885 TG |
399 | ret = 0; |
400 | fail: | |
401 | kfree(ebuf); | |
402 | return ret; | |
403 | } | |
1da177e4 | 404 | |
5d157885 TG |
405 | static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb) |
406 | { | |
5d157885 TG |
407 | size_t retlen; |
408 | int ret; | |
f4e35647 | 409 | uint32_t uninitialized_var(bad_offset); |
5d157885 TG |
410 | |
411 | switch (jffs2_block_check_erase(c, jeb, &bad_offset)) { | |
412 | case -EAGAIN: goto refile; | |
413 | case -EIO: goto filebad; | |
414 | } | |
1da177e4 | 415 | |
182ec4ee | 416 | /* Write the erase complete marker */ |
1da177e4 | 417 | D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset)); |
5d157885 | 418 | bad_offset = jeb->offset; |
1da177e4 | 419 | |
5d157885 TG |
420 | /* Cleanmarker in oob area or no cleanmarker at all ? */ |
421 | if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) { | |
1da177e4 | 422 | |
5d157885 TG |
423 | if (jffs2_cleanmarker_oob(c)) { |
424 | if (jffs2_write_nand_cleanmarker(c, jeb)) | |
425 | goto filebad; | |
426 | } | |
1da177e4 | 427 | } else { |
5d157885 | 428 | |
1da177e4 LT |
429 | struct kvec vecs[1]; |
430 | struct jffs2_unknown_node marker = { | |
431 | .magic = cpu_to_je16(JFFS2_MAGIC_BITMASK), | |
432 | .nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER), | |
433 | .totlen = cpu_to_je32(c->cleanmarker_size) | |
434 | }; | |
435 | ||
046b8b98 | 436 | jffs2_prealloc_raw_node_refs(c, jeb, 1); |
5d157885 | 437 | |
1da177e4 LT |
438 | marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4)); |
439 | ||
440 | vecs[0].iov_base = (unsigned char *) ▮ | |
441 | vecs[0].iov_len = sizeof(marker); | |
442 | ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen); | |
182ec4ee | 443 | |
5d157885 TG |
444 | if (ret || retlen != sizeof(marker)) { |
445 | if (ret) | |
446 | printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n", | |
447 | jeb->offset, ret); | |
448 | else | |
449 | printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n", | |
450 | jeb->offset, sizeof(marker), retlen); | |
451 | ||
5d157885 | 452 | goto filebad; |
1da177e4 | 453 | } |
1da177e4 | 454 | } |
014b164e DW |
455 | /* Everything else got zeroed before the erase */ |
456 | jeb->free_size = c->sector_size; | |
1da177e4 | 457 | |
ced22070 | 458 | mutex_lock(&c->erase_free_sem); |
1da177e4 | 459 | spin_lock(&c->erase_completion_lock); |
014b164e | 460 | |
1da177e4 | 461 | c->erasing_size -= c->sector_size; |
014b164e DW |
462 | c->free_size += c->sector_size; |
463 | ||
464 | /* Account for cleanmarker now, if it's in-band */ | |
465 | if (c->cleanmarker_size && !jffs2_cleanmarker_oob(c)) | |
466 | jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL); | |
1da177e4 | 467 | |
e2bc322b | 468 | list_move_tail(&jeb->list, &c->free_list); |
1da177e4 LT |
469 | c->nr_erasing_blocks--; |
470 | c->nr_free_blocks++; | |
85a62db6 DW |
471 | |
472 | jffs2_dbg_acct_sanity_check_nolock(c, jeb); | |
473 | jffs2_dbg_acct_paranoia_check_nolock(c, jeb); | |
474 | ||
1da177e4 | 475 | spin_unlock(&c->erase_completion_lock); |
ced22070 | 476 | mutex_unlock(&c->erase_free_sem); |
1da177e4 | 477 | wake_up(&c->erase_wait); |
5d157885 TG |
478 | return; |
479 | ||
480 | filebad: | |
ced22070 | 481 | mutex_lock(&c->erase_free_sem); |
5d157885 TG |
482 | spin_lock(&c->erase_completion_lock); |
483 | /* Stick it on a list (any list) so erase_failed can take it | |
484 | right off again. Silly, but shouldn't happen often. */ | |
e2bc322b | 485 | list_move(&jeb->list, &c->erasing_list); |
5d157885 | 486 | spin_unlock(&c->erase_completion_lock); |
ced22070 | 487 | mutex_unlock(&c->erase_free_sem); |
5d157885 TG |
488 | jffs2_erase_failed(c, jeb, bad_offset); |
489 | return; | |
1da177e4 | 490 | |
5d157885 TG |
491 | refile: |
492 | /* Stick it back on the list from whence it came and come back later */ | |
493 | jffs2_erase_pending_trigger(c); | |
ced22070 | 494 | mutex_lock(&c->erase_free_sem); |
5d157885 | 495 | spin_lock(&c->erase_completion_lock); |
e2bc322b | 496 | list_move(&jeb->list, &c->erase_complete_list); |
5d157885 | 497 | spin_unlock(&c->erase_completion_lock); |
ced22070 | 498 | mutex_unlock(&c->erase_free_sem); |
5d157885 TG |
499 | return; |
500 | } |