3 * Copyright (c) 2013, Intel Corporation
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),
115 .ino = dn->inode->i_ino,
118 .op_flags = REQ_SYNC | REQ_PRIO,
120 .encrypted_page = NULL,
121 .io_type = FS_DATA_IO,
125 if (!f2fs_exist_data(dn->inode))
128 err = f2fs_reserve_block(dn, 0);
132 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
134 read_inline_data(page, dn->inode_page);
135 set_page_dirty(page);
137 /* clear dirty state */
138 dirty = clear_page_dirty_for_io(page);
140 /* write data page to try to make data consistent */
141 set_page_writeback(page);
142 fio.old_blkaddr = dn->data_blkaddr;
143 set_inode_flag(dn->inode, FI_HOT_DATA);
144 write_data_page(dn, &fio);
145 f2fs_wait_on_page_writeback(page, DATA, true);
147 inode_dec_dirty_pages(dn->inode);
148 remove_dirty_inode(dn->inode);
151 /* this converted inline_data should be recovered. */
152 set_inode_flag(dn->inode, FI_APPEND_WRITE);
154 /* clear inline data and flag after data writeback */
155 truncate_inline_inode(dn->inode, dn->inode_page, 0);
156 clear_inline_node(dn->inode_page);
158 stat_dec_inline_inode(dn->inode);
159 clear_inode_flag(dn->inode, FI_INLINE_DATA);
164 int f2fs_convert_inline_inode(struct inode *inode)
166 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
167 struct dnode_of_data dn;
168 struct page *ipage, *page;
171 if (!f2fs_has_inline_data(inode))
174 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
180 ipage = get_node_page(sbi, inode->i_ino);
182 err = PTR_ERR(ipage);
186 set_new_dnode(&dn, inode, ipage, ipage, 0);
188 if (f2fs_has_inline_data(inode))
189 err = f2fs_convert_inline_page(&dn, page);
195 f2fs_put_page(page, 1);
197 f2fs_balance_fs(sbi, dn.node_changed);
202 int f2fs_write_inline_data(struct inode *inode, struct page *page)
204 void *src_addr, *dst_addr;
205 struct dnode_of_data dn;
206 struct address_space *mapping = page_mapping(page);
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(inode, dn.inode_page);
225 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
226 kunmap_atomic(src_addr);
227 set_page_dirty(dn.inode_page);
229 spin_lock_irqsave(&mapping->tree_lock, flags);
230 radix_tree_tag_clear(&mapping->page_tree, page_index(page),
231 PAGECACHE_TAG_DIRTY);
232 spin_unlock_irqrestore(&mapping->tree_lock, flags);
234 set_inode_flag(inode, FI_APPEND_WRITE);
235 set_inode_flag(inode, FI_DATA_EXIST);
237 clear_inline_node(dn.inode_page);
242 bool recover_inline_data(struct inode *inode, struct page *npage)
244 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
245 struct f2fs_inode *ri = NULL;
246 void *src_addr, *dst_addr;
250 * The inline_data recovery policy is as follows.
251 * [prev.] [next] of inline_data flag
252 * o o -> recover inline_data
253 * o x -> remove inline_data, and then recover data blocks
254 * x o -> remove inline_data, and then recover inline_data
255 * x x -> recover data blocks
258 ri = F2FS_INODE(npage);
260 if (f2fs_has_inline_data(inode) &&
261 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
263 ipage = get_node_page(sbi, inode->i_ino);
264 f2fs_bug_on(sbi, IS_ERR(ipage));
266 f2fs_wait_on_page_writeback(ipage, NODE, true);
268 src_addr = inline_data_addr(inode, npage);
269 dst_addr = inline_data_addr(inode, ipage);
270 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
272 set_inode_flag(inode, FI_INLINE_DATA);
273 set_inode_flag(inode, FI_DATA_EXIST);
275 set_page_dirty(ipage);
276 f2fs_put_page(ipage, 1);
280 if (f2fs_has_inline_data(inode)) {
281 ipage = get_node_page(sbi, inode->i_ino);
282 f2fs_bug_on(sbi, IS_ERR(ipage));
283 truncate_inline_inode(inode, ipage, 0);
284 clear_inode_flag(inode, FI_INLINE_DATA);
285 f2fs_put_page(ipage, 1);
286 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
287 if (truncate_blocks(inode, 0, false))
294 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
295 struct fscrypt_name *fname, struct page **res_page)
297 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
298 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
299 struct f2fs_dir_entry *de;
300 struct f2fs_dentry_ptr d;
303 f2fs_hash_t namehash;
305 ipage = get_node_page(sbi, dir->i_ino);
311 namehash = f2fs_dentry_hash(&name, fname);
313 inline_dentry = inline_data_addr(dir, ipage);
315 make_dentry_ptr_inline(dir, &d, inline_dentry);
316 de = find_target_dentry(fname, namehash, NULL, &d);
321 f2fs_put_page(ipage, 0);
326 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
329 struct f2fs_dentry_ptr d;
332 inline_dentry = inline_data_addr(inode, ipage);
334 make_dentry_ptr_inline(inode, &d, inline_dentry);
335 do_make_empty_dir(inode, parent, &d);
337 set_page_dirty(ipage);
339 /* update i_size to MAX_INLINE_DATA */
340 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
341 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
346 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
347 * release ipage in this function.
349 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
353 struct dnode_of_data dn;
354 struct f2fs_dentry_block *dentry_blk;
355 struct f2fs_dentry_ptr src, dst;
358 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
360 f2fs_put_page(ipage, 1);
364 set_new_dnode(&dn, dir, ipage, NULL, 0);
365 err = f2fs_reserve_block(&dn, 0);
369 f2fs_wait_on_page_writeback(page, DATA, true);
370 zero_user_segment(page, MAX_INLINE_DATA(dir), PAGE_SIZE);
372 dentry_blk = kmap_atomic(page);
374 make_dentry_ptr_inline(dir, &src, inline_dentry);
375 make_dentry_ptr_block(dir, &dst, dentry_blk);
377 /* copy data from inline dentry block to new dentry block */
378 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
379 memset(dst.bitmap + src.nr_bitmap, 0, dst.nr_bitmap - src.nr_bitmap);
381 * we do not need to zero out remainder part of dentry and filename
382 * field, since we have used bitmap for marking the usage status of
383 * them, besides, we can also ignore copying/zeroing reserved space
384 * of dentry block, because them haven't been used so far.
386 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
387 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
389 kunmap_atomic(dentry_blk);
390 if (!PageUptodate(page))
391 SetPageUptodate(page);
392 set_page_dirty(page);
394 /* clear inline dir and flag after data writeback */
395 truncate_inline_inode(dir, ipage, 0);
397 stat_dec_inline_dir(dir);
398 clear_inode_flag(dir, FI_INLINE_DENTRY);
400 f2fs_i_depth_write(dir, 1);
401 if (i_size_read(dir) < PAGE_SIZE)
402 f2fs_i_size_write(dir, PAGE_SIZE);
404 f2fs_put_page(page, 1);
408 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
410 struct f2fs_dentry_ptr d;
411 unsigned long bit_pos = 0;
414 make_dentry_ptr_inline(dir, &d, inline_dentry);
416 while (bit_pos < d.max) {
417 struct f2fs_dir_entry *de;
418 struct qstr new_name;
422 if (!test_bit_le(bit_pos, d.bitmap)) {
427 de = &d.dentry[bit_pos];
429 if (unlikely(!de->name_len)) {
434 new_name.name = d.filename[bit_pos];
435 new_name.len = le16_to_cpu(de->name_len);
437 ino = le32_to_cpu(de->ino);
438 fake_mode = get_de_type(de) << S_SHIFT;
440 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
443 goto punch_dentry_pages;
445 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
449 truncate_inode_pages(&dir->i_data, 0);
450 truncate_blocks(dir, 0, false);
451 remove_dirty_inode(dir);
455 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
461 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
462 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
463 if (!backup_dentry) {
464 f2fs_put_page(ipage, 1);
468 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
469 truncate_inline_inode(dir, ipage, 0);
473 err = f2fs_add_inline_entries(dir, backup_dentry);
479 stat_dec_inline_dir(dir);
480 clear_inode_flag(dir, FI_INLINE_DENTRY);
481 kfree(backup_dentry);
485 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
486 f2fs_i_depth_write(dir, 0);
487 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
488 set_page_dirty(ipage);
489 f2fs_put_page(ipage, 1);
491 kfree(backup_dentry);
495 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
498 if (!F2FS_I(dir)->i_dir_level)
499 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
501 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
504 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
505 const struct qstr *orig_name,
506 struct inode *inode, nid_t ino, umode_t mode)
508 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
510 unsigned int bit_pos;
511 f2fs_hash_t name_hash;
512 void *inline_dentry = NULL;
513 struct f2fs_dentry_ptr d;
514 int slots = GET_DENTRY_SLOTS(new_name->len);
515 struct page *page = NULL;
518 ipage = get_node_page(sbi, dir->i_ino);
520 return PTR_ERR(ipage);
522 inline_dentry = inline_data_addr(dir, ipage);
523 make_dentry_ptr_inline(dir, &d, inline_dentry);
525 bit_pos = room_for_filename(d.bitmap, slots, d.max);
526 if (bit_pos >= d.max) {
527 err = f2fs_convert_inline_dir(dir, ipage, inline_dentry);
535 down_write(&F2FS_I(inode)->i_sem);
536 page = init_inode_metadata(inode, dir, new_name,
544 f2fs_wait_on_page_writeback(ipage, NODE, true);
546 name_hash = f2fs_dentry_hash(new_name, NULL);
547 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
549 set_page_dirty(ipage);
551 /* we don't need to mark_inode_dirty now */
553 f2fs_i_pino_write(inode, dir->i_ino);
554 f2fs_put_page(page, 1);
557 update_parent_metadata(dir, inode, 0);
560 up_write(&F2FS_I(inode)->i_sem);
562 f2fs_put_page(ipage, 1);
566 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
567 struct inode *dir, struct inode *inode)
569 struct f2fs_dentry_ptr d;
571 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
572 unsigned int bit_pos;
576 f2fs_wait_on_page_writeback(page, NODE, true);
578 inline_dentry = inline_data_addr(dir, page);
579 make_dentry_ptr_inline(dir, &d, inline_dentry);
581 bit_pos = dentry - d.dentry;
582 for (i = 0; i < slots; i++)
583 __clear_bit_le(bit_pos + i, d.bitmap);
585 set_page_dirty(page);
586 f2fs_put_page(page, 1);
588 dir->i_ctime = dir->i_mtime = current_time(dir);
589 f2fs_mark_inode_dirty_sync(dir, false);
592 f2fs_drop_nlink(dir, inode);
595 bool f2fs_empty_inline_dir(struct inode *dir)
597 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
599 unsigned int bit_pos = 2;
601 struct f2fs_dentry_ptr d;
603 ipage = get_node_page(sbi, dir->i_ino);
607 inline_dentry = inline_data_addr(dir, ipage);
608 make_dentry_ptr_inline(dir, &d, inline_dentry);
610 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
612 f2fs_put_page(ipage, 1);
620 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
621 struct fscrypt_str *fstr)
623 struct inode *inode = file_inode(file);
624 struct page *ipage = NULL;
625 struct f2fs_dentry_ptr d;
626 void *inline_dentry = NULL;
629 make_dentry_ptr_inline(inode, &d, inline_dentry);
631 if (ctx->pos == d.max)
634 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
636 return PTR_ERR(ipage);
638 inline_dentry = inline_data_addr(inode, ipage);
640 make_dentry_ptr_inline(inode, &d, inline_dentry);
642 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
646 f2fs_put_page(ipage, 1);
647 return err < 0 ? err : 0;
650 int f2fs_inline_data_fiemap(struct inode *inode,
651 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
653 __u64 byteaddr, ilen;
654 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
660 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
662 return PTR_ERR(ipage);
664 if (!f2fs_has_inline_data(inode)) {
669 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
672 if (start + len < ilen)
676 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
677 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
678 byteaddr += (char *)inline_data_addr(inode, ipage) -
679 (char *)F2FS_INODE(ipage);
680 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
682 f2fs_put_page(ipage, 1);