[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 fsync_inode_entry *entry;

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

	return NULL;
}

static int recover_dentry(struct page *ipage, struct inode *inode)
{
	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;
	int err = 0;

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

	if (is_inode_flag_set(F2FS_I(dir), FI_DIRTY_DIR)) {
		iput(dir);
	} else {
		add_dirty_dir_inode(dir);
		set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
	}

	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);
			if (PTR_ERR(einode) == -ENOENT)
				err = -EEXIST;
			goto out_unmap_put;
		}
		err = acquire_orphan_inode(F2FS_SB(inode->i_sb));
		if (err) {
			iput(einode);
			goto out_unmap_put;
		}
		f2fs_delete_entry(de, page, einode);
		iput(einode);
		goto retry;
	}
	err = __f2fs_add_link(dir, &name, inode);
	goto out;

out_unmap_put:
	kunmap(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 int recover_inode(struct inode *inode, struct page *node_page)
{
	struct f2fs_inode *raw_inode = F2FS_INODE(node_page);

	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 = cur_cp_version(F2FS_CKPT(sbi));
	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 = NEXT_FREE_BLKADDR(sbi, curseg);

	/* read node page */
	page = alloc_page(GFP_F2FS_ZERO);
	if (!page)
		return -ENOMEM;
	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

		err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
		if (err)
			return err;

		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);
	__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_BLKOFF_FROM_SEG0(sbi, blkaddr);
	struct f2fs_summary_block *sum_node;
	struct f2fs_summary sum;
	struct page *sum_page, *node_page;
	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) {
		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);

	offset = ofs_of_node(node_page);
	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);

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

	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)
{
	struct f2fs_inode_info *fi = F2FS_I(inode);
	unsigned int start, end;
	struct dnode_of_data dn;
	struct f2fs_summary sum;
	struct node_info ni;
	int err = 0, recovered = 0;

	if (recover_inline_data(inode, page))
		goto out;

	if (recover_xattr_data(inode, page, blkaddr))
		goto out;

	start = start_bidx_of_node(ofs_of_node(page), fi);
	end = start + ADDRS_PER_PAGE(page, fi);

	f2fs_lock_op(sbi);

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

	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
	if (err) {
		f2fs_unlock_op(sbi);
		goto out;
	}

	f2fs_wait_on_page_writeback(dn.node_page, NODE);

	get_node_info(sbi, dn.nid, &ni);
	f2fs_bug_on(ni.ino != ino_of_node(page));
	f2fs_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) {
				err = reserve_new_block(&dn);
				/* We should not get -ENOSPC */
				f2fs_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);
	f2fs_unlock_op(sbi);
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 *head, int type)
{
	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
	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_F2FS_ZERO);
	if (!page)
		return -ENOMEM;

	lock_page(page);

	while (1) {
		struct fsync_inode_entry *entry;

		err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
		if (err)
			return err;

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

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

	if (list_empty(&inode_list))
		goto out;

	need_writecp = true;

	/* step #2: recover data */
	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
	f2fs_bug_on(!list_empty(&inode_list));
out:
	destroy_fsync_dnodes(&inode_list);
	kmem_cache_destroy(fsync_entry_slab);
	sbi->por_doing = false;
	if (!err && need_writecp)
		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	{
d624c96f JK	30	struct fsync_inode_entry *entry;
d624c96f JK	31
2d7b822a	32	list_for_each_entry(entry, head, list)
d624c96f JK	33	if (entry->inode->i_ino == ino)
d624c96f JK	34	return entry;
2d7b822a	35
d624c96f JK	36	return NULL;
	37	}
	38
	39	static int recover_dentry(struct page ipage, struct inode inode)
	40	{
58bfaf44	41	struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
74d0b917	42	nid_t pino = le32_to_cpu(raw_inode->i_pino);
6b8213d9	43	struct f2fs_dir_entry *de;
b7f7a5e0	44	struct qstr name;
d624c96f	45	struct page *page;
6b8213d9	46	struct inode dir, einode;
d624c96f JK	47	int err = 0;
d624c96f JK	48
ed57c27f JK	49	dir = f2fs_iget(inode->i_sb, pino);
	50	if (IS_ERR(dir)) {
	51	err = PTR_ERR(dir);
	52	goto out;
	53	}
	54
	55	if (is_inode_flag_set(F2FS_I(dir), FI_DIRTY_DIR)) {
	56	iput(dir);
	57	} else {
5deb8267	58	add_dirty_dir_inode(dir);
ed57c27f	59	set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
d624c96f JK	60	}
d624c96f JK	61
b7f7a5e0 AV	62	name.len = le32_to_cpu(raw_inode->i_namelen);
b7f7a5e0 AV	63	name.name = raw_inode->i_name;
d96b1431 CY	64
	65	if (unlikely(name.len > F2FS_NAME_LEN)) {
	66	WARN_ON(1);
	67	err = -ENAMETOOLONG;
	68	goto out;
	69	}
6b8213d9 JK	70	retry:
6b8213d9 JK	71	de = f2fs_find_entry(dir, &name, &page);
2e5558f4 RK	72	if (de && inode->i_ino == le32_to_cpu(de->ino))
2e5558f4 RK	73	goto out_unmap_put;
6b8213d9 JK	74	if (de) {
	75	einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
	76	if (IS_ERR(einode)) {
	77	WARN_ON(1);
	78	if (PTR_ERR(einode) == -ENOENT)
	79	err = -EEXIST;
2e5558f4 RK	80	goto out_unmap_put;
	81	}
	82	err = acquire_orphan_inode(F2FS_SB(inode->i_sb));
	83	if (err) {
	84	iput(einode);
	85	goto out_unmap_put;
6b8213d9 JK	86	}
	87	f2fs_delete_entry(de, page, einode);
	88	iput(einode);
	89	goto retry;
d624c96f	90	}
6b8213d9	91	err = __f2fs_add_link(dir, &name, inode);
2e5558f4 RK	92	goto out;
	93
	94	out_unmap_put:
	95	kunmap(page);
	96	f2fs_put_page(page, 0);
d624c96f	97	out:
6c311ec6 CF	98	f2fs_msg(inode->i_sb, KERN_NOTICE,
	99	"%s: ino = %x, name = %s, dir = %lx, err = %d",
	100	__func__, ino_of_node(ipage), raw_inode->i_name,
f28c06fa	101	IS_ERR(dir) ? 0 : dir->i_ino, err);
d624c96f JK	102	return err;
	103	}
	104
	105	static int recover_inode(struct inode inode, struct page node_page)
	106	{
58bfaf44	107	struct f2fs_inode *raw_inode = F2FS_INODE(node_page);
d624c96f	108
f356fe0c JK	109	if (!IS_INODE(node_page))
	110	return 0;
	111
25ca923b	112	inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f JK	113	i_size_write(inode, le64_to_cpu(raw_inode->i_size));
	114	inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	115	inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
	116	inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
	117	inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	118	inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
	119	inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
	120
f356fe0c JK	121	if (is_dent_dnode(node_page))
	122	return recover_dentry(node_page, inode);
	123
	124	f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
	125	ino_of_node(node_page), raw_inode->i_name);
	126	return 0;
d624c96f JK	127	}
	128
	129	static int find_fsync_dnodes(struct f2fs_sb_info sbi, struct list_head head)
	130	{
d71b5564	131	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f JK	132	struct curseg_info *curseg;
	133	struct page *page;
	134	block_t blkaddr;
	135	int err = 0;
	136
	137	/* get node pages in the current segment */
	138	curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
695fd1ed	139	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
d624c96f JK	140
	141	/* read node page */
	142	page = alloc_page(GFP_F2FS_ZERO);
e27dae4d DC	143	if (!page)
e27dae4d DC	144	return -ENOMEM;
d624c96f JK	145	lock_page(page);
	146
	147	while (1) {
	148	struct fsync_inode_entry *entry;
	149
93dfe2ac	150	err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
393ff91f	151	if (err)
b9987a27	152	return err;
d624c96f	153
393ff91f JK	154	lock_page(page);
393ff91f JK	155
6ead1142	156	if (cp_ver != cpver_of_node(page))
f356fe0c	157	break;
d624c96f JK	158
	159	if (!is_fsync_dnode(page))
	160	goto next;
	161
	162	entry = get_fsync_inode(head, ino_of_node(page));
	163	if (entry) {
d624c96f JK	164	if (IS_INODE(page) && is_dent_dnode(page))
	165	set_inode_flag(F2FS_I(entry->inode),
	166	FI_INC_LINK);
	167	} else {
	168	if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142 JK	169	err = recover_inode_page(sbi, page);
6ead1142 JK	170	if (err)
f356fe0c	171	break;
d624c96f JK	172	}
	173
	174	/* add this fsync inode to the list */
	175	entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
	176	if (!entry) {
	177	err = -ENOMEM;
f356fe0c	178	break;
d624c96f JK	179	}
d624c96f JK	180
d624c96f JK	181	entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
	182	if (IS_ERR(entry->inode)) {
	183	err = PTR_ERR(entry->inode);
fd8bb65f	184	kmem_cache_free(fsync_entry_slab, entry);
f356fe0c	185	break;
d624c96f	186	}
fd8bb65f	187	list_add_tail(&entry->list, head);
d624c96f	188	}
addbe45b JK	189	entry->blkaddr = blkaddr;
addbe45b JK	190
f356fe0c JK	191	err = recover_inode(entry->inode, page);
	192	if (err && err != -ENOENT)
	193	break;
d624c96f JK	194	next:
	195	/* check next segment */
	196	blkaddr = next_blkaddr_of_node(page);
d624c96f	197	}
b9987a27	198
d624c96f JK	199	unlock_page(page);
d624c96f JK	200	__free_pages(page, 0);
b9987a27	201
d624c96f JK	202	return err;
	203	}
	204
