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 if (!test_opt(F2FS_I_SB(inode
), INLINE_DATA
))
21 if (f2fs_is_atomic_file(inode
))
24 if (!S_ISREG(inode
->i_mode
) && !S_ISLNK(inode
->i_mode
))
27 if (i_size_read(inode
) > MAX_INLINE_DATA
)
33 void read_inline_data(struct page
*page
, struct page
*ipage
)
35 void *src_addr
, *dst_addr
;
37 if (PageUptodate(page
))
40 f2fs_bug_on(F2FS_P_SB(page
), page
->index
);
42 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
44 /* Copy the whole inline data block */
45 src_addr
= inline_data_addr(ipage
);
46 dst_addr
= kmap_atomic(page
);
47 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
48 flush_dcache_page(page
);
49 kunmap_atomic(dst_addr
);
50 SetPageUptodate(page
);
53 bool truncate_inline_inode(struct page
*ipage
, u64 from
)
57 if (from
>= MAX_INLINE_DATA
)
60 addr
= inline_data_addr(ipage
);
62 f2fs_wait_on_page_writeback(ipage
, NODE
);
63 memset(addr
+ from
, 0, MAX_INLINE_DATA
- from
);
68 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
72 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
75 return PTR_ERR(ipage
);
78 if (!f2fs_has_inline_data(inode
)) {
79 f2fs_put_page(ipage
, 1);
84 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
86 read_inline_data(page
, ipage
);
88 SetPageUptodate(page
);
89 f2fs_put_page(ipage
, 1);
94 int f2fs_convert_inline_page(struct dnode_of_data
*dn
, struct page
*page
)
96 void *src_addr
, *dst_addr
;
97 struct f2fs_io_info fio
= {
99 .rw
= WRITE_SYNC
| REQ_PRIO
,
103 f2fs_bug_on(F2FS_I_SB(dn
->inode
), page
->index
);
105 if (!f2fs_exist_data(dn
->inode
))
108 err
= f2fs_reserve_block(dn
, 0);
112 f2fs_wait_on_page_writeback(page
, DATA
);
114 if (PageUptodate(page
))
117 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
119 /* Copy the whole inline data block */
120 src_addr
= inline_data_addr(dn
->inode_page
);
121 dst_addr
= kmap_atomic(page
);
122 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
123 flush_dcache_page(page
);
124 kunmap_atomic(dst_addr
);
125 SetPageUptodate(page
);
127 /* clear dirty state */
128 dirty
= clear_page_dirty_for_io(page
);
130 /* write data page to try to make data consistent */
131 set_page_writeback(page
);
132 fio
.blk_addr
= dn
->data_blkaddr
;
133 write_data_page(page
, dn
, &fio
);
134 set_data_blkaddr(dn
);
135 f2fs_update_extent_cache(dn
);
136 f2fs_wait_on_page_writeback(page
, DATA
);
138 inode_dec_dirty_pages(dn
->inode
);
140 /* this converted inline_data should be recovered. */
141 set_inode_flag(F2FS_I(dn
->inode
), FI_APPEND_WRITE
);
143 /* clear inline data and flag after data writeback */
144 truncate_inline_inode(dn
->inode_page
, 0);
146 stat_dec_inline_inode(dn
->inode
);
147 f2fs_clear_inline_inode(dn
->inode
);
153 int f2fs_convert_inline_inode(struct inode
*inode
)
155 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
156 struct dnode_of_data dn
;
157 struct page
*ipage
, *page
;
160 page
= grab_cache_page(inode
->i_mapping
, 0);
166 ipage
= get_node_page(sbi
, inode
->i_ino
);
168 err
= PTR_ERR(ipage
);
172 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
174 if (f2fs_has_inline_data(inode
))
175 err
= f2fs_convert_inline_page(&dn
, page
);
181 f2fs_put_page(page
, 1);
185 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
187 void *src_addr
, *dst_addr
;
188 struct dnode_of_data dn
;
191 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
192 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
196 if (!f2fs_has_inline_data(inode
)) {
201 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
203 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
);
204 src_addr
= kmap_atomic(page
);
205 dst_addr
= inline_data_addr(dn
.inode_page
);
206 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
207 kunmap_atomic(src_addr
);
209 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
210 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
212 sync_inode_page(&dn
);
217 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
219 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
220 struct f2fs_inode
*ri
= NULL
;
221 void *src_addr
, *dst_addr
;
225 * The inline_data recovery policy is as follows.
226 * [prev.] [next] of inline_data flag
227 * o o -> recover inline_data
228 * o x -> remove inline_data, and then recover data blocks
229 * x o -> remove inline_data, and then recover inline_data
230 * x x -> recover data blocks
233 ri
= F2FS_INODE(npage
);
235 if (f2fs_has_inline_data(inode
) &&
236 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
238 ipage
= get_node_page(sbi
, inode
->i_ino
);
239 f2fs_bug_on(sbi
, IS_ERR(ipage
));
241 f2fs_wait_on_page_writeback(ipage
, NODE
);
243 src_addr
= inline_data_addr(npage
);
244 dst_addr
= inline_data_addr(ipage
);
245 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
247 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
248 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
250 update_inode(inode
, ipage
);
251 f2fs_put_page(ipage
, 1);
255 if (f2fs_has_inline_data(inode
)) {
256 ipage
= get_node_page(sbi
, inode
->i_ino
);
257 f2fs_bug_on(sbi
, IS_ERR(ipage
));
258 truncate_inline_inode(ipage
, 0);
259 f2fs_clear_inline_inode(inode
);
260 update_inode(inode
, ipage
);
261 f2fs_put_page(ipage
, 1);
262 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
263 truncate_blocks(inode
, 0, false);
269 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
270 struct qstr
*name
, struct page
**res_page
)
272 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
273 struct f2fs_inline_dentry
*inline_dentry
;
274 struct f2fs_dir_entry
*de
;
275 struct f2fs_dentry_ptr d
;
278 ipage
= get_node_page(sbi
, dir
->i_ino
);
282 inline_dentry
= inline_data_addr(ipage
);
284 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
285 de
= find_target_dentry(name
, NULL
, &d
);
291 f2fs_put_page(ipage
, 0);
294 * For the most part, it should be a bug when name_len is zero.
295 * We stop here for figuring out where the bugs has occurred.
297 f2fs_bug_on(sbi
, d
.max
< 0);
301 struct f2fs_dir_entry
*f2fs_parent_inline_dir(struct inode
*dir
,
304 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
306 struct f2fs_dir_entry
*de
;
307 struct f2fs_inline_dentry
*dentry_blk
;
309 ipage
= get_node_page(sbi
, dir
->i_ino
);
313 dentry_blk
= inline_data_addr(ipage
);
314 de
= &dentry_blk
->dentry
[1];
320 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
323 struct f2fs_inline_dentry
*dentry_blk
;
324 struct f2fs_dentry_ptr d
;
326 dentry_blk
= inline_data_addr(ipage
);
328 make_dentry_ptr(&d
, (void *)dentry_blk
, 2);
329 do_make_empty_dir(inode
, parent
, &d
);
331 set_page_dirty(ipage
);
333 /* update i_size to MAX_INLINE_DATA */
334 if (i_size_read(inode
) < MAX_INLINE_DATA
) {
335 i_size_write(inode
, MAX_INLINE_DATA
);
336 set_inode_flag(F2FS_I(inode
), FI_UPDATE_DIR
);
341 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
342 struct f2fs_inline_dentry
*inline_dentry
)
345 struct dnode_of_data dn
;
346 struct f2fs_dentry_block
*dentry_blk
;
349 page
= grab_cache_page(dir
->i_mapping
, 0);
353 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
354 err
= f2fs_reserve_block(&dn
, 0);
358 f2fs_wait_on_page_writeback(page
, DATA
);
359 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
361 dentry_blk
= kmap_atomic(page
);
363 /* copy data from inline dentry block to new dentry block */
364 memcpy(dentry_blk
->dentry_bitmap
, inline_dentry
->dentry_bitmap
,
365 INLINE_DENTRY_BITMAP_SIZE
);
366 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
367 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
368 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
369 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
371 kunmap_atomic(dentry_blk
);
372 SetPageUptodate(page
);
373 set_page_dirty(page
);
375 /* clear inline dir and flag after data writeback */
376 truncate_inline_inode(ipage
, 0);
378 stat_dec_inline_dir(dir
);
379 clear_inode_flag(F2FS_I(dir
), FI_INLINE_DENTRY
);
381 if (i_size_read(dir
) < PAGE_CACHE_SIZE
) {
382 i_size_write(dir
, PAGE_CACHE_SIZE
);
383 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
386 sync_inode_page(&dn
);
388 f2fs_put_page(page
, 1);
392 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*name
,
393 struct inode
*inode
, nid_t ino
, umode_t mode
)
395 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
397 unsigned int bit_pos
;
398 f2fs_hash_t name_hash
;
399 size_t namelen
= name
->len
;
400 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
401 struct f2fs_dentry_ptr d
;
402 int slots
= GET_DENTRY_SLOTS(namelen
);
403 struct page
*page
= NULL
;
406 ipage
= get_node_page(sbi
, dir
->i_ino
);
408 return PTR_ERR(ipage
);
410 dentry_blk
= inline_data_addr(ipage
);
411 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
412 slots
, NR_INLINE_DENTRY
);
413 if (bit_pos
>= NR_INLINE_DENTRY
) {
414 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
421 down_write(&F2FS_I(inode
)->i_sem
);
422 page
= init_inode_metadata(inode
, dir
, name
, ipage
);
429 f2fs_wait_on_page_writeback(ipage
, NODE
);
431 name_hash
= f2fs_dentry_hash(name
);
432 make_dentry_ptr(&d
, (void *)dentry_blk
, 2);
433 f2fs_update_dentry(ino
, mode
, &d
, name
, name_hash
, bit_pos
);
435 set_page_dirty(ipage
);
437 /* we don't need to mark_inode_dirty now */
439 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
440 update_inode(inode
, page
);
441 f2fs_put_page(page
, 1);
444 update_parent_metadata(dir
, inode
, 0);
447 up_write(&F2FS_I(inode
)->i_sem
);
449 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
450 update_inode(dir
, ipage
);
451 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
454 f2fs_put_page(ipage
, 1);
458 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
459 struct inode
*dir
, struct inode
*inode
)
461 struct f2fs_inline_dentry
*inline_dentry
;
462 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
463 unsigned int bit_pos
;
467 f2fs_wait_on_page_writeback(page
, NODE
);
469 inline_dentry
= inline_data_addr(page
);
470 bit_pos
= dentry
- inline_dentry
->dentry
;
471 for (i
= 0; i
< slots
; i
++)
472 test_and_clear_bit_le(bit_pos
+ i
,
473 &inline_dentry
->dentry_bitmap
);
475 set_page_dirty(page
);
477 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
480 f2fs_drop_nlink(dir
, inode
, page
);
482 f2fs_put_page(page
, 1);
485 bool f2fs_empty_inline_dir(struct inode
*dir
)
487 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
489 unsigned int bit_pos
= 2;
490 struct f2fs_inline_dentry
*dentry_blk
;
492 ipage
= get_node_page(sbi
, dir
->i_ino
);
496 dentry_blk
= inline_data_addr(ipage
);
497 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
501 f2fs_put_page(ipage
, 1);
503 if (bit_pos
< NR_INLINE_DENTRY
)
509 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
)
511 struct inode
*inode
= file_inode(file
);
512 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
513 struct page
*ipage
= NULL
;
514 struct f2fs_dentry_ptr d
;
516 if (ctx
->pos
== NR_INLINE_DENTRY
)
519 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
521 return PTR_ERR(ipage
);
523 inline_dentry
= inline_data_addr(ipage
);
525 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
527 if (!f2fs_fill_dentries(ctx
, &d
, 0))
528 ctx
->pos
= NR_INLINE_DENTRY
;
530 f2fs_put_page(ipage
, 1);