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_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 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 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
133 read_inline_data(page, dn->inode_page);
134 set_page_dirty(page);
136 /* clear dirty state */
137 dirty = clear_page_dirty_for_io(page);
139 /* write data page to try to make data consistent */
140 set_page_writeback(page);
141 fio.old_blkaddr = dn->data_blkaddr;
142 set_inode_flag(dn->inode, FI_HOT_DATA);
143 write_data_page(dn, &fio);
144 f2fs_wait_on_page_writeback(page, DATA, true);
146 inode_dec_dirty_pages(dn->inode);
147 remove_dirty_inode(dn->inode);
150 /* this converted inline_data should be recovered. */
151 set_inode_flag(dn->inode, FI_APPEND_WRITE);
153 /* clear inline data and flag after data writeback */
154 truncate_inline_inode(dn->inode, dn->inode_page, 0);
155 clear_inline_node(dn->inode_page);
157 stat_dec_inline_inode(dn->inode);
158 clear_inode_flag(dn->inode, FI_INLINE_DATA);
163 int f2fs_convert_inline_inode(struct inode *inode)
165 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
166 struct dnode_of_data dn;
167 struct page *ipage, *page;
170 if (!f2fs_has_inline_data(inode))
173 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
179 ipage = get_node_page(sbi, inode->i_ino);
181 err = PTR_ERR(ipage);
185 set_new_dnode(&dn, inode, ipage, ipage, 0);
187 if (f2fs_has_inline_data(inode))
188 err = f2fs_convert_inline_page(&dn, page);
194 f2fs_put_page(page, 1);
196 f2fs_balance_fs(sbi, dn.node_changed);
201 int f2fs_write_inline_data(struct inode *inode, struct page *page)
203 void *src_addr, *dst_addr;
204 struct dnode_of_data dn;
207 set_new_dnode(&dn, inode, NULL, NULL, 0);
208 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
212 if (!f2fs_has_inline_data(inode)) {
217 f2fs_bug_on(F2FS_I_SB(inode), page->index);
219 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
220 src_addr = kmap_atomic(page);
221 dst_addr = inline_data_addr(inode, dn.inode_page);
222 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
223 kunmap_atomic(src_addr);
224 set_page_dirty(dn.inode_page);
226 set_inode_flag(inode, FI_APPEND_WRITE);
227 set_inode_flag(inode, FI_DATA_EXIST);
229 clear_inline_node(dn.inode_page);
234 bool recover_inline_data(struct inode *inode, struct page *npage)
236 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
237 struct f2fs_inode *ri = NULL;
238 void *src_addr, *dst_addr;
242 * The inline_data recovery policy is as follows.
243 * [prev.] [next] of inline_data flag
244 * o o -> recover inline_data
245 * o x -> remove inline_data, and then recover data blocks
246 * x o -> remove inline_data, and then recover inline_data
247 * x x -> recover data blocks
250 ri = F2FS_INODE(npage);
252 if (f2fs_has_inline_data(inode) &&
253 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
255 ipage = get_node_page(sbi, inode->i_ino);
256 f2fs_bug_on(sbi, IS_ERR(ipage));
258 f2fs_wait_on_page_writeback(ipage, NODE, true);
260 src_addr = inline_data_addr(inode, npage);
261 dst_addr = inline_data_addr(inode, ipage);
262 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
264 set_inode_flag(inode, FI_INLINE_DATA);
265 set_inode_flag(inode, FI_DATA_EXIST);
267 set_page_dirty(ipage);
268 f2fs_put_page(ipage, 1);
272 if (f2fs_has_inline_data(inode)) {
273 ipage = get_node_page(sbi, inode->i_ino);
274 f2fs_bug_on(sbi, IS_ERR(ipage));
275 truncate_inline_inode(inode, ipage, 0);
276 clear_inode_flag(inode, FI_INLINE_DATA);
277 f2fs_put_page(ipage, 1);
278 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
279 if (truncate_blocks(inode, 0, false))
286 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
287 struct fscrypt_name *fname, struct page **res_page)
289 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
290 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
291 struct f2fs_dir_entry *de;
292 struct f2fs_dentry_ptr d;
295 f2fs_hash_t namehash;
297 ipage = get_node_page(sbi, dir->i_ino);
303 namehash = f2fs_dentry_hash(&name, fname);
305 inline_dentry = inline_data_addr(dir, ipage);
307 make_dentry_ptr_inline(dir, &d, inline_dentry);
308 de = find_target_dentry(fname, namehash, NULL, &d);
313 f2fs_put_page(ipage, 0);
318 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
321 struct f2fs_dentry_ptr d;
324 inline_dentry = inline_data_addr(inode, ipage);
326 make_dentry_ptr_inline(inode, &d, inline_dentry);
327 do_make_empty_dir(inode, parent, &d);
329 set_page_dirty(ipage);
331 /* update i_size to MAX_INLINE_DATA */
332 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
333 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
338 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
339 * release ipage in this function.
341 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
345 struct dnode_of_data dn;
346 struct f2fs_dentry_block *dentry_blk;
347 struct f2fs_dentry_ptr src, dst;
350 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
352 f2fs_put_page(ipage, 1);
356 set_new_dnode(&dn, dir, ipage, NULL, 0);
357 err = f2fs_reserve_block(&dn, 0);
361 f2fs_wait_on_page_writeback(page, DATA, true);
362 zero_user_segment(page, MAX_INLINE_DATA(dir), PAGE_SIZE);
364 dentry_blk = kmap_atomic(page);
366 make_dentry_ptr_inline(dir, &src, inline_dentry);
367 make_dentry_ptr_block(dir, &dst, dentry_blk);
369 /* copy data from inline dentry block to new dentry block */
370 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
371 memset(dst.bitmap + src.nr_bitmap, 0, dst.nr_bitmap - src.nr_bitmap);
373 * we do not need to zero out remainder part of dentry and filename
374 * field, since we have used bitmap for marking the usage status of
375 * them, besides, we can also ignore copying/zeroing reserved space
376 * of dentry block, because them haven't been used so far.
378 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
379 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
381 kunmap_atomic(dentry_blk);
382 if (!PageUptodate(page))
383 SetPageUptodate(page);
384 set_page_dirty(page);
386 /* clear inline dir and flag after data writeback */
387 truncate_inline_inode(dir, ipage, 0);
389 stat_dec_inline_dir(dir);
390 clear_inode_flag(dir, FI_INLINE_DENTRY);
392 f2fs_i_depth_write(dir, 1);
393 if (i_size_read(dir) < PAGE_SIZE)
394 f2fs_i_size_write(dir, PAGE_SIZE);
396 f2fs_put_page(page, 1);
400 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
402 struct f2fs_dentry_ptr d;
403 unsigned long bit_pos = 0;
406 make_dentry_ptr_inline(dir, &d, inline_dentry);
408 while (bit_pos < d.max) {
409 struct f2fs_dir_entry *de;
410 struct qstr new_name;
414 if (!test_bit_le(bit_pos, d.bitmap)) {
419 de = &d.dentry[bit_pos];
421 if (unlikely(!de->name_len)) {
426 new_name.name = d.filename[bit_pos];
427 new_name.len = le16_to_cpu(de->name_len);
429 ino = le32_to_cpu(de->ino);
430 fake_mode = get_de_type(de) << S_SHIFT;
432 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
435 goto punch_dentry_pages;
437 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
441 truncate_inode_pages(&dir->i_data, 0);
442 truncate_blocks(dir, 0, false);
443 remove_dirty_inode(dir);
447 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
453 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
454 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
455 if (!backup_dentry) {
456 f2fs_put_page(ipage, 1);
460 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
461 truncate_inline_inode(dir, ipage, 0);
465 err = f2fs_add_inline_entries(dir, backup_dentry);
471 stat_dec_inline_dir(dir);
472 clear_inode_flag(dir, FI_INLINE_DENTRY);
473 kfree(backup_dentry);
477 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
478 f2fs_i_depth_write(dir, 0);
479 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
480 set_page_dirty(ipage);
481 f2fs_put_page(ipage, 1);
483 kfree(backup_dentry);
487 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
490 if (!F2FS_I(dir)->i_dir_level)
491 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
493 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
496 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
497 const struct qstr *orig_name,
498 struct inode *inode, nid_t ino, umode_t mode)
500 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
502 unsigned int bit_pos;
503 f2fs_hash_t name_hash;
504 void *inline_dentry = NULL;
505 struct f2fs_dentry_ptr d;
506 int slots = GET_DENTRY_SLOTS(new_name->len);
507 struct page *page = NULL;
510 ipage = get_node_page(sbi, dir->i_ino);
512 return PTR_ERR(ipage);
514 inline_dentry = inline_data_addr(dir, ipage);
515 make_dentry_ptr_inline(dir, &d, inline_dentry);
517 bit_pos = room_for_filename(d.bitmap, slots, d.max);
518 if (bit_pos >= d.max) {
519 err = f2fs_convert_inline_dir(dir, ipage, inline_dentry);
527 down_write(&F2FS_I(inode)->i_sem);
528 page = init_inode_metadata(inode, dir, new_name,
536 f2fs_wait_on_page_writeback(ipage, NODE, true);
538 name_hash = f2fs_dentry_hash(new_name, NULL);
539 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
541 set_page_dirty(ipage);
543 /* we don't need to mark_inode_dirty now */
545 f2fs_i_pino_write(inode, dir->i_ino);
546 f2fs_put_page(page, 1);
549 update_parent_metadata(dir, inode, 0);
552 up_write(&F2FS_I(inode)->i_sem);
554 f2fs_put_page(ipage, 1);
558 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
559 struct inode *dir, struct inode *inode)
561 struct f2fs_dentry_ptr d;
563 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
564 unsigned int bit_pos;
568 f2fs_wait_on_page_writeback(page, NODE, true);
570 inline_dentry = inline_data_addr(dir, page);
571 make_dentry_ptr_inline(dir, &d, inline_dentry);
573 bit_pos = dentry - d.dentry;
574 for (i = 0; i < slots; i++)
575 __clear_bit_le(bit_pos + i, d.bitmap);
577 set_page_dirty(page);
578 f2fs_put_page(page, 1);
580 dir->i_ctime = dir->i_mtime = current_time(dir);
581 f2fs_mark_inode_dirty_sync(dir, false);
584 f2fs_drop_nlink(dir, inode);
587 bool f2fs_empty_inline_dir(struct inode *dir)
589 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
591 unsigned int bit_pos = 2;
593 struct f2fs_dentry_ptr d;
595 ipage = get_node_page(sbi, dir->i_ino);
599 inline_dentry = inline_data_addr(dir, ipage);
600 make_dentry_ptr_inline(dir, &d, inline_dentry);
602 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
604 f2fs_put_page(ipage, 1);
612 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
613 struct fscrypt_str *fstr)
615 struct inode *inode = file_inode(file);
616 struct page *ipage = NULL;
617 struct f2fs_dentry_ptr d;
618 void *inline_dentry = NULL;
621 make_dentry_ptr_inline(inode, &d, inline_dentry);
623 if (ctx->pos == d.max)
626 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
628 return PTR_ERR(ipage);
630 inline_dentry = inline_data_addr(inode, ipage);
632 make_dentry_ptr_inline(inode, &d, inline_dentry);
634 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
638 f2fs_put_page(ipage, 1);
639 return err < 0 ? err : 0;
642 int f2fs_inline_data_fiemap(struct inode *inode,
643 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
645 __u64 byteaddr, ilen;
646 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
652 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
654 return PTR_ERR(ipage);
656 if (!f2fs_has_inline_data(inode)) {
661 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
664 if (start + len < ilen)
668 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
669 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
670 byteaddr += (char *)inline_data_addr(inode, ipage) -
671 (char *)F2FS_INODE(ipage);
672 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
674 f2fs_put_page(ipage, 1);