[linux.git] / fs / f2fs / recovery.c

/*
 * fs/f2fs/recovery.c
 *
 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
 *             http://www.samsung.com/
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 */
#include <linux/fs.h>
#include <linux/f2fs_fs.h>
#include "f2fs.h"
#include "node.h"
#include "segment.h"

static struct kmem_cache *fsync_entry_slab;

bool space_for_roll_forward(struct f2fs_sb_info *sbi)
{
	if (sbi->last_valid_block_count + sbi->alloc_valid_block_count
			> sbi->user_block_count)
		return false;
	return true;
}

static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
								nid_t ino)
{
	struct list_head *this;
	struct fsync_inode_entry *entry;

	list_for_each(this, head) {
		entry = list_entry(this, struct fsync_inode_entry, list);
		if (entry->inode->i_ino == ino)
			return entry;
	}
	return NULL;
}

static int recover_dentry(struct page *ipage, struct inode *inode)
{
	void *kaddr = page_address(ipage);
	struct f2fs_node *raw_node = (struct f2fs_node *)kaddr;
	struct f2fs_inode *raw_inode = &(raw_node->i);
	nid_t pino = le32_to_cpu(raw_inode->i_pino);
	struct f2fs_dir_entry *de;
	struct qstr name;
	struct page *page;
	struct inode *dir, *einode;
	int err = 0;

	dir = check_dirty_dir_inode(F2FS_SB(inode->i_sb), pino);
	if (!dir) {
		dir = f2fs_iget(inode->i_sb, pino);
		if (IS_ERR(dir)) {
			err = PTR_ERR(dir);
			goto out;
		}
		set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
		add_dirty_dir_inode(dir);
	}

	name.len = le32_to_cpu(raw_inode->i_namelen);
	name.name = raw_inode->i_name;
retry:
	de = f2fs_find_entry(dir, &name, &page);
	if (de && inode->i_ino == le32_to_cpu(de->ino)) {
		kunmap(page);
		f2fs_put_page(page, 0);
		goto out;
	}
	if (de) {
		einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
		if (IS_ERR(einode)) {
			WARN_ON(1);
			if (PTR_ERR(einode) == -ENOENT)
				err = -EEXIST;
			goto out;
		}
		f2fs_delete_entry(de, page, einode);
		iput(einode);
		goto retry;
	}
	err = __f2fs_add_link(dir, &name, inode);
out:
	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode and its dentry: "
			"ino = %x, name = %s, dir = %lx, err = %d",
			ino_of_node(ipage), raw_inode->i_name,
			IS_ERR(dir) ? 0 : dir->i_ino, err);
	return err;
}

static int recover_inode(struct inode *inode, struct page *node_page)
{
	void *kaddr = page_address(node_page);
	struct f2fs_node *raw_node = (struct f2fs_node *)kaddr;
	struct f2fs_inode *raw_inode = &(raw_node->i);

	if (!IS_INODE(node_page))
		return 0;

	inode->i_mode = le16_to_cpu(raw_inode->i_mode);
	i_size_write(inode, le64_to_cpu(raw_inode->i_size));
	inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
	inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
	inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);

	if (is_dent_dnode(node_page))
		return recover_dentry(node_page, inode);

	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
			ino_of_node(node_page), raw_inode->i_name);
	return 0;
}

static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
{
	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	struct curseg_info *curseg;
	struct page *page;
	block_t blkaddr;
	int err = 0;

	/* get node pages in the current segment */
	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
	blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;

	/* read node page */
	page = alloc_page(GFP_F2FS_ZERO);
	if (IS_ERR(page))
		return PTR_ERR(page);
	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

		err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
		if (err)
			goto out;

		lock_page(page);

		if (cp_ver != cpver_of_node(page))
			break;

		if (!is_fsync_dnode(page))
			goto next;

		entry = get_fsync_inode(head, ino_of_node(page));
		if (entry) {
			if (IS_INODE(page) && is_dent_dnode(page))
				set_inode_flag(F2FS_I(entry->inode),
							FI_INC_LINK);
		} else {
			if (IS_INODE(page) && is_dent_dnode(page)) {
				err = recover_inode_page(sbi, page);
				if (err)
					break;
			}

			/* add this fsync inode to the list */
			entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
			if (!entry) {
				err = -ENOMEM;
				break;
			}

			entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
			if (IS_ERR(entry->inode)) {
				err = PTR_ERR(entry->inode);
				kmem_cache_free(fsync_entry_slab, entry);
				break;
			}
			list_add_tail(&entry->list, head);
		}
		entry->blkaddr = blkaddr;

		err = recover_inode(entry->inode, page);
		if (err && err != -ENOENT)
			break;
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
	}
	unlock_page(page);