5ebefc5b	205	static void destroy_fsync_dnodes(struct list_head *head)
d624c96f	206	{
d8b79b2f DC	207	struct fsync_inode_entry entry, tmp;
	208
	209	list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f JK	210	iput(entry->inode);
	211	list_del(&entry->list);
	212	kmem_cache_free(fsync_entry_slab, entry);
	213	}
	214	}
	215
39cf72cf	216	static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
b292dcab	217	block_t blkaddr, struct dnode_of_data *dn)
d624c96f JK	218	{
	219	struct seg_entry *sentry;
	220	unsigned int segno = GET_SEGNO(sbi, blkaddr);
491c0854	221	unsigned short blkoff = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
f6517cfc	222	struct f2fs_summary_block *sum_node;
d624c96f	223	struct f2fs_summary sum;
f6517cfc	224	struct page sum_page, node_page;
b292dcab	225	nid_t ino, nid;
d624c96f	226	struct inode *inode;
de93653f	227	unsigned int offset;
d624c96f JK	228	block_t bidx;
	229	int i;
	230
	231	sentry = get_seg_entry(sbi, segno);
	232	if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
39cf72cf	233	return 0;
d624c96f JK	234
	235	/* Get the previous summary */
	236	for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
	237	struct curseg_info *curseg = CURSEG_I(sbi, i);
	238	if (curseg->segno == segno) {
	239	sum = curseg->sum_blk->entries[blkoff];
f6517cfc	240	goto got_it;
d624c96f JK	241	}
d624c96f JK	242	}
d624c96f	243
f6517cfc JK	244	sum_page = get_sum_page(sbi, segno);
	245	sum_node = (struct f2fs_summary_block *)page_address(sum_page);
	246	sum = sum_node->entries[blkoff];
	247	f2fs_put_page(sum_page, 1);
	248	got_it:
