[net-next-2.6.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.74 2005/03/20 17:46:20 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_free_all_node_refs(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;

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

static 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 void jffs2_mark_erased_block(struct jffs2_sb_info *c, struct jffs2_eraseblock *jeb)
{
	struct jffs2_raw_node_ref *marker_ref = NULL;
	unsigned char *ebuf;
	size_t retlen;
	int ret;
	uint32_t bad_offset;

	if ((!jffs2_cleanmarker_oob(c)) && (c->cleanmarker_size > 0)) {
		marker_ref = jffs2_alloc_raw_node_ref();
		if (!marker_ref) {
			printk(KERN_WARNING "Failed to allocate raw node ref for clean marker\n");
			/* 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;
		}
	}
	ebuf = kmalloc(PAGE_SIZE, GFP_KERNEL);
	if (!ebuf) {
		printk(KERN_WARNING "Failed to allocate page buffer for verifying erase at 0x%08x. Assuming it worked\n", jeb->offset);
	} else {
		uint32_t ofs = jeb->offset;

		D1(printk(KERN_DEBUG "Verifying erase at 0x%08x\n", jeb->offset));
		while(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 bad;
			}
			if (retlen != readlen) {
				printk(KERN_WARNING "Short read from newly-erased block at 0x%08x. Wanted %d, got %zd\n", ofs, readlen, retlen);
				goto bad;
			}
			for (i=0; i<readlen; i += sizeof(unsigned long)) {
				/* It's OK. We know it's properly aligned */
				unsigned long datum = *(unsigned long *)(&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);
				bad: 
					if ((!jffs2_cleanmarker_oob(c)) && (c->cleanmarker_size > 0))
						jffs2_free_raw_node_ref(marker_ref);
					kfree(ebuf);
				bad2:
					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;
				}
			}
			ofs += readlen;
			cond_resched();
		}
		kfree(ebuf);
	}

	bad_offset = jeb->offset;

	/* Write the erase complete marker */	
	D1(printk(KERN_DEBUG "Writing erased marker to block at 0x%08x\n", jeb->offset));
	if (jffs2_cleanmarker_oob(c)) {

		if (jffs2_write_nand_cleanmarker(c, jeb))
			goto bad2;
			
		jeb->first_node = jeb->last_node = NULL;

		jeb->free_size = c->sector_size;
		jeb->used_size = 0;
		jeb->dirty_size = 0;
		jeb->wasted_size = 0;
	} else if (c->cleanmarker_size == 0) {
		jeb->first_node = jeb->last_node = NULL;

		jeb->free_size = c->sector_size;
		jeb->used_size = 0;
		jeb->dirty_size = 0;
		jeb->wasted_size = 0;
	} 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.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) {
			printk(KERN_WARNING "Write clean marker to block at 0x%08x failed: %d\n",
			       jeb->offset, ret);
			goto bad2;
		}
		if (retlen != sizeof(marker)) {
			printk(KERN_WARNING "Short write to newly-erased block at 0x%08x: Wanted %zd, got %zd\n",
			       jeb->offset, sizeof(marker), retlen);
			goto bad2;
		}

		marker_ref->next_in_ino = NULL;
		marker_ref->next_phys = NULL;
		marker_ref->flash_offset = jeb->offset | REF_NORMAL;
		marker_ref->__totlen = c->cleanmarker_size;
			
		jeb->first_node = jeb->last_node = marker_ref;
			
		jeb->free_size = c->sector_size - c->cleanmarker_size;
		jeb->used_size = c->cleanmarker_size;
		jeb->dirty_size = 0;
		jeb->wasted_size = 0;
	}

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

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