erase.c 14.4 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3
/*
 * JFFS2 -- Journalling Flash File System, Version 2.
 *
4
 * Copyright © 2001-2007 Red Hat, Inc.
L
Linus Torvalds 已提交
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 *
 * Created by David Woodhouse <dwmw2@infradead.org>
 *
 * For licensing information, see the file 'LICENCE' in this directory.
 *
 */

#include <linux/kernel.h>
#include <linux/slab.h>
#include <linux/mtd/mtd.h>
#include <linux/compiler.h>
#include <linux/crc32.h>
#include <linux/sched.h>
#include <linux/pagemap.h>
#include "nodelist.h"

struct erase_priv_struct {
	struct jffs2_eraseblock *jeb;
	struct jffs2_sb_info *c;
};
25

L
Linus Torvalds 已提交
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
#ifndef __ECOS
static void jffs2_erase_callback(struct erase_info *);
#endif
static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset);
static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);
static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb);

static void jffs2_erase_block(struct jffs2_sb_info *c,
			      struct jffs2_eraseblock *jeb)
{
	int ret;
	uint32_t bad_offset;
#ifdef __ECOS
       ret = jffs2_flash_erase(c, jeb);
       if (!ret) {
D
David Woodhouse 已提交
41 42
	       jffs2_erase_succeeded(c, jeb);
	       return;
L
Linus Torvalds 已提交
43 44 45 46 47
       }
       bad_offset = jeb->offset;
#else /* Linux */
	struct erase_info *instr;

48 49
	D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#08x (range %#08x-%#08x)\n",
				jeb->offset, jeb->offset, jeb->offset + c->sector_size));
L
Linus Torvalds 已提交
50 51 52
	instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL);
	if (!instr) {
		printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n");
53
		down(&c->erase_free_sem);
L
Linus Torvalds 已提交
54
		spin_lock(&c->erase_completion_lock);
A
Akinobu Mita 已提交
55
		list_move(&jeb->list, &c->erase_pending_list);
L
Linus Torvalds 已提交
56 57 58 59
		c->erasing_size -= c->sector_size;
		c->dirty_size += c->sector_size;
		jeb->dirty_size = c->sector_size;
		spin_unlock(&c->erase_completion_lock);
60
		up(&c->erase_free_sem);
L
Linus Torvalds 已提交
61 62 63 64 65 66 67 68 69 70 71
		return;
	}

	memset(instr, 0, sizeof(*instr));

	instr->mtd = c->mtd;
	instr->addr = jeb->offset;
	instr->len = c->sector_size;
	instr->callback = jffs2_erase_callback;
	instr->priv = (unsigned long)(&instr[1]);
	instr->fail_addr = 0xffffffff;
72

L
Linus Torvalds 已提交
73 74 75 76 77 78 79 80 81 82 83 84 85 86
	((struct erase_priv_struct *)instr->priv)->jeb = jeb;
	((struct erase_priv_struct *)instr->priv)->c = c;

	ret = c->mtd->erase(c->mtd, instr);
	if (!ret)
		return;

	bad_offset = instr->fail_addr;
	kfree(instr);
#endif /* __ECOS */

	if (ret == -ENOMEM || ret == -EAGAIN) {
		/* Erase failed immediately. Refile it on the list */
		D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret));
87
		down(&c->erase_free_sem);
L
Linus Torvalds 已提交
88
		spin_lock(&c->erase_completion_lock);
A
Akinobu Mita 已提交
89
		list_move(&jeb->list, &c->erase_pending_list);
L
Linus Torvalds 已提交
90 91 92 93
		c->erasing_size -= c->sector_size;
		c->dirty_size += c->sector_size;
		jeb->dirty_size = c->sector_size;
		spin_unlock(&c->erase_completion_lock);
94
		up(&c->erase_free_sem);
L
Linus Torvalds 已提交
95 96 97
		return;
	}

98
	if (ret == -EROFS)
L
Linus Torvalds 已提交
99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
		printk(KERN_WARNING "Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n", jeb->offset);
	else
		printk(KERN_WARNING "Erase at 0x%08x failed immediately: errno %d\n", jeb->offset, ret);

	jffs2_erase_failed(c, jeb, bad_offset);
}

void jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count)
{
	struct jffs2_eraseblock *jeb;

	down(&c->erase_free_sem);

	spin_lock(&c->erase_completion_lock);

	while (!list_empty(&c->erase_complete_list) ||
	       !list_empty(&c->erase_pending_list)) {

		if (!list_empty(&c->erase_complete_list)) {
			jeb = list_entry(c->erase_complete_list.next, struct jffs2_eraseblock, list);
			list_del(&jeb->list);
			spin_unlock(&c->erase_completion_lock);
121
			up(&c->erase_free_sem);
L
Linus Torvalds 已提交
122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138
			jffs2_mark_erased_block(c, jeb);

			if (!--count) {
				D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n"));
				goto done;
			}

		} else if (!list_empty(&c->erase_pending_list)) {
			jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list);
			D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset));
			list_del(&jeb->list);
			c->erasing_size += c->sector_size;
			c->wasted_size -= jeb->wasted_size;
			c->free_size -= jeb->free_size;
			c->used_size -= jeb->used_size;
			c->dirty_size -= jeb->dirty_size;
			jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0;
