[mirror_ubuntu-jammy-kernel.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;

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

	zero_user_segment(page, INLINE_DATA_OFFSET,
				INLINE_DATA_OFFSET + MAX_INLINE_DATA);

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

	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))
		return PTR_ERR(ipage);

	/*
	 * 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) {
		f2fs_unlock_op(sbi);
		return err;
	}

	zero_user_segment(page, 0, 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, true);

	/* 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);
	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_write_begin(inode->i_mapping, 0, AOP_FLAG_NOFS);
	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;

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

	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);

	return 0;
}

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

		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));
		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
	42	ipage = get_node_page(sbi, inode->i_ino);
	43	if (IS_ERR(ipage))
	44	return PTR_ERR(ipage);
	45
	46	zero_user_segment(page, INLINE_DATA_OFFSET,
	47	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	48
	49	/* Copy the whole inline data block */
	50	src_addr = inline_data_addr(ipage);
	51	dst_addr = kmap(page);
	52	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	53	kunmap(page);
	54	f2fs_put_page(ipage, 1);
	55
	56	SetPageUptodate(page);
	57	unlock_page(page);
	58
	59	return 0;
	60	}
	61
	62	static int __f2fs_convert_inline_data(struct inode inode, struct page page)
	63	{
	64	int err;
	65	struct page *ipage;
	66	struct dnode_of_data dn;
	67	void src_addr, dst_addr;
	68	block_t new_blk_addr;
	69	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	70	struct f2fs_io_info fio = {
	71	.type = DATA,
	72	.rw = WRITE_SYNC \| REQ_PRIO,
	73	};
	74
	75	f2fs_lock_op(sbi);
	76	ipage = get_node_page(sbi, inode->i_ino);
	77	if (IS_ERR(ipage))
	78	return PTR_ERR(ipage);
	79
80	/*
81	* i_addr[0] is not used for inline data,
82	* so reserving new block will not destroy inline data
83	*/
a8865372	84	set_new_dnode(&dn, inode, ipage, NULL, 0);
e18c65b2 HL	85	err = f2fs_reserve_block(&dn, 0);
e18c65b2 HL	86	if (err) {
e18c65b2 HL	87	f2fs_unlock_op(sbi);
	88	return err;
	89	}
	90
	91	zero_user_segment(page, 0, PAGE_CACHE_SIZE);
	92
	93	/* Copy the whole inline data block */
	94	src_addr = inline_data_addr(ipage);
	95	dst_addr = kmap(page);
	96	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	97	kunmap(page);
9e09fc85	98	SetPageUptodate(page);
e18c65b2 HL	99
	100	/* write data page to try to make data consistent */
	101	set_page_writeback(page);
	102	write_data_page(page, &dn, &new_blk_addr, &fio);
	103	update_extent_cache(new_blk_addr, &dn);
	104	f2fs_wait_on_page_writeback(page, DATA, true);
	105
	106	/* clear inline data and flag after data writeback */
	107	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	108	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	109	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
0dbdc2ae	110	stat_dec_inline_inode(inode);
e18c65b2 HL	111
e18c65b2 HL	112	sync_inode_page(&dn);
a8865372	113	f2fs_put_dnode(&dn);
e18c65b2	114	f2fs_unlock_op(sbi);
e18c65b2 HL	115	return err;
	116	}
	117
9e09fc85	118	int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size)
e18c65b2	119	{
e18c65b2	120	struct page *page;
9e09fc85	121	int err;
e18c65b2	122
9e09fc85 JK	123	if (!f2fs_has_inline_data(inode))
	124	return 0;
	125	else if (to_size <= MAX_INLINE_DATA)
	126	return 0;
e18c65b2	127
9e09fc85 JK	128	page = grab_cache_page_write_begin(inode->i_mapping, 0, AOP_FLAG_NOFS);
	129	if (!page)
	130	return -ENOMEM;
e18c65b2	131
9e09fc85 JK	132	err = __f2fs_convert_inline_data(inode, page);
9e09fc85 JK	133	f2fs_put_page(page, 1);
e18c65b2 HL	134	return err;
	135	}
	136
	137	int f2fs_write_inline_data(struct inode *inode,
	138	struct page *page, unsigned size)
	139	{
	140	void src_addr, dst_addr;
	141	struct page *ipage;
	142	struct dnode_of_data dn;
	143	int err;
	144
	145	set_new_dnode(&dn, inode, NULL, NULL, 0);
	146	err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
	147	if (err)
	148	return err;
	149	ipage = dn.inode_page;
	150
	151	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	152	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	153	src_addr = kmap(page);
	154	dst_addr = inline_data_addr(ipage);
	155	memcpy(dst_addr, src_addr, size);
	156	kunmap(page);
	157
	158	/* Release the first data block if it is allocated */
	159	if (!f2fs_has_inline_data(inode)) {
	160	truncate_data_blocks_range(&dn, 1);
	161	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
0dbdc2ae	162	stat_inc_inline_inode(inode);
e18c65b2 HL	163	}
	164
	165	sync_inode_page(&dn);
	166	f2fs_put_dnode(&dn);
	167
	168	return 0;
	169	}
1e1bb4ba JK	170
	171	int recover_inline_data(struct inode inode, struct page npage)
	172	{
	173	struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
	174	struct f2fs_inode *ri = NULL;
	175	void src_addr, dst_addr;
	176	struct page *ipage;
	177
	178	/*
	179	* The inline_data recovery policy is as follows.
	180	* [prev.] [next] of inline_data flag
	181	* o o -> recover inline_data
	182	* o x -> remove inline_data, and then recover data blocks
	183	* x o -> remove inline_data, and then recover inline_data
	184	* x x -> recover data blocks
	185	*/
	186	if (IS_INODE(npage))
	187	ri = F2FS_INODE(npage);
	188
	189	if (f2fs_has_inline_data(inode) &&
	190	ri && ri->i_inline & F2FS_INLINE_DATA) {
	191	process_inline:
	192	ipage = get_node_page(sbi, inode->i_ino);
	193	f2fs_bug_on(IS_ERR(ipage));
	194
	195	src_addr = inline_data_addr(npage);
	196	dst_addr = inline_data_addr(ipage);
	197	memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
	198	update_inode(inode, ipage);
	199	f2fs_put_page(ipage, 1);
	200	return -1;
	201	}
	202
	203	if (f2fs_has_inline_data(inode)) {
	204	ipage = get_node_page(sbi, inode->i_ino);
	205	f2fs_bug_on(IS_ERR(ipage));
	206	zero_user_segment(ipage, INLINE_DATA_OFFSET,
	207	INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	208	clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	209	update_inode(inode, ipage);
	210	f2fs_put_page(ipage, 1);
	211	} else if (ri && ri->i_inline & F2FS_INLINE_DATA) {
	212	truncate_blocks(inode, 0);
	213	set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
	214	goto process_inline;
	215	}
	216	return 0;
	217	}