]>
git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - 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.
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 /* Release any data block if it is allocated */
170 if (!f2fs_has_inline_data(inode
)) {
171 int count
= ADDRS_PER_PAGE(dn
.node_page
, F2FS_I(inode
));
172 truncate_data_blocks_range(&dn
, count
);
173 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
174 stat_inc_inline_inode(inode
);
177 f2fs_wait_on_page_writeback(ipage
, NODE
);
178 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
179 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
180 src_addr
= kmap(page
);
181 dst_addr
= inline_data_addr(ipage
);
182 memcpy(dst_addr
, src_addr
, size
);
185 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
186 sync_inode_page(&dn
);
192 void truncate_inline_data(struct inode
*inode
, u64 from
)
196 if (from
>= MAX_INLINE_DATA
)
199 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
203 f2fs_wait_on_page_writeback(ipage
, NODE
);
205 zero_user_segment(ipage
, INLINE_DATA_OFFSET
+ from
,
206 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
207 set_page_dirty(ipage
);
208 f2fs_put_page(ipage
, 1);
211 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
213 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
214 struct f2fs_inode
*ri
= NULL
;
215 void *src_addr
, *dst_addr
;
219 * The inline_data recovery policy is as follows.
220 * [prev.] [next] of inline_data flag
221 * o o -> recover inline_data
222 * o x -> remove inline_data, and then recover data blocks
223 * x o -> remove inline_data, and then recover inline_data
224 * x x -> recover data blocks
227 ri
= F2FS_INODE(npage
);
229 if (f2fs_has_inline_data(inode
) &&
230 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
232 ipage
= get_node_page(sbi
, inode
->i_ino
);
233 f2fs_bug_on(sbi
, IS_ERR(ipage
));
235 f2fs_wait_on_page_writeback(ipage
, NODE
);
237 src_addr
= inline_data_addr(npage
);
238 dst_addr
= inline_data_addr(ipage
);
239 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
240 update_inode(inode
, ipage
);
241 f2fs_put_page(ipage
, 1);
245 if (f2fs_has_inline_data(inode
)) {
246 ipage
= get_node_page(sbi
, inode
->i_ino
);
247 f2fs_bug_on(sbi
, IS_ERR(ipage
));
248 f2fs_wait_on_page_writeback(ipage
, NODE
);
249 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
250 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
251 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
252 update_inode(inode
, ipage
);
253 f2fs_put_page(ipage
, 1);
254 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
255 truncate_blocks(inode
, 0, false);
256 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);