[GitHub/exynos8895/android_kernel_samsung_universal8895.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)
{
	struct f2fs_node *raw_node = (struct f2fs_node *)kmap(ipage);
	struct f2fs_inode *raw_inode = &(raw_node->i);
	struct qstr name;
	struct f2fs_dir_entry *de;
	struct page *page;
	struct inode *dir;
	int err = 0;

	if (!is_dent_dnode(ipage))
		goto out;

	dir = f2fs_iget(inode->i_sb, le32_to_cpu(raw_inode->i_pino));
	if (IS_ERR(dir)) {
		err = PTR_ERR(dir);
		goto out;
	}

	name.len = le32_to_cpu(raw_inode->i_namelen);
	name.name = raw_inode->i_name;

	de = f2fs_find_entry(dir, &name, &page);
	if (de) {
		kunmap(page);
		f2fs_put_page(page, 0);
	} else {
		err = __f2fs_add_link(dir, &name, inode);
	}
	iput(dir);
out:
	kunmap(ipage);
	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);

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

	return recover_dentry(node_page, inode);
}

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

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

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

			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);
				goto unlock_out;
			}
			list_add_tail(&entry->list, head);
		}
		entry->blkaddr = blkaddr;

		if (IS_INODE(page)) {
			err = recover_inode(entry->inode, page);
			if (err == -ENOENT) {
				goto next;
			} else if (err) {
				err = -EINVAL;
				goto unlock_out;
			}
		}
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
	}
unlock_out:
	unlock_page(page);
out:
	__free_pages(page, 0);
	return err;
}

