|
@@ -53,8 +53,7 @@ static void jffs2_erase_block(struct jffs2_sb_info *c,
|
|
if (!instr) {
|
|
if (!instr) {
|
|
printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n");
|
|
printk(KERN_WARNING "kmalloc for struct erase_info in jffs2_erase_block failed. Refiling block for later\n");
|
|
spin_lock(&c->erase_completion_lock);
|
|
spin_lock(&c->erase_completion_lock);
|
|
- list_del(&jeb->list);
|
|
|
|
- list_add(&jeb->list, &c->erase_pending_list);
|
|
|
|
|
|
+ list_move(&jeb->list, &c->erase_pending_list);
|
|
c->erasing_size -= c->sector_size;
|
|
c->erasing_size -= c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
@@ -86,8 +85,7 @@ static void jffs2_erase_block(struct jffs2_sb_info *c,
|
|
/* Erase failed immediately. Refile it on the list */
|
|
/* 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));
|
|
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);
|
|
spin_lock(&c->erase_completion_lock);
|
|
- list_del(&jeb->list);
|
|
|
|
- list_add(&jeb->list, &c->erase_pending_list);
|
|
|
|
|
|
+ list_move(&jeb->list, &c->erase_pending_list);
|
|
c->erasing_size -= c->sector_size;
|
|
c->erasing_size -= c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
@@ -161,8 +159,7 @@ static void jffs2_erase_succeeded(struct jffs2_sb_info *c, struct jffs2_eraseblo
|
|
{
|
|
{
|
|
D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset));
|
|
D1(printk(KERN_DEBUG "Erase completed successfully at 0x%08x\n", jeb->offset));
|
|
spin_lock(&c->erase_completion_lock);
|
|
spin_lock(&c->erase_completion_lock);
|
|
- list_del(&jeb->list);
|
|
|
|
- list_add_tail(&jeb->list, &c->erase_complete_list);
|
|
|
|
|
|
+ list_move_tail(&jeb->list, &c->erase_complete_list);
|
|
spin_unlock(&c->erase_completion_lock);
|
|
spin_unlock(&c->erase_completion_lock);
|
|
/* Ensure that kupdated calls us again to mark them clean */
|
|
/* Ensure that kupdated calls us again to mark them clean */
|
|
jffs2_erase_pending_trigger(c);
|
|
jffs2_erase_pending_trigger(c);
|
|
@@ -178,8 +175,7 @@ static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock
|
|
if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) {
|
|
if (!jffs2_write_nand_badblock(c, jeb, bad_offset)) {
|
|
/* We'd like to give this block another try. */
|
|
/* We'd like to give this block another try. */
|
|
spin_lock(&c->erase_completion_lock);
|
|
spin_lock(&c->erase_completion_lock);
|
|
- list_del(&jeb->list);
|
|
|
|
- list_add(&jeb->list, &c->erase_pending_list);
|
|
|
|
|
|
+ list_move(&jeb->list, &c->erase_pending_list);
|
|
c->erasing_size -= c->sector_size;
|
|
c->erasing_size -= c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
c->dirty_size += c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
jeb->dirty_size = c->sector_size;
|
|
@@ -191,8 +187,7 @@ static void jffs2_erase_failed(struct jffs2_sb_info *c, struct jffs2_eraseblock
|
|
spin_lock(&c->erase_completion_lock);
|
|
spin_lock(&c->erase_completion_lock);
|
|
c->erasing_size -= c->sector_size;
|
|
c->erasing_size -= c->sector_size;
|
|
c->bad_size += c->sector_size;
|
|
c->bad_size += c->sector_size;
|
|
- list_del(&jeb->list);
|
|
|
|
- list_add(&jeb->list, &c->bad_list);
|
|
|
|
|
|
+ list_move(&jeb->list, &c->bad_list);
|
|
c->nr_erasing_blocks--;
|
|
c->nr_erasing_blocks--;
|
|
spin_unlock(&c->erase_completion_lock);
|
|
spin_unlock(&c->erase_completion_lock);
|
|
wake_up(&c->erase_wait);
|
|
wake_up(&c->erase_wait);
|