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_encrypted_file(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 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 truncate_inline_inode(struct inode *inode, struct page *ipage, u64 from)
71 if (from >= MAX_INLINE_DATA(inode))
74 addr = inline_data_addr(inode, ipage);
76 f2fs_wait_on_page_writeback(ipage, NODE, true);
77 memset(addr + from, 0, MAX_INLINE_DATA(inode) - from);
78 set_page_dirty(ipage);
81 clear_inode_flag(inode, FI_DATA_EXIST);
84 int f2fs_read_inline_data(struct inode *inode, struct page *page)
88 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
91 return PTR_ERR(ipage);
94 if (!f2fs_has_inline_data(inode)) {
95 f2fs_put_page(ipage, 1);
100 zero_user_segment(page, 0, PAGE_SIZE);
102 read_inline_data(page, ipage);
104 if (!PageUptodate(page))
105 SetPageUptodate(page);
106 f2fs_put_page(ipage, 1);
111 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
113 struct f2fs_io_info fio = {
114 .sbi = F2FS_I_SB(dn->inode),
117 .op_flags = REQ_SYNC | REQ_PRIO,
119 .encrypted_page = NULL,
120 .io_type = FS_DATA_IO,
124 if (!f2fs_exist_data(dn->inode))
127 err = f2fs_reserve_block(dn, 0);
131 if (unlikely(dn->data_blkaddr != NEW_ADDR)) {
133 set_sbi_flag(fio.sbi, SBI_NEED_FSCK);
134 f2fs_msg(fio.sbi->sb, KERN_WARNING,
135 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
137 __func__, dn->inode->i_ino, dn->data_blkaddr);
138 return -EFSCORRUPTED;
141 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
143 read_inline_data(page, dn->inode_page);
144 set_page_dirty(page);
146 /* clear dirty state */
147 dirty = clear_page_dirty_for_io(page);
149 /* write data page to try to make data consistent */
150 set_page_writeback(page);
151 fio.old_blkaddr = dn->data_blkaddr;
152 set_inode_flag(dn->inode, FI_HOT_DATA);
153 write_data_page(dn, &fio);
154 f2fs_wait_on_page_writeback(page, DATA, true);
156 inode_dec_dirty_pages(dn->inode);
157 remove_dirty_inode(dn->inode);
160 /* this converted inline_data should be recovered. */
161 set_inode_flag(dn->inode, FI_APPEND_WRITE);
163 /* clear inline data and flag after data writeback */
164 truncate_inline_inode(dn->inode, dn->inode_page, 0);
165 clear_inline_node(dn->inode_page);
167 stat_dec_inline_inode(dn->inode);
168 clear_inode_flag(dn->inode, FI_INLINE_DATA);
173 int f2fs_convert_inline_inode(struct inode *inode)
175 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
176 struct dnode_of_data dn;
177 struct page *ipage, *page;
180 if (!f2fs_has_inline_data(inode))
183 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
189 ipage = get_node_page(sbi, inode->i_ino);
191 err = PTR_ERR(ipage);
195 set_new_dnode(&dn, inode, ipage, ipage, 0);
197 if (f2fs_has_inline_data(inode))
198 err = f2fs_convert_inline_page(&dn, page);
204 f2fs_put_page(page, 1);
207 f2fs_balance_fs(sbi, dn.node_changed);
212 int f2fs_write_inline_data(struct inode *inode, struct page *page)
214 void *src_addr, *dst_addr;
215 struct dnode_of_data dn;
216 struct address_space *mapping = page_mapping(page);
220 set_new_dnode(&dn, inode, NULL, NULL, 0);
221 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
225 if (!f2fs_has_inline_data(inode)) {
230 f2fs_bug_on(F2FS_I_SB(inode), page->index);
232 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
233 src_addr = kmap_atomic(page);
234 dst_addr = inline_data_addr(inode, dn.inode_page);
235 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
236 kunmap_atomic(src_addr);
237 set_page_dirty(dn.inode_page);
239 spin_lock_irqsave(&mapping->tree_lock, flags);
240 radix_tree_tag_clear(&mapping->page_tree, page_index(page),
241 PAGECACHE_TAG_DIRTY);
242 spin_unlock_irqrestore(&mapping->tree_lock, flags);
244 set_inode_flag(inode, FI_APPEND_WRITE);
245 set_inode_flag(inode, FI_DATA_EXIST);
247 clear_inline_node(dn.inode_page);
252 bool recover_inline_data(struct inode *inode, struct page *npage)
254 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
255 struct f2fs_inode *ri = NULL;
256 void *src_addr, *dst_addr;
260 * The inline_data recovery policy is as follows.
261 * [prev.] [next] of inline_data flag
262 * o o -> recover inline_data
263 * o x -> remove inline_data, and then recover data blocks
264 * x o -> remove inline_data, and then recover inline_data
265 * x x -> recover data blocks
268 ri = F2FS_INODE(npage);
270 if (f2fs_has_inline_data(inode) &&
271 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
273 ipage = get_node_page(sbi, inode->i_ino);
274 f2fs_bug_on(sbi, IS_ERR(ipage));
276 f2fs_wait_on_page_writeback(ipage, NODE, true);
278 src_addr = inline_data_addr(inode, npage);
279 dst_addr = inline_data_addr(inode, ipage);
280 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
282 set_inode_flag(inode, FI_INLINE_DATA);
283 set_inode_flag(inode, FI_DATA_EXIST);
285 set_page_dirty(ipage);
286 f2fs_put_page(ipage, 1);
290 if (f2fs_has_inline_data(inode)) {
291 ipage = get_node_page(sbi, inode->i_ino);
292 f2fs_bug_on(sbi, IS_ERR(ipage));
293 truncate_inline_inode(inode, ipage, 0);
294 clear_inode_flag(inode, FI_INLINE_DATA);
295 f2fs_put_page(ipage, 1);
296 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
297 if (truncate_blocks(inode, 0, false))
304 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
305 struct fscrypt_name *fname, struct page **res_page)
307 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
308 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
309 struct f2fs_dir_entry *de;
310 struct f2fs_dentry_ptr d;
313 f2fs_hash_t namehash;
315 ipage = get_node_page(sbi, dir->i_ino);
321 namehash = f2fs_dentry_hash(&name, fname);
323 inline_dentry = inline_data_addr(dir, ipage);
325 make_dentry_ptr_inline(dir, &d, inline_dentry);
326 de = find_target_dentry(fname, namehash, NULL, &d);
331 f2fs_put_page(ipage, 0);
336 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
339 struct f2fs_dentry_ptr d;
342 inline_dentry = inline_data_addr(inode, ipage);
344 make_dentry_ptr_inline(inode, &d, inline_dentry);
345 do_make_empty_dir(inode, parent, &d);
347 set_page_dirty(ipage);
349 /* update i_size to MAX_INLINE_DATA */
350 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
351 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
356 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
357 * release ipage in this function.
359 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
363 struct dnode_of_data dn;
364 struct f2fs_dentry_block *dentry_blk;
365 struct f2fs_dentry_ptr src, dst;
368 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
370 f2fs_put_page(ipage, 1);
374 set_new_dnode(&dn, dir, ipage, NULL, 0);
375 err = f2fs_reserve_block(&dn, 0);
379 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
381 set_sbi_flag(F2FS_P_SB(page), SBI_NEED_FSCK);
382 f2fs_msg(F2FS_P_SB(page)->sb, KERN_WARNING,
383 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
385 __func__, dir->i_ino, dn.data_blkaddr);
390 f2fs_wait_on_page_writeback(page, DATA, true);
391 zero_user_segment(page, MAX_INLINE_DATA(dir), PAGE_SIZE);
393 dentry_blk = kmap_atomic(page);
396 * Start by zeroing the full block, to ensure that all unused space is
397 * zeroed and no uninitialized memory is leaked to disk.
399 memset(dentry_blk, 0, F2FS_BLKSIZE);
401 make_dentry_ptr_inline(dir, &src, inline_dentry);
402 make_dentry_ptr_block(dir, &dst, dentry_blk);
404 /* copy data from inline dentry block to new dentry block */
405 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
406 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
407 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
409 kunmap_atomic(dentry_blk);
410 if (!PageUptodate(page))
411 SetPageUptodate(page);
412 set_page_dirty(page);
414 /* clear inline dir and flag after data writeback */
415 truncate_inline_inode(dir, ipage, 0);
417 stat_dec_inline_dir(dir);
418 clear_inode_flag(dir, FI_INLINE_DENTRY);
420 f2fs_i_depth_write(dir, 1);
421 if (i_size_read(dir) < PAGE_SIZE)
422 f2fs_i_size_write(dir, PAGE_SIZE);
424 f2fs_put_page(page, 1);
428 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
430 struct f2fs_dentry_ptr d;
431 unsigned long bit_pos = 0;
434 make_dentry_ptr_inline(dir, &d, inline_dentry);
436 while (bit_pos < d.max) {
437 struct f2fs_dir_entry *de;
438 struct qstr new_name;
442 if (!test_bit_le(bit_pos, d.bitmap)) {
447 de = &d.dentry[bit_pos];
449 if (unlikely(!de->name_len)) {
454 new_name.name = d.filename[bit_pos];
455 new_name.len = le16_to_cpu(de->name_len);
457 ino = le32_to_cpu(de->ino);
458 fake_mode = get_de_type(de) << S_SHIFT;
460 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
463 goto punch_dentry_pages;
465 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
469 truncate_inode_pages(&dir->i_data, 0);
470 truncate_blocks(dir, 0, false);
471 remove_dirty_inode(dir);
475 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
481 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
482 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
483 if (!backup_dentry) {
484 f2fs_put_page(ipage, 1);
488 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
489 truncate_inline_inode(dir, ipage, 0);
493 err = f2fs_add_inline_entries(dir, backup_dentry);
499 stat_dec_inline_dir(dir);
500 clear_inode_flag(dir, FI_INLINE_DENTRY);
501 kfree(backup_dentry);
505 f2fs_wait_on_page_writeback(ipage, NODE, true);
506 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
507 f2fs_i_depth_write(dir, 0);
508 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
509 set_page_dirty(ipage);
510 f2fs_put_page(ipage, 1);
512 kfree(backup_dentry);
516 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
519 if (!F2FS_I(dir)->i_dir_level)
520 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
522 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
525 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
526 const struct qstr *orig_name,
527 struct inode *inode, nid_t ino, umode_t mode)
529 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
531 unsigned int bit_pos;
532 f2fs_hash_t name_hash;
533 void *inline_dentry = NULL;
534 struct f2fs_dentry_ptr d;
535 int slots = GET_DENTRY_SLOTS(new_name->len);
536 struct page *page = NULL;
539 ipage = get_node_page(sbi, dir->i_ino);
541 return PTR_ERR(ipage);
543 inline_dentry = inline_data_addr(dir, ipage);
544 make_dentry_ptr_inline(dir, &d, inline_dentry);
546 bit_pos = room_for_filename(d.bitmap, slots, d.max);
547 if (bit_pos >= d.max) {
548 err = f2fs_convert_inline_dir(dir, ipage, inline_dentry);
556 down_write(&F2FS_I(inode)->i_sem);
557 page = init_inode_metadata(inode, dir, new_name,
565 f2fs_wait_on_page_writeback(ipage, NODE, true);
567 name_hash = f2fs_dentry_hash(new_name, NULL);
568 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
570 set_page_dirty(ipage);
572 /* we don't need to mark_inode_dirty now */
574 f2fs_i_pino_write(inode, dir->i_ino);
575 f2fs_put_page(page, 1);
578 update_parent_metadata(dir, inode, 0);
581 up_write(&F2FS_I(inode)->i_sem);
583 f2fs_put_page(ipage, 1);
587 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
588 struct inode *dir, struct inode *inode)
590 struct f2fs_dentry_ptr d;
592 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
593 unsigned int bit_pos;
597 f2fs_wait_on_page_writeback(page, NODE, true);
599 inline_dentry = inline_data_addr(dir, page);
600 make_dentry_ptr_inline(dir, &d, inline_dentry);
602 bit_pos = dentry - d.dentry;
603 for (i = 0; i < slots; i++)
604 __clear_bit_le(bit_pos + i, d.bitmap);
606 set_page_dirty(page);
607 f2fs_put_page(page, 1);
609 dir->i_ctime = dir->i_mtime = current_time(dir);
610 f2fs_mark_inode_dirty_sync(dir, false);
613 f2fs_drop_nlink(dir, inode);
616 bool f2fs_empty_inline_dir(struct inode *dir)
618 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
620 unsigned int bit_pos = 2;
622 struct f2fs_dentry_ptr d;
624 ipage = get_node_page(sbi, dir->i_ino);
628 inline_dentry = inline_data_addr(dir, ipage);
629 make_dentry_ptr_inline(dir, &d, inline_dentry);
631 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
633 f2fs_put_page(ipage, 1);
641 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
642 struct fscrypt_str *fstr)
644 struct inode *inode = file_inode(file);
645 struct page *ipage = NULL;
646 struct f2fs_dentry_ptr d;
647 void *inline_dentry = NULL;
650 make_dentry_ptr_inline(inode, &d, inline_dentry);
652 if (ctx->pos == d.max)
655 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
657 return PTR_ERR(ipage);
660 * f2fs_readdir was protected by inode.i_rwsem, it is safe to access
661 * ipage without page's lock held.
665 inline_dentry = inline_data_addr(inode, ipage);
667 make_dentry_ptr_inline(inode, &d, inline_dentry);
669 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
673 f2fs_put_page(ipage, 0);
674 return err < 0 ? err : 0;
677 int f2fs_inline_data_fiemap(struct inode *inode,
678 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
680 __u64 byteaddr, ilen;
681 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
687 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
689 return PTR_ERR(ipage);
691 if (!f2fs_has_inline_data(inode)) {
696 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
699 if (start + len < ilen)
703 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
704 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
705 byteaddr += (char *)inline_data_addr(inode, ipage) -
706 (char *)F2FS_INODE(ipage);
707 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
709 f2fs_put_page(ipage, 1);