static void destroy_fsync_dnodes(struct f2fs_sb_info *sbi,
					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 void check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
						block_t blkaddr)
{
	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;
	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;

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

	/* Get the node page */
	node_page = get_node_page(sbi, le32_to_cpu(sum.nid));
	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;

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

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;
	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 */
			check_index_in_prev_nodes(sbi, dest);

			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);
		}
		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);
	f2fs_put_dnode(&dn);
	mutex_unlock_op(sbi, ilock);
	return 0;
}

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

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

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

		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_out:
	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(sbi, &inode_list);
	kmem_cache_destroy(fsync_entry_slab);
	sbi->por_doing = 0;
	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	{
	43	struct f2fs_node raw_node = (struct f2fs_node )kmap(ipage);
	44	struct f2fs_inode *raw_inode = &(raw_node->i);
b7f7a5e0	45	struct qstr name;
d624c96f JK	46	struct f2fs_dir_entry *de;
	47	struct page *page;
	48	struct inode *dir;
	49	int err = 0;
	50
	51	if (!is_dent_dnode(ipage))
	52	goto out;
	53
	54	dir = f2fs_iget(inode->i_sb, le32_to_cpu(raw_inode->i_pino));
	55	if (IS_ERR(dir)) {
047184b4	56	err = PTR_ERR(dir);
d624c96f JK	57	goto out;
	58	}
	59
b7f7a5e0 AV	60	name.len = le32_to_cpu(raw_inode->i_namelen);
b7f7a5e0 AV	61	name.name = raw_inode->i_name;
d624c96f	62
b7f7a5e0	63	de = f2fs_find_entry(dir, &name, &page);
d624c96f JK	64	if (de) {
	65	kunmap(page);
	66	f2fs_put_page(page, 0);
	67	} else {
90b2fc64	68	err = __f2fs_add_link(dir, &name, inode);
d624c96f JK	69	}
	70	iput(dir);
	71	out:
	72	kunmap(ipage);
	73	return err;
	74	}
	75
	76	static int recover_inode(struct inode inode, struct page node_page)
	77	{
	78	void *kaddr = page_address(node_page);
	79	struct f2fs_node raw_node = (struct f2fs_node )kaddr;
	80	struct f2fs_inode *raw_inode = &(raw_node->i);
	81
25ca923b	82	inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f JK	83	i_size_write(inode, le64_to_cpu(raw_inode->i_size));
	84	inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	85	inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
	86	inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	87	inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	88	inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
	89	inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	90
	91	return recover_dentry(node_page, inode);
	92	}
	93
	94	static int find_fsync_dnodes(struct f2fs_sb_info sbi, struct list_head head)
	95	{
	96	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	97	struct curseg_info *curseg;
	98	struct page *page;
	99	block_t blkaddr;
	100	int err = 0;
	101
	102	/* get node pages in the current segment */
	103	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
	104	blkaddr = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;
	105
	106	/* read node page */
	107	page = alloc_page(GFP_F2FS_ZERO);
	108	if (IS_ERR(page))
	109	return PTR_ERR(page);
	110	lock_page(page);
	111
	112	while (1) {
	113	struct fsync_inode_entry *entry;
	114
393ff91f JK	115	err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
393ff91f JK	116	if (err)
d624c96f JK	117	goto out;
d624c96f JK	118
393ff91f JK	119	lock_page(page);
393ff91f JK	120
6ead1142	121	if (cp_ver != cpver_of_node(page))
393ff91f	122	goto unlock_out;
d624c96f JK	123
	124	if (!is_fsync_dnode(page))
	125	goto next;
	126
	127	entry = get_fsync_inode(head, ino_of_node(page));
	128	if (entry) {
d624c96f JK	129	if (IS_INODE(page) && is_dent_dnode(page))
	130	set_inode_flag(F2FS_I(entry->inode),
	131	FI_INC_LINK);
	132	} else {
	133	if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142 JK	134	err = recover_inode_page(sbi, page);
6ead1142 JK	135	if (err)
393ff91f	136	goto unlock_out;
d624c96f JK	137	}
	138
	139	/* add this fsync inode to the list */
	140	entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
	141	if (!entry) {
	142	err = -ENOMEM;
393ff91f	143	goto unlock_out;
d624c96f JK	144	}
d624c96f JK	145
d624c96f JK	146	entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
	147	if (IS_ERR(entry->inode)) {
	148	err = PTR_ERR(entry->inode);
fd8bb65f	149	kmem_cache_free(fsync_entry_slab, entry);
393ff91f	150	goto unlock_out;
d624c96f	151	}
fd8bb65f	152	list_add_tail(&entry->list, head);
d624c96f	153	}
addbe45b JK	154	entry->blkaddr = blkaddr;
addbe45b JK	155
d624c96f JK	156	if (IS_INODE(page)) {
d624c96f JK	157	err = recover_inode(entry->inode, page);
047184b4 CF	158	if (err == -ENOENT) {
	159	goto next;
	160	} else if (err) {
	161	err = -EINVAL;
393ff91f	162	goto unlock_out;
047184b4	163	}
d624c96f JK	164	}
	165	next:
	166	/* check next segment */
	167	blkaddr = next_blkaddr_of_node(page);
d624c96f	168	}
393ff91f	169	unlock_out:
d624c96f	170	unlock_page(page);
393ff91f	171	out:
d624c96f JK	172	__free_pages(page, 0);
	173	return err;
	174	}
	175
	176	static void destroy_fsync_dnodes(struct f2fs_sb_info *sbi,
	177	struct list_head *head)
	178	{
d8b79b2f DC	179	struct fsync_inode_entry entry, tmp;
	180
	181	list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f JK	182	iput(entry->inode);
	183	list_del(&entry->list);
	184	kmem_cache_free(fsync_entry_slab, entry);
	185	}
	186	}
	187
	188	static void check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
	189	block_t blkaddr)
	190	{
	191	struct seg_entry *sentry;
	192	unsigned int segno = GET_SEGNO(sbi, blkaddr);
	193	unsigned short blkoff = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) &
	194	(sbi->blocks_per_seg - 1);
	195	struct f2fs_summary sum;
	196	nid_t ino;
	197	void *kaddr;
	198	struct inode *inode;
	199	struct page *node_page;
	200	block_t bidx;
	201	int i;
	202
	203	sentry = get_seg_entry(sbi, segno);
	204	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
	205	return;
	206
	207	/* Get the previous summary */
	208	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
	209	struct curseg_info *curseg = CURSEG_I(sbi, i);
	210	if (curseg->segno == segno) {
	211	sum = curseg->sum_blk->entries[blkoff];
	212	break;
	213	}
	214	}
	215	if (i > CURSEG_COLD_DATA) {
	216	struct page *sum_page = get_sum_page(sbi, segno);
	217	struct f2fs_summary_block *sum_node;
	218	kaddr = page_address(sum_page);
	219	sum_node = (struct f2fs_summary_block *)kaddr;
	220	sum = sum_node->entries[blkoff];
	221	f2fs_put_page(sum_page, 1);
	222	}
	223
	224	/* Get the node page */
	225	node_page = get_node_page(sbi, le32_to_cpu(sum.nid));
	226	bidx = start_bidx_of_node(ofs_of_node(node_page)) +
	227	le16_to_cpu(sum.ofs_in_node);
	228	ino = ino_of_node(node_page);
	229	f2fs_put_page(node_page, 1);
	230
	231	/* Deallocate previous index in the node page */