b292dcab JK	249	/* Use the locked dnode page and inode */
	250	nid = le32_to_cpu(sum.nid);
	251	if (dn->inode->i_ino == nid) {
	252	struct dnode_of_data tdn = *dn;
	253	tdn.nid = nid;
	254	tdn.node_page = dn->inode_page;
060dd67b	255	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab	256	truncate_data_blocks_range(&tdn, 1);
39cf72cf	257	return 0;
b292dcab JK	258	} else if (dn->nid == nid) {
b292dcab JK	259	struct dnode_of_data tdn = *dn;
060dd67b	260	tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab	261	truncate_data_blocks_range(&tdn, 1);
39cf72cf	262	return 0;
b292dcab JK	263	}
b292dcab JK	264
d624c96f	265	/* Get the node page */
b292dcab	266	node_page = get_node_page(sbi, nid);
39cf72cf JK	267	if (IS_ERR(node_page))
39cf72cf JK	268	return PTR_ERR(node_page);
de93653f JK	269
de93653f JK	270	offset = ofs_of_node(node_page);
d624c96f JK	271	ino = ino_of_node(node_page);
	272	f2fs_put_page(node_page, 1);
	273
	274	/* Deallocate previous index in the node page */
d4686d56	275	inode = f2fs_iget(sbi->sb, ino);
06025f4d	276	if (IS_ERR(inode))
39cf72cf	277	return PTR_ERR(inode);
06025f4d	278
de93653f JK	279	bidx = start_bidx_of_node(offset, F2FS_I(inode)) +
	280	le16_to_cpu(sum.ofs_in_node);
	281