out:
	__free_pages(page, 0);
	return err;
}

static void destroy_fsync_dnodes(struct list_head *head)
{
	struct fsync_inode_entry *entry, *tmp;

	list_for_each_entry_safe(entry, tmp, head, list) {
		iput(entry->inode);
		list_del(&entry->list);
		kmem_cache_free(fsync_entry_slab, entry);
	}
}

static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
			block_t blkaddr, struct dnode_of_data *dn)
{
	struct seg_entry *sentry;
	unsigned int segno = GET_SEGNO(sbi, blkaddr);
	unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
					(sbi->blocks_per_seg - 1);
	struct f2fs_summary sum;
	nid_t ino, nid;
	void *kaddr;
	struct inode *inode;
	struct page *node_page;
	block_t bidx;
	int i;

	sentry = get_seg_entry(sbi, segno);
	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
		return 0;

	/* Get the previous summary */
	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
		struct curseg_info *curseg = CURSEG_I(sbi, i);
		if (curseg->segno == segno) {
			sum = curseg->sum_blk->entries[blkoff];
			break;
		}
	}
	if (i > CURSEG_COLD_DATA) {
		struct page *sum_page = get_sum_page(sbi, segno);
		struct f2fs_summary_block *sum_node;
		kaddr = page_address(sum_page);
		sum_node = (struct f2fs_summary_block *)kaddr;
		sum = sum_node->entries[blkoff];
		f2fs_put_page(sum_page, 1);
	}

	/* Use the locked dnode page and inode */
	nid = le32_to_cpu(sum.nid);
	if (dn->inode->i_ino == nid) {
		struct dnode_of_data tdn = *dn;
		tdn.nid = nid;
		tdn.node_page = dn->inode_page;
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
		truncate_data_blocks_range(&tdn, 1);
		return 0;
	} else if (dn->nid == nid) {
		struct dnode_of_data tdn = *dn;
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
		truncate_data_blocks_range(&tdn, 1);
		return 0;
	}

	/* Get the node page */
	node_page = get_node_page(sbi, nid);
	if (IS_ERR(node_page))
		return PTR_ERR(node_page);
	bidx = start_bidx_of_node(ofs_of_node(node_page)) +
					le16_to_cpu(sum.ofs_in_node);
	ino = ino_of_node(node_page);
	f2fs_put_page(node_page, 1);

	/* Deallocate previous index in the node page */
	inode = f2fs_iget(sbi->sb, ino);
	if (IS_ERR(inode))
		return PTR_ERR(inode);

	truncate_hole(inode, bidx, bidx + 1);
	iput(inode);
	return 0;
}

static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
					struct page *page, block_t blkaddr)
{
	unsigned int start, end;
	struct dnode_of_data dn;
	struct f2fs_summary sum;
	struct node_info ni;
	int err = 0, recovered = 0;
	int ilock;

	start = start_bidx_of_node(ofs_of_node(page));
	if (IS_INODE(page))
		end = start + ADDRS_PER_INODE;
	else
		end = start + ADDRS_PER_BLOCK;

	ilock = mutex_lock_op(sbi);
	set_new_dnode(&dn, inode, NULL, NULL, 0);

	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
	if (err) {
		mutex_unlock_op(sbi, ilock);
		return err;
	}

	wait_on_page_writeback(dn.node_page);