d4686d56	232	inode = f2fs_iget(sbi->sb, ino);
06025f4d NJ	233	if (IS_ERR(inode))
	234	return;
	235
d624c96f JK	236	truncate_hole(inode, bidx, bidx + 1);
	237	iput(inode);
	238	}
	239
6ead1142	240	static int do_recover_data(struct f2fs_sb_info sbi, struct inode inode,
d624c96f JK	241	struct page *page, block_t blkaddr)
	242	{
	243	unsigned int start, end;
	244	struct dnode_of_data dn;
	245	struct f2fs_summary sum;
	246	struct node_info ni;
6ead1142	247	int err = 0;
39936837	248	int ilock;
d624c96f JK	249
	250	start = start_bidx_of_node(ofs_of_node(page));
	251	if (IS_INODE(page))
	252	end = start + ADDRS_PER_INODE;
	253	else
	254	end = start + ADDRS_PER_BLOCK;
	255
39936837	256	ilock = mutex_lock_op(sbi);
d624c96f	257	set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837	258
6ead1142	259	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837 JK	260	if (err) {
39936837 JK	261	mutex_unlock_op(sbi, ilock);
6ead1142	262	return err;
39936837	263	}
d624c96f JK	264
	265	wait_on_page_writeback(dn.node_page);
	266
	267	get_node_info(sbi, dn.nid, &ni);
	268	BUG_ON(ni.ino != ino_of_node(page));
	269	BUG_ON(ofs_of_node(dn.node_page) != ofs_of_node(page));
	270
	271	for (; start < end; start++) {
	272	block_t src, dest;
	273
	274	src = datablock_addr(dn.node_page, dn.ofs_in_node);
	275	dest = datablock_addr(page, dn.ofs_in_node);
	276
	277	if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
	278	if (src == NULL_ADDR) {
	279	int err = reserve_new_block(&dn);
	280	/* We should not get -ENOSPC */
	281	BUG_ON(err);
	282	}
	283
	284	/* Check the previous node page having this index */
	285	check_index_in_prev_nodes(sbi, dest);
	286
	287	set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
	288
	289	/* write dummy data page */
	290	recover_data_page(sbi, NULL, &sum, src, dest);
	291	update_extent_cache(dest, &dn);
	292	}
	293	dn.ofs_in_node++;
	294	}
	295
	296	/* write node page in place */
	297	set_summary(&sum, dn.nid, 0, 0);
	298	if (IS_INODE(dn.node_page))
	299	sync_inode_page(&dn);
	300
	301	copy_node_footer(dn.node_page, page);
	302	fill_node_footer(dn.node_page, dn.nid, ni.ino,
	303	ofs_of_node(page), false);
	304	set_page_dirty(dn.node_page);
	305
	306	recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
	307	f2fs_put_dnode(&dn);
