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

/*
 * JFFS2 -- Journalling Flash File System, Version 2.
 *
 * Copyright (C) 2001-2003 Red Hat, Inc.
 *
 * Created by David Woodhouse <dwmw2@infradead.org>
 *
 * For licensing information, see the file 'LICENCE' in this directory.
 *
 * $Id: erase.c,v 1.85 2005/09/20 14:53:15 dedekind Exp $
 *
 */

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

	D1(printk(KERN_DEBUG "jffs2_erase_block(): erase block %#08x (range %#08x-%#08x)\n",
				jeb->offset, jeb->offset, jeb->offset + c->sector_size));
	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");
		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);
		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;

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

	if (ret == -EROFS)
		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);
			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;
			jffs2_free_jeb_node_refs(c, jeb);
			list_add(&jeb->list, &c->erasing_list);
			spin_unlock(&c->erase_completion_lock);

			jffs2_erase_block(c, jeb);

		} else {
			BUG();
		}

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

	spin_unlock(&c->erase_completion_lock);
 done:
	D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n"));

	up(&c->erase_free_sem);
}

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));
	spin_lock(&c->erase_completion_lock);
	list_move_tail(&jeb->list, &c->erase_complete_list);
	spin_unlock(&c->erase_completion_lock);
	/* 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. */
			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);
			return;
		}
	}

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

	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;

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

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

void jffs2_free_jeb_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	struct jffs2_raw_node_ref *block, *ref;
	D1(printk(KERN_DEBUG "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 = -EIO;

	ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
	if (!ebuf) {
		printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset);
		return -EAGAIN;
	}

	D1(printk(KERN_DEBUG "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 = jffs2_flash_read(c, ofs, readlen, &retlen, ebuf);
		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;
			}
		}
		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 bad_offset;

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

	/* Write the erase complete marker */
	D1(printk(KERN_DEBUG "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;
		}

		/* Everything else got zeroed before the erase */
		jeb->free_size = c->sector_size;
	} 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)
				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;
		}

		/* Everything else got zeroed before the erase */
		jeb->free_size = c->sector_size;
		/* FIXME Special case for cleanmarker in empty block */
		jffs2_link_node_ref(c, jeb, jeb->offset | REF_NORMAL, c->cleanmarker_size, NULL);
	}

	spin_lock(&c->erase_completion_lock);
	c->erasing_size -= c->sector_size;
	c->free_size += jeb->free_size;
	c->used_size += jeb->used_size;

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

	list_add_tail(&jeb->list, &c->free_list);
	c->nr_erasing_blocks--;
	c->nr_free_blocks++;
	spin_unlock(&c->erase_completion_lock);
	wake_up(&c->erase_wait);
	return;

filebad:
	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);
	jffs2_erase_failed(c, jeb, bad_offset);
	return;

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