[linux.git] / fs / jffs2 / erase.c

/*
 * JFFS2 -- Journalling Flash File System, Version 2.
 *
 * Copyright © 2001-2007 Red Hat, Inc.
 * Copyright © 2004-2010 David Woodhouse <[email protected]>
 *
 * Created by David Woodhouse <[email protected]>
 *
 * For licensing information, see the file 'LICENCE' in this directory.
 *
 */

#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt

#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;
};

#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) {
	       jffs2_erase_succeeded(c, jeb);
	       return;
       }
       bad_offset = jeb->offset;
#else /* Linux */
	struct erase_info *instr;

	jffs2_dbg(1, "%s(): erase block %#08x (range %#08x-%#08x)\n",
		  __func__,
		  jeb->offset, jeb->offset, jeb->offset + c->sector_size);
	instr = kmalloc(sizeof(struct erase_info) + sizeof(struct erase_priv_struct), GFP_KERNEL);
	if (!instr) {
		pr_warn("kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n");
		mutex_lock(&c->erase_free_sem);
		spin_lock(&c->erase_completion_lock);
		list_move(&jeb->list, &c->erase_pending_list);
		c->erasing_size -= c->sector_size;
		c->dirty_size += c->sector_size;
		jeb->dirty_size = c->sector_size;
		spin_unlock(&c->erase_completion_lock);
		mutex_unlock(&c->erase_free_sem);
		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]);

	((struct erase_priv_struct *)instr->priv)->jeb = jeb;
	((struct erase_priv_struct *)instr->priv)->c = c;

	ret = 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 */
		jffs2_dbg(1, "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n",
			  jeb->offset, ret);
		mutex_lock(&c->erase_free_sem);
		spin_lock(&c->erase_completion_lock);
		list_move(&jeb->list, &c->erase_pending_list);
		c->erasing_size -= c->sector_size;
		c->dirty_size += c->sector_size;
		jeb->dirty_size = c->sector_size;
		spin_unlock(&c->erase_completion_lock);
		mutex_unlock(&c->erase_free_sem);
		return;
	}

	if (ret == -EROFS)
		pr_warn("Erase at 0x%08x failed immediately: -EROFS. Is the sector locked?\n",
			jeb->offset);
	else
		pr_warn("Erase at 0x%08x failed immediately: errno %d\n",
			jeb->offset, ret);

	jffs2_erase_failed(c, jeb, bad_offset);
}

int jffs2_erase_pending_blocks(struct jffs2_sb_info *c, int count)
{
	struct jffs2_eraseblock *jeb;
	int work_done = 0;

	mutex_lock(&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_move(&jeb->list, &c->erase_checking_list);
			spin_unlock(&c->erase_completion_lock);
			mutex_unlock(&c->erase_free_sem);
			jffs2_mark_erased_block(c, jeb);

			work_done++;
			if (!--count) {
				jffs2_dbg(1, "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);
			jffs2_dbg(1, "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;
			jffs2_free_jeb_node_refs(c, jeb);
			list_add(&jeb->list, &c->erasing_list);
			spin_unlock(&c->erase_completion_lock);
			mutex_unlock(&c->erase_free_sem);

			jffs2_erase_block(c, jeb);

		} else {
			BUG();
		}

		/* Be nice */
		cond_resched();
		mutex_lock(&c->erase_free_sem);
		spin_lock(&c->erase_completion_lock);
	}

	spin_unlock(&c->erase_completion_lock);
	mutex_unlock(&c->erase_free_sem);
 done:
	jffs2_dbg(1, "jffs2_erase_pending_blocks completed\n");
	return work_done;
}

static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	jffs2_dbg(1, "Erase completed successfully at 0x%08x\n", jeb->offset);
	mutex_lock(&c->erase_free_sem);
	spin_lock(&c->erase_completion_lock);
	list_move_tail(&jeb->list, &c->erase_complete_list);
	/* Wake the GC thread to mark them clean */
	jffs2_garbage_collect_trigger(c);
	spin_unlock(&c->erase_completion_lock);
	mutex_unlock(&c->erase_free_sem);
	wake_up(&c->erase_wait);
}

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 != (uint32_t)MTD_FAIL_ADDR_UNKNOWN)) {
		/* 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. */
			mutex_lock(&c->erase_free_sem);
			spin_lock(&c->erase_completion_lock);
			list_move(&jeb->list, &c->erase_pending_list);
			c->erasing_size -= c->sector_size;
			c->dirty_size += c->sector_size;
			jeb->dirty_size = c->sector_size;
			spin_unlock(&c->erase_completion_lock);
			mutex_unlock(&c->erase_free_sem);
			return;
		}
	}

	mutex_lock(&c->erase_free_sem);
	spin_lock(&c->erase_completion_lock);
	c->erasing_size -= c->sector_size;
	c->bad_size += c->sector_size;
	list_move(&jeb->list, &c->bad_list);
	c->nr_erasing_blocks--;
	spin_unlock(&c->erase_completion_lock);
	mutex_unlock(&c->erase_free_sem);
	wake_up(&c->erase_wait);
}

