[mirror_ubuntu-zesty-kernel.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_del(&jeb->list);
		list_add(&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_del(&jeb->list);
		list_add(&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_all_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_del(&jeb->list);
	list_add_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_del(&jeb->list);
			list_add(&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_del(&jeb->list);
	list_add(&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) {
		printk(KERN_WARNING "inode_cache 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");
	});

	if (ic->nodes == (void *)ic && ic->nlink == 0)
		jffs2_del_ino_cache(c, ic);
}

void jffs2_free_all_node_refs(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	struct jffs2_raw_node_ref *ref;
	D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset));
	while(jeb->first_node) {
		ref = jeb->first_node;
		jeb->first_node = ref->next_phys;

		/* Remove from the inode-list */
		if (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 */

		jffs2_free_raw_node_ref(ref);
	}
	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)
{
	struct jffs2_raw_node_ref *marker_ref = NULL;
	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)
		};

		marker_ref = jffs2_alloc_raw_node_ref();
		if (!marker_ref) {
			printk(KERN_WARNING "Failed to allocate raw node ref for clean marker. Refiling\n");
			goto refile;
		}

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

			jffs2_free_raw_node_ref(marker_ref);
			goto filebad;
		}

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

		marker_ref->flash_offset = jeb->offset | REF_NORMAL;

		jffs2_link_node_ref(c, jeb, marker_ref, 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);
	56	list_del(&jeb->list);
	57	list_add(&jeb->list, &c->erase_pending_list);
	58	c->erasing_size -= c->sector_size;
	59	c->dirty_size += c->sector_size;
	60	jeb->dirty_size = c->sector_size;
	61	spin_unlock(&c->erase_completion_lock);
	62	return;
	63	}
	64
	65	memset(instr, 0, sizeof(*instr));
	66
	67	instr->mtd = c->mtd;
	68	instr->addr = jeb->offset;
	69	instr->len = c->sector_size;
	70	instr->callback = jffs2_erase_callback;
	71	instr->priv = (unsigned long)(&instr[1]);
	72	instr->fail_addr = 0xffffffff;
182ec4ee	73
1da177e4 LT	74	((struct erase_priv_struct *)instr->priv)->jeb = jeb;
	75	((struct erase_priv_struct *)instr->priv)->c = c;
	76
	77	ret = c->mtd->erase(c->mtd, instr);
	78	if (!ret)
	79	return;
	80
	81	bad_offset = instr->fail_addr;
	82	kfree(instr);
	83	#endif /* __ECOS */
	84
	85	if (ret == -ENOMEM \|\| ret == -EAGAIN) {
	86	/* Erase failed immediately. Refile it on the list */
	87	D1(printk(KERN_DEBUG "Erase at 0x%08x failed: %d. Refiling on erase_pending_list\n", jeb->offset, ret));
	88	spin_lock(&c->erase_completion_lock);
	89	list_del(&jeb->list);
	90	list_add(&jeb->list, &c->erase_pending_list);
	91	c->erasing_size -= c->sector_size;
	92	c->dirty_size += c->sector_size;
	93	jeb->dirty_size = c->sector_size;
	94	spin_unlock(&c->erase_completion_lock);
	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
	110	down(&c->erase_free_sem);
	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);
	119	list_del(&jeb->list);
	120	spin_unlock(&c->erase_completion_lock);
	121	jffs2_mark_erased_block(c, jeb);
	122
	123	if (!--count) {
	124	D1(printk(KERN_DEBUG "Count reached. jffs2_erase_pending_blocks leaving\n"));
	125	goto done;
	126	}
	127
	128	} else if (!list_empty(&c->erase_pending_list)) {
	129	jeb = list_entry(c->erase_pending_list.next, struct jffs2_eraseblock, list);
	130	D1(printk(KERN_DEBUG "Starting erase of pending block 0x%08x\n", jeb->offset));
	131	list_del(&jeb->list);
	132	c->erasing_size += c->sector_size;
	133	c->wasted_size -= jeb->wasted_size;
	134	c->free_size -= jeb->free_size;
	135	c->used_size -= jeb->used_size;
	136	c->dirty_size -= jeb->dirty_size;
	137	jeb->wasted_size = jeb->used_size = jeb->dirty_size = jeb->free_size = 0;
	138	jffs2_free_all_node_refs(c, jeb);
	139	list_add(&jeb->list, &c->erasing_list);
	140	spin_unlock(&c->erase_completion_lock);
	141
	142	jffs2_erase_block(c, jeb);
	143
	144	} else {
	145	BUG();
	146	}
	147
	148	/* Be nice */
	149	cond_resched();
	150	spin_lock(&c->erase_completion_lock);
	151	}
	152
	153	spin_unlock(&c->erase_completion_lock);
	154	done:
	155	D1(printk(KERN_DEBUG "jffs2_erase_pending_blocks completed\n"));
	156
	157	up(&c->erase_free_sem);
	158	}
	159
	160	static void jffs2_erase_succeeded(struct jffs2_sb_info c, struct jffs2_eraseblock jeb)
	161	{
	162	D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset));
