[deliverable/linux.git] / fs / f2fs / inline.c

/*
 * fs/f2fs/inline.c
 * Copyright (c) 2013, Intel Corporation
 * Authors: Huajun Li <huajun.li@intel.com>
 *          Haicheng Li <haicheng.li@intel.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"

bool f2fs_may_inline(struct inode *inode)
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	block_t nr_blocks;
	loff_t i_size;

	if (!test_opt(sbi, INLINE_DATA))
		return false;

	nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
	if (inode->i_blocks > nr_blocks)
		return false;

	i_size = i_size_read(inode);
	if (i_size > MAX_INLINE_DATA)
		return false;

	return true;
}

int f2fs_read_inline_data(struct inode *inode, struct page *page)
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct page *ipage;
	void *src_addr, *dst_addr;

	if (page->index) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
		goto out;
	}

	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage)) {
		unlock_page(page);
		return PTR_ERR(ipage);
	}

	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
	dst_addr = kmap(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap(page);
	f2fs_put_page(ipage, 1);

out:
	SetPageUptodate(page);
	unlock_page(page);

	return 0;
}

static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
{
	int err;
	struct page *ipage;
	struct dnode_of_data dn;
	void *src_addr, *dst_addr;
	block_t new_blk_addr;
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct f2fs_io_info fio = {
		.type = DATA,
		.rw = WRITE_SYNC | REQ_PRIO,
	};

	f2fs_lock_op(sbi);
	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
		goto out;
	}

	/*
	 * i_addr[0] is not used for inline data,
	 * so reserving new block will not destroy inline data
	 */
	set_new_dnode(&dn, inode, ipage, NULL, 0);
	err = f2fs_reserve_block(&dn, 0);
	if (err)
		goto out;

	f2fs_wait_on_page_writeback(page, DATA);
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);

	/* Copy the whole inline data block */
	src_addr = inline_data_addr(ipage);
	dst_addr = kmap(page);
	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	kunmap(page);
	SetPageUptodate(page);

	/* write data page to try to make data consistent */
	set_page_writeback(page);
	write_data_page(page, &dn, &new_blk_addr, &fio);
	update_extent_cache(new_blk_addr, &dn);
	f2fs_wait_on_page_writeback(page, DATA);

	/* clear inline data and flag after data writeback */
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	stat_dec_inline_inode(inode);

	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);
out:
	f2fs_unlock_op(sbi);
	return err;
}

int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size)
{
	struct page *page;
	int err;

	if (!f2fs_has_inline_data(inode))
		return 0;
	else if (to_size <= MAX_INLINE_DATA)
		return 0;

	page = grab_cache_page(inode->i_mapping, 0);
	if (!page)
		return -ENOMEM;

	err = __f2fs_convert_inline_data(inode, page);
	f2fs_put_page(page, 1);
	return err;
}

int f2fs_write_inline_data(struct inode *inode,
			   struct page *page, unsigned size)
{
	void *src_addr, *dst_addr;
	struct page *ipage;
	struct dnode_of_data dn;
	int err;

	set_new_dnode(&dn, inode, NULL, NULL, 0);
	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	if (err)
		return err;
	ipage = dn.inode_page;

	f2fs_wait_on_page_writeback(ipage, NODE);
	zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	src_addr = kmap(page);
	dst_addr = inline_data_addr(ipage);
	memcpy(dst_addr, src_addr, size);
	kunmap(page);

	/* Release the first data block if it is allocated */
	if (!f2fs_has_inline_data(inode)) {
		truncate_data_blocks_range(&dn, 1);
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		stat_inc_inline_inode(inode);
	}

	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);

	return 0;
}

void truncate_inline_data(struct inode *inode, u64 from)
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct page *ipage;

	if (from >= MAX_INLINE_DATA)
		return;

	ipage = get_node_page(sbi, inode->i_ino);
	if (IS_ERR(ipage))
		return;

	f2fs_wait_on_page_writeback(ipage, NODE);

	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
				INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	set_page_dirty(ipage);
	f2fs_put_page(ipage, 1);
}

