[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"

/*
 * Roll forward recovery scenarios.
 *
 * [Term] F: fsync_mark, D: dentry_mark
 *
 * 1. inode(x) | CP | inode(x) | dnode(F)
 * -> Update the latest inode(x).
 *
 * 2. inode(x) | CP | inode(F) | dnode(F)
 * -> No problem.
 *
 * 3. inode(x) | CP | dnode(F) | inode(x)
 * -> Recover to the latest dnode(F), and drop the last inode(x)
 *
 * 4. inode(x) | CP | dnode(F) | inode(F)
 * -> No problem.
 *
 * 5. CP | inode(x) | dnode(F)
 * -> The inode(DF) was missing. Should drop this dnode(F).
 *
 * 6. CP | inode(DF) | dnode(F)
 * -> No problem.
 *
 * 7. CP | dnode(F) | inode(DF)
 * -> If f2fs_iget fails, then goto next to find inode(DF).
 *
 * 8. CP | dnode(F) | inode(x)
 * -> If f2fs_iget fails, then goto next to find inode(DF).
 *    But it will fail due to no inode(DF).
 */

static struct kmem_cache *fsync_entry_slab;

bool space_for_roll_forward(struct f2fs_sb_info *sbi)
{
	s64 nalloc = percpu_counter_sum_positive(&sbi->alloc_valid_block_count);

	if (sbi->last_valid_block_count + nalloc > sbi->user_block_count)
		return false;
	return true;
}

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

	list_for_each_entry(entry, head, list)
		if (entry->inode->i_ino == ino)
			return entry;

	return NULL;
}

static struct fsync_inode_entry *add_fsync_inode(struct list_head *head,
							struct inode *inode)
{
	struct fsync_inode_entry *entry;

	entry = kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO);
	if (!entry)
		return NULL;

	entry->inode = inode;
	list_add_tail(&entry->list, head);

	return entry;
}

static void del_fsync_inode(struct fsync_inode_entry *entry)
{
	iput(entry->inode);
	list_del(&entry->list);
	kmem_cache_free(fsync_entry_slab, entry);
}

static int recover_dentry(struct inode *inode, struct page *ipage,
						struct list_head *dir_list)
{
	struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
	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;
	struct fsync_inode_entry *entry;
	int err = 0;

	entry = get_fsync_inode(dir_list, pino);
	if (!entry) {
		dir = f2fs_iget(inode->i_sb, pino);
		if (IS_ERR(dir)) {
			err = PTR_ERR(dir);
			goto out;
		}

		entry = add_fsync_inode(dir_list, dir);
		if (!entry) {
			err = -ENOMEM;
			iput(dir);
			goto out;
		}
	}

	dir = entry->inode;

	if (file_enc_name(inode))
		return 0;

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

	if (unlikely(name.len > F2FS_NAME_LEN)) {
		WARN_ON(1);
		err = -ENAMETOOLONG;
		goto out;
	}
retry:
	de = f2fs_find_entry(dir, &name, &page);
	if (de && inode->i_ino == le32_to_cpu(de->ino))
		goto out_unmap_put;

	if (de) {
		einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
		if (IS_ERR(einode)) {
			WARN_ON(1);
			err = PTR_ERR(einode);
			if (err == -ENOENT)
				err = -EEXIST;
			goto out_unmap_put;
		}
		err = acquire_orphan_inode(F2FS_I_SB(inode));
		if (err) {
			iput(einode);
			goto out_unmap_put;
		}
		f2fs_delete_entry(de, page, dir, einode);
		iput(einode);
		goto retry;
	} else if (IS_ERR(page)) {
		err = PTR_ERR(page);
	} else {
		err = __f2fs_add_link(dir, &name, inode,
					inode->i_ino, inode->i_mode);
	}
	goto out;

out_unmap_put:
	f2fs_dentry_kunmap(dir, page);
	f2fs_put_page(page, 0);
out:
	f2fs_msg(inode->i_sb, KERN_NOTICE,
			"%s: ino = %x, name = %s, dir = %lx, err = %d",
			__func__, ino_of_node(ipage), raw_inode->i_name,
			IS_ERR(dir) ? 0 : dir->i_ino, err);
	return err;
}

static void recover_inode(struct inode *inode, struct page *page)
{
	struct f2fs_inode *raw = F2FS_INODE(page);
	char *name;

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

	if (file_enc_name(inode))
		name = "<encrypted>";
	else
		name = F2FS_INODE(page)->i_name;

	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
			ino_of_node(page), name);
}

static bool is_same_inode(struct inode *inode, struct page *ipage)
{
	struct f2fs_inode *ri = F2FS_INODE(ipage);
	struct timespec disk;

	if (!IS_INODE(ipage))
		return true;

	disk.tv_sec = le64_to_cpu(ri->i_ctime);
	disk.tv_nsec = le32_to_cpu(ri->i_ctime_nsec);
	if (timespec_compare(&inode->i_ctime, &disk) > 0)
		return false;

	disk.tv_sec = le64_to_cpu(ri->i_atime);
	disk.tv_nsec = le32_to_cpu(ri->i_atime_nsec);
	if (timespec_compare(&inode->i_atime, &disk) > 0)
		return false;

	disk.tv_sec = le64_to_cpu(ri->i_mtime);
	disk.tv_nsec = le32_to_cpu(ri->i_mtime_nsec);
	if (timespec_compare(&inode->i_mtime, &disk) > 0)
		return false;

	return true;
}

