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.
12 #include <linux/f2fs_fs.h>
16 bool f2fs_may_inline(struct inode *inode)
18 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
22 if (!test_opt(sbi, INLINE_DATA))
25 nr_blocks = F2FS_I(inode)->i_xattr_nid ? 3 : 2;
26 if (inode->i_blocks > nr_blocks)
29 i_size = i_size_read(inode);
30 if (i_size > MAX_INLINE_DATA)
36 int f2fs_read_inline_data(struct inode *inode, struct page *page)
38 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
40 void *src_addr, *dst_addr;
43 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
47 ipage = get_node_page(sbi, inode->i_ino);
50 return PTR_ERR(ipage);
53 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
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);
60 f2fs_put_page(ipage, 1);
63 SetPageUptodate(page);
69 static int __f2fs_convert_inline_data(struct inode *inode, struct page *page)
73 struct dnode_of_data dn;
74 void *src_addr, *dst_addr;
76 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
77 struct f2fs_io_info fio = {
79 .rw = WRITE_SYNC | REQ_PRIO,
83 ipage = get_node_page(sbi, inode->i_ino);
90 * i_addr[0] is not used for inline data,
91 * so reserving new block will not destroy inline data
93 set_new_dnode(&dn, inode, ipage, NULL, 0);
94 err = f2fs_reserve_block(&dn, 0);
98 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
100 /* Copy the whole inline data block */
101 src_addr = inline_data_addr(ipage);
102 dst_addr = kmap(page);
103 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
105 SetPageUptodate(page);
107 /* write data page to try to make data consistent */
108 set_page_writeback(page);
109 write_data_page(page, &dn, &new_blk_addr, &fio);
110 update_extent_cache(new_blk_addr, &dn);
111 f2fs_wait_on_page_writeback(page, DATA);
113 /* clear inline data and flag after data writeback */
114 zero_user_segment(ipage, INLINE_DATA_OFFSET,
115 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
116 clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
117 stat_dec_inline_inode(inode);
119 sync_inode_page(&dn);
126 int f2fs_convert_inline_data(struct inode *inode, pgoff_t to_size)
131 if (!f2fs_has_inline_data(inode))
133 else if (to_size <= MAX_INLINE_DATA)
136 page = grab_cache_page_write_begin(inode->i_mapping, 0, AOP_FLAG_NOFS);
140 err = __f2fs_convert_inline_data(inode, page);
141 f2fs_put_page(page, 1);
145 int f2fs_write_inline_data(struct inode *inode,
146 struct page *page, unsigned size)
148 void *src_addr, *dst_addr;
150 struct dnode_of_data dn;
153 set_new_dnode(&dn, inode, NULL, NULL, 0);
154 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
157 ipage = dn.inode_page;
159 f2fs_wait_on_page_writeback(ipage, NODE);
160 zero_user_segment(ipage, INLINE_DATA_OFFSET,
161 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
162 src_addr = kmap(page);
163 dst_addr = inline_data_addr(ipage);
164 memcpy(dst_addr, src_addr, size);
167 /* Release the first data block if it is allocated */
168 if (!f2fs_has_inline_data(inode)) {
169 truncate_data_blocks_range(&dn, 1);
170 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
171 stat_inc_inline_inode(inode);
174 sync_inode_page(&dn);
180 void truncate_inline_data(struct inode *inode, u64 from)
182 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
185 if (from >= MAX_INLINE_DATA)
188 ipage = get_node_page(sbi, inode->i_ino);
192 f2fs_wait_on_page_writeback(ipage, NODE);
194 zero_user_segment(ipage, INLINE_DATA_OFFSET + from,
195 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
196 set_page_dirty(ipage);
197 f2fs_put_page(ipage, 1);
200 int recover_inline_data(struct inode *inode, struct page *npage)
202 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
203 struct f2fs_inode *ri = NULL;
204 void *src_addr, *dst_addr;
208 * The inline_data recovery policy is as follows.
209 * [prev.] [next] of inline_data flag
210 * o o -> recover inline_data
211 * o x -> remove inline_data, and then recover data blocks
212 * x o -> remove inline_data, and then recover inline_data
213 * x x -> recover data blocks
216 ri = F2FS_INODE(npage);
218 if (f2fs_has_inline_data(inode) &&
219 ri && ri->i_inline & F2FS_INLINE_DATA) {
221 ipage = get_node_page(sbi, inode->i_ino);
222 f2fs_bug_on(IS_ERR(ipage));
224 f2fs_wait_on_page_writeback(ipage, NODE);
226 src_addr = inline_data_addr(npage);
227 dst_addr = inline_data_addr(ipage);
228 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
229 update_inode(inode, ipage);
230 f2fs_put_page(ipage, 1);
234 if (f2fs_has_inline_data(inode)) {
235 ipage = get_node_page(sbi, inode->i_ino);
236 f2fs_bug_on(IS_ERR(ipage));
237 f2fs_wait_on_page_writeback(ipage, NODE);
238 zero_user_segment(ipage, INLINE_DATA_OFFSET,
239 INLINE_DATA_OFFSET + MAX_INLINE_DATA);
240 clear_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
241 update_inode(inode, ipage);
242 f2fs_put_page(ipage, 1);
243 } else if (ri && ri->i_inline & F2FS_INLINE_DATA) {
244 truncate_blocks(inode, 0);
245 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);