	get_node_info(sbi, dn.nid, &ni);
	BUG_ON(ni.ino != ino_of_node(page));
	BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));

	for (; start < end; start++) {
		block_t src, dest;

		src = datablock_addr(dn.node_page, dn.ofs_in_node);
		dest = datablock_addr(page, dn.ofs_in_node);

		if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
			if (src == NULL_ADDR) {
				int err = reserve_new_block(&dn);
				/* We should not get -ENOSPC */
				BUG_ON(err);
			}

			/* Check the previous node page having this index */
			err = check_index_in_prev_nodes(sbi, dest, &dn);
			if (err)
				goto err;

			set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);

			/* write dummy data page */
			recover_data_page(sbi, NULL, &sum, src, dest);
			update_extent_cache(dest, &dn);
			recovered++;
		}
		dn.ofs_in_node++;
	}

	/* write node page in place */
	set_summary(&sum, dn.nid, 0, 0);
	if (IS_INODE(dn.node_page))
		sync_inode_page(&dn);

	copy_node_footer(dn.node_page, page);
	fill_node_footer(dn.node_page, dn.nid, ni.ino,
					ofs_of_node(page), false);
	set_page_dirty(dn.node_page);

	recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
err:
	f2fs_put_dnode(&dn);
	mutex_unlock_op(sbi, ilock);

	f2fs_msg(sbi->sb, KERN_NOTICE, "recover_data: ino = %lx, "
			"recovered_data = %d blocks, err = %d",
			inode->i_ino, recovered, err);
	return err;
}

static int recover_data(struct f2fs_sb_info *sbi,
				struct list_head *head, int type)
{
	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	struct curseg_info *curseg;
	struct page *page;
	int err = 0;
	block_t blkaddr;

	/* get node pages in the current segment */
	curseg = CURSEG_I(sbi, type);
	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);

	/* read node page */
	page = alloc_page(GFP_NOFS | __GFP_ZERO);
	if (IS_ERR(page))
		return -ENOMEM;

	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

		err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
		if (err)
			goto out;

		lock_page(page);

		if (cp_ver != cpver_of_node(page))
			break;

		entry = get_fsync_inode(head, ino_of_node(page));
		if (!entry)
			goto next;

		err = do_recover_data(sbi, entry->inode, page, blkaddr);
		if (err)
			break;

		if (entry->blkaddr == blkaddr) {
			iput(entry->inode);
			list_del(&entry->list);
			kmem_cache_free(fsync_entry_slab, entry);
		}
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
	}
	unlock_page(page);
out:
	__free_pages(page, 0);

	if (!err)
		allocate_new_segments(sbi);
	return err;
}

int recover_fsync_data(struct f2fs_sb_info *sbi)
{
	struct list_head inode_list;
	int err;

	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
			sizeof(struct fsync_inode_entry), NULL);
	if (unlikely(!fsync_entry_slab))
		return -ENOMEM;

	INIT_LIST_HEAD(&inode_list);

	/* step #1: find fsynced inode numbers */
	sbi->por_doing = 1;
	err = find_fsync_dnodes(sbi, &inode_list);
	if (err)
		goto out;

	if (list_empty(&inode_list))
		goto out;

	/* step #2: recover data */
	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
	BUG_ON(!list_empty(&inode_list));