int recover_inline_data(struct inode *inode, struct page *npage)
{
	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	struct f2fs_inode *ri = NULL;
	void *src_addr, *dst_addr;
	struct page *ipage;

	/*
	 * The inline_data recovery policy is as follows.
	 * [prev.] [next] of inline_data flag
	 *    o       o  -> recover inline_data
	 *    o       x  -> remove inline_data, and then recover data blocks
	 *    x       o  -> remove inline_data, and then recover inline_data
	 *    x       x  -> recover data blocks
	 */
	if (IS_INODE(npage))
		ri = F2FS_INODE(npage);

	if (f2fs_has_inline_data(inode) &&
			ri && ri->i_inline & F2FS_INLINE_DATA) {
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(IS_ERR(ipage));

		f2fs_wait_on_page_writeback(ipage, NODE);

		src_addr = inline_data_addr(npage);
		dst_addr = inline_data_addr(ipage);
		memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
		return -1;
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(IS_ERR(ipage));
		f2fs_wait_on_page_writeback(ipage, NODE);
		zero_user_segment(ipage, INLINE_DATA_OFFSET,
				 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
		clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		update_inode(inode, ipage);
		f2fs_put_page(ipage, 1);
	} else if (ri && ri->i_inline & F2FS_INLINE_DATA) {
		truncate_blocks(inode, 0);
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		goto process_inline;
	}
	return 0;
}
Commit	Line	Data
e18c65b2 HL	1	/*
	2	* fs/f2fs/inline.c
	3	* Copyright (c) 2013, Intel Corporation
	4	* Authors: Huajun Li <huajun.li@intel.com>
	5	* Haicheng Li <haicheng.li@intel.com>
	6	* This program is free software; you can redistribute it and/or modify
	7	* it under the terms of the GNU General Public License version 2 as
	8	* published by the Free Software Foundation.
	9	*/
	10
	11	#include <linux/fs.h>
	12	#include <linux/f2fs_fs.h>
	13
	14	#include "f2fs.h"
	15
e18c65b2 HL	16	bool f2fs_may_inline(struct inode *inode)
	17	{
	18	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	19	block_t nr_blocks;
	20	loff_t i_size;
	21
	22	if (!test_opt(sbi, INLINE_DATA))
	23	return false;
	24
	25	nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
	26	if (inode->i_blocks > nr_blocks)
	27	return false;
	28
	29	i_size = i_size_read(inode);
	30	if (i_size > MAX_INLINE_DATA)
	31	return false;
	32
	33	return true;
	34	}
	35
	36	int f2fs_read_inline_data(struct inode inode, struct page page)
	37	{
	38	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	39	struct page *ipage;
	40	void src_addr, dst_addr;
	41
04a17fb1 CY	42	if (page->index) {
	43	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	44	goto out;
	45	}
	46
e18c65b2	47	ipage = get_node_page(sbi, inode->i_ino);
d54c795b CY	48	if (IS_ERR(ipage)) {
d54c795b CY	49	unlock_page(page);
e18c65b2	50	return PTR_ERR(ipage);
d54c795b	51	}
e18c65b2	52
18309aaa	53	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	54
	55	/* Copy the whole inline data block */
	56	src_addr = inline_data_addr(ipage);
	57	dst_addr = kmap(page);
	58	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	59	kunmap(page);
	60	f2fs_put_page(ipage, 1);
	61
04a17fb1	62	out:
e18c65b2 HL	63	SetPageUptodate(page);
	64	unlock_page(page);
	65
	66	return 0;
	67	}
	68
	69	static int __f2fs_convert_inline_data(struct inode inode, struct page page)
	70	{
	71	int err;
	72	struct page *ipage;
	73	struct dnode_of_data dn;
	74	void src_addr, dst_addr;
	75	block_t new_blk_addr;
	76	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	77	struct f2fs_io_info fio = {
	78	.type = DATA,
	79	.rw = WRITE_SYNC \| REQ_PRIO,
	80	};
	81
	82	f2fs_lock_op(sbi);
	83	ipage = get_node_page(sbi, inode->i_ino);
15c6e3aa JK	84	if (IS_ERR(ipage)) {
	85	err = PTR_ERR(ipage);
	86	goto out;
	87	}
e18c65b2 HL	88
	89	/*
	90	* i_addr[0] is not used for inline data,
	91	* so reserving new block will not destroy inline data
	92	*/
a8865372	93	set_new_dnode(&dn, inode, ipage, NULL, 0);
e18c65b2	94	err = f2fs_reserve_block(&dn, 0);
15c6e3aa JK	95	if (err)
15c6e3aa JK	96	goto out;
e18c65b2	97
9ac1349a	98	f2fs_wait_on_page_writeback(page, DATA);
18309aaa	99	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
e18c65b2 HL	100
	101	/* Copy the whole inline data block */
	102	src_addr = inline_data_addr(ipage);
	103	dst_addr = kmap(page);
	104	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	105	kunmap(page);
9e09fc85	106	SetPageUptodate(page);
e18c65b2 HL	107
	108	/* write data page to try to make data consistent */
	109	set_page_writeback(page);
	110	write_data_page(page, &dn, &new_blk_addr, &fio);
	111	update_extent_cache(new_blk_addr, &dn);
5514f0aa	112	f2fs_wait_on_page_writeback(page, DATA);
e18c65b2 HL	113
	114	/* clear inline data and flag after data writeback */
	115	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	116	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	117	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
0dbdc2ae	118	stat_dec_inline_inode(inode);
e18c65b2 HL	119
e18c65b2 HL	120	sync_inode_page(&dn);
a8865372	121	f2fs_put_dnode(&dn);
15c6e3aa	122	out:
e18c65b2	123	f2fs_unlock_op(sbi);
e18c65b2 HL	124	return err;
	125	}
	126
9e09fc85	127	int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size)
e18c65b2	128	{
e18c65b2	129	struct page *page;
9e09fc85	130	int err;
e18c65b2	131
9e09fc85 JK	132	if (!f2fs_has_inline_data(inode))
	133	return 0;
	134	else if (to_size <= MAX_INLINE_DATA)
	135	return 0;
e18c65b2	136
9ac1349a	137	page = grab_cache_page(inode->i_mapping, 0);
9e09fc85 JK	138	if (!page)
9e09fc85 JK	139	return -ENOMEM;
e18c65b2	140
9e09fc85 JK	141	err = __f2fs_convert_inline_data(inode, page);
9e09fc85 JK	142	f2fs_put_page(page, 1);
e18c65b2 HL	143	return err;
	144	}
	145
	146	int f2fs_write_inline_data(struct inode *inode,
	147	struct page *page, unsigned size)
	148	{
	149	void src_addr, dst_addr;
	150	struct page *ipage;
	151	struct dnode_of_data dn;
	152	int err;
	153
	154	set_new_dnode(&dn, inode, NULL, NULL, 0);
	155	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	156	if (err)
	157	return err;
	158	ipage = dn.inode_page;
	159
54b591df	160	f2fs_wait_on_page_writeback(ipage, NODE);
e18c65b2 HL	161	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	162	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	163	src_addr = kmap(page);
	164	dst_addr = inline_data_addr(ipage);
	165	memcpy(dst_addr, src_addr, size);
	166	kunmap(page);
	167
	168	/* Release the first data block if it is allocated */
	169	if (!f2fs_has_inline_data(inode)) {
	170	truncate_data_blocks_range(&dn, 1);
	171	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
0dbdc2ae	172	stat_inc_inline_inode(inode);
e18c65b2 HL	173	}
e18c65b2 HL	174
fff04f90	175	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
e18c65b2 HL	176	sync_inode_page(&dn);
	177	f2fs_put_dnode(&dn);
	178
	179	return 0;
	180	}
