[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 = F2FS_NODE(ipage);
	struct f2fs_inode *raw_inode = &(raw_node->i);
	nid_t pino = le32_to_cpu(raw_inode->i_pino);
	struct f2fs_dir_entry *de;
	struct qstr name;
	struct page *page;
	struct inode *dir, *einode;
	int err = 0;

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

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

	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, "recover_inode and its dentry: "
			"ino = %x, name = %s, dir = %lx, err = %d",
			ino_of_node(ipage), raw_inode->i_name,
			IS_ERR(dir) ? 0 : dir->i_ino, err);
	return err;
}

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

	if (!IS_INODE(node_page))
		return 0;

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

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

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

static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
{
	unsigned long long cp_ver = 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 = START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff;

	/* 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_SEGOFF_FROM_SEG0(sbi, blkaddr) &
					(sbi->blocks_per_seg - 1);
	struct f2fs_summary sum;
	nid_t ino, nid;
	void *kaddr;
	struct inode *inode;
	struct page *node_page;
	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];
			break;
		}
	}
	if (i > CURSEG_COLD_DATA) {
		struct page *sum_page = get_sum_page(sbi, segno);
		struct f2fs_summary_block *sum_node;
		kaddr = page_address(sum_page);
		sum_node = (struct f2fs_summary_block *)kaddr;
		sum = sum_node->entries[blkoff];
		f2fs_put_page(sum_page, 1);
	}

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

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

	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;

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

	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);
		return err;
	}

	wait_on_page_writeback(dn.node_page);

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

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

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