out:
	destroy_fsync_dnodes(&inode_list);
	kmem_cache_destroy(fsync_entry_slab);
	sbi->por_doing = 0;
	if (!err)
		write_checkpoint(sbi, false);
	return err;
}
Commit	Line	Data
0a8165d7	1	/*
d624c96f JK	2	* fs/f2fs/recovery.c
	3	*
	4	* Copyright (c) 2012 Samsung Electronics Co., Ltd.
	5	* http://www.samsung.com/
	6	*
	7	* This program is free software; you can redistribute it and/or modify
	8	* it under the terms of the GNU General Public License version 2 as
	9	* published by the Free Software Foundation.
	10	*/
	11	#include <linux/fs.h>
	12	#include <linux/f2fs_fs.h>
	13	#include "f2fs.h"
	14	#include "node.h"
	15	#include "segment.h"
	16
	17	static struct kmem_cache *fsync_entry_slab;
	18
	19	bool space_for_roll_forward(struct f2fs_sb_info *sbi)
	20	{
	21	if (sbi->last_valid_block_count + sbi->alloc_valid_block_count
	22	> sbi->user_block_count)
	23	return false;
	24	return true;
	25	}
	26
	27	static struct fsync_inode_entry get_fsync_inode(struct list_head head,
	28	nid_t ino)
	29	{
	30	struct list_head *this;
	31	struct fsync_inode_entry *entry;
	32
	33	list_for_each(this, head) {
	34	entry = list_entry(this, struct fsync_inode_entry, list);
	35	if (entry->inode->i_ino == ino)
	36	return entry;
	37	}
	38	return NULL;
	39	}
	40
	41	static int recover_dentry(struct page ipage, struct inode inode)
	42	{
9a55ed65 JK	43	void *kaddr = page_address(ipage);
9a55ed65 JK	44	struct f2fs_node raw_node = (struct f2fs_node )kaddr;
d624c96f	45	struct f2fs_inode *raw_inode = &(raw_node->i);
74d0b917	46	nid_t pino = le32_to_cpu(raw_inode->i_pino);
6b8213d9	47	struct f2fs_dir_entry *de;
b7f7a5e0	48	struct qstr name;
d624c96f	49	struct page *page;
6b8213d9	50	struct inode dir, einode;
d624c96f JK	51	int err = 0;
d624c96f JK	52
74d0b917 JK	53	dir = check_dirty_dir_inode(F2FS_SB(inode->i_sb), pino);
	54	if (!dir) {
	55	dir = f2fs_iget(inode->i_sb, pino);
	56	if (IS_ERR(dir)) {
	57	err = PTR_ERR(dir);
	58	goto out;
	59	}
	60	set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
5deb8267	61	add_dirty_dir_inode(dir);
d624c96f JK	62	}
d624c96f JK	63
b7f7a5e0 AV	64	name.len = le32_to_cpu(raw_inode->i_namelen);
b7f7a5e0 AV	65	name.name = raw_inode->i_name;
6b8213d9 JK	66	retry:
	67	de = f2fs_find_entry(dir, &name, &page);
	68	if (de && inode->i_ino == le32_to_cpu(de->ino)) {
d624c96f JK	69	kunmap(page);
d624c96f JK	70	f2fs_put_page(page, 0);
6b8213d9 JK	71	goto out;
	72	}
	73	if (de) {
	74	einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
	75	if (IS_ERR(einode)) {
	76	WARN_ON(1);
	77	if (PTR_ERR(einode) == -ENOENT)
	78	err = -EEXIST;
	79	goto out;
	80	}
	81	f2fs_delete_entry(de, page, einode);
	82	iput(einode);
	83	goto retry;
d624c96f	84	}
6b8213d9	85	err = __f2fs_add_link(dir, &name, inode);
d624c96f	86	out:
f356fe0c JK	87	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode and its dentry: "
f356fe0c JK	88	"ino = %x, name = %s, dir = %lx, err = %d",
f28c06fa DC	89	ino_of_node(ipage), raw_inode->i_name,
f28c06fa DC	90	IS_ERR(dir) ? 0 : dir->i_ino, err);
d624c96f JK	91	return err;
	92	}
	93
	94	static int recover_inode(struct inode inode, struct page node_page)
	95	{
	96	void *kaddr = page_address(node_page);
	97	struct f2fs_node raw_node = (struct f2fs_node )kaddr;
	98	struct f2fs_inode *raw_inode = &(raw_node->i);
	99
f356fe0c JK	100	if (!IS_INODE(node_page))
	101	return 0;
	102
25ca923b	103	inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f JK	104	i_size_write(inode, le64_to_cpu(raw_inode->i_size));
	105	inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	106	inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
	107	inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	108	inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	109	inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
	110	inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	111
f356fe0c JK	112	if (is_dent_dnode(node_page))
	113	return recover_dentry(node_page, inode);
	114
	115	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
	116	ino_of_node(node_page), raw_inode->i_name);
	117	return 0;