static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
{
	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
	struct curseg_info *curseg;
	struct inode *inode;
	struct page *page = NULL;
	block_t blkaddr;
	int err = 0;

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

	while (1) {
		struct fsync_inode_entry *entry;

		if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
			return 0;

		page = get_tmp_page(sbi, blkaddr);

		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_same_inode(entry->inode, page))
				goto next;
		} else {
			if (IS_INODE(page) && is_dent_dnode(page)) {
				err = recover_inode_page(sbi, page);
				if (err)
					break;
			}

			/*
			 * CP | dnode(F) | inode(DF)
			 * For this case, we should not give up now.
			 */
			inode = f2fs_iget(sbi->sb, ino_of_node(page));
			if (IS_ERR(inode)) {
				err = PTR_ERR(inode);
				if (err == -ENOENT) {
					err = 0;
					goto next;
				}
				break;
			}

			/* add this fsync inode to the list */
			entry = add_fsync_inode(head, inode);
			if (!entry) {
				err = -ENOMEM;
				iput(inode);
				break;
			}
		}
		entry->blkaddr = blkaddr;

		if (IS_INODE(page) && is_dent_dnode(page))
			entry->last_dentry = blkaddr;
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
		f2fs_put_page(page, 1);

		ra_meta_pages_cond(sbi, blkaddr);
	}
	f2fs_put_page(page, 1);
	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)
		del_fsync_inode(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_BLKOFF_FROM_SEG0(sbi, blkaddr);
	struct f2fs_summary_block *sum_node;
	struct f2fs_summary sum;
	struct page *sum_page, *node_page;
	struct dnode_of_data tdn = *dn;
	nid_t ino, nid;
	struct inode *inode;
	unsigned int offset;
	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];
			goto got_it;
		}
	}

	sum_page = get_sum_page(sbi, segno);
	sum_node = (struct f2fs_summary_block *)page_address(sum_page);
	sum = sum_node->entries[blkoff];
	f2fs_put_page(sum_page, 1);
got_it:
	/* Use the locked dnode page and inode */
	nid = le32_to_cpu(sum.nid);
	if (dn->inode->i_ino == nid) {
		tdn.nid = nid;
		if (!dn->inode_page_locked)
			lock_page(dn->inode_page);
		tdn.node_page = dn->inode_page;
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
		goto truncate_out;
	} else if (dn->nid == nid) {
		tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
		goto truncate_out;
	}

	/* Get the node page */
	node_page = get_node_page(sbi, nid);
	if (IS_ERR(node_page))
		return PTR_ERR(node_page);

	offset = ofs_of_node(node_page);
	ino = ino_of_node(node_page);
	f2fs_put_page(node_page, 1);

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

	bidx = start_bidx_of_node(offset, inode) + le16_to_cpu(sum.ofs_in_node);

	/*
	 * if inode page is locked, unlock temporarily, but its reference
	 * count keeps alive.
	 */
	if (ino == dn->inode->i_ino && dn->inode_page_locked)
		unlock_page(dn->inode_page);

	set_new_dnode(&tdn, inode, NULL, NULL, 0);
	if (get_dnode_of_data(&tdn, bidx, LOOKUP_NODE))
		goto out;

	if (tdn.data_blkaddr == blkaddr)
		truncate_data_blocks_range(&tdn, 1);

	f2fs_put_dnode(&tdn);
out:
	if (ino != dn->inode->i_ino)
		iput(inode);
	else if (dn->inode_page_locked)
		lock_page(dn->inode_page);
	return 0;

truncate_out:
	if (datablock_addr(tdn.node_page, tdn.ofs_in_node) == blkaddr)
		truncate_data_blocks_range(&tdn, 1);
	if (dn->inode->i_ino == nid && !dn->inode_page_locked)
		unlock_page(dn->inode_page);
	return 0;
}

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

	/* step 1: recover xattr */
	if (IS_INODE(page)) {
		recover_inline_xattr(inode, page);
	} else if (f2fs_has_xattr_block(ofs_of_node(page))) {
		/*
		 * Deprecated; xattr blocks should be found from cold log.
		 * But, we should remain this for backward compatibility.
		 */
		recover_xattr_data(inode, page, blkaddr);
		goto out;
	}

	/* step 2: recover inline data */
	if (recover_inline_data(inode, page))
		goto out;

	/* step 3: recover data indices */
	start = start_bidx_of_node(ofs_of_node(page), inode);
	end = start + ADDRS_PER_PAGE(page, inode);

	set_new_dnode(&dn, inode, NULL, NULL, 0);

	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(dn.node_page, NODE, true);

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

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

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

		/* skip recovering if dest is the same as src */
		if (src == dest)
			continue;

		/* dest is invalid, just invalidate src block */
		if (dest == NULL_ADDR) {
			truncate_data_blocks_range(&dn, 1);
			continue;
		}

		if ((start + 1) << PAGE_SHIFT > i_size_read(inode))
			f2fs_i_size_write(inode, (start + 1) << PAGE_SHIFT);

		/*
		 * dest is reserved block, invalidate src block
		 * and then reserve one new block in dnode page.
		 */
		if (dest == NEW_ADDR) {
			truncate_data_blocks_range(&dn, 1);
			reserve_new_block(&dn);
			continue;
		}

		/* dest is valid block, try to recover from src to dest */
		if (is_valid_blkaddr(sbi, dest, META_POR)) {

			if (src == NULL_ADDR) {
				err = reserve_new_block(&dn);
#ifdef CONFIG_F2FS_FAULT_INJECTION
				while (err)
					err = reserve_new_block(&dn);
#endif
				/* We should not get -ENOSPC */
				f2fs_bug_on(sbi, err);
				if (err)
					goto err;
			}

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

			/* write dummy data page */
			f2fs_replace_block(sbi, &dn, src, dest,
						ni.version, false, false);
			recovered++;
		}
	}

	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);