163	spin_lock(&c->erase_completion_lock);
164	list_del(&jeb->list);
165	list_add_tail(&jeb->list, &c->erase_complete_list);
166	spin_unlock(&c->erase_completion_lock);
167	/* Ensure that kupdated calls us again to mark them clean */
168	jffs2_erase_pending_trigger(c);
169	}
170
171	static void jffs2_erase_failed(struct jffs2_sb_info c, struct jffs2_eraseblock jeb, uint32_t bad_offset)
172	{
173	/* For NAND, if the failure did not occur at the device level for a
174	specific physical page, don't bother updating the bad block table. */
175	if (jffs2_cleanmarker_oob(c) && (bad_offset != 0xffffffff)) {
176	/* We had a device-level failure to erase. Let's see if we've
177	failed too many times. */
178	if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) {
179	/* We'd like to give this block another try. */
180	spin_lock(&c->erase_completion_lock);
181	list_del(&jeb->list);
182	list_add(&jeb->list, &c->erase_pending_list);
183	c->erasing_size -= c->sector_size;
184	c->dirty_size += c->sector_size;
185	jeb->dirty_size = c->sector_size;
186	spin_unlock(&c->erase_completion_lock);
187	return;
188	}
189	}
190
191	spin_lock(&c->erase_completion_lock);
192	c->erasing_size -= c->sector_size;
193	c->bad_size += c->sector_size;
194	list_del(&jeb->list);
195	list_add(&jeb->list, &c->bad_list);
196	c->nr_erasing_blocks--;
197	spin_unlock(&c->erase_completion_lock);
198	wake_up(&c->erase_wait);
182ec4ee	199	}
1da177e4 LT	200
	201	#ifndef __ECOS
	202	static void jffs2_erase_callback(struct erase_info *instr)
	203	{
	204	struct erase_priv_struct priv = (void )instr->priv;
	205
	206	if(instr->state != MTD_ERASE_DONE) {
	207	printk(KERN_WARNING "Erase at 0x%08x finished, but state != MTD_ERASE_DONE. State is 0x%x instead.\n", instr->addr, instr->state);
	208	jffs2_erase_failed(priv->c, priv->jeb, instr->fail_addr);
	209	} else {
	210	jffs2_erase_succeeded(priv->c, priv->jeb);
182ec4ee	211	}
1da177e4 LT	212	kfree(instr);
	213	}
	214	#endif /* !__ECOS */
	215
	216	/* Hmmm. Maybe we should accept the extra space it takes and make
	217	this a standard doubly-linked list? */
	218	static inline void jffs2_remove_node_refs_from_ino_list(struct jffs2_sb_info *c,
	219	struct jffs2_raw_node_ref ref, struct jffs2_eraseblock jeb)
	220	{
	221	struct jffs2_inode_cache *ic = NULL;
	222	struct jffs2_raw_node_ref **prev;
	223
	224	prev = &ref->next_in_ino;
	225
	226	/* Walk the inode's list once, removing any nodes from this eraseblock */
	227	while (1) {
	228	if (!(*prev)->next_in_ino) {
182ec4ee	229	/* We're looking at the jffs2_inode_cache, which is
1da177e4 LT	230	at the end of the linked list. Stash it and continue
	231	from the beginning of the list */
	232	ic = (struct jffs2_inode_cache )(prev);
	233	prev = &ic->nodes;
	234	continue;
182ec4ee	235	}
1da177e4	236
3be36675	237	if (SECTOR_ADDR((*prev)->flash_offset) == jeb->offset) {
1da177e4 LT	238	/* It's in the block we're erasing */
	239	struct jffs2_raw_node_ref *this;
	240
	241	this = *prev;
	242	*prev = this->next_in_ino;
	243	this->next_in_ino = NULL;
	244
	245	if (this == ref)
	246	break;
	247
	248	continue;
	249	}
	250	/* Not to be deleted. Skip */
	251	prev = &((*prev)->next_in_ino);
	252	}
	253
	254	/* PARANOIA */
	255	if (!ic) {
	256	printk(KERN_WARNING "inode_cache not found in remove_node_refs()!!\n");
	257	return;
	258	}
	259
	260	D1(printk(KERN_DEBUG "Removed nodes in range 0x%08x-0x%08x from ino #%u\n",
	261	jeb->offset, jeb->offset + c->sector_size, ic->ino));
	262
	263	D2({
	264	int i=0;
	265	struct jffs2_raw_node_ref *this;
	266	printk(KERN_DEBUG "After remove_node_refs_from_ino_list: \n" KERN_DEBUG);
	267
	268	this = ic->nodes;
182ec4ee	269
1da177e4 LT	270	while(this) {
	271	printk( "0x%08x(%d)->", ref_offset(this), ref_flags(this));
	272	if (++i == 5) {
	273	printk("\n" KERN_DEBUG);
	274	i=0;
	275	}
	276	this = this->next_in_ino;
	277	}
	278	printk("\n");
	279	});
	280
437316d9	281	if (ic->nodes == (void *)ic && ic->nlink == 0)
1da177e4	282	jffs2_del_ino_cache(c, ic);
1da177e4 LT	283	}
1da177e4 LT	284
7807ef7b	285	void jffs2_free_all_node_refs(struct jffs2_sb_info c, struct jffs2_eraseblock jeb)
1da177e4 LT	286	{
	287	struct jffs2_raw_node_ref *ref;
	288	D1(printk(KERN_DEBUG "Freeing all node refs for eraseblock offset 0x%08x\n", jeb->offset));
	289	while(jeb->first_node) {
	290	ref = jeb->first_node;
	291	jeb->first_node = ref->next_phys;
182ec4ee	292
1da177e4 LT	293	/* Remove from the inode-list */
	294	if (ref->next_in_ino)
	295	jffs2_remove_node_refs_from_ino_list(c, ref, jeb);
	296	/* else it was a non-inode node or already removed, so don't bother */
	297
	298	jffs2_free_raw_node_ref(ref);
	299	}
	300	jeb->last_node = NULL;
	301	}
	302