d624c96f JK	118	}
	119
	120	static int find_fsync_dnodes(struct f2fs_sb_info sbi, struct list_head head)
	121	{
	122	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	123	struct curseg_info *curseg;
	124	struct page *page;
	125	block_t blkaddr;
	126	int err = 0;
	127
	128	/* get node pages in the current segment */
	129	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
	130	blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;
	131
	132	/* read node page */
	133	page = alloc_page(GFP_F2FS_ZERO);
	134	if (IS_ERR(page))
	135	return PTR_ERR(page);
	136	lock_page(page);
	137
	138	while (1) {
	139	struct fsync_inode_entry *entry;
	140
393ff91f JK	141	err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
393ff91f JK	142	if (err)
d624c96f JK	143	goto out;
d624c96f JK	144
393ff91f JK	145	lock_page(page);
393ff91f JK	146
6ead1142	147	if (cp_ver != cpver_of_node(page))
f356fe0c	148	break;
d624c96f JK	149
	150	if (!is_fsync_dnode(page))
	151	goto next;
	152
	153	entry = get_fsync_inode(head, ino_of_node(page));
	154	if (entry) {
d624c96f JK	155	if (IS_INODE(page) && is_dent_dnode(page))
	156	set_inode_flag(F2FS_I(entry->inode),
	157	FI_INC_LINK);
	158	} else {
	159	if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142 JK	160	err = recover_inode_page(sbi, page);
6ead1142 JK	161	if (err)
f356fe0c	162	break;
d624c96f JK	163	}
	164
	165	/* add this fsync inode to the list */
	166	entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
	167	if (!entry) {
	168	err = -ENOMEM;
f356fe0c	169	break;
d624c96f JK	170	}
d624c96f JK	171
d624c96f JK	172	entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
	173	if (IS_ERR(entry->inode)) {
	174	err = PTR_ERR(entry->inode);
fd8bb65f	175	kmem_cache_free(fsync_entry_slab, entry);
f356fe0c	176	break;
d624c96f	177	}
fd8bb65f	178	list_add_tail(&entry->list, head);
d624c96f	179	}
addbe45b JK	180	entry->blkaddr = blkaddr;
addbe45b JK	181
f356fe0c JK	182	err = recover_inode(entry->inode, page);
	183	if (err && err != -ENOENT)
	184	break;
d624c96f JK	185	next:
	186	/* check next segment */
	187	blkaddr = next_blkaddr_of_node(page);
d624c96f	188	}
d624c96f	189	unlock_page(page);
393ff91f	190	out:
d624c96f JK	191	__free_pages(page, 0);
	192	return err;
	193	}
	194
5ebefc5b	195	static void destroy_fsync_dnodes(struct list_head *head)
d624c96f	196	{
d8b79b2f DC	197	struct fsync_inode_entry entry, tmp;
	198
	199	list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f JK	200	iput(entry->inode);
	201	list_del(&entry->list);
	202	kmem_cache_free(fsync_entry_slab, entry);
	203	}
	204	}
	205
39cf72cf	206	static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
b292dcab	207	block_t blkaddr, struct dnode_of_data *dn)
d624c96f JK	208	{
	209	struct seg_entry *sentry;
	210	unsigned int segno = GET_SEGNO(sbi, blkaddr);
	211	unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
	212	(sbi->blocks_per_seg - 1);
	213	struct f2fs_summary sum;
b292dcab	214	nid_t ino, nid;
d624c96f JK	215	void *kaddr;
	216	struct inode *inode;
	217	struct page *node_page;
	218	block_t bidx;
	219	int i;
	220
	221	sentry = get_seg_entry(sbi, segno);
	222	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
39cf72cf	223	return 0;
d624c96f JK	224
	225	/* Get the previous summary */
	226	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
	227	struct curseg_info *curseg = CURSEG_I(sbi, i);
	228	if (curseg->segno == segno) {
	229	sum = curseg->sum_blk->entries[blkoff];
	230	break;
	231	}
	232	}
	233	if (i > CURSEG_COLD_DATA) {
	234	struct page *sum_page = get_sum_page(sbi, segno);
	235	struct f2fs_summary_block *sum_node;
	236	kaddr = page_address(sum_page);
	237	sum_node = (struct f2fs_summary_block *)kaddr;
	238	sum = sum_node->entries[blkoff];
	239	f2fs_put_page(sum_page, 1);
	240	}
	241