err:
	f2fs_put_dnode(&dn);
out:
	f2fs_msg(sbi->sb, KERN_NOTICE,
		"recover_data: ino = %lx, recovered = %d blocks, err = %d",
		inode->i_ino, recovered, err);
	return err;
}

static int recover_data(struct f2fs_sb_info *sbi, struct list_head *inode_list,
						struct list_head *dir_list)
{
	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
	struct curseg_info *curseg;
	struct page *page = NULL;
	int err = 0;
	block_t blkaddr;

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

	while (1) {
		struct fsync_inode_entry *entry;

		if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
			break;

		ra_meta_pages_cond(sbi, blkaddr);

		page = get_tmp_page(sbi, blkaddr);

		if (cp_ver != cpver_of_node(page)) {
			f2fs_put_page(page, 1);
			break;
		}

		entry = get_fsync_inode(inode_list, ino_of_node(page));
		if (!entry)
			goto next;
		/*
		 * inode(x) | CP | inode(x) | dnode(F)
		 * In this case, we can lose the latest inode(x).
		 * So, call recover_inode for the inode update.
		 */
		if (IS_INODE(page))
			recover_inode(entry->inode, page);
		if (entry->last_dentry == blkaddr) {
			err = recover_dentry(entry->inode, page, dir_list);
			if (err) {
				f2fs_put_page(page, 1);
				break;
			}
		}
		err = do_recover_data(sbi, entry->inode, page, blkaddr);
		if (err) {
			f2fs_put_page(page, 1);
			break;
		}

		if (entry->blkaddr == blkaddr)
			del_fsync_inode(entry);
next:
		/* check next segment */
		blkaddr = next_blkaddr_of_node(page);
		f2fs_put_page(page, 1);
	}
	if (!err)
		allocate_new_segments(sbi);
	return err;
}

int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only)
{
	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
	struct list_head inode_list;
	struct list_head dir_list;
	block_t blkaddr;
	int err;
	int ret = 0;
	bool need_writecp = false;

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

	INIT_LIST_HEAD(&inode_list);
	INIT_LIST_HEAD(&dir_list);

	/* prevent checkpoint */
	mutex_lock(&sbi->cp_mutex);

	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);

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

	if (check_only) {
		ret = 1;
		goto out;
	}

	need_writecp = true;

	/* step #2: recover data */
	err = recover_data(sbi, &inode_list, &dir_list);
	if (!err)
		f2fs_bug_on(sbi, !list_empty(&inode_list));
out:
	destroy_fsync_dnodes(&inode_list);

	/* truncate meta pages to be used by the recovery */
	truncate_inode_pages_range(META_MAPPING(sbi),
			(loff_t)MAIN_BLKADDR(sbi) << PAGE_SHIFT, -1);

	if (err) {
		truncate_inode_pages_final(NODE_MAPPING(sbi));
		truncate_inode_pages_final(META_MAPPING(sbi));
	}

	clear_sbi_flag(sbi, SBI_POR_DOING);
	if (err) {
		bool invalidate = false;

		if (test_opt(sbi, LFS)) {
			update_meta_page(sbi, NULL, blkaddr);
			invalidate = true;
		} else if (discard_next_dnode(sbi, blkaddr)) {
			invalidate = true;
		}

		/* Flush all the NAT/SIT pages */
		while (get_pages(sbi, F2FS_DIRTY_META))
			sync_meta_pages(sbi, META, LONG_MAX);

		/* invalidate temporary meta page */
		if (invalidate)
			invalidate_mapping_pages(META_MAPPING(sbi),
							blkaddr, blkaddr);

		set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
		mutex_unlock(&sbi->cp_mutex);
	} else if (need_writecp) {
		struct cp_control cpc = {
			.reason = CP_RECOVERY,
		};
		mutex_unlock(&sbi->cp_mutex);
		err = write_checkpoint(sbi, &cpc);
	} else {
		mutex_unlock(&sbi->cp_mutex);
	}

	destroy_fsync_dnodes(&dir_list);
	kmem_cache_destroy(fsync_entry_slab);
	return ret ? ret: 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
441ac5cb JK	17	/*
	18	* Roll forward recovery scenarios.
	19	*
	20	* [Term] F: fsync_mark, D: dentry_mark
	21	*
	22	* 1. inode(x) \| CP \| inode(x) \| dnode(F)
	23	* -> Update the latest inode(x).
	24	*
	25	* 2. inode(x) \| CP \| inode(F) \| dnode(F)
	26	* -> No problem.
	27	*
	28	* 3. inode(x) \| CP \| dnode(F) \| inode(x)
	29	* -> Recover to the latest dnode(F), and drop the last inode(x)
	30	*
	31	* 4. inode(x) \| CP \| dnode(F) \| inode(F)
	32	* -> No problem.
	33	*
	34	* 5. CP \| inode(x) \| dnode(F)
	35	* -> The inode(DF) was missing. Should drop this dnode(F).
	36	*
	37	* 6. CP \| inode(DF) \| dnode(F)
	38	* -> No problem.
	39	*
	40	* 7. CP \| dnode(F) \| inode(DF)
	41	* -> If f2fs_iget fails, then goto next to find inode(DF).
	42	*
	43	* 8. CP \| dnode(F) \| inode(x)
	44	* -> If f2fs_iget fails, then goto next to find inode(DF).
	45	* But it will fail due to no inode(DF).
	46	*/
	47