39936837	308	mutex_unlock_op(sbi, ilock);
6ead1142	309	return 0;
d624c96f JK	310	}
d624c96f JK	311
6ead1142	312	static int recover_data(struct f2fs_sb_info *sbi,
d624c96f JK	313	struct list_head *head, int type)
	314	{
	315	unsigned long long cp_ver = le64_to_cpu(sbi->ckpt->checkpoint_ver);
	316	struct curseg_info *curseg;
	317	struct page *page;
6ead1142	318	int err = 0;
d624c96f JK	319	block_t blkaddr;
	320
	321	/* get node pages in the current segment */
	322	curseg = CURSEG_I(sbi, type);
	323	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
	324
	325	/* read node page */
	326	page = alloc_page(GFP_NOFS \| __GFP_ZERO);
	327	if (IS_ERR(page))
6ead1142 JK	328	return -ENOMEM;
6ead1142 JK	329
d624c96f JK	330	lock_page(page);
	331
	332	while (1) {
	333	struct fsync_inode_entry *entry;
	334
6ead1142 JK	335	err = f2fs_readpage(sbi, page, blkaddr, READ_SYNC);
6ead1142 JK	336	if (err)
d624c96f JK	337	goto out;
d624c96f JK	338
393ff91f JK	339	lock_page(page);
393ff91f JK	340
d624c96f	341	if (cp_ver != cpver_of_node(page))
393ff91f	342	goto unlock_out;
d624c96f JK	343
	344	entry = get_fsync_inode(head, ino_of_node(page));
	345	if (!entry)
	346	goto next;
	347
6ead1142 JK	348	err = do_recover_data(sbi, entry->inode, page, blkaddr);
	349	if (err)
	350	goto out;
d624c96f JK	351
	352	if (entry->blkaddr == blkaddr) {
	353	iput(entry->inode);
	354	list_del(&entry->list);
	355	kmem_cache_free(fsync_entry_slab, entry);
	356	}
	357	next:
	358	/* check next segment */
	359	blkaddr = next_blkaddr_of_node(page);
d624c96f	360	}
393ff91f	361	unlock_out:
d624c96f	362	unlock_page(page);
393ff91f	363	out:
d624c96f JK	364	__free_pages(page, 0);
d624c96f JK	365
6ead1142 JK	366	if (!err)
	367	allocate_new_segments(sbi);
	368	return err;
d624c96f JK	369	}
d624c96f JK	370
6ead1142	371	int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f JK	372	{
d624c96f JK	373	struct list_head inode_list;
6ead1142	374	int err;
d624c96f JK	375
	376	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
	377	sizeof(struct fsync_inode_entry), NULL);
	378	if (unlikely(!fsync_entry_slab))
6ead1142	379	return -ENOMEM;
d624c96f JK	380
	381	INIT_LIST_HEAD(&inode_list);
	382
	383	/* step #1: find fsynced inode numbers */
8c26d7d5	384	sbi->por_doing = 1;
6ead1142 JK	385	err = find_fsync_dnodes(sbi, &inode_list);
6ead1142 JK	386	if (err)
d624c96f JK	387	goto out;
	388
	389	if (list_empty(&inode_list))
	390	goto out;
	391
	392	/* step #2: recover data */
6ead1142	393	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
d624c96f JK	394	BUG_ON(!list_empty(&inode_list));
	395	out:
	396	destroy_fsync_dnodes(sbi, &inode_list);
	397	kmem_cache_destroy(fsync_entry_slab);
8c26d7d5	398	sbi->por_doing = 0;
43727527	399	write_checkpoint(sbi, false);
6ead1142	400	return err;
d624c96f	401	}