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)
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);
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_wait_on_page_writeback(page, DATA);
129 if (PageUptodate(page))
132 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
134 /* Copy the whole inline data block */
135 src_addr = inline_data_addr(dn->inode_page);
136 dst_addr = kmap_atomic(page);
137 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
138 flush_dcache_page(page);
139 kunmap_atomic(dst_addr);
140 SetPageUptodate(page);
142 set_page_dirty(page);
144 /* clear dirty state */
145 dirty = clear_page_dirty_for_io(page);
147 /* write data page to try to make data consistent */
148 set_page_writeback(page);
149 fio.blk_addr = dn->data_blkaddr;
150 write_data_page(dn, &fio);
151 set_data_blkaddr(dn);
152 f2fs_update_extent_cache(dn);
153 f2fs_wait_on_page_writeback(page, DATA);
155 inode_dec_dirty_pages(dn->inode);
157 /* this converted inline_data should be recovered. */
158 set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
160 /* clear inline data and flag after data writeback */
161 truncate_inline_inode(dn->inode_page, 0);
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);
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);
240 bool recover_inline_data(struct inode *inode, struct page *npage)
242 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
243 struct f2fs_inode *ri = NULL;
244 void *src_addr, *dst_addr;
248 * The inline_data recovery policy is as follows.
249 * [prev.] [next] of inline_data flag
250 * o o -> recover inline_data
251 * o x -> remove inline_data, and then recover data blocks
252 * x o -> remove inline_data, and then recover inline_data
253 * x x -> recover data blocks
256 ri = F2FS_INODE(npage);
258 if (f2fs_has_inline_data(inode) &&
259 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
261 ipage = get_node_page(sbi, inode->i_ino);
262 f2fs_bug_on(sbi, IS_ERR(ipage));
264 f2fs_wait_on_page_writeback(ipage, NODE);
266 src_addr = inline_data_addr(npage);
267 dst_addr = inline_data_addr(ipage);
268 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
270 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
271 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
273 update_inode(inode, ipage);
274 f2fs_put_page(ipage, 1);
278 if (f2fs_has_inline_data(inode)) {
279 ipage = get_node_page(sbi, inode->i_ino);
280 f2fs_bug_on(sbi, IS_ERR(ipage));
281 if (!truncate_inline_inode(ipage, 0))
283 f2fs_clear_inline_inode(inode);
284 update_inode(inode, ipage);
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 f2fs_filename *fname, struct page **res_page)
297 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
298 struct f2fs_inline_dentry *inline_dentry;
299 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
300 struct f2fs_dir_entry *de;
301 struct f2fs_dentry_ptr d;
303 f2fs_hash_t namehash;
305 ipage = get_node_page(sbi, dir->i_ino);
309 namehash = f2fs_dentry_hash(&name);
311 inline_dentry = inline_data_addr(ipage);
313 make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
314 de = find_target_dentry(fname, namehash, NULL, &d);
319 f2fs_put_page(ipage, 0);
322 * For the most part, it should be a bug when name_len is zero.
323 * We stop here for figuring out where the bugs has occurred.
325 f2fs_bug_on(sbi, d.max < 0);
329 struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
332 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
334 struct f2fs_dir_entry *de;
335 struct f2fs_inline_dentry *dentry_blk;
337 ipage = get_node_page(sbi, dir->i_ino);
341 dentry_blk = inline_data_addr(ipage);
342 de = &dentry_blk->dentry[1];
348 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
351 struct f2fs_inline_dentry *dentry_blk;
352 struct f2fs_dentry_ptr d;
354 dentry_blk = inline_data_addr(ipage);
356 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
357 do_make_empty_dir(inode, parent, &d);
359 set_page_dirty(ipage);
361 /* update i_size to MAX_INLINE_DATA */
362 if (i_size_read(inode) < MAX_INLINE_DATA) {
363 i_size_write(inode, MAX_INLINE_DATA);
364 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
370 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
371 * release ipage in this function.
373 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
374 struct f2fs_inline_dentry *inline_dentry)
377 struct dnode_of_data dn;
378 struct f2fs_dentry_block *dentry_blk;
381 page = grab_cache_page(dir->i_mapping, 0);
383 f2fs_put_page(ipage, 1);
387 set_new_dnode(&dn, dir, ipage, NULL, 0);
388 err = f2fs_reserve_block(&dn, 0);
392 f2fs_wait_on_page_writeback(page, DATA);
393 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
395 dentry_blk = kmap_atomic(page);
397 /* copy data from inline dentry block to new dentry block */
398 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
399 INLINE_DENTRY_BITMAP_SIZE);
400 memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
401 SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
403 * we do not need to zero out remainder part of dentry and filename
404 * field, since we have used bitmap for marking the usage status of
405 * them, besides, we can also ignore copying/zeroing reserved space
406 * of dentry block, because them haven't been used so far.
408 memcpy(dentry_blk->dentry, inline_dentry->dentry,
409 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
410 memcpy(dentry_blk->filename, inline_dentry->filename,
411 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
413 kunmap_atomic(dentry_blk);
414 SetPageUptodate(page);
415 set_page_dirty(page);
417 /* clear inline dir and flag after data writeback */
418 truncate_inline_inode(ipage, 0);
420 stat_dec_inline_dir(dir);
421 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
423 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
424 i_size_write(dir, PAGE_CACHE_SIZE);
425 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
428 sync_inode_page(&dn);
430 f2fs_put_page(page, 1);
434 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
435 struct inode *inode, nid_t ino, umode_t mode)
437 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
439 unsigned int bit_pos;
440 f2fs_hash_t name_hash;
441 size_t namelen = name->len;
442 struct f2fs_inline_dentry *dentry_blk = NULL;
443 struct f2fs_dentry_ptr d;
444 int slots = GET_DENTRY_SLOTS(namelen);
445 struct page *page = NULL;
448 ipage = get_node_page(sbi, dir->i_ino);
450 return PTR_ERR(ipage);
452 dentry_blk = inline_data_addr(ipage);
453 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
454 slots, NR_INLINE_DENTRY);
455 if (bit_pos >= NR_INLINE_DENTRY) {
456 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
464 down_write(&F2FS_I(inode)->i_sem);
465 page = init_inode_metadata(inode, dir, name, ipage);
472 f2fs_wait_on_page_writeback(ipage, NODE);
474 name_hash = f2fs_dentry_hash(name);
475 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
476 f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
478 set_page_dirty(ipage);
480 /* we don't need to mark_inode_dirty now */
482 F2FS_I(inode)->i_pino = dir->i_ino;
483 update_inode(inode, page);
484 f2fs_put_page(page, 1);
487 update_parent_metadata(dir, inode, 0);
490 up_write(&F2FS_I(inode)->i_sem);
492 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
493 update_inode(dir, ipage);
494 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
497 f2fs_put_page(ipage, 1);
501 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
502 struct inode *dir, struct inode *inode)
504 struct f2fs_inline_dentry *inline_dentry;
505 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
506 unsigned int bit_pos;
510 f2fs_wait_on_page_writeback(page, NODE);
512 inline_dentry = inline_data_addr(page);
513 bit_pos = dentry - inline_dentry->dentry;
514 for (i = 0; i < slots; i++)
515 test_and_clear_bit_le(bit_pos + i,
516 &inline_dentry->dentry_bitmap);
518 set_page_dirty(page);
520 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
523 f2fs_drop_nlink(dir, inode, page);
525 f2fs_put_page(page, 1);
528 bool f2fs_empty_inline_dir(struct inode *dir)
530 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
532 unsigned int bit_pos = 2;
533 struct f2fs_inline_dentry *dentry_blk;
535 ipage = get_node_page(sbi, dir->i_ino);
539 dentry_blk = inline_data_addr(ipage);
540 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
544 f2fs_put_page(ipage, 1);
546 if (bit_pos < NR_INLINE_DENTRY)
552 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
553 struct f2fs_str *fstr)
555 struct inode *inode = file_inode(file);
556 struct f2fs_inline_dentry *inline_dentry = NULL;
557 struct page *ipage = NULL;
558 struct f2fs_dentry_ptr d;
560 if (ctx->pos == NR_INLINE_DENTRY)
563 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
565 return PTR_ERR(ipage);
567 inline_dentry = inline_data_addr(ipage);
569 make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
571 if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
572 ctx->pos = NR_INLINE_DENTRY;
574 f2fs_put_page(ipage, 1);
578 int f2fs_inline_data_fiemap(struct inode *inode,
579 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
581 __u64 byteaddr, ilen;
582 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
588 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
590 return PTR_ERR(ipage);
592 if (!f2fs_has_inline_data(inode)) {
597 ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
600 if (start + len < ilen)
604 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
605 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
606 byteaddr += (char *)inline_data_addr(ipage) - (char *)F2FS_INODE(ipage);
607 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
609 f2fs_put_page(ipage, 1);