d624c96f JK	48	static struct kmem_cache *fsync_entry_slab;
	49
	50	bool space_for_roll_forward(struct f2fs_sb_info *sbi)
	51	{
41382ec4 JK	52	s64 nalloc = percpu_counter_sum_positive(&sbi->alloc_valid_block_count);
	53
	54	if (sbi->last_valid_block_count + nalloc > sbi->user_block_count)
d624c96f JK	55	return false;
	56	return true;
	57	}
	58
	59	static struct fsync_inode_entry get_fsync_inode(struct list_head head,
	60	nid_t ino)
	61	{
d624c96f JK	62	struct fsync_inode_entry *entry;
d624c96f JK	63
2d7b822a	64	list_for_each_entry(entry, head, list)
d624c96f JK	65	if (entry->inode->i_ino == ino)
d624c96f JK	66	return entry;
2d7b822a	67
d624c96f JK	68	return NULL;
	69	}
	70
3f8ab270 CY	71	static struct fsync_inode_entry add_fsync_inode(struct list_head head,
	72	struct inode *inode)
	73	{
	74	struct fsync_inode_entry *entry;
	75
	76	entry = kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO);
	77	if (!entry)
	78	return NULL;
	79
	80	entry->inode = inode;
	81	list_add_tail(&entry->list, head);
	82
	83	return entry;
	84	}
	85
	86	static void del_fsync_inode(struct fsync_inode_entry *entry)
	87	{
	88	iput(entry->inode);
	89	list_del(&entry->list);
	90	kmem_cache_free(fsync_entry_slab, entry);
	91	}
	92
f61cce5b CY	93	static int recover_dentry(struct inode inode, struct page ipage,
f61cce5b CY	94	struct list_head *dir_list)
d624c96f	95	{
58bfaf44	96	struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
74d0b917	97	nid_t pino = le32_to_cpu(raw_inode->i_pino);
6b8213d9	98	struct f2fs_dir_entry *de;
b7f7a5e0	99	struct qstr name;
d624c96f	100	struct page *page;
6b8213d9	101	struct inode dir, einode;
f61cce5b	102	struct fsync_inode_entry *entry;
d624c96f JK	103	int err = 0;
d624c96f JK	104
f61cce5b CY	105	entry = get_fsync_inode(dir_list, pino);
	106	if (!entry) {
	107	dir = f2fs_iget(inode->i_sb, pino);
	108	if (IS_ERR(dir)) {
	109	err = PTR_ERR(dir);
	110	goto out;
	111	}
	112
	113	entry = add_fsync_inode(dir_list, dir);
	114	if (!entry) {
	115	err = -ENOMEM;
	116	iput(dir);
	117	goto out;
	118	}
ed57c27f JK	119	}
ed57c27f JK	120
f61cce5b CY	121	dir = entry->inode;
	122
	123	if (file_enc_name(inode))
e7d55452	124	return 0;
e7d55452	125
b7f7a5e0 AV	126	name.len = le32_to_cpu(raw_inode->i_namelen);
b7f7a5e0 AV	127	name.name = raw_inode->i_name;
d96b1431 CY	128
	129	if (unlikely(name.len > F2FS_NAME_LEN)) {
	130	WARN_ON(1);
	131	err = -ENAMETOOLONG;
f61cce5b	132	goto out;
d96b1431	133	}
6b8213d9 JK	134	retry:
6b8213d9 JK	135	de = f2fs_find_entry(dir, &name, &page);
418f6c27	136	if (de && inode->i_ino == le32_to_cpu(de->ino))
2e5558f4	137	goto out_unmap_put;
418f6c27	138
6b8213d9 JK	139	if (de) {
	140	einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
	141	if (IS_ERR(einode)) {
	142	WARN_ON(1);
5c1f9927 CY	143	err = PTR_ERR(einode);
5c1f9927 CY	144	if (err == -ENOENT)
6b8213d9	145	err = -EEXIST;
2e5558f4 RK	146	goto out_unmap_put;
2e5558f4 RK	147	}
4081363f	148	err = acquire_orphan_inode(F2FS_I_SB(inode));
2e5558f4 RK	149	if (err) {
	150	iput(einode);
	151	goto out_unmap_put;
6b8213d9	152	}
dbeacf02	153	f2fs_delete_entry(de, page, dir, einode);
6b8213d9 JK	154	iput(einode);
6b8213d9 JK	155	goto retry;
91246c21 CY	156	} else if (IS_ERR(page)) {
	157	err = PTR_ERR(page);
	158	} else {
	159	err = __f2fs_add_link(dir, &name, inode,
	160	inode->i_ino, inode->i_mode);
d624c96f	161	}
2e5558f4 RK	162	goto out;
	163
	164	out_unmap_put:
9486ba44	165	f2fs_dentry_kunmap(dir, page);
2e5558f4	166	f2fs_put_page(page, 0);
d624c96f	167	out:
6c311ec6 CF	168	f2fs_msg(inode->i_sb, KERN_NOTICE,
	169	"%s: ino = %x, name = %s, dir = %lx, err = %d",
	170	__func__, ino_of_node(ipage), raw_inode->i_name,
f28c06fa	171	IS_ERR(dir) ? 0 : dir->i_ino, err);
d624c96f JK	172	return err;
	173	}
	174