5d157885	303	static int jffs2_block_check_erase(struct jffs2_sb_info c, struct jffs2_eraseblock jeb, uint32_t *bad_offset)
1da177e4	304	{
5d157885 TG	305	void *ebuf;
5d157885 TG	306	uint32_t ofs;
1da177e4	307	size_t retlen;
5d157885	308	int ret = -EIO;
182ec4ee	309
1da177e4 LT	310	ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
1da177e4 LT	311	if (!ebuf) {
5d157885 TG	312	printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Refiling\n", jeb->offset);
	313	return -EAGAIN;
	314	}
1da177e4	315
5d157885	316	D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset));
1da177e4	317
5d157885 TG	318	for (ofs = jeb->offset; ofs < jeb->offset + c->sector_size; ) {
	319	uint32_t readlen = min((uint32_t)PAGE_SIZE, jeb->offset + c->sector_size - ofs);
	320	int i;
1da177e4	321
5d157885	322	*bad_offset = ofs;
894214d1	323
5d157885 TG	324	ret = jffs2_flash_read(c, ofs, readlen, &retlen, ebuf);
	325	if (ret) {
	326	printk(KERN_WARNING "Read of newly-erased block at 0x%08x failed: %d. Putting on bad_list\n", ofs, ret);
	327	goto fail;
	328	}
	329	if (retlen != readlen) {
	330	printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen);
	331	goto fail;
	332	}
	333	for (i=0; i<readlen; i += sizeof(unsigned long)) {
	334	/* It's OK. We know it's properly aligned */
	335	unsigned long *datum = ebuf + i;
	336	if (*datum + 1) {
	337	*bad_offset += i;
	338	printk(KERN_WARNING "Newly-erased block contained word 0x%lx at offset 0x%08x\n", datum, bad_offset);
	339	goto fail;
1da177e4	340	}
1da177e4	341	}
5d157885 TG	342	ofs += readlen;
5d157885 TG	343	cond_resched();
1da177e4	344	}
5d157885 TG	345	ret = 0;
	346	fail:
	347	kfree(ebuf);
	348	return ret;
	349	}
