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>
17 bool f2fs_may_inline_data(struct inode
*inode
)
19 if (f2fs_is_atomic_file(inode
))
22 if (!S_ISREG(inode
->i_mode
) && !S_ISLNK(inode
->i_mode
))
25 if (i_size_read(inode
) > MAX_INLINE_DATA
)
28 if (f2fs_encrypted_inode(inode
) && S_ISREG(inode
->i_mode
))
34 bool f2fs_may_inline_dentry(struct inode
*inode
)
36 if (!test_opt(F2FS_I_SB(inode
), INLINE_DENTRY
))
39 if (!S_ISDIR(inode
->i_mode
))
45 void read_inline_data(struct page
*page
, struct page
*ipage
)
47 void *src_addr
, *dst_addr
;
49 if (PageUptodate(page
))
52 f2fs_bug_on(F2FS_P_SB(page
), page
->index
);
54 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_SIZE
);
56 /* Copy the whole inline data block */
57 src_addr
= inline_data_addr(ipage
);
58 dst_addr
= kmap_atomic(page
);
59 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
60 flush_dcache_page(page
);
61 kunmap_atomic(dst_addr
);
62 if (!PageUptodate(page
))
63 SetPageUptodate(page
);
66 bool truncate_inline_inode(struct page
*ipage
, u64 from
)
70 if (from
>= MAX_INLINE_DATA
)
73 addr
= inline_data_addr(ipage
);
75 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
76 memset(addr
+ from
, 0, MAX_INLINE_DATA
- from
);
77 set_page_dirty(ipage
);
81 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
85 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
88 return PTR_ERR(ipage
);
91 if (!f2fs_has_inline_data(inode
)) {
92 f2fs_put_page(ipage
, 1);
97 zero_user_segment(page
, 0, PAGE_SIZE
);
99 read_inline_data(page
, ipage
);
101 if (!PageUptodate(page
))
102 SetPageUptodate(page
);
103 f2fs_put_page(ipage
, 1);
108 int f2fs_convert_inline_page(struct dnode_of_data
*dn
, struct page
*page
)
110 struct f2fs_io_info fio
= {
111 .sbi
= F2FS_I_SB(dn
->inode
),
114 .op_flags
= WRITE_SYNC
| REQ_PRIO
,
116 .encrypted_page
= NULL
,
120 if (!f2fs_exist_data(dn
->inode
))
123 err
= f2fs_reserve_block(dn
, 0);
127 if (unlikely(dn
->data_blkaddr
!= NEW_ADDR
)) {
129 set_sbi_flag(fio
.sbi
, SBI_NEED_FSCK
);
130 f2fs_msg(fio
.sbi
->sb
, KERN_WARNING
,
131 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
133 __func__
, dn
->inode
->i_ino
, dn
->data_blkaddr
);
137 f2fs_bug_on(F2FS_P_SB(page
), PageWriteback(page
));
139 read_inline_data(page
, dn
->inode_page
);
140 set_page_dirty(page
);
142 /* clear dirty state */
143 dirty
= clear_page_dirty_for_io(page
);
145 /* write data page to try to make data consistent */
146 set_page_writeback(page
);
147 fio
.old_blkaddr
= dn
->data_blkaddr
;
148 write_data_page(dn
, &fio
);
149 f2fs_wait_on_page_writeback(page
, DATA
, true);
151 inode_dec_dirty_pages(dn
->inode
);
153 /* this converted inline_data should be recovered. */
154 set_inode_flag(dn
->inode
, FI_APPEND_WRITE
);
156 /* clear inline data and flag after data writeback */
157 truncate_inline_inode(dn
->inode_page
, 0);
158 clear_inline_node(dn
->inode_page
);
160 stat_dec_inline_inode(dn
->inode
);
161 f2fs_clear_inline_inode(dn
->inode
);
166 int f2fs_convert_inline_inode(struct inode
*inode
)
168 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
169 struct dnode_of_data dn
;
170 struct page
*ipage
, *page
;
173 if (!f2fs_has_inline_data(inode
))
176 page
= f2fs_grab_cache_page(inode
->i_mapping
, 0, false);
182 ipage
= get_node_page(sbi
, inode
->i_ino
);
184 err
= PTR_ERR(ipage
);
188 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
190 if (f2fs_has_inline_data(inode
))
191 err
= f2fs_convert_inline_page(&dn
, page
);
197 f2fs_put_page(page
, 1);
199 f2fs_balance_fs(sbi
, dn
.node_changed
);
204 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
206 void *src_addr
, *dst_addr
;
207 struct dnode_of_data dn
;
210 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
211 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
215 if (!f2fs_has_inline_data(inode
)) {
220 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
222 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
, true);
223 src_addr
= kmap_atomic(page
);
224 dst_addr
= inline_data_addr(dn
.inode_page
);
225 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
226 kunmap_atomic(src_addr
);
227 set_page_dirty(dn
.inode_page
);
229 set_inode_flag(inode
, FI_APPEND_WRITE
);
230 set_inode_flag(inode
, FI_DATA_EXIST
);
232 clear_inline_node(dn
.inode_page
);
237 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
239 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
240 struct f2fs_inode
*ri
= NULL
;
241 void *src_addr
, *dst_addr
;
245 * The inline_data recovery policy is as follows.
246 * [prev.] [next] of inline_data flag
247 * o o -> recover inline_data
248 * o x -> remove inline_data, and then recover data blocks
249 * x o -> remove inline_data, and then recover inline_data
250 * x x -> recover data blocks
253 ri
= F2FS_INODE(npage
);
255 if (f2fs_has_inline_data(inode
) &&
256 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
258 ipage
= get_node_page(sbi
, inode
->i_ino
);
259 f2fs_bug_on(sbi
, IS_ERR(ipage
));
261 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
263 src_addr
= inline_data_addr(npage
);
264 dst_addr
= inline_data_addr(ipage
);
265 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
267 set_inode_flag(inode
, FI_INLINE_DATA
);
268 set_inode_flag(inode
, FI_DATA_EXIST
);
270 set_page_dirty(ipage
);
271 f2fs_put_page(ipage
, 1);
275 if (f2fs_has_inline_data(inode
)) {
276 ipage
= get_node_page(sbi
, inode
->i_ino
);
277 f2fs_bug_on(sbi
, IS_ERR(ipage
));
278 if (!truncate_inline_inode(ipage
, 0))
280 f2fs_clear_inline_inode(inode
);
281 f2fs_put_page(ipage
, 1);
282 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
283 if (truncate_blocks(inode
, 0, false))
290 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
291 struct fscrypt_name
*fname
, struct page
**res_page
)
293 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
294 struct f2fs_inline_dentry
*inline_dentry
;
295 struct qstr name
= FSTR_TO_QSTR(&fname
->disk_name
);
296 struct f2fs_dir_entry
*de
;
297 struct f2fs_dentry_ptr d
;
299 f2fs_hash_t namehash
;
301 ipage
= get_node_page(sbi
, dir
->i_ino
);
307 namehash
= f2fs_dentry_hash(&name
, fname
);
309 inline_dentry
= inline_data_addr(ipage
);
311 make_dentry_ptr(NULL
, &d
, (void *)inline_dentry
, 2);
312 de
= find_target_dentry(fname
, namehash
, NULL
, &d
);
317 f2fs_put_page(ipage
, 0);
322 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
325 struct f2fs_inline_dentry
*dentry_blk
;
326 struct f2fs_dentry_ptr d
;
328 dentry_blk
= inline_data_addr(ipage
);
330 make_dentry_ptr(NULL
, &d
, (void *)dentry_blk
, 2);
331 do_make_empty_dir(inode
, parent
, &d
);
333 set_page_dirty(ipage
);
335 /* update i_size to MAX_INLINE_DATA */
336 if (i_size_read(inode
) < MAX_INLINE_DATA
)
337 f2fs_i_size_write(inode
, MAX_INLINE_DATA
);
342 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
343 * release ipage in this function.
345 static int f2fs_move_inline_dirents(struct inode
*dir
, struct page
*ipage
,
346 struct f2fs_inline_dentry
*inline_dentry
)
349 struct dnode_of_data dn
;
350 struct f2fs_dentry_block
*dentry_blk
;
353 page
= f2fs_grab_cache_page(dir
->i_mapping
, 0, false);
355 f2fs_put_page(ipage
, 1);
359 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
360 err
= f2fs_reserve_block(&dn
, 0);
364 if (unlikely(dn
.data_blkaddr
!= NEW_ADDR
)) {
366 set_sbi_flag(F2FS_P_SB(page
), SBI_NEED_FSCK
);
367 f2fs_msg(F2FS_P_SB(page
)->sb
, KERN_WARNING
,
368 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
370 __func__
, dir
->i_ino
, dn
.data_blkaddr
);
375 f2fs_wait_on_page_writeback(page
, DATA
, true);
376 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_SIZE
);
378 dentry_blk
= kmap_atomic(page
);
380 /* copy data from inline dentry block to new dentry block */
381 memcpy(dentry_blk
->dentry_bitmap
, inline_dentry
->dentry_bitmap
,
382 INLINE_DENTRY_BITMAP_SIZE
);
383 memset(dentry_blk
->dentry_bitmap
+ INLINE_DENTRY_BITMAP_SIZE
, 0,
384 SIZE_OF_DENTRY_BITMAP
- INLINE_DENTRY_BITMAP_SIZE
);
386 * we do not need to zero out remainder part of dentry and filename
387 * field, since we have used bitmap for marking the usage status of
388 * them, besides, we can also ignore copying/zeroing reserved space
389 * of dentry block, because them haven't been used so far.
391 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
392 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
393 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
394 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
396 kunmap_atomic(dentry_blk
);
397 if (!PageUptodate(page
))
398 SetPageUptodate(page
);
399 set_page_dirty(page
);
401 /* clear inline dir and flag after data writeback */
402 truncate_inline_inode(ipage
, 0);
404 stat_dec_inline_dir(dir
);
405 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
407 f2fs_i_depth_write(dir
, 1);
408 if (i_size_read(dir
) < PAGE_SIZE
)
409 f2fs_i_size_write(dir
, PAGE_SIZE
);
411 f2fs_put_page(page
, 1);
415 static int f2fs_add_inline_entries(struct inode
*dir
,
416 struct f2fs_inline_dentry
*inline_dentry
)
418 struct f2fs_dentry_ptr d
;
419 unsigned long bit_pos
= 0;
422 make_dentry_ptr(NULL
, &d
, (void *)inline_dentry
, 2);
424 while (bit_pos
< d
.max
) {
425 struct f2fs_dir_entry
*de
;
426 struct qstr new_name
;
430 if (!test_bit_le(bit_pos
, d
.bitmap
)) {
435 de
= &d
.dentry
[bit_pos
];
437 if (unlikely(!de
->name_len
)) {
442 new_name
.name
= d
.filename
[bit_pos
];
443 new_name
.len
= de
->name_len
;
445 ino
= le32_to_cpu(de
->ino
);
446 fake_mode
= get_de_type(de
) << S_SHIFT
;
448 err
= f2fs_add_regular_entry(dir
, &new_name
, NULL
, NULL
,
451 goto punch_dentry_pages
;
453 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
457 truncate_inode_pages(&dir
->i_data
, 0);
458 truncate_blocks(dir
, 0, false);
459 remove_dirty_inode(dir
);
463 static int f2fs_move_rehashed_dirents(struct inode
*dir
, struct page
*ipage
,
464 struct f2fs_inline_dentry
*inline_dentry
)
466 struct f2fs_inline_dentry
*backup_dentry
;
469 backup_dentry
= f2fs_kmalloc(F2FS_I_SB(dir
),
470 sizeof(struct f2fs_inline_dentry
), GFP_F2FS_ZERO
);
471 if (!backup_dentry
) {
472 f2fs_put_page(ipage
, 1);
476 memcpy(backup_dentry
, inline_dentry
, MAX_INLINE_DATA
);
477 truncate_inline_inode(ipage
, 0);
481 err
= f2fs_add_inline_entries(dir
, backup_dentry
);
487 stat_dec_inline_dir(dir
);
488 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
489 kfree(backup_dentry
);
493 memcpy(inline_dentry
, backup_dentry
, MAX_INLINE_DATA
);
494 f2fs_i_depth_write(dir
, 0);
495 f2fs_i_size_write(dir
, MAX_INLINE_DATA
);
496 set_page_dirty(ipage
);
497 f2fs_put_page(ipage
, 1);
499 kfree(backup_dentry
);
503 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
504 struct f2fs_inline_dentry
*inline_dentry
)
506 if (!F2FS_I(dir
)->i_dir_level
)
507 return f2fs_move_inline_dirents(dir
, ipage
, inline_dentry
);
509 return f2fs_move_rehashed_dirents(dir
, ipage
, inline_dentry
);
512 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*new_name
,
513 const struct qstr
*orig_name
,
514 struct inode
*inode
, nid_t ino
, umode_t mode
)
516 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
518 unsigned int bit_pos
;
519 f2fs_hash_t name_hash
;
520 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
521 struct f2fs_dentry_ptr d
;
522 int slots
= GET_DENTRY_SLOTS(new_name
->len
);
523 struct page
*page
= NULL
;
526 ipage
= get_node_page(sbi
, dir
->i_ino
);
528 return PTR_ERR(ipage
);
530 dentry_blk
= inline_data_addr(ipage
);
531 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
532 slots
, NR_INLINE_DENTRY
);
533 if (bit_pos
>= NR_INLINE_DENTRY
) {
534 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
542 down_write(&F2FS_I(inode
)->i_sem
);
543 page
= init_inode_metadata(inode
, dir
, new_name
,
549 if (f2fs_encrypted_inode(dir
))
550 file_set_enc_name(inode
);
553 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
555 name_hash
= f2fs_dentry_hash(new_name
, NULL
);
556 make_dentry_ptr(NULL
, &d
, (void *)dentry_blk
, 2);
557 f2fs_update_dentry(ino
, mode
, &d
, new_name
, name_hash
, bit_pos
);
559 set_page_dirty(ipage
);
561 /* we don't need to mark_inode_dirty now */
563 f2fs_i_pino_write(inode
, dir
->i_ino
);
564 f2fs_put_page(page
, 1);
567 update_parent_metadata(dir
, inode
, 0);
570 up_write(&F2FS_I(inode
)->i_sem
);
572 f2fs_put_page(ipage
, 1);
576 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
577 struct inode
*dir
, struct inode
*inode
)
579 struct f2fs_inline_dentry
*inline_dentry
;
580 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
581 unsigned int bit_pos
;
585 f2fs_wait_on_page_writeback(page
, NODE
, true);
587 inline_dentry
= inline_data_addr(page
);
588 bit_pos
= dentry
- inline_dentry
->dentry
;
589 for (i
= 0; i
< slots
; i
++)
590 __clear_bit_le(bit_pos
+ i
,
591 &inline_dentry
->dentry_bitmap
);
593 set_page_dirty(page
);
594 f2fs_put_page(page
, 1);
596 dir
->i_ctime
= dir
->i_mtime
= current_time(dir
);
597 f2fs_mark_inode_dirty_sync(dir
);
600 f2fs_drop_nlink(dir
, inode
);
603 bool f2fs_empty_inline_dir(struct inode
*dir
)
605 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
607 unsigned int bit_pos
= 2;
608 struct f2fs_inline_dentry
*dentry_blk
;
610 ipage
= get_node_page(sbi
, dir
->i_ino
);
614 dentry_blk
= inline_data_addr(ipage
);
615 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
619 f2fs_put_page(ipage
, 1);
621 if (bit_pos
< NR_INLINE_DENTRY
)
627 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
,
628 struct fscrypt_str
*fstr
)
630 struct inode
*inode
= file_inode(file
);
631 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
632 struct page
*ipage
= NULL
;
633 struct f2fs_dentry_ptr d
;
635 if (ctx
->pos
== NR_INLINE_DENTRY
)
638 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
640 return PTR_ERR(ipage
);
642 inline_dentry
= inline_data_addr(ipage
);
644 make_dentry_ptr(inode
, &d
, (void *)inline_dentry
, 2);
646 if (!f2fs_fill_dentries(ctx
, &d
, 0, fstr
))
647 ctx
->pos
= NR_INLINE_DENTRY
;
649 f2fs_put_page(ipage
, 1);
653 int f2fs_inline_data_fiemap(struct inode
*inode
,
654 struct fiemap_extent_info
*fieinfo
, __u64 start
, __u64 len
)
656 __u64 byteaddr
, ilen
;
657 __u32 flags
= FIEMAP_EXTENT_DATA_INLINE
| FIEMAP_EXTENT_NOT_ALIGNED
|
663 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
665 return PTR_ERR(ipage
);
667 if (!f2fs_has_inline_data(inode
)) {
672 ilen
= min_t(size_t, MAX_INLINE_DATA
, i_size_read(inode
));
675 if (start
+ len
< ilen
)
679 get_node_info(F2FS_I_SB(inode
), inode
->i_ino
, &ni
);
680 byteaddr
= (__u64
)ni
.blk_addr
<< inode
->i_sb
->s_blocksize_bits
;
681 byteaddr
+= (char *)inline_data_addr(ipage
) - (char *)F2FS_INODE(ipage
);
682 err
= fiemap_fill_next_extent(fieinfo
, start
, byteaddr
, ilen
, flags
);
684 f2fs_put_page(ipage
, 1);