c52e1b10	175	static void recover_inode(struct inode inode, struct page page)
d624c96f	176	{
441ac5cb	177	struct f2fs_inode *raw = F2FS_INODE(page);
e7d55452	178	char *name;
441ac5cb JK	179
441ac5cb JK	180	inode->i_mode = le16_to_cpu(raw->i_mode);
fc9581c8	181	f2fs_i_size_write(inode, le64_to_cpu(raw->i_size));
441ac5cb JK	182	inode->i_atime.tv_sec = le64_to_cpu(raw->i_mtime);
	183	inode->i_ctime.tv_sec = le64_to_cpu(raw->i_ctime);
	184	inode->i_mtime.tv_sec = le64_to_cpu(raw->i_mtime);
	185	inode->i_atime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
	186	inode->i_ctime.tv_nsec = le32_to_cpu(raw->i_ctime_nsec);
	187	inode->i_mtime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
f356fe0c	188
e7d55452 JK	189	if (file_enc_name(inode))
	190	name = "<encrypted>";
	191	else
	192	name = F2FS_INODE(page)->i_name;
	193
f356fe0c	194	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
e7d55452	195	ino_of_node(page), name);
d624c96f JK	196	}
d624c96f JK	197
807b1e1c JK	198	static bool is_same_inode(struct inode inode, struct page ipage)
	199	{
	200	struct f2fs_inode *ri = F2FS_INODE(ipage);
	201	struct timespec disk;
	202
	203	if (!IS_INODE(ipage))
	204	return true;
	205
	206	disk.tv_sec = le64_to_cpu(ri->i_ctime);
	207	disk.tv_nsec = le32_to_cpu(ri->i_ctime_nsec);
	208	if (timespec_compare(&inode->i_ctime, &disk) > 0)
	209	return false;
	210
	211	disk.tv_sec = le64_to_cpu(ri->i_atime);
	212	disk.tv_nsec = le32_to_cpu(ri->i_atime_nsec);
	213	if (timespec_compare(&inode->i_atime, &disk) > 0)
	214	return false;
	215
	216	disk.tv_sec = le64_to_cpu(ri->i_mtime);
	217	disk.tv_nsec = le32_to_cpu(ri->i_mtime_nsec);
	218	if (timespec_compare(&inode->i_mtime, &disk) > 0)
	219	return false;
	220
	221	return true;
	222	}
	223
d624c96f JK	224	static int find_fsync_dnodes(struct f2fs_sb_info sbi, struct list_head head)
d624c96f JK	225	{
d71b5564	226	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f	227	struct curseg_info *curseg;
3f8ab270	228	struct inode *inode;
4c521f49	229	struct page *page = NULL;
d624c96f JK	230	block_t blkaddr;
	231	int err = 0;
	232
	233	/* get node pages in the current segment */
	234	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
695fd1ed	235	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
d624c96f	236
d624c96f JK	237	while (1) {
	238	struct fsync_inode_entry *entry;
	239
f0c9cada	240	if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
4c521f49	241	return 0;
d624c96f	242
2b947003	243	page = get_tmp_page(sbi, blkaddr);
393ff91f	244
6ead1142	245	if (cp_ver != cpver_of_node(page))
f356fe0c	246	break;
d624c96f JK	247
	248	if (!is_fsync_dnode(page))
	249	goto next;
	250
	251	entry = get_fsync_inode(head, ino_of_node(page));
807b1e1c JK	252	if (entry) {
	253	if (!is_same_inode(entry->inode, page))
	254	goto next;
	255	} else {
d624c96f	256	if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142 JK	257	err = recover_inode_page(sbi, page);
6ead1142 JK	258	if (err)
f356fe0c	259	break;
d624c96f JK	260	}
d624c96f JK	261
441ac5cb JK	262	/*
	263	* CP \| dnode(F) \| inode(DF)
	264	* For this case, we should not give up now.
	265	*/
3f8ab270 CY	266	inode = f2fs_iget(sbi->sb, ino_of_node(page));
	267	if (IS_ERR(inode)) {
	268	err = PTR_ERR(inode);
8fbc418f JK	269	if (err == -ENOENT) {
8fbc418f JK	270	err = 0;
441ac5cb	271	goto next;
8fbc418f	272	}
f356fe0c	273	break;
d624c96f	274	}
3f8ab270 CY	275
	276	/* add this fsync inode to the list */
	277	entry = add_fsync_inode(head, inode);
	278	if (!entry) {
	279	err = -ENOMEM;
	280	iput(inode);
	281	break;
	282	}
d624c96f	283	}
addbe45b JK	284	entry->blkaddr = blkaddr;
addbe45b JK	285
608514de JK	286	if (IS_INODE(page) && is_dent_dnode(page))
608514de JK	287	entry->last_dentry = blkaddr;
d624c96f JK	288	next:
	289	/* check next segment */
	290	blkaddr = next_blkaddr_of_node(page);
4c521f49	291	f2fs_put_page(page, 1);
635aee1f CY	292
635aee1f CY	293	ra_meta_pages_cond(sbi, blkaddr);
d624c96f	294	}
4c521f49	295	f2fs_put_page(page, 1);
d624c96f JK	296	return err;
	297	}
	298
