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_CACHE_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 SetPageUptodate(page);
65 bool truncate_inline_inode(struct page *ipage, u64 from)
69 if (from >= MAX_INLINE_DATA)
72 addr = inline_data_addr(ipage);
74 f2fs_wait_on_page_writeback(ipage, NODE, true);
75 memset(addr + from, 0, MAX_INLINE_DATA - from);
80 int f2fs_read_inline_data(struct inode *inode, struct page *page)
84 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
87 return PTR_ERR(ipage);
90 if (!f2fs_has_inline_data(inode)) {
91 f2fs_put_page(ipage, 1);
96 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
98 read_inline_data(page, ipage);
100 SetPageUptodate(page);
101 f2fs_put_page(ipage, 1);
106 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
108 void *src_addr, *dst_addr;
109 struct f2fs_io_info fio = {
110 .sbi = F2FS_I_SB(dn->inode),
112 .rw = WRITE_SYNC | REQ_PRIO,
114 .encrypted_page = NULL,
118 f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
120 if (!f2fs_exist_data(dn->inode))
123 err = f2fs_reserve_block(dn, 0);
127 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
128 if (PageUptodate(page))
131 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
133 /* Copy the whole inline data block */
134 src_addr = inline_data_addr(dn->inode_page);
135 dst_addr = kmap_atomic(page);
136 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
137 flush_dcache_page(page);
138 kunmap_atomic(dst_addr);
139 SetPageUptodate(page);
141 set_page_dirty(page);
143 /* clear dirty state */
144 dirty = clear_page_dirty_for_io(page);
146 /* write data page to try to make data consistent */
147 set_page_writeback(page);
148 fio.blk_addr = dn->data_blkaddr;
149 write_data_page(dn, &fio);
150 set_data_blkaddr(dn);
151 f2fs_update_extent_cache(dn);
152 f2fs_wait_on_page_writeback(page, DATA, true);
154 inode_dec_dirty_pages(dn->inode);
156 /* this converted inline_data should be recovered. */
157 set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
159 /* clear inline data and flag after data writeback */
160 truncate_inline_inode(dn->inode_page, 0);
161 clear_inline_node(dn->inode_page);
163 stat_dec_inline_inode(dn->inode);
164 f2fs_clear_inline_inode(dn->inode);
170 int f2fs_convert_inline_inode(struct inode *inode)
172 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
173 struct dnode_of_data dn;
174 struct page *ipage, *page;
177 if (!f2fs_has_inline_data(inode))
180 page = grab_cache_page(inode->i_mapping, 0);
186 ipage = get_node_page(sbi, inode->i_ino);
188 err = PTR_ERR(ipage);
192 set_new_dnode(&dn, inode, ipage, ipage, 0);
194 if (f2fs_has_inline_data(inode))
195 err = f2fs_convert_inline_page(&dn, page);
201 f2fs_put_page(page, 1);
203 f2fs_balance_fs(sbi, dn.node_changed);
208 int f2fs_write_inline_data(struct inode *inode, struct page *page)
210 void *src_addr, *dst_addr;
211 struct dnode_of_data dn;
214 set_new_dnode(&dn, inode, NULL, NULL, 0);
215 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
219 if (!f2fs_has_inline_data(inode)) {
224 f2fs_bug_on(F2FS_I_SB(inode), page->index);
226 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
227 src_addr = kmap_atomic(page);
228 dst_addr = inline_data_addr(dn.inode_page);
229 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
230 kunmap_atomic(src_addr);
232 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
233 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
235 sync_inode_page(&dn);
236 clear_inline_node(dn.inode_page);
241 bool recover_inline_data(struct inode *inode, struct page *npage)
243 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
244 struct f2fs_inode *ri = NULL;
245 void *src_addr, *dst_addr;
249 * The inline_data recovery policy is as follows.
250 * [prev.] [next] of inline_data flag
251 * o o -> recover inline_data
252 * o x -> remove inline_data, and then recover data blocks
253 * x o -> remove inline_data, and then recover inline_data
254 * x x -> recover data blocks
257 ri = F2FS_INODE(npage);
259 if (f2fs_has_inline_data(inode) &&
260 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
262 ipage = get_node_page(sbi, inode->i_ino);
263 f2fs_bug_on(sbi, IS_ERR(ipage));
265 f2fs_wait_on_page_writeback(ipage, NODE, true);
267 src_addr = inline_data_addr(npage);
268 dst_addr = inline_data_addr(ipage);
269 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
271 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
272 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
274 update_inode(inode, ipage);
275 f2fs_put_page(ipage, 1);
279 if (f2fs_has_inline_data(inode)) {
280 ipage = get_node_page(sbi, inode->i_ino);
281 f2fs_bug_on(sbi, IS_ERR(ipage));
282 if (!truncate_inline_inode(ipage, 0))
284 f2fs_clear_inline_inode(inode);
285 update_inode(inode, ipage);
286 f2fs_put_page(ipage, 1);
287 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
288 if (truncate_blocks(inode, 0, false))
295 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
296 struct f2fs_filename *fname, struct page **res_page)
298 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
299 struct f2fs_inline_dentry *inline_dentry;
300 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
301 struct f2fs_dir_entry *de;
302 struct f2fs_dentry_ptr d;
304 f2fs_hash_t namehash;
306 ipage = get_node_page(sbi, dir->i_ino);
310 namehash = f2fs_dentry_hash(&name);
312 inline_dentry = inline_data_addr(ipage);
314 make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
315 de = find_target_dentry(fname, namehash, NULL, &d);
320 f2fs_put_page(ipage, 0);
323 * For the most part, it should be a bug when name_len is zero.
324 * We stop here for figuring out where the bugs has occurred.
326 f2fs_bug_on(sbi, d.max < 0);
330 struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
333 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
335 struct f2fs_dir_entry *de;
336 struct f2fs_inline_dentry *dentry_blk;
338 ipage = get_node_page(sbi, dir->i_ino);
342 dentry_blk = inline_data_addr(ipage);
343 de = &dentry_blk->dentry[1];
349 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
352 struct f2fs_inline_dentry *dentry_blk;
353 struct f2fs_dentry_ptr d;
355 dentry_blk = inline_data_addr(ipage);
357 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
358 do_make_empty_dir(inode, parent, &d);
360 set_page_dirty(ipage);
362 /* update i_size to MAX_INLINE_DATA */
363 if (i_size_read(inode) < MAX_INLINE_DATA) {
364 i_size_write(inode, MAX_INLINE_DATA);
365 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
371 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
372 * release ipage in this function.
374 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
375 struct f2fs_inline_dentry *inline_dentry)
378 struct dnode_of_data dn;
379 struct f2fs_dentry_block *dentry_blk;
382 page = grab_cache_page(dir->i_mapping, 0);
384 f2fs_put_page(ipage, 1);
388 set_new_dnode(&dn, dir, ipage, NULL, 0);
389 err = f2fs_reserve_block(&dn, 0);
393 f2fs_wait_on_page_writeback(page, DATA, true);
394 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
396 dentry_blk = kmap_atomic(page);
398 /* copy data from inline dentry block to new dentry block */
399 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
400 INLINE_DENTRY_BITMAP_SIZE);
401 memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
402 SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
404 * we do not need to zero out remainder part of dentry and filename
405 * field, since we have used bitmap for marking the usage status of
406 * them, besides, we can also ignore copying/zeroing reserved space
407 * of dentry block, because them haven't been used so far.
409 memcpy(dentry_blk->dentry, inline_dentry->dentry,
410 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
411 memcpy(dentry_blk->filename, inline_dentry->filename,
412 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
414 kunmap_atomic(dentry_blk);
415 SetPageUptodate(page);
416 set_page_dirty(page);
418 /* clear inline dir and flag after data writeback */
419 truncate_inline_inode(ipage, 0);
421 stat_dec_inline_dir(dir);
422 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
424 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
425 i_size_write(dir, PAGE_CACHE_SIZE);
426 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
429 sync_inode_page(&dn);
431 f2fs_put_page(page, 1);
435 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
436 struct inode *inode, nid_t ino, umode_t mode)
438 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
440 unsigned int bit_pos;
441 f2fs_hash_t name_hash;
442 size_t namelen = name->len;
443 struct f2fs_inline_dentry *dentry_blk = NULL;
444 struct f2fs_dentry_ptr d;
445 int slots = GET_DENTRY_SLOTS(namelen);
446 struct page *page = NULL;
449 ipage = get_node_page(sbi, dir->i_ino);
451 return PTR_ERR(ipage);
453 dentry_blk = inline_data_addr(ipage);
454 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
455 slots, NR_INLINE_DENTRY);
456 if (bit_pos >= NR_INLINE_DENTRY) {
457 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
465 down_write(&F2FS_I(inode)->i_sem);
466 page = init_inode_metadata(inode, dir, name, ipage);
473 f2fs_wait_on_page_writeback(ipage, NODE, true);
475 name_hash = f2fs_dentry_hash(name);
476 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
477 f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
479 set_page_dirty(ipage);
481 /* we don't need to mark_inode_dirty now */
483 F2FS_I(inode)->i_pino = dir->i_ino;
484 update_inode(inode, page);
485 f2fs_put_page(page, 1);
488 update_parent_metadata(dir, inode, 0);
491 up_write(&F2FS_I(inode)->i_sem);
493 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
494 update_inode(dir, ipage);
495 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
498 f2fs_put_page(ipage, 1);
502 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
503 struct inode *dir, struct inode *inode)
505 struct f2fs_inline_dentry *inline_dentry;
506 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
507 unsigned int bit_pos;
511 f2fs_wait_on_page_writeback(page, NODE, true);
513 inline_dentry = inline_data_addr(page);
514 bit_pos = dentry - inline_dentry->dentry;
515 for (i = 0; i < slots; i++)
516 test_and_clear_bit_le(bit_pos + i,
517 &inline_dentry->dentry_bitmap);
519 set_page_dirty(page);
521 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
524 f2fs_drop_nlink(dir, inode, page);
526 f2fs_put_page(page, 1);
529 bool f2fs_empty_inline_dir(struct inode *dir)
531 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
533 unsigned int bit_pos = 2;
534 struct f2fs_inline_dentry *dentry_blk;
536 ipage = get_node_page(sbi, dir->i_ino);
540 dentry_blk = inline_data_addr(ipage);
541 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
545 f2fs_put_page(ipage, 1);
547 if (bit_pos < NR_INLINE_DENTRY)
553 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
554 struct f2fs_str *fstr)
556 struct inode *inode = file_inode(file);
557 struct f2fs_inline_dentry *inline_dentry = NULL;
558 struct page *ipage = NULL;
559 struct f2fs_dentry_ptr d;
561 if (ctx->pos == NR_INLINE_DENTRY)
564 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
566 return PTR_ERR(ipage);
568 inline_dentry = inline_data_addr(ipage);
570 make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
572 if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
573 ctx->pos = NR_INLINE_DENTRY;
575 f2fs_put_page(ipage, 1);
579 int f2fs_inline_data_fiemap(struct inode *inode,
580 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
582 __u64 byteaddr, ilen;
583 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
589 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
591 return PTR_ERR(ipage);
593 if (!f2fs_has_inline_data(inode)) {
598 ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
601 if (start + len < ilen)
605 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
606 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
607 byteaddr += (char *)inline_data_addr(ipage) - (char *)F2FS_INODE(ipage);
608 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
610 f2fs_put_page(ipage, 1);