1da177e4	350
5d157885 TG	351	static void jffs2_mark_erased_block(struct jffs2_sb_info c, struct jffs2_eraseblock jeb)
	352	{
	353	struct jffs2_raw_node_ref *marker_ref = NULL;
	354	size_t retlen;
	355	int ret;
	356	uint32_t bad_offset;
	357
	358	switch (jffs2_block_check_erase(c, jeb, &bad_offset)) {
	359	case -EAGAIN: goto refile;
	360	case -EIO: goto filebad;
	361	}
1da177e4	362
182ec4ee	363	/* Write the erase complete marker */
1da177e4	364	D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset));
5d157885	365	bad_offset = jeb->offset;
1da177e4	366
5d157885 TG	367	/* Cleanmarker in oob area or no cleanmarker at all ? */
5d157885 TG	368	if (jffs2_cleanmarker_oob(c) \|\| c->cleanmarker_size == 0) {
1da177e4	369
5d157885 TG	370	if (jffs2_cleanmarker_oob(c)) {
	371	if (jffs2_write_nand_cleanmarker(c, jeb))
	372	goto filebad;
	373	}
8f15fd55	374
f1f9671b	375	/* Everything else got zeroed before the erase */
1da177e4	376	jeb->free_size = c->sector_size;
1da177e4	377	} else {
5d157885	378
1da177e4 LT	379	struct kvec vecs[1];
	380	struct jffs2_unknown_node marker = {
	381	.magic = cpu_to_je16(JFFS2_MAGIC_BITMASK),
	382	.nodetype = cpu_to_je16(JFFS2_NODETYPE_CLEANMARKER),
	383	.totlen = cpu_to_je32(c->cleanmarker_size)
	384	};
	385
5d157885 TG	386	marker_ref = jffs2_alloc_raw_node_ref();
	387	if (!marker_ref) {
	388	printk(KERN_WARNING "Failed to allocate raw node ref for clean marker. Refiling\n");
	389	goto refile;
	390	}
	391
1da177e4 LT	392	marker.hdr_crc = cpu_to_je32(crc32(0, &marker, sizeof(struct jffs2_unknown_node)-4));
	393
	394	vecs[0].iov_base = (unsigned char *) &marker;
	395	vecs[0].iov_len = sizeof(marker);
	396	ret = jffs2_flash_direct_writev(c, vecs, 1, jeb->offset, &retlen);
182ec4ee	397
5d157885 TG	398	if (ret \|\| retlen != sizeof(marker)) {
	399	if (ret)
	400	printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n",
	401	jeb->offset, ret);
	402	else
	403	printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n",
	404	jeb->offset, sizeof(marker), retlen);
	405
	406	jffs2_free_raw_node_ref(marker_ref);
	407	goto filebad;
1da177e4 LT	408	}
1da177e4 LT	409
f1f9671b DW	410	/* Everything else got zeroed before the erase */
	411	jeb->free_size = c->sector_size;
	412
1da177e4	413	marker_ref->flash_offset = jeb->offset \| REF_NORMAL;
182ec4ee	414
fcb75787	415	jffs2_link_node_ref(c, jeb, marker_ref, c->cleanmarker_size, NULL);
1da177e4 LT	416	}
	417
	418	spin_lock(&c->erase_completion_lock);
	419	c->erasing_size -= c->sector_size;
	420	c->free_size += jeb->free_size;
	421	c->used_size += jeb->used_size;
	422
e0c8e42f AB	423	jffs2_dbg_acct_sanity_check_nolock(c,jeb);
e0c8e42f AB	424	jffs2_dbg_acct_paranoia_check_nolock(c, jeb);
1da177e4 LT	425
	426	list_add_tail(&jeb->list, &c->free_list);
	427	c->nr_erasing_blocks--;
	428	c->nr_free_blocks++;
	429	spin_unlock(&c->erase_completion_lock);
	430	wake_up(&c->erase_wait);
5d157885 TG	431	return;
	432
	433	filebad:
	434	spin_lock(&c->erase_completion_lock);
	435	/* Stick it on a list (any list) so erase_failed can take it
	436	right off again. Silly, but shouldn't happen often. */
	437	list_add(&jeb->list, &c->erasing_list);
	438	spin_unlock(&c->erase_completion_lock);
	439	jffs2_erase_failed(c, jeb, bad_offset);
	440	return;
1da177e4	441
5d157885 TG	442	refile:
	443	/* Stick it back on the list from whence it came and come back later */
	444	jffs2_erase_pending_trigger(c);
	445	spin_lock(&c->erase_completion_lock);
	446	list_add(&jeb->list, &c->erase_complete_list);
	447	spin_unlock(&c->erase_completion_lock);
	448	return;
	449	}