139
			jffs2_free_jeb_node_refs(c, jeb);
L
Linus Torvalds 已提交
140 141
			list_add(&jeb->list, &c->erasing_list);
			spin_unlock(&c->erase_completion_lock);
142
			up(&c->erase_free_sem);
L
Linus Torvalds 已提交
143 144 145 146 147 148 149 150

			jffs2_erase_block(c, jeb);

		} else {
			BUG();
		}

		/* Be nice */
151
		yield();
152
		down(&c->erase_free_sem);
L
Linus Torvalds 已提交
153 154 155 156
		spin_lock(&c->erase_completion_lock);
	}

	spin_unlock(&c->erase_completion_lock);
157
	up(&c->erase_free_sem);
L
Linus Torvalds 已提交
158 159 160 161 162 163 164
 done:
	D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n"));
}

static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset));
165
	down(&c->erase_free_sem);
L
Linus Torvalds 已提交
166
	spin_lock(&c->erase_completion_lock);
A
Akinobu Mita 已提交
167
	list_move_tail(&jeb->list, &c->erase_complete_list);
L
Linus Torvalds 已提交
168
	spin_unlock(&c->erase_completion_lock);
169
	up(&c->erase_free_sem);
L
Linus Torvalds 已提交
170 171 172 173 174 175 176 177 178 179 180 181 182
	/* Ensure that kupdated calls us again to mark them clean */
	jffs2_erase_pending_trigger(c);
}

static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t bad_offset)
{
	/* For NAND, if the failure did not occur at the device level for a
	   specific physical page, don't bother updating the bad block table. */
	if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) {
		/* We had a device-level failure to erase.  Let's see if we've
		   failed too many times. */
		if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) {
			/* We'd like to give this block another try. */
183
			down(&c->erase_free_sem);
L
Linus Torvalds 已提交
184
			spin_lock(&c->erase_completion_lock);
A
Akinobu Mita 已提交
185
			list_move(&jeb->list, &c->erase_pending_list);
L
Linus Torvalds 已提交
186 187 188 189
			c->erasing_size -= c->sector_size;
			c->dirty_size += c->sector_size;
			jeb->dirty_size = c->sector_size;
			spin_unlock(&c->erase_completion_lock);
190
			up(&c->erase_free_sem);
L
Linus Torvalds 已提交
191 192 193 194
			return;
		}
	}

195
	down(&c->erase_free_sem);
L
Linus Torvalds 已提交
196 197 198
	spin_lock(&c->erase_completion_lock);
	c->erasing_size -= c->sector_size;
	c->bad_size += c->sector_size;
A
Akinobu Mita 已提交
199
	list_move(&jeb->list, &c->bad_list);
L
Linus Torvalds 已提交
200 201
	c->nr_erasing_blocks--;
	spin_unlock(&c->erase_completion_lock);
202
	up(&c->erase_free_sem);
L
Linus Torvalds 已提交
203
	wake_up(&c->erase_wait);
204
}
L
Linus Torvalds 已提交
205 206 207 208 209 210 211 212 213 214 215

#ifndef __ECOS
static void jffs2_erase_callback(struct erase_info *instr)
{
	struct erase_priv_struct *priv = (void *)instr->priv;

	if(instr->state != MTD_ERASE_DONE) {
		printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state);
		jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr);
	} else {
		jffs2_erase_succeeded(priv->c, priv->jeb);
216
	}
L
Linus Torvalds 已提交
217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233
	kfree(instr);
}
#endif /* !__ECOS */

/* Hmmm. Maybe we should accept the extra space it takes and make
   this a standard doubly-linked list? */
static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c,
			struct jffs2_raw_node_ref *ref, struct jffs2_eraseblock *jeb)
{
	struct jffs2_inode_cache *ic = NULL;
	struct jffs2_raw_node_ref **prev;

	prev = &ref->next_in_ino;

