[deliverable/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)
{
	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 = -EINVAL;
		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) {
			entry->blkaddr = blkaddr;
			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)
				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;

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

	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
	if (err)
		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);
	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 */
	err = find_fsync_dnodes(sbi, &inode_list);
	if (err)
		goto out;

	if (list_empty(&inode_list))
		goto out;

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