5ebefc5b	299	static void destroy_fsync_dnodes(struct list_head *head)
d624c96f	300	{
d8b79b2f DC	301	struct fsync_inode_entry entry, tmp;
d8b79b2f DC	302
3f8ab270 CY	303	list_for_each_entry_safe(entry, tmp, head, list)
3f8ab270 CY	304	del_fsync_inode(entry);
d624c96f JK	305	}
d624c96f JK	306
39cf72cf	307	static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
b292dcab	308	block_t blkaddr, struct dnode_of_data *dn)
d624c96f JK	309	{
	310	struct seg_entry *sentry;
	311	unsigned int segno = GET_SEGNO(sbi, blkaddr);
491c0854	312	unsigned short blkoff = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
f6517cfc	313	struct f2fs_summary_block *sum_node;
d624c96f	314	struct f2fs_summary sum;
f6517cfc	315	struct page sum_page, node_page;
c9ef4810	316	struct dnode_of_data tdn = *dn;
b292dcab	317	nid_t ino, nid;
d624c96f	318	struct inode *inode;
de93653f	319	unsigned int offset;
d624c96f JK	320	block_t bidx;
	321	int i;
	322
	323	sentry = get_seg_entry(sbi, segno);
	324	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
39cf72cf	325	return 0;
d624c96f JK	326
	327	/* Get the previous summary */
	328	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
	329	struct curseg_info *curseg = CURSEG_I(sbi, i);
	330	if (curseg->segno == segno) {
	331	sum = curseg->sum_blk->entries[blkoff];
f6517cfc	332	goto got_it;
d624c96f JK	333	}
d624c96f JK	334	}
d624c96f	335
f6517cfc JK	336	sum_page = get_sum_page(sbi, segno);
	337	sum_node = (struct f2fs_summary_block *)page_address(sum_page);
	338	sum = sum_node->entries[blkoff];
	339	f2fs_put_page(sum_page, 1);
	340	got_it:
b292dcab JK	341	/* Use the locked dnode page and inode */
	342	nid = le32_to_cpu(sum.nid);
	343	if (dn->inode->i_ino == nid) {
b292dcab	344	tdn.nid = nid;
c9ef4810 JK	345	if (!dn->inode_page_locked)
c9ef4810 JK	346	lock_page(dn->inode_page);
b292dcab	347	tdn.node_page = dn->inode_page;
060dd67b	348	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
c9ef4810	349	goto truncate_out;
b292dcab	350	} else if (dn->nid == nid) {
060dd67b	351	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
c9ef4810	352	goto truncate_out;
b292dcab JK	353	}
b292dcab JK	354
d624c96f	355	/* Get the node page */
b292dcab	356	node_page = get_node_page(sbi, nid);
39cf72cf JK	357	if (IS_ERR(node_page))
39cf72cf JK	358	return PTR_ERR(node_page);
de93653f JK	359
de93653f JK	360	offset = ofs_of_node(node_page);
d624c96f JK	361	ino = ino_of_node(node_page);
	362	f2fs_put_page(node_page, 1);
	363
60979115 JK	364	if (ino != dn->inode->i_ino) {
	365	/* Deallocate previous index in the node page */
	366	inode = f2fs_iget(sbi->sb, ino);
	367	if (IS_ERR(inode))
	368	return PTR_ERR(inode);
	369	} else {
	370	inode = dn->inode;
	371	}
06025f4d	372
81ca7350	373	bidx = start_bidx_of_node(offset, inode) + le16_to_cpu(sum.ofs_in_node);
de93653f	374
c9ef4810 JK	375	/*
	376	* if inode page is locked, unlock temporarily, but its reference
	377	* count keeps alive.
	378	*/
	379	if (ino == dn->inode->i_ino && dn->inode_page_locked)
	380	unlock_page(dn->inode_page);
	381
	382	set_new_dnode(&tdn, inode, NULL, NULL, 0);
	383	if (get_dnode_of_data(&tdn, bidx, LOOKUP_NODE))
	384	goto out;
	385
	386	if (tdn.data_blkaddr == blkaddr)
	387	truncate_data_blocks_range(&tdn, 1);
	388
	389	f2fs_put_dnode(&tdn);
	390	out:
	391	if (ino != dn->inode->i_ino)
60979115	392	iput(inode);
c9ef4810 JK	393	else if (dn->inode_page_locked)
	394	lock_page(dn->inode_page);
	395	return 0;
	396
	397	truncate_out:
	398	if (datablock_addr(tdn.node_page, tdn.ofs_in_node) == blkaddr)
	399	truncate_data_blocks_range(&tdn, 1);
	400	if (dn->inode->i_ino == nid && !dn->inode_page_locked)
	401	unlock_page(dn->inode_page);