	/* Walk the inode's list once, removing any nodes from this eraseblock */
	while (1) {
		if (!(*prev)->next_in_ino) {
234
			/* We're looking at the jffs2_inode_cache, which is
L
Linus Torvalds 已提交
235 236 237 238 239
			   at the end of the linked list. Stash it and continue
			   from the beginning of the list */
			ic = (struct jffs2_inode_cache *)(*prev);
			prev = &ic->nodes;
			continue;
240
		}
L
Linus Torvalds 已提交
241

242
		if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) {
L
Linus Torvalds 已提交
243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260
			/* It's in the block we're erasing */
			struct jffs2_raw_node_ref *this;

			this = *prev;
			*prev = this->next_in_ino;
			this->next_in_ino = NULL;

			if (this == ref)
				break;

			continue;
		}
		/* Not to be deleted. Skip */
		prev = &((*prev)->next_in_ino);
	}

	/* PARANOIA */
	if (!ic) {
261 262
		JFFS2_WARNING("inode_cache/xattr_datum/xattr_ref"
			      " not found in remove_node_refs()!!\n");
L
Linus Torvalds 已提交
263 264 265 266 267 268 269 270 271 272 273 274
		return;
	}

	D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n",
		  jeb->offset, jeb->offset + c->sector_size, ic->ino));

	D2({
		int i=0;
		struct jffs2_raw_node_ref *this;
		printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG);

		this = ic->nodes;
275

L
Linus Torvalds 已提交
276 277 278 279 280 281 282 283 284 285 286
		while(this) {
			printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this));
			if (++i == 5) {
				printk("\n" KERN_DEBUG);
				i=0;
			}
			this = this->next_in_ino;
		}
		printk("\n");
	});

287 288 289 290 291 292 293 294 295 296 297 298 299
	switch (ic->class) {
#ifdef CONFIG_JFFS2_FS_XATTR
		case RAWNODE_CLASS_XATTR_DATUM:
			jffs2_release_xattr_datum(c, (struct jffs2_xattr_datum *)ic);
			break;
		case RAWNODE_CLASS_XATTR_REF:
			jffs2_release_xattr_ref(c, (struct jffs2_xattr_ref *)ic);
			break;
#endif
		default:
			if (ic->nodes == (void *)ic && ic->nlink == 0)
				jffs2_del_ino_cache(c, ic);
	}
L
Linus Torvalds 已提交
300 301
}

302
void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
L
Linus Torvalds 已提交
303
{
304
	struct jffs2_raw_node_ref *block, *ref;
L
Linus Torvalds 已提交
305
	D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset));
306

307 308 309 310 311 312 313 314 315 316
	block = ref = jeb->first_node;

	while (ref) {
		if (ref->flash_offset == REF_LINK_NODE) {
			ref = ref->next_in_ino;
			jffs2_free_refblock(block);
			block = ref;
			continue;
		}
		if (ref->flash_offset != REF_EMPTY_NODE && ref->next_in_ino)
L
Linus Torvalds 已提交
317 318 319
			jffs2_remove_node_refs_from_ino_list(c, ref, jeb);
		/* else it was a non-inode node or already removed, so don't bother */

320
		ref++;
L
Linus Torvalds 已提交
321
	}
322
	jeb->first_node = jeb->last_node = NULL;
L
Linus Torvalds 已提交
323 324
}

325
static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset)
L
Linus Torvalds 已提交
326
{
327 328
	void *ebuf;
	uint32_t ofs;
L
Linus Torvalds 已提交
329
	size_t retlen;
330
	int ret = -EIO;
331

332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353
	if (c->mtd->point) {
		unsigned long *wordebuf;

		ret = c->mtd->point(c->mtd, jeb->offset, c->sector_size, &retlen, (unsigned char **)&ebuf);
		if (ret) {
			D1(printk(KERN_DEBUG "MTD point failed %d\n", ret));
			goto do_flash_read;
		}
		if (retlen < c->sector_size) {
			/* Don't muck about if it won't let us point to the whole erase sector */
			D1(printk(KERN_DEBUG "MTD point returned len too short: 0x%zx\n", retlen));
			c->mtd->unpoint(c->mtd, ebuf, jeb->offset, c->sector_size);
			goto do_flash_read;
		}
		wordebuf = ebuf-sizeof(*wordebuf);
		retlen /= sizeof(*wordebuf);
		do {
		   if (*++wordebuf != ~0)
			   break;
		} while(--retlen);
		c->mtd->unpoint(c->mtd, ebuf, jeb->offset, c->sector_size);
		if (retlen)
354
			printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08tx\n",
355 356 357 358
			       *wordebuf, jeb->offset + c->sector_size-retlen*sizeof(*wordebuf));
		return 0;
	}
 do_flash_read:
L
Linus Torvalds 已提交
359 360
	ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
	if (!ebuf) {
361 362 363
		printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset);
		return -EAGAIN;
	}
L
Linus Torvalds 已提交
364

365
	D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset));
L
Linus Torvalds 已提交
366

367 368 369
	for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) {
		uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs);
		int i;
L
Linus Torvalds 已提交
370

371
		*bad_offset = ofs;
372

373
		ret = c->mtd->read(c->mtd, ofs, readlen, &retlen, ebuf);
