3e8ecdf3742b18d72eba2e9c780f2c6e8d215c5e
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
);
89 /* someone else converted inline_data already */
90 if (!f2fs_has_inline_data(inode
))
94 * i_addr[0] is not used for inline data,
95 * 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);
102 f2fs_wait_on_page_writeback(page
, DATA
);
103 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
105 /* Copy the whole inline data block */
106 src_addr
= inline_data_addr(ipage
);
107 dst_addr
= kmap(page
);
108 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
110 SetPageUptodate(page
);
112 /* write data page to try to make data consistent */
113 set_page_writeback(page
);
114 write_data_page(page
, &dn
, &new_blk_addr
, &fio
);
115 update_extent_cache(new_blk_addr
, &dn
);
116 f2fs_wait_on_page_writeback(page
, DATA
);
118 /* clear inline data and flag after data writeback */
119 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
120 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
121 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
122 stat_dec_inline_inode(inode
);
124 sync_inode_page(&dn
);
131 int f2fs_convert_inline_data(struct inode
*inode
, pgoff_t to_size
,
134 struct page
*new_page
= page
;
137 if (!f2fs_has_inline_data(inode
))
139 else if (to_size
<= MAX_INLINE_DATA
)
142 if (!page
|| page
->index
!= 0) {
143 new_page
= grab_cache_page(inode
->i_mapping
, 0);
148 err
= __f2fs_convert_inline_data(inode
, new_page
);
149 if (!page
|| page
->index
!= 0)
150 f2fs_put_page(new_page
, 1);
154 int f2fs_write_inline_data(struct inode
*inode
,
155 struct page
*page
, unsigned size
)
157 void *src_addr
, *dst_addr
;
159 struct dnode_of_data dn
;
162 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
163 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
166 ipage
= dn
.inode_page
;
168 f2fs_wait_on_page_writeback(ipage
, NODE
);
169 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
170 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
171 src_addr
= kmap(page
);
172 dst_addr
= inline_data_addr(ipage
);
173 memcpy(dst_addr
, src_addr
, size
);
176 /* Release the first data block if it is allocated */
177 if (!f2fs_has_inline_data(inode
)) {
178 truncate_data_blocks_range(&dn
, 1);
179 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
180 stat_inc_inline_inode(inode
);
183 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
184 sync_inode_page(&dn
);
190 void truncate_inline_data(struct inode
*inode
, u64 from
)
192 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
195 if (from
>= MAX_INLINE_DATA
)
198 ipage
= get_node_page(sbi
, inode
->i_ino
);
202 f2fs_wait_on_page_writeback(ipage
, NODE
);
204 zero_user_segment(ipage
, INLINE_DATA_OFFSET
+ from
,
205 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
206 set_page_dirty(ipage
);
207 f2fs_put_page(ipage
, 1);
210 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
212 struct f2fs_sb_info
*sbi
= F2FS_SB(inode
->i_sb
);
213 struct f2fs_inode
*ri
= NULL
;
214 void *src_addr
, *dst_addr
;
218 * The inline_data recovery policy is as follows.
219 * [prev.] [next] of inline_data flag
220 * o o -> recover inline_data
221 * o x -> remove inline_data, and then recover data blocks
222 * x o -> remove inline_data, and then recover inline_data
223 * x x -> recover data blocks
226 ri
= F2FS_INODE(npage
);
228 if (f2fs_has_inline_data(inode
) &&
229 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
231 ipage
= get_node_page(sbi
, inode
->i_ino
);
232 f2fs_bug_on(IS_ERR(ipage
));
234 f2fs_wait_on_page_writeback(ipage
, NODE
);
236 src_addr
= inline_data_addr(npage
);
237 dst_addr
= inline_data_addr(ipage
);
238 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
239 update_inode(inode
, ipage
);
240 f2fs_put_page(ipage
, 1);
244 if (f2fs_has_inline_data(inode
)) {
245 ipage
= get_node_page(sbi
, inode
->i_ino
);
246 f2fs_bug_on(IS_ERR(ipage
));
247 f2fs_wait_on_page_writeback(ipage
, NODE
);
248 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
249 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
250 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
251 update_inode(inode
, ipage
);
252 f2fs_put_page(ipage
, 1);
253 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
254 truncate_blocks(inode
, 0, false);
255 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);