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
)
21 if (!test_opt(F2FS_I_SB(inode
), INLINE_DATA
))
24 if (f2fs_is_atomic_file(inode
))
27 nr_blocks
= F2FS_I(inode
)->i_xattr_nid
? 3 : 2;
28 if (inode
->i_blocks
> nr_blocks
)
31 i_size
= i_size_read(inode
);
32 if (i_size
> MAX_INLINE_DATA
)
38 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
41 void *src_addr
, *dst_addr
;
44 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
48 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
51 return PTR_ERR(ipage
);
54 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
56 /* Copy the whole inline data block */
57 src_addr
= inline_data_addr(ipage
);
58 dst_addr
= kmap(page
);
59 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
61 f2fs_put_page(ipage
, 1);
64 SetPageUptodate(page
);
70 static int __f2fs_convert_inline_data(struct inode
*inode
, struct page
*page
)
74 struct dnode_of_data dn
;
75 void *src_addr
, *dst_addr
;
77 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
78 struct f2fs_io_info fio
= {
80 .rw
= WRITE_SYNC
| REQ_PRIO
,
84 ipage
= get_node_page(sbi
, inode
->i_ino
);
90 /* someone else converted inline_data already */
91 if (!f2fs_has_inline_data(inode
))
95 * i_addr[0] is not used for inline data,
96 * so reserving new block will not destroy inline data
98 set_new_dnode(&dn
, inode
, ipage
, NULL
, 0);
99 err
= f2fs_reserve_block(&dn
, 0);
103 f2fs_wait_on_page_writeback(page
, DATA
);
104 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
106 /* Copy the whole inline data block */
107 src_addr
= inline_data_addr(ipage
);
108 dst_addr
= kmap(page
);
109 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
111 SetPageUptodate(page
);
113 /* write data page to try to make data consistent */
114 set_page_writeback(page
);
115 write_data_page(page
, &dn
, &new_blk_addr
, &fio
);
116 update_extent_cache(new_blk_addr
, &dn
);
117 f2fs_wait_on_page_writeback(page
, DATA
);
119 /* clear inline data and flag after data writeback */
120 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
121 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
122 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
123 stat_dec_inline_inode(inode
);
125 sync_inode_page(&dn
);
132 int f2fs_convert_inline_data(struct inode
*inode
, pgoff_t to_size
,
135 struct page
*new_page
= page
;
138 if (!f2fs_has_inline_data(inode
))
140 else if (to_size
<= MAX_INLINE_DATA
)
143 if (!page
|| page
->index
!= 0) {
144 new_page
= grab_cache_page(inode
->i_mapping
, 0);
149 err
= __f2fs_convert_inline_data(inode
, new_page
);
150 if (!page
|| page
->index
!= 0)
151 f2fs_put_page(new_page
, 1);
155 int f2fs_write_inline_data(struct inode
*inode
,
156 struct page
*page
, unsigned size
)
158 void *src_addr
, *dst_addr
;
160 struct dnode_of_data dn
;
163 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
164 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
167 ipage
= dn
.inode_page
;
169 f2fs_wait_on_page_writeback(ipage
, NODE
);
170 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
171 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
172 src_addr
= kmap(page
);
173 dst_addr
= inline_data_addr(ipage
);
174 memcpy(dst_addr
, src_addr
, size
);
177 /* Release the first data block if it is allocated */
178 if (!f2fs_has_inline_data(inode
)) {
179 truncate_data_blocks_range(&dn
, 1);
180 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
181 stat_inc_inline_inode(inode
);
184 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
185 sync_inode_page(&dn
);
191 void truncate_inline_data(struct inode
*inode
, u64 from
)
195 if (from
>= MAX_INLINE_DATA
)
198 ipage
= get_node_page(F2FS_I_SB(inode
), 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_I_SB(inode
);
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(sbi
, 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(sbi
, 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
);
This page took 0.035638 seconds and 5 git commands to generate.