b292dcab JK	242	/* Use the locked dnode page and inode */
	243	nid = le32_to_cpu(sum.nid);
	244	if (dn->inode->i_ino == nid) {
	245	struct dnode_of_data tdn = *dn;
	246	tdn.nid = nid;
	247	tdn.node_page = dn->inode_page;
060dd67b	248	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab	249	truncate_data_blocks_range(&tdn, 1);
39cf72cf	250	return 0;
b292dcab JK	251	} else if (dn->nid == nid) {
b292dcab JK	252	struct dnode_of_data tdn = *dn;
060dd67b	253	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab	254	truncate_data_blocks_range(&tdn, 1);
39cf72cf	255	return 0;
b292dcab JK	256	}
b292dcab JK	257
d624c96f	258	/* Get the node page */
b292dcab	259	node_page = get_node_page(sbi, nid);
39cf72cf JK	260	if (IS_ERR(node_page))
39cf72cf JK	261	return PTR_ERR(node_page);
d624c96f	262	bidx = start_bidx_of_node(ofs_of_node(node_page)) +
b292dcab	263	le16_to_cpu(sum.ofs_in_node);
d624c96f JK	264	ino = ino_of_node(node_page);
	265	f2fs_put_page(node_page, 1);
	266
	267	/* Deallocate previous index in the node page */
d4686d56	268	inode = f2fs_iget(sbi->sb, ino);
06025f4d	269	if (IS_ERR(inode))
39cf72cf	270	return PTR_ERR(inode);
06025f4d	271
d624c96f JK	272	truncate_hole(inode, bidx, bidx + 1);
d624c96f JK	273	iput(inode);
39cf72cf	274	return 0;
d624c96f JK	275	}
d624c96f JK	276
6ead1142	277	static int do_recover_data(struct f2fs_sb_info sbi, struct inode inode,
d624c96f JK	278	struct page *page, block_t blkaddr)
	279	{
	280	unsigned int start, end;
	281	struct dnode_of_data dn;
	282	struct f2fs_summary sum;
	283	struct node_info ni;
f356fe0c	284	int err = 0, recovered = 0;
39936837	285	int ilock;
d624c96f JK	286
	287	start = start_bidx_of_node(ofs_of_node(page));
	288	if (IS_INODE(page))
	289	end = start + ADDRS_PER_INODE;
	290	else
	291	end = start + ADDRS_PER_BLOCK;
	292
39936837	293	ilock = mutex_lock_op(sbi);
d624c96f	294	set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837	295
6ead1142	296	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837 JK	297	if (err) {
39936837 JK	298	mutex_unlock_op(sbi, ilock);
6ead1142	299	return err;
39936837	300	}
d624c96f JK	301
	302	wait_on_page_writeback(dn.node_page);
	303
	304	get_node_info(sbi, dn.nid, &ni);
	305	BUG_ON(ni.ino != ino_of_node(page));
	306	BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));
	307
	308	for (; start < end; start++) {
	309	block_t src, dest;
	310
	311	src = datablock_addr(dn.node_page, dn.ofs_in_node);
	312	dest = datablock_addr(page, dn.ofs_in_node);
	313
	314	if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
	315	if (src == NULL_ADDR) {
	316	int err = reserve_new_block(&dn);
	317	/* We should not get -ENOSPC */
	318	BUG_ON(err);
	319	}
	320
	321	/* Check the previous node page having this index */
39cf72cf JK	322	err = check_index_in_prev_nodes(sbi, dest, &dn);
	323	if (err)
	324	goto err;
d624c96f JK	325
	326	set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
	327
	328	/* write dummy data page */
	329	recover_data_page(sbi, NULL, &sum, src, dest);
	330	update_extent_cache(dest, &dn);
f356fe0c	331	recovered++;
d624c96f JK	332	}
	333	dn.ofs_in_node++;
	334	}
	335
	336	/* write node page in place */
	337	set_summary(&sum, dn.nid, 0, 0);
	338	if (IS_INODE(dn.node_page))
	339	sync_inode_page(&dn);
	340
	341	copy_node_footer(dn.node_page, page);
	342	fill_node_footer(dn.node_page, dn.nid, ni.ino,
	343	ofs_of_node(page), false);
	344	set_page_dirty(dn.node_page);
	345
	346	recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