1e1bb4ba	181
8aa6f1c5 CY	182	void truncate_inline_data(struct inode *inode, u64 from)
	183	{
	184	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	185	struct page *ipage;
	186
	187	if (from >= MAX_INLINE_DATA)
	188	return;
	189
	190	ipage = get_node_page(sbi, inode->i_ino);
	191	if (IS_ERR(ipage))
	192	return;
	193
54b591df JK	194	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	195
8aa6f1c5 CY	196	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
	197	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	198	set_page_dirty(ipage);
	199	f2fs_put_page(ipage, 1);
	200	}
	201
1e1bb4ba JK	202	int recover_inline_data(struct inode inode, struct page npage)
	203	{
	204	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	205	struct f2fs_inode *ri = NULL;
	206	void src_addr, dst_addr;
	207	struct page *ipage;
	208
	209	/*
	210	* The inline_data recovery policy is as follows.
	211	* [prev.] [next] of inline_data flag
	212	* o o -> recover inline_data
	213	* o x -> remove inline_data, and then recover data blocks
	214	* x o -> remove inline_data, and then recover inline_data
	215	* x x -> recover data blocks
	216	*/
	217	if (IS_INODE(npage))
	218	ri = F2FS_INODE(npage);
	219
	220	if (f2fs_has_inline_data(inode) &&
	221	ri && ri->i_inline & F2FS_INLINE_DATA) {
	222	process_inline:
	223	ipage = get_node_page(sbi, inode->i_ino);
	224	f2fs_bug_on(IS_ERR(ipage));
	225
54b591df JK	226	f2fs_wait_on_page_writeback(ipage, NODE);
54b591df JK	227
1e1bb4ba JK	228	src_addr = inline_data_addr(npage);
	229	dst_addr = inline_data_addr(ipage);
	230	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	231	update_inode(inode, ipage);
	232	f2fs_put_page(ipage, 1);
	233	return -1;
	234	}
	235
	236	if (f2fs_has_inline_data(inode)) {
	237	ipage = get_node_page(sbi, inode->i_ino);
	238	f2fs_bug_on(IS_ERR(ipage));
54b591df	239	f2fs_wait_on_page_writeback(ipage, NODE);
1e1bb4ba JK	240	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	241	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	242	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	243	update_inode(inode, ipage);
	244	f2fs_put_page(ipage, 1);
	245	} else if (ri && ri->i_inline & F2FS_INLINE_DATA) {
	246	truncate_blocks(inode, 0);
	247	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	248	goto process_inline;
	249	}
	250	return 0;
	251	}