#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) {
		pr_warn("Erase at 0x%08llx finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n",
			(unsigned long long)instr->addr, instr->state);
		jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr);
	} else {
		jffs2_erase_succeeded(priv->c, priv->jeb);
	}
	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) {
			/* We're looking at the jffs2_inode_cache, which is
			   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;
		}

		if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) {
			/* 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) {
		JFFS2_WARNING("inode_cache/xattr_datum/xattr_ref"
			      " not found in remove_node_refs()!!\n");
		return;
	}

	jffs2_dbg(1, "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");

		this = ic->nodes;

		printk(KERN_DEBUG);
		while(this) {
			pr_cont("0x%08x(%d)->",
			       ref_offset(this), ref_flags(this));
			if (++i == 5) {
				printk(KERN_DEBUG);
				i=0;
			}
			this = this->next_in_ino;
		}
		pr_cont("\n");
	});

	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->pino_nlink == 0)
				jffs2_del_ino_cache(c, ic);
	}
}

void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	struct jffs2_raw_node_ref *block, *ref;
	jffs2_dbg(1, "Freeing all node refs for eraseblock offset 0x%08x\n",
		  jeb->offset);

	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)
			jffs2_remove_node_refs_from_ino_list(c, ref, jeb);
		/* else it was a non-inode node or already removed, so don't bother */

		ref++;
	}
	jeb->first_node = jeb->last_node = NULL;
}

static int jffs2_block_check_erase(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb, uint32_t *bad_offset)
{
	void *ebuf;
	uint32_t ofs;
	size_t retlen;
	int ret;
	unsigned long *wordebuf;

	ret = mtd_point(c->mtd, jeb->offset, c->sector_size, &retlen,
			&ebuf, NULL);
	if (ret != -EOPNOTSUPP) {
		if (ret) {
			jffs2_dbg(1, "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 */
			jffs2_dbg(1, "MTD point returned len too short: 0x%zx\n",
				  retlen);
			mtd_unpoint(c->mtd, jeb->offset, retlen);
			goto do_flash_read;
		}
		wordebuf = ebuf-sizeof(*wordebuf);
		retlen /= sizeof(*wordebuf);
		do {
		   if (*++wordebuf != ~0)
			   break;
		} while(--retlen);
		mtd_unpoint(c->mtd, jeb->offset, c->sector_size);
		if (retlen) {
			pr_warn("Newly-erased block contained word 0x%lx at offset 0x%08tx\n",
				*wordebuf,
				jeb->offset +
				c->sector_size-retlen * sizeof(*wordebuf));
			return -EIO;
		}
		return 0;
	}
 do_flash_read:
	ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
	if (!ebuf) {
		pr_warn("Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n",
			jeb->offset);
		return -EAGAIN;
	}

	jffs2_dbg(1, "Verifying erase at 0x%08x\n", jeb->offset);

	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;

		*bad_offset = ofs;

		ret = mtd_read(c->mtd, ofs, readlen, &retlen, ebuf);
		if (ret) {
			pr_warn("Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n",
				ofs, ret);
			ret = -EIO;
			goto fail;
		}
		if (retlen != readlen) {
			pr_warn("Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n",
				ofs, readlen, retlen);
			ret = -EIO;
			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;
				pr_warn("Newly-erased block contained word 0x%lx at offset 0x%08x\n",
					*datum, *bad_offset);
				ret = -EIO;
				goto fail;
			}
		}
		ofs += readlen;
		cond_resched();
	}
	ret = 0;
fail:
	kfree(ebuf);
	return ret;
}

static void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	size_t retlen;
	int ret;
	uint32_t uninitialized_var(bad_offset);

	switch (jffs2_block_check_erase(c, jeb, &bad_offset)) {
	case -EAGAIN:	goto refile;
	case -EIO:	goto filebad;
	}

	/* Write the erase complete marker */
	jffs2_dbg(1, "Writing erased marker to block at 0x%08x\n", jeb->offset);
	bad_offset = jeb->offset;

	/* Cleanmarker in oob area or no cleanmarker at all ? */
	if (jffs2_cleanmarker_oob(c) || c->cleanmarker_size == 0) {

		if (jffs2_cleanmarker_oob(c)) {
			if (jffs2_write_nand_cleanmarker(c, jeb))
				goto filebad;
		}
	} else {

		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)
		};

		jffs2_prealloc_raw_node_refs(c, jeb, 1);

		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);

		if (ret || retlen != sizeof(marker)) {
			if (ret)
				pr_warn("Write clean marker to block at 0x%08x failed: %d\n",
				       jeb->offset, ret);
			else
				pr_warn("Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n",
				       jeb->offset, sizeof(marker), retlen);

			goto filebad;
		}
	}
	/* Everything else got zeroed before the erase */
	jeb->free_size = c->sector_size;

	mutex_lock(&c->erase_free_sem);
	spin_lock(&c->erase_completion_lock);

	c->erasing_size -= c->sector_size;
	c->free_size += c->sector_size;

	/* Account for cleanmarker now, if it's in-band */
	if (c->cleanmarker_size && !jffs2_cleanmarker_oob(c))
		jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL);

	list_move_tail(&jeb->list, &c->free_list);
	c->nr_erasing_blocks--;
	c->nr_free_blocks++;

	jffs2_dbg_acct_sanity_check_nolock(c, jeb);
	jffs2_dbg_acct_paranoia_check_nolock(c, jeb);

	spin_unlock(&c->erase_completion_lock);
	mutex_unlock(&c->erase_free_sem);
	wake_up(&c->erase_wait);
	return;

filebad:
	jffs2_erase_failed(c, jeb, bad_offset);
	return;

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