39cf72cf	347	err:
d624c96f	348	f2fs_put_dnode(&dn);
39936837	349	mutex_unlock_op(sbi, ilock);
f356fe0c JK	350
f356fe0c JK	351	f2fs_msg(sbi->sb, KERN_NOTICE, "recover_data: ino = %lx, "
39cf72cf JK	352	"recovered_data = %d blocks, err = %d",
	353	inode->i_ino, recovered, err);
	354	return err;
d624c96f JK	355	}
d624c96f JK	356
6ead1142	357	static int recover_data(struct f2fs_sb_info *sbi,
d624c96f JK	358	struct list_head *head, int type)
	359	{
	360	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	361	struct curseg_info *curseg;
	362	struct page *page;
6ead1142	363	int err = 0;
d624c96f JK	364	block_t blkaddr;
	365
	366	/* get node pages in the current segment */
	367	curseg = CURSEG_I(sbi, type);
	368	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
	369
	370	/* read node page */
	371	page = alloc_page(GFP_NOFS \| __GFP_ZERO);
	372	if (IS_ERR(page))
6ead1142 JK	373	return -ENOMEM;
6ead1142 JK	374
d624c96f JK	375	lock_page(page);
	376
	377	while (1) {
	378	struct fsync_inode_entry *entry;
	379
6ead1142 JK	380	err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
6ead1142 JK	381	if (err)
d624c96f JK	382	goto out;
d624c96f JK	383
393ff91f JK	384	lock_page(page);
393ff91f JK	385
d624c96f	386	if (cp_ver != cpver_of_node(page))
45856aff	387	break;
d624c96f JK	388
	389	entry = get_fsync_inode(head, ino_of_node(page));
	390	if (!entry)
	391	goto next;
	392
6ead1142 JK	393	err = do_recover_data(sbi, entry->inode, page, blkaddr);
6ead1142 JK	394	if (err)
45856aff	395	break;
d624c96f JK	396
	397	if (entry->blkaddr == blkaddr) {
	398	iput(entry->inode);
	399	list_del(&entry->list);
	400	kmem_cache_free(fsync_entry_slab, entry);
	401	}
	402	next:
	403	/* check next segment */
	404	blkaddr = next_blkaddr_of_node(page);
d624c96f	405	}
d624c96f	406	unlock_page(page);
393ff91f	407	out:
d624c96f JK	408	__free_pages(page, 0);
d624c96f JK	409
6ead1142 JK	410	if (!err)
	411	allocate_new_segments(sbi);
	412	return err;
d624c96f JK	413	}
d624c96f JK	414
6ead1142	415	int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f JK	416	{
d624c96f JK	417	struct list_head inode_list;
6ead1142	418	int err;
d624c96f JK	419
	420	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
	421	sizeof(struct fsync_inode_entry), NULL);
	422	if (unlikely(!fsync_entry_slab))
6ead1142	423	return -ENOMEM;
d624c96f JK	424
	425	INIT_LIST_HEAD(&inode_list);
	426
	427	/* step #1: find fsynced inode numbers */
8c26d7d5	428	sbi->por_doing = 1;
6ead1142 JK	429	err = find_fsync_dnodes(sbi, &inode_list);
6ead1142 JK	430	if (err)
d624c96f JK	431	goto out;
	432
	433	if (list_empty(&inode_list))
	434	goto out;
	435
	436	/* step #2: recover data */
6ead1142	437	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
d624c96f JK	438	BUG_ON(!list_empty(&inode_list));
d624c96f JK	439	out:
5ebefc5b	440	destroy_fsync_dnodes(&inode_list);
d624c96f	441	kmem_cache_destroy(fsync_entry_slab);
8c26d7d5	442	sbi->por_doing = 0;
2c2c149f JK	443	if (!err)
2c2c149f JK	444	write_checkpoint(sbi, false);
6ead1142	445	return err;
d624c96f	446	}