inline.c 6.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
/*
 * 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;

42 43 44 45 46
	if (page->index) {
		zero_user_segment(page, 0, PAGE_CACHE_SIZE);
		goto out;
	}

47
	ipage = get_node_page(sbi, inode->i_ino);
48 49
	if (IS_ERR(ipage)) {
		unlock_page(page);
50
		return PTR_ERR(ipage);
51
	}
52

53
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
54 55 56 57 58 59 60 61

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

62
out:
63 64 65 66 67 68 69 70
	SetPageUptodate(page);
	unlock_page(page);

	return 0;
}

static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
{
71
	int err = 0;
72 73 74 75 76 77 78 79 80 81 82 83
	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);
84 85 86 87
	if (IS_ERR(ipage)) {
		err = PTR_ERR(ipage);
		goto out;
	}
88

89 90 91 92
	/* someone else converted inline_data already */
	if (!f2fs_has_inline_data(inode))
		goto out;

93 94 95 96
	/*
	 * i_addr[0] is not used for inline data,
	 * so reserving new block will not destroy inline data
	 */
97
	set_new_dnode(&dn, inode, ipage, NULL, 0);
98
	err = f2fs_reserve_block(&dn, 0);
99 100
	if (err)
		goto out;
101

102
	f2fs_wait_on_page_writeback(page, DATA);
103
	zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
104 105 106 107 108 109

	/* 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);
110
	SetPageUptodate(page);
111 112 113 114 115

	/* 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);
116
	f2fs_wait_on_page_writeback(page, DATA);
117 118 119 120 121

	/* 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);
122
	stat_dec_inline_inode(inode);
123 124

	sync_inode_page(&dn);
125
	f2fs_put_dnode(&dn);
126
out:
127 128 129 130
	f2fs_unlock_op(sbi);
	return err;
}

131 132
int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size,
						struct page *page)
133
{
134
	struct page *new_page = page;
135
	int err;
136

137 138 139 140
	if (!f2fs_has_inline_data(inode))
		return 0;
	else if (to_size <= MAX_INLINE_DATA)
		return 0;
141

142 143 144 145 146
	if (!page || page->index != 0) {
		new_page = grab_cache_page(inode->i_mapping, 0);
		if (!new_page)
			return -ENOMEM;
	}
147

148 149 150
	err = __f2fs_convert_inline_data(inode, new_page);
	if (!page || page->index != 0)
		f2fs_put_page(new_page, 1);
151 152 153 154
	return err;
}

int f2fs_write_inline_data(struct inode *inode,
155
				struct page *page, unsigned size)
156 157 158 159 160 161 162 163 164 165 166 167
{
	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;

168
	f2fs_wait_on_page_writeback(ipage, NODE);
169 170 171 172 173 174 175 176 177 178 179
	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);
180
		stat_inc_inline_inode(inode);
181 182
	}

183
	set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
184 185 186 187 188
	sync_inode_page(&dn);
	f2fs_put_dnode(&dn);

	return 0;
}
189

190 191 192 193 194 195 196 197 198 199 200 201
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;

202 203
	f2fs_wait_on_page_writeback(ipage, NODE);

204 205 206 207 208 209
	zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
				INLINE_DATA_OFFSET + MAX_INLINE_DATA);
	set_page_dirty(ipage);
	f2fs_put_page(ipage, 1);
}

210
bool recover_inline_data(struct inode *inode, struct page *npage)
211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228
{
	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) &&
229
			ri && (ri->i_inline & F2FS_INLINE_DATA)) {
230 231 232 233
process_inline:
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(IS_ERR(ipage));

234 235
		f2fs_wait_on_page_writeback(ipage, NODE);

236 237 238 239 240
		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);
241
		return true;
242 243 244 245 246
	}

	if (f2fs_has_inline_data(inode)) {
		ipage = get_node_page(sbi, inode->i_ino);
		f2fs_bug_on(IS_ERR(ipage));
247
		f2fs_wait_on_page_writeback(ipage, NODE);
248 249 250 251 252
		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);
253
	} else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
254
		truncate_blocks(inode, 0, false);
255 256 257
		set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
		goto process_inline;
	}
258
	return false;
259
}