374 375 376 377 378 379 380 381 382 383 384 385 386 387 388
		if (ret) {
			printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret);
			goto fail;
		}
		if (retlen != readlen) {
			printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen);
			goto fail;
		}
		for (i=0; i<readlen; i += sizeof(unsigned long)) {
			/* It's OK. We know it's properly aligned */
			unsigned long *datum = ebuf + i;
			if (*datum + 1) {
				*bad_offset += i;
				printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", *datum, *bad_offset);
				goto fail;
L
Linus Torvalds 已提交
389 390
			}
		}
391 392
		ofs += readlen;
		cond_resched();
L
Linus Torvalds 已提交
393
	}
394 395 396 397 398
	ret = 0;
fail:
	kfree(ebuf);
	return ret;
}
L
Linus Torvalds 已提交
399

400 401 402 403
static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	size_t retlen;
	int ret;
404
	uint32_t uninitialized_var(bad_offset);
405 406 407 408 409

	switch (jffs2_block_check_erase(c, jeb, &bad_offset)) {
	case -EAGAIN:	goto refile;
	case -EIO:	goto filebad;
	}
L
Linus Torvalds 已提交
410

411
	/* Write the erase complete marker */
L
Linus Torvalds 已提交
412
	D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset));
413
	bad_offset = jeb->offset;
L
Linus Torvalds 已提交
414

415 416
	/* Cleanmarker in oob area or no cleanmarker at all ? */
	if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) {
L
Linus Torvalds 已提交
417

418 419 420 421
		if (jffs2_cleanmarker_oob(c)) {
			if (jffs2_write_nand_cleanmarker(c, jeb))
				goto filebad;
		}
422

423
		/* Everything else got zeroed before the erase */
L
Linus Torvalds 已提交
424 425
		jeb->free_size = c->sector_size;
	} else {
426

L
Linus Torvalds 已提交
427 428 429 430 431 432 433
		struct kvec vecs[1];
		struct jffs2_unknown_node marker = {
			.magic =	cpu_to_je16(JFFS2_MAGIC_BITMASK),
			.nodetype =	cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER),
			.totlen =	cpu_to_je32(c->cleanmarker_size)
		};

434
		jffs2_prealloc_raw_node_refs(c, jeb, 1);
435

L
Linus Torvalds 已提交
436 437 438 439 440
		marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4));

		vecs[0].iov_base = (unsigned char *) &marker;
		vecs[0].iov_len = sizeof(marker);
		ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen);
441

442 443 444 445 446 447 448 449 450
		if (ret || retlen != sizeof(marker)) {
			if (ret)
				printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n",
				       jeb->offset, ret);
			else
				printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n",
				       jeb->offset, sizeof(marker), retlen);

			goto filebad;
L
Linus Torvalds 已提交
451 452
		}

453 454
		/* Everything else got zeroed before the erase */
		jeb->free_size = c->sector_size;
455 456
		/* FIXME Special case for cleanmarker in empty block */
		jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL);
L
Linus Torvalds 已提交
457 458
	}

459
	down(&c->erase_free_sem);
L
Linus Torvalds 已提交
460 461 462 463 464
	spin_lock(&c->erase_completion_lock);
	c->erasing_size -= c->sector_size;
	c->free_size += jeb->free_size;
	c->used_size += jeb->used_size;

465 466
	jffs2_dbg_acct_sanity_check_nolock(c,jeb);
	jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
L
Linus Torvalds 已提交
467 468 469 470 471

	list_add_tail(&jeb->list, &c->free_list);
	c->nr_erasing_blocks--;
	c->nr_free_blocks++;
	spin_unlock(&c->erase_completion_lock);
472
	up(&c->erase_free_sem);
L
Linus Torvalds 已提交
473
	wake_up(&c->erase_wait);
474 475 476
	return;

filebad:
477
	down(&c->erase_free_sem);
478 479 480 481 482
	spin_lock(&c->erase_completion_lock);
	/* Stick it on a list (any list) so erase_failed can take it
	   right off again.  Silly, but shouldn't happen often. */
	list_add(&jeb->list, &c->erasing_list);
	spin_unlock(&c->erase_completion_lock);
483
	up(&c->erase_free_sem);
484 485
	jffs2_erase_failed(c, jeb, bad_offset);
	return;
L
Linus Torvalds 已提交
486

487 488 489
refile:
	/* Stick it back on the list from whence it came and come back later */
	jffs2_erase_pending_trigger(c);
490
	down(&c->erase_free_sem);
491 492 493
	spin_lock(&c->erase_completion_lock);
	list_add(&jeb->list, &c->erase_complete_list);
	spin_unlock(&c->erase_completion_lock);
494
	up(&c->erase_free_sem);
495 496
	return;
}