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(inode))
28 if (f2fs_post_read_required(inode))
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 f2fs_do_read_inline_data(struct page *page, struct page *ipage)
47 struct inode *inode = page->mapping->host;
48 void *src_addr, *dst_addr;
50 if (PageUptodate(page))
53 f2fs_bug_on(F2FS_P_SB(page), page->index);
55 zero_user_segment(page, MAX_INLINE_DATA(inode), PAGE_SIZE);
57 /* Copy the whole inline data block */
58 src_addr = inline_data_addr(inode, ipage);
59 dst_addr = kmap_atomic(page);
60 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
61 flush_dcache_page(page);
62 kunmap_atomic(dst_addr);
63 if (!PageUptodate(page))
64 SetPageUptodate(page);
67 void f2fs_truncate_inline_inode(struct inode *inode,
68 struct page *ipage, u64 from)
72 if (from >= MAX_INLINE_DATA(inode))
75 addr = inline_data_addr(inode, ipage);
77 f2fs_wait_on_page_writeback(ipage, NODE, true);
78 memset(addr + from, 0, MAX_INLINE_DATA(inode) - from);
79 set_page_dirty(ipage);
82 clear_inode_flag(inode, FI_DATA_EXIST);
85 int f2fs_read_inline_data(struct inode *inode, struct page *page)
89 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
92 return PTR_ERR(ipage);
95 if (!f2fs_has_inline_data(inode)) {
96 f2fs_put_page(ipage, 1);
101 zero_user_segment(page, 0, PAGE_SIZE);
103 f2fs_do_read_inline_data(page, ipage);
105 if (!PageUptodate(page))
106 SetPageUptodate(page);
107 f2fs_put_page(ipage, 1);
112 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
114 struct f2fs_io_info fio = {
115 .sbi = F2FS_I_SB(dn->inode),
116 .ino = dn->inode->i_ino,
119 .op_flags = REQ_SYNC | REQ_PRIO,
121 .encrypted_page = NULL,
122 .io_type = FS_DATA_IO,
127 if (!f2fs_exist_data(dn->inode))
130 err = f2fs_reserve_block(dn, 0);
134 err = f2fs_get_node_info(fio.sbi, dn->nid, &ni);
136 f2fs_truncate_data_blocks_range(dn, 1);
141 fio.version = ni.version;
143 if (unlikely(dn->data_blkaddr != NEW_ADDR)) {
145 set_sbi_flag(fio.sbi, SBI_NEED_FSCK);
146 f2fs_msg(fio.sbi->sb, KERN_WARNING,
147 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
149 __func__, dn->inode->i_ino, dn->data_blkaddr);
150 return -EFSCORRUPTED;
153 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
155 f2fs_do_read_inline_data(page, dn->inode_page);
156 set_page_dirty(page);
158 /* clear dirty state */
159 dirty = clear_page_dirty_for_io(page);
161 /* write data page to try to make data consistent */
162 set_page_writeback(page);
163 ClearPageError(page);
164 fio.old_blkaddr = dn->data_blkaddr;
165 set_inode_flag(dn->inode, FI_HOT_DATA);
166 f2fs_outplace_write_data(dn, &fio);
167 f2fs_wait_on_page_writeback(page, DATA, true);
169 inode_dec_dirty_pages(dn->inode);
170 f2fs_remove_dirty_inode(dn->inode);
173 /* this converted inline_data should be recovered. */
174 set_inode_flag(dn->inode, FI_APPEND_WRITE);
176 /* clear inline data and flag after data writeback */
177 f2fs_truncate_inline_inode(dn->inode, dn->inode_page, 0);
178 clear_inline_node(dn->inode_page);
180 stat_dec_inline_inode(dn->inode);
181 clear_inode_flag(dn->inode, FI_INLINE_DATA);
186 int f2fs_convert_inline_inode(struct inode *inode)
188 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
189 struct dnode_of_data dn;
190 struct page *ipage, *page;
193 if (!f2fs_has_inline_data(inode))
196 err = dquot_initialize(inode);
200 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
206 ipage = f2fs_get_node_page(sbi, inode->i_ino);
208 err = PTR_ERR(ipage);
212 set_new_dnode(&dn, inode, ipage, ipage, 0);
214 if (f2fs_has_inline_data(inode))
215 err = f2fs_convert_inline_page(&dn, page);
221 f2fs_put_page(page, 1);
224 f2fs_balance_fs(sbi, dn.node_changed);
229 int f2fs_write_inline_data(struct inode *inode, struct page *page)
231 void *src_addr, *dst_addr;
232 struct dnode_of_data dn;
235 set_new_dnode(&dn, inode, NULL, NULL, 0);
236 err = f2fs_get_dnode_of_data(&dn, 0, LOOKUP_NODE);
240 if (!f2fs_has_inline_data(inode)) {
245 f2fs_bug_on(F2FS_I_SB(inode), page->index);
247 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
248 src_addr = kmap_atomic(page);
249 dst_addr = inline_data_addr(inode, dn.inode_page);
250 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
251 kunmap_atomic(src_addr);
252 set_page_dirty(dn.inode_page);
254 f2fs_clear_radix_tree_dirty_tag(page);
256 set_inode_flag(inode, FI_APPEND_WRITE);
257 set_inode_flag(inode, FI_DATA_EXIST);
259 clear_inline_node(dn.inode_page);
264 int f2fs_recover_inline_data(struct inode *inode, struct page *npage)
266 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
267 struct f2fs_inode *ri = NULL;
268 void *src_addr, *dst_addr;
272 * The inline_data recovery policy is as follows.
273 * [prev.] [next] of inline_data flag
274 * o o -> recover inline_data
275 * o x -> remove inline_data, and then recover data blocks
276 * x o -> remove inline_data, and then recover inline_data
277 * x x -> recover data blocks
280 ri = F2FS_INODE(npage);
282 if (f2fs_has_inline_data(inode) &&
283 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
285 ipage = f2fs_get_node_page(sbi, inode->i_ino);
287 return PTR_ERR(ipage);
289 f2fs_wait_on_page_writeback(ipage, NODE, true);
291 src_addr = inline_data_addr(inode, npage);
292 dst_addr = inline_data_addr(inode, ipage);
293 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
295 set_inode_flag(inode, FI_INLINE_DATA);
296 set_inode_flag(inode, FI_DATA_EXIST);
298 set_page_dirty(ipage);
299 f2fs_put_page(ipage, 1);
303 if (f2fs_has_inline_data(inode)) {
304 ipage = f2fs_get_node_page(sbi, inode->i_ino);
306 return PTR_ERR(ipage);
307 f2fs_truncate_inline_inode(inode, ipage, 0);
308 clear_inode_flag(inode, FI_INLINE_DATA);
309 f2fs_put_page(ipage, 1);
310 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
313 ret = f2fs_truncate_blocks(inode, 0, false);
321 struct f2fs_dir_entry *f2fs_find_in_inline_dir(struct inode *dir,
322 struct fscrypt_name *fname, struct page **res_page)
324 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
325 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
326 struct f2fs_dir_entry *de;
327 struct f2fs_dentry_ptr d;
330 f2fs_hash_t namehash;
332 ipage = f2fs_get_node_page(sbi, dir->i_ino);
338 namehash = f2fs_dentry_hash(&name, fname);
340 inline_dentry = inline_data_addr(dir, ipage);
342 make_dentry_ptr_inline(dir, &d, inline_dentry);
343 de = f2fs_find_target_dentry(fname, namehash, NULL, &d);
348 f2fs_put_page(ipage, 0);
353 int f2fs_make_empty_inline_dir(struct inode *inode, struct inode *parent,
356 struct f2fs_dentry_ptr d;
359 inline_dentry = inline_data_addr(inode, ipage);
361 make_dentry_ptr_inline(inode, &d, inline_dentry);
362 f2fs_do_make_empty_dir(inode, parent, &d);
364 set_page_dirty(ipage);
366 /* update i_size to MAX_INLINE_DATA */
367 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
368 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
373 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
374 * release ipage in this function.
376 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
380 struct dnode_of_data dn;
381 struct f2fs_dentry_block *dentry_blk;
382 struct f2fs_dentry_ptr src, dst;
385 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
387 f2fs_put_page(ipage, 1);
391 set_new_dnode(&dn, dir, ipage, NULL, 0);
392 err = f2fs_reserve_block(&dn, 0);
396 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
398 set_sbi_flag(F2FS_P_SB(page), SBI_NEED_FSCK);
399 f2fs_msg(F2FS_P_SB(page)->sb, KERN_WARNING,
400 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
402 __func__, dir->i_ino, dn.data_blkaddr);
407 f2fs_wait_on_page_writeback(page, DATA, true);
409 dentry_blk = page_address(page);
411 make_dentry_ptr_inline(dir, &src, inline_dentry);
412 make_dentry_ptr_block(dir, &dst, dentry_blk);
414 /* copy data from inline dentry block to new dentry block */
415 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
416 memset(dst.bitmap + src.nr_bitmap, 0, dst.nr_bitmap - src.nr_bitmap);
418 * we do not need to zero out remainder part of dentry and filename
419 * field, since we have used bitmap for marking the usage status of
420 * them, besides, we can also ignore copying/zeroing reserved space
421 * of dentry block, because them haven't been used so far.
423 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
424 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
426 if (!PageUptodate(page))
427 SetPageUptodate(page);
428 set_page_dirty(page);
430 /* clear inline dir and flag after data writeback */
431 f2fs_truncate_inline_inode(dir, ipage, 0);
433 stat_dec_inline_dir(dir);
434 clear_inode_flag(dir, FI_INLINE_DENTRY);
436 f2fs_i_depth_write(dir, 1);
437 if (i_size_read(dir) < PAGE_SIZE)
438 f2fs_i_size_write(dir, PAGE_SIZE);
440 f2fs_put_page(page, 1);
444 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
446 struct f2fs_dentry_ptr d;
447 unsigned long bit_pos = 0;
450 make_dentry_ptr_inline(dir, &d, inline_dentry);
452 while (bit_pos < d.max) {
453 struct f2fs_dir_entry *de;
454 struct qstr new_name;
458 if (!test_bit_le(bit_pos, d.bitmap)) {
463 de = &d.dentry[bit_pos];
465 if (unlikely(!de->name_len)) {
470 new_name.name = d.filename[bit_pos];
471 new_name.len = le16_to_cpu(de->name_len);
473 ino = le32_to_cpu(de->ino);
474 fake_mode = f2fs_get_de_type(de) << S_SHIFT;
476 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
479 goto punch_dentry_pages;
481 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
485 truncate_inode_pages(&dir->i_data, 0);
486 f2fs_truncate_blocks(dir, 0, false);
487 f2fs_remove_dirty_inode(dir);
491 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
497 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
498 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
499 if (!backup_dentry) {
500 f2fs_put_page(ipage, 1);
504 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
505 f2fs_truncate_inline_inode(dir, ipage, 0);
509 err = f2fs_add_inline_entries(dir, backup_dentry);
515 stat_dec_inline_dir(dir);
516 clear_inode_flag(dir, FI_INLINE_DENTRY);
517 kfree(backup_dentry);
521 f2fs_wait_on_page_writeback(ipage, NODE, true);
522 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
523 f2fs_i_depth_write(dir, 0);
524 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
525 set_page_dirty(ipage);
526 f2fs_put_page(ipage, 1);
528 kfree(backup_dentry);
532 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
535 if (!F2FS_I(dir)->i_dir_level)
536 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
538 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
541 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
542 const struct qstr *orig_name,
543 struct inode *inode, nid_t ino, umode_t mode)
545 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
547 unsigned int bit_pos;
548 f2fs_hash_t name_hash;
549 void *inline_dentry = NULL;
550 struct f2fs_dentry_ptr d;
551 int slots = GET_DENTRY_SLOTS(new_name->len);
552 struct page *page = NULL;
555 ipage = f2fs_get_node_page(sbi, dir->i_ino);
557 return PTR_ERR(ipage);
559 inline_dentry = inline_data_addr(dir, ipage);
560 make_dentry_ptr_inline(dir, &d, inline_dentry);
562 bit_pos = f2fs_room_for_filename(d.bitmap, slots, d.max);
563 if (bit_pos >= d.max) {
564 err = f2fs_convert_inline_dir(dir, ipage, inline_dentry);
572 down_write(&F2FS_I(inode)->i_sem);
573 page = f2fs_init_inode_metadata(inode, dir, new_name,
581 f2fs_wait_on_page_writeback(ipage, NODE, true);
583 name_hash = f2fs_dentry_hash(new_name, NULL);
584 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
586 set_page_dirty(ipage);
588 /* we don't need to mark_inode_dirty now */
590 f2fs_i_pino_write(inode, dir->i_ino);
592 /* synchronize inode page's data from inode cache */
593 if (is_inode_flag_set(inode, FI_NEW_INODE))
594 f2fs_update_inode(inode, page);
596 f2fs_put_page(page, 1);
599 f2fs_update_parent_metadata(dir, inode, 0);
602 up_write(&F2FS_I(inode)->i_sem);
604 f2fs_put_page(ipage, 1);
608 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
609 struct inode *dir, struct inode *inode)
611 struct f2fs_dentry_ptr d;
613 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
614 unsigned int bit_pos;
618 f2fs_wait_on_page_writeback(page, NODE, true);
620 inline_dentry = inline_data_addr(dir, page);
621 make_dentry_ptr_inline(dir, &d, inline_dentry);
623 bit_pos = dentry - d.dentry;
624 for (i = 0; i < slots; i++)
625 __clear_bit_le(bit_pos + i, d.bitmap);
627 set_page_dirty(page);
628 f2fs_put_page(page, 1);
630 dir->i_ctime = dir->i_mtime = current_time(dir);
631 f2fs_mark_inode_dirty_sync(dir, false);
634 f2fs_drop_nlink(dir, inode);
637 bool f2fs_empty_inline_dir(struct inode *dir)
639 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
641 unsigned int bit_pos = 2;
643 struct f2fs_dentry_ptr d;
645 ipage = f2fs_get_node_page(sbi, dir->i_ino);
649 inline_dentry = inline_data_addr(dir, ipage);
650 make_dentry_ptr_inline(dir, &d, inline_dentry);
652 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
654 f2fs_put_page(ipage, 1);
662 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
663 struct fscrypt_str *fstr)
665 struct inode *inode = file_inode(file);
666 struct page *ipage = NULL;
667 struct f2fs_dentry_ptr d;
668 void *inline_dentry = NULL;
671 make_dentry_ptr_inline(inode, &d, inline_dentry);
673 if (ctx->pos == d.max)
676 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
678 return PTR_ERR(ipage);
681 * f2fs_readdir was protected by inode.i_rwsem, it is safe to access
682 * ipage without page's lock held.
686 inline_dentry = inline_data_addr(inode, ipage);
688 make_dentry_ptr_inline(inode, &d, inline_dentry);
690 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
694 f2fs_put_page(ipage, 0);
695 return err < 0 ? err : 0;
698 int f2fs_inline_data_fiemap(struct inode *inode,
699 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
701 __u64 byteaddr, ilen;
702 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
708 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
710 return PTR_ERR(ipage);
712 if (!f2fs_has_inline_data(inode)) {
717 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
720 if (start + len < ilen)
724 err = f2fs_get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
728 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
729 byteaddr += (char *)inline_data_addr(inode, ipage) -
730 (char *)F2FS_INODE(ipage);
731 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
733 f2fs_put_page(ipage, 1);