d624c96f JK	282	truncate_hole(inode, bidx, bidx + 1);
d624c96f JK	283	iput(inode);
39cf72cf	284	return 0;
d624c96f JK	285	}
d624c96f JK	286
6ead1142	287	static int do_recover_data(struct f2fs_sb_info sbi, struct inode inode,
d624c96f JK	288	struct page *page, block_t blkaddr)
d624c96f JK	289	{
de93653f	290	struct f2fs_inode_info *fi = F2FS_I(inode);
d624c96f JK	291	unsigned int start, end;
	292	struct dnode_of_data dn;
	293	struct f2fs_summary sum;
	294	struct node_info ni;
f356fe0c	295	int err = 0, recovered = 0;
d624c96f	296
1e1bb4ba JK	297	if (recover_inline_data(inode, page))
	298	goto out;
	299
abb2366c JK	300	if (recover_xattr_data(inode, page, blkaddr))
	301	goto out;
	302
de93653f	303	start = start_bidx_of_node(ofs_of_node(page), fi);
6403eb1f	304	end = start + ADDRS_PER_PAGE(page, fi);
d624c96f	305
e479556b	306	f2fs_lock_op(sbi);
1e1bb4ba	307
d624c96f	308	set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837	309
6ead1142	310	err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837	311	if (err) {
e479556b	312	f2fs_unlock_op(sbi);
1e1bb4ba	313	goto out;
39936837	314	}
d624c96f	315
3cb5ad15	316	f2fs_wait_on_page_writeback(dn.node_page, NODE);
d624c96f JK	317
d624c96f JK	318	get_node_info(sbi, dn.nid, &ni);
5d56b671 JK	319	f2fs_bug_on(ni.ino != ino_of_node(page));
5d56b671 JK	320	f2fs_bug_on(ofs_of_node(dn.node_page) != ofs_of_node(page));
d624c96f JK	321
	322	for (; start < end; start++) {
	323	block_t src, dest;
	324
	325	src = datablock_addr(dn.node_page, dn.ofs_in_node);
	326	dest = datablock_addr(page, dn.ofs_in_node);
	327
	328	if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
	329	if (src == NULL_ADDR) {
5d56b671	330	err = reserve_new_block(&dn);
d624c96f	331	/* We should not get -ENOSPC */
5d56b671	332	f2fs_bug_on(err);
d624c96f JK	333	}
	334
	335	/* Check the previous node page having this index */
39cf72cf JK	336	err = check_index_in_prev_nodes(sbi, dest, &dn);
	337	if (err)
	338	goto err;
d624c96f JK	339
	340	set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
	341
	342	/* write dummy data page */
	343	recover_data_page(sbi, NULL, &sum, src, dest);
	344	update_extent_cache(dest, &dn);
f356fe0c	345	recovered++;
d624c96f JK	346	}
	347	dn.ofs_in_node++;
	348	}
	349
	350	/* write node page in place */
	351	set_summary(&sum, dn.nid, 0, 0);
	352	if (IS_INODE(dn.node_page))
	353	sync_inode_page(&dn);
	354
	355	copy_node_footer(dn.node_page, page);
	356	fill_node_footer(dn.node_page, dn.nid, ni.ino,
	357	ofs_of_node(page), false);
	358	set_page_dirty(dn.node_page);
	359
	360	recover_node_page(sbi, dn.node_page, &sum, &ni, blkaddr);