39cf72cf	402	return 0;
d624c96f JK	403	}
d624c96f JK	404
6ead1142	405	static int do_recover_data(struct f2fs_sb_info sbi, struct inode inode,
d624c96f JK	406	struct page *page, block_t blkaddr)
d624c96f JK	407	{
d624c96f	408	struct dnode_of_data dn;
d624c96f	409	struct node_info ni;
81ca7350	410	unsigned int start, end;
f356fe0c	411	int err = 0, recovered = 0;
d624c96f	412
1c35a90e JK	413	/* step 1: recover xattr */
	414	if (IS_INODE(page)) {
	415	recover_inline_xattr(inode, page);
	416	} else if (f2fs_has_xattr_block(ofs_of_node(page))) {
bc4a1f87 JK	417	/*
	418	* Deprecated; xattr blocks should be found from cold log.
	419	* But, we should remain this for backward compatibility.
	420	*/
1c35a90e	421	recover_xattr_data(inode, page, blkaddr);
1e1bb4ba	422	goto out;
1c35a90e	423	}
1e1bb4ba	424
1c35a90e JK	425	/* step 2: recover inline data */
1c35a90e JK	426	if (recover_inline_data(inode, page))
abb2366c JK	427	goto out;
abb2366c JK	428
1c35a90e	429	/* step 3: recover data indices */
81ca7350 CY	430	start = start_bidx_of_node(ofs_of_node(page), inode);
81ca7350 CY	431	end = start + ADDRS_PER_PAGE(page, inode);
d624c96f JK	432
d624c96f JK	433	set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837	434
6ead1142	435	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
72235541	436	if (err)
1e1bb4ba	437	goto out;
d624c96f	438
fec1d657	439	f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
d624c96f JK	440
d624c96f JK	441	get_node_info(sbi, dn.nid, &ni);
9850cf4a JK	442	f2fs_bug_on(sbi, ni.ino != ino_of_node(page));
9850cf4a JK	443	f2fs_bug_on(sbi, ofs_of_node(dn.node_page) != ofs_of_node(page));
d624c96f	444
12a8343e	445	for (; start < end; start++, dn.ofs_in_node++) {
d624c96f JK	446	block_t src, dest;
	447
	448	src = datablock_addr(dn.node_page, dn.ofs_in_node);
	449	dest = datablock_addr(page, dn.ofs_in_node);
	450
12a8343e CY	451	/* skip recovering if dest is the same as src */
	452	if (src == dest)
	453	continue;
	454
	455	/* dest is invalid, just invalidate src block */
	456	if (dest == NULL_ADDR) {
	457	truncate_data_blocks_range(&dn, 1);
	458	continue;
	459	}
	460
26de9b11 JK	461	if ((start + 1) << PAGE_SHIFT > i_size_read(inode))
	462	f2fs_i_size_write(inode, (start + 1) << PAGE_SHIFT);
	463
12a8343e CY	464	/*
	465	* dest is reserved block, invalidate src block
	466	* and then reserve one new block in dnode page.
	467	*/
	468	if (dest == NEW_ADDR) {
	469	truncate_data_blocks_range(&dn, 1);
3b9b10f9	470	reserve_new_block(&dn);
12a8343e CY	471	continue;
	472	}
	473
	474	/* dest is valid block, try to recover from src to dest */
	475	if (is_valid_blkaddr(sbi, dest, META_POR)) {
e03b07d9	476
d624c96f	477	if (src == NULL_ADDR) {
5d56b671	478	err = reserve_new_block(&dn);
975756c4 JK	479	#ifdef CONFIG_F2FS_FAULT_INJECTION
	480	while (err)
	481	err = reserve_new_block(&dn);
	482	#endif
d624c96f	483	/* We should not get -ENOSPC */
9850cf4a	484	f2fs_bug_on(sbi, err);
6f3ec995 JK	485	if (err)
6f3ec995 JK	486	goto err;
d624c96f JK	487	}
	488
	489	/* Check the previous node page having this index */
39cf72cf JK	490	err = check_index_in_prev_nodes(sbi, dest, &dn);
	491	if (err)
	492	goto err;
d624c96f	493
d624c96f	494	/* write dummy data page */
528e3459	495	f2fs_replace_block(sbi, &dn, src, dest,
28bc106b	496	ni.version, false, false);
f356fe0c	497	recovered++;
d624c96f	498	}
d624c96f JK	499	}
d624c96f JK	500
d624c96f JK	501	copy_node_footer(dn.node_page, page);
	502	fill_node_footer(dn.node_page, dn.nid, ni.ino,
	503	ofs_of_node(page), false);
	504	set_page_dirty(dn.node_page);
39cf72cf	505	err:
d624c96f	506	f2fs_put_dnode(&dn);
1e1bb4ba	507	out:
6c311ec6 CF	508	f2fs_msg(sbi->sb, KERN_NOTICE,
	509	"recover_data: ino = %lx, recovered = %d blocks, err = %d",
	510	inode->i_ino, recovered, err);
39cf72cf	511	return err;
d624c96f JK	512	}
d624c96f JK	513
f61cce5b CY	514	static int recover_data(struct f2fs_sb_info sbi, struct list_head inode_list,
f61cce5b CY	515	struct list_head *dir_list)
d624c96f	516	{
d71b5564	517	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f	518	struct curseg_info *curseg;
4c521f49	519	struct page *page = NULL;
6ead1142	520	int err = 0;
d624c96f JK	521	block_t blkaddr;
	522
	523	/* get node pages in the current segment */
b7973f23	524	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
d624c96f JK	525	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
d624c96f JK	526
d624c96f JK	527	while (1) {
	528	struct fsync_inode_entry *entry;
	529
f0c9cada	530	if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
4c521f49	531	break;
d624c96f	532
635aee1f CY	533	ra_meta_pages_cond(sbi, blkaddr);
635aee1f CY	534
2b947003	535	page = get_tmp_page(sbi, blkaddr);
393ff91f	536
4c521f49 JK	537	if (cp_ver != cpver_of_node(page)) {
4c521f49 JK	538	f2fs_put_page(page, 1);
45856aff	539	break;
4c521f49	540	}
d624c96f	541
f61cce5b	542	entry = get_fsync_inode(inode_list, ino_of_node(page));
d624c96f JK	543	if (!entry)
d624c96f JK	544	goto next;
441ac5cb JK	545	/*
	546	* inode(x) \| CP \| inode(x) \| dnode(F)
	547	* In this case, we can lose the latest inode(x).
c52e1b10	548	* So, call recover_inode for the inode update.
441ac5cb	549	*/
608514de	550	if (IS_INODE(page))
c52e1b10 JK	551	recover_inode(entry->inode, page);
c52e1b10 JK	552	if (entry->last_dentry == blkaddr) {
f61cce5b	553	err = recover_dentry(entry->inode, page, dir_list);
c52e1b10 JK	554	if (err) {
	555	f2fs_put_page(page, 1);
	556	break;
	557	}
	558	}
6ead1142	559	err = do_recover_data(sbi, entry->inode, page, blkaddr);
4c521f49 JK	560	if (err) {
4c521f49 JK	561	f2fs_put_page(page, 1);
45856aff	562	break;
4c521f49	563	}
d624c96f	564
3f8ab270 CY	565	if (entry->blkaddr == blkaddr)
3f8ab270 CY	566	del_fsync_inode(entry);
d624c96f JK	567	next:
	568	/* check next segment */
	569	blkaddr = next_blkaddr_of_node(page);
4c521f49	570	f2fs_put_page(page, 1);
d624c96f	571	}
6ead1142 JK	572	if (!err)
	573	allocate_new_segments(sbi);
	574	return err;
d624c96f JK	575	}
d624c96f JK	576
6781eabb	577	int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only)
d624c96f	578	{
cf2271e7	579	struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
d624c96f	580	struct list_head inode_list;
f61cce5b	581	struct list_head dir_list;
cf2271e7	582	block_t blkaddr;
6ead1142	583	int err;
6781eabb	584	int ret = 0;
aabe5136	585	bool need_writecp = false;
d624c96f JK	586
d624c96f JK	587	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
e8512d2e	588	sizeof(struct fsync_inode_entry));
6bacf52f	589	if (!fsync_entry_slab)
6ead1142	590	return -ENOMEM;
d624c96f JK	591
d624c96f JK	592	INIT_LIST_HEAD(&inode_list);
f61cce5b	593	INIT_LIST_HEAD(&dir_list);
d624c96f	594
14f4e690 JK	595	/* prevent checkpoint */
	596	mutex_lock(&sbi->cp_mutex);
	597