39cf72cf	361	err:
d624c96f	362	f2fs_put_dnode(&dn);
e479556b	363	f2fs_unlock_op(sbi);
1e1bb4ba	364	out:
6c311ec6 CF	365	f2fs_msg(sbi->sb, KERN_NOTICE,
	366	"recover_data: ino = %lx, recovered = %d blocks, err = %d",
	367	inode->i_ino, recovered, err);
39cf72cf	368	return err;
d624c96f JK	369	}
d624c96f JK	370
6ead1142	371	static int recover_data(struct f2fs_sb_info *sbi,
d624c96f JK	372	struct list_head *head, int type)
d624c96f JK	373	{
d71b5564	374	unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f JK	375	struct curseg_info *curseg;
d624c96f JK	376	struct page *page;
6ead1142	377	int err = 0;
d624c96f JK	378	block_t blkaddr;
	379
	380	/* get node pages in the current segment */
	381	curseg = CURSEG_I(sbi, type);
	382	blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
	383
	384	/* read node page */
a0acdfe0	385	page = alloc_page(GFP_F2FS_ZERO);
e27dae4d	386	if (!page)
6ead1142 JK	387	return -ENOMEM;
6ead1142 JK	388
d624c96f JK	389	lock_page(page);
	390
	391	while (1) {
	392	struct fsync_inode_entry *entry;
	393
93dfe2ac	394	err = f2fs_submit_page_bio(sbi, page, blkaddr, READ_SYNC);
6ead1142	395	if (err)
b9987a27	396	return err;
d624c96f	397
393ff91f JK	398	lock_page(page);
393ff91f JK	399
d624c96f	400	if (cp_ver != cpver_of_node(page))
45856aff	401	break;
d624c96f JK	402
	403	entry = get_fsync_inode(head, ino_of_node(page));
	404	if (!entry)
	405	goto next;
	406
6ead1142 JK	407	err = do_recover_data(sbi, entry->inode, page, blkaddr);
6ead1142 JK	408	if (err)
45856aff	409	break;
d624c96f JK	410
	411	if (entry->blkaddr == blkaddr) {
	412	iput(entry->inode);
	413	list_del(&entry->list);
	414	kmem_cache_free(fsync_entry_slab, entry);
	415	}
	416	next:
	417	/* check next segment */
	418	blkaddr = next_blkaddr_of_node(page);
d624c96f	419	}
b9987a27	420
d624c96f JK	421	unlock_page(page);
	422	__free_pages(page, 0);
	423
6ead1142 JK	424	if (!err)
	425	allocate_new_segments(sbi);
	426	return err;
d624c96f JK	427	}
d624c96f JK	428
6ead1142	429	int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f JK	430	{
d624c96f JK	431	struct list_head inode_list;
6ead1142	432	int err;
aabe5136	433	bool need_writecp = false;
d624c96f JK	434
d624c96f JK	435	fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
e8512d2e	436	sizeof(struct fsync_inode_entry));
6bacf52f	437	if (!fsync_entry_slab)
6ead1142	438	return -ENOMEM;
d624c96f JK	439
	440	INIT_LIST_HEAD(&inode_list);
	441
	442	/* step #1: find fsynced inode numbers */
aabe5136	443	sbi->por_doing = true;
6ead1142 JK	444	err = find_fsync_dnodes(sbi, &inode_list);
6ead1142 JK	445	if (err)
d624c96f JK	446	goto out;
	447
	448	if (list_empty(&inode_list))
	449	goto out;
	450
aabe5136	451	need_writecp = true;
691c6fd2	452
d624c96f	453	/* step #2: recover data */
6ead1142	454	err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
5d56b671	455	f2fs_bug_on(!list_empty(&inode_list));
d624c96f	456	out:
5ebefc5b	457	destroy_fsync_dnodes(&inode_list);
d624c96f	458	kmem_cache_destroy(fsync_entry_slab);
aabe5136	459	sbi->por_doing = false;
691c6fd2	460	if (!err && need_writecp)
2c2c149f	461	write_checkpoint(sbi, false);
6ead1142	462	return err;
d624c96f	463	}