cf2271e7 JK	598	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
cf2271e7 JK	599
315df839	600	/* step #1: find fsynced inode numbers */
6ead1142	601	err = find_fsync_dnodes(sbi, &inode_list);
6781eabb	602	if (err \|\| list_empty(&inode_list))
d624c96f JK	603	goto out;
d624c96f JK	604
6781eabb JK	605	if (check_only) {
6781eabb JK	606	ret = 1;
d624c96f	607	goto out;
6781eabb	608	}
d624c96f	609
aabe5136	610	need_writecp = true;
691c6fd2	611
d624c96f	612	/* step #2: recover data */
f61cce5b	613	err = recover_data(sbi, &inode_list, &dir_list);
b307384e	614	if (!err)
9850cf4a	615	f2fs_bug_on(sbi, !list_empty(&inode_list));
d624c96f	616	out:
5ebefc5b	617	destroy_fsync_dnodes(&inode_list);
cf2271e7	618
4c521f49 JK	619	/* truncate meta pages to be used by the recovery */
4c521f49 JK	620	truncate_inode_pages_range(META_MAPPING(sbi),
09cbfeaf	621	(loff_t)MAIN_BLKADDR(sbi) << PAGE_SHIFT, -1);
4c521f49	622
cf2271e7 JK	623	if (err) {
	624	truncate_inode_pages_final(NODE_MAPPING(sbi));
	625	truncate_inode_pages_final(META_MAPPING(sbi));
	626	}
	627
caf0047e	628	clear_sbi_flag(sbi, SBI_POR_DOING);
cf2271e7	629	if (err) {
e90c2d28 CY	630	bool invalidate = false;
e90c2d28 CY	631
36abef4e JK	632	if (test_opt(sbi, LFS)) {
36abef4e JK	633	update_meta_page(sbi, NULL, blkaddr);
e90c2d28	634	invalidate = true;
36abef4e JK	635	} else if (discard_next_dnode(sbi, blkaddr)) {
	636	invalidate = true;
	637	}
cf2271e7 JK	638
	639	/* Flush all the NAT/SIT pages */
	640	while (get_pages(sbi, F2FS_DIRTY_META))
	641	sync_meta_pages(sbi, META, LONG_MAX);
e90c2d28 CY	642
	643	/* invalidate temporary meta page */
	644	if (invalidate)
	645	invalidate_mapping_pages(META_MAPPING(sbi),
	646	blkaddr, blkaddr);
	647
14f4e690 JK	648	set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
14f4e690 JK	649	mutex_unlock(&sbi->cp_mutex);
cf2271e7	650	} else if (need_writecp) {
75ab4cb8	651	struct cp_control cpc = {
10027551	652	.reason = CP_RECOVERY,
75ab4cb8	653	};
14f4e690	654	mutex_unlock(&sbi->cp_mutex);
c34f42e2	655	err = write_checkpoint(sbi, &cpc);
14f4e690 JK	656	} else {
14f4e690 JK	657	mutex_unlock(&sbi->cp_mutex);
cf2271e7	658	}
f61cce5b CY	659
	660	destroy_fsync_dnodes(&dir_list);
	661	kmem_cache_destroy(fsync_entry_slab);
6781eabb	662	return ret ? ret: err;
d624c96f	663	}