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>
16 #include <trace/events/android_fs.h>
18 bool f2fs_may_inline_data(struct inode *inode)
20 if (!test_opt(F2FS_I_SB(inode), INLINE_DATA))
23 if (f2fs_is_atomic_file(inode))
26 if (!S_ISREG(inode->i_mode) && !S_ISLNK(inode->i_mode))
29 if (i_size_read(inode) > MAX_INLINE_DATA)
32 if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
38 bool f2fs_may_inline_dentry(struct inode *inode)
40 if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
43 if (!S_ISDIR(inode->i_mode))
49 void read_inline_data(struct page *page, struct page *ipage)
51 void *src_addr, *dst_addr;
53 if (PageUptodate(page))
56 f2fs_bug_on(F2FS_P_SB(page), page->index);
58 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
60 /* Copy the whole inline data block */
61 src_addr = inline_data_addr(ipage);
62 dst_addr = kmap_atomic(page);
63 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
64 flush_dcache_page(page);
65 kunmap_atomic(dst_addr);
66 SetPageUptodate(page);
69 bool truncate_inline_inode(struct page *ipage, u64 from)
73 if (from >= MAX_INLINE_DATA)
76 addr = inline_data_addr(ipage);
78 f2fs_wait_on_page_writeback(ipage, NODE);
79 memset(addr + from, 0, MAX_INLINE_DATA - from);
84 int f2fs_read_inline_data(struct inode *inode, struct page *page)
88 if (trace_android_fs_dataread_start_enabled()) {
89 char *path, pathbuf[MAX_TRACE_PATHBUF_LEN];
91 path = android_fstrace_get_pathname(pathbuf,
92 MAX_TRACE_PATHBUF_LEN,
94 trace_android_fs_dataread_start(inode, page_offset(page),
95 PAGE_SIZE, current->pid,
99 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
101 trace_android_fs_dataread_end(inode, page_offset(page),
104 return PTR_ERR(ipage);
107 if (!f2fs_has_inline_data(inode)) {
108 f2fs_put_page(ipage, 1);
109 trace_android_fs_dataread_end(inode, page_offset(page),
115 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
117 read_inline_data(page, ipage);
119 SetPageUptodate(page);
120 f2fs_put_page(ipage, 1);
121 trace_android_fs_dataread_end(inode, page_offset(page),
127 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
129 void *src_addr, *dst_addr;
130 struct f2fs_io_info fio = {
131 .sbi = F2FS_I_SB(dn->inode),
133 .rw = WRITE_SYNC | REQ_PRIO,
135 .encrypted_page = NULL,
139 f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
141 if (!f2fs_exist_data(dn->inode))
144 err = f2fs_reserve_block(dn, 0);
148 f2fs_wait_on_page_writeback(page, DATA);
150 if (PageUptodate(page))
153 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
155 /* Copy the whole inline data block */
156 src_addr = inline_data_addr(dn->inode_page);
157 dst_addr = kmap_atomic(page);
158 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
159 flush_dcache_page(page);
160 kunmap_atomic(dst_addr);
161 SetPageUptodate(page);
163 set_page_dirty(page);
165 /* clear dirty state */
166 dirty = clear_page_dirty_for_io(page);
168 /* write data page to try to make data consistent */
169 set_page_writeback(page);
170 fio.blk_addr = dn->data_blkaddr;
171 write_data_page(dn, &fio);
172 set_data_blkaddr(dn);
173 f2fs_update_extent_cache(dn);
174 f2fs_wait_on_page_writeback(page, DATA);
176 inode_dec_dirty_pages(dn->inode);
178 /* this converted inline_data should be recovered. */
179 set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
181 /* clear inline data and flag after data writeback */
182 truncate_inline_inode(dn->inode_page, 0);
184 stat_dec_inline_inode(dn->inode);
185 f2fs_clear_inline_inode(dn->inode);
191 int f2fs_convert_inline_inode(struct inode *inode)
193 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
194 struct dnode_of_data dn;
195 struct page *ipage, *page;
198 page = grab_cache_page(inode->i_mapping, 0);
204 ipage = get_node_page(sbi, inode->i_ino);
206 err = PTR_ERR(ipage);
210 set_new_dnode(&dn, inode, ipage, ipage, 0);
212 if (f2fs_has_inline_data(inode))
213 err = f2fs_convert_inline_page(&dn, page);
219 f2fs_put_page(page, 1);
223 int f2fs_write_inline_data(struct inode *inode, struct page *page)
225 void *src_addr, *dst_addr;
226 struct dnode_of_data dn;
229 set_new_dnode(&dn, inode, NULL, NULL, 0);
230 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
234 if (!f2fs_has_inline_data(inode)) {
239 f2fs_bug_on(F2FS_I_SB(inode), page->index);
241 f2fs_wait_on_page_writeback(dn.inode_page, NODE);
242 src_addr = kmap_atomic(page);
243 dst_addr = inline_data_addr(dn.inode_page);
244 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
245 kunmap_atomic(src_addr);
247 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
248 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
250 sync_inode_page(&dn);
255 bool recover_inline_data(struct inode *inode, struct page *npage)
257 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
258 struct f2fs_inode *ri = NULL;
259 void *src_addr, *dst_addr;
263 * The inline_data recovery policy is as follows.
264 * [prev.] [next] of inline_data flag
265 * o o -> recover inline_data
266 * o x -> remove inline_data, and then recover data blocks
267 * x o -> remove inline_data, and then recover inline_data
268 * x x -> recover data blocks
271 ri = F2FS_INODE(npage);
273 if (f2fs_has_inline_data(inode) &&
274 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
276 ipage = get_node_page(sbi, inode->i_ino);
277 f2fs_bug_on(sbi, IS_ERR(ipage));
279 f2fs_wait_on_page_writeback(ipage, NODE);
281 src_addr = inline_data_addr(npage);
282 dst_addr = inline_data_addr(ipage);
283 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
285 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
286 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
288 update_inode(inode, ipage);
289 f2fs_put_page(ipage, 1);
293 if (f2fs_has_inline_data(inode)) {
294 ipage = get_node_page(sbi, inode->i_ino);
295 f2fs_bug_on(sbi, IS_ERR(ipage));
296 if (!truncate_inline_inode(ipage, 0))
298 f2fs_clear_inline_inode(inode);
299 update_inode(inode, ipage);
300 f2fs_put_page(ipage, 1);
301 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
302 if (truncate_blocks(inode, 0, false))
309 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
310 struct f2fs_filename *fname, struct page **res_page)
312 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
313 struct f2fs_inline_dentry *inline_dentry;
314 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
315 struct f2fs_dir_entry *de;
316 struct f2fs_dentry_ptr d;
318 f2fs_hash_t namehash;
320 ipage = get_node_page(sbi, dir->i_ino);
324 namehash = f2fs_dentry_hash(&name);
326 inline_dentry = inline_data_addr(ipage);
328 make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
329 de = find_target_dentry(fname, namehash, NULL, &d);
334 f2fs_put_page(ipage, 0);
337 * For the most part, it should be a bug when name_len is zero.
338 * We stop here for figuring out where the bugs has occurred.
340 f2fs_bug_on(sbi, d.max < 0);
344 struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
347 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
349 struct f2fs_dir_entry *de;
350 struct f2fs_inline_dentry *dentry_blk;
352 ipage = get_node_page(sbi, dir->i_ino);
356 dentry_blk = inline_data_addr(ipage);
357 de = &dentry_blk->dentry[1];
363 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
366 struct f2fs_inline_dentry *dentry_blk;
367 struct f2fs_dentry_ptr d;
369 dentry_blk = inline_data_addr(ipage);
371 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
372 do_make_empty_dir(inode, parent, &d);
374 set_page_dirty(ipage);
376 /* update i_size to MAX_INLINE_DATA */
377 if (i_size_read(inode) < MAX_INLINE_DATA) {
378 i_size_write(inode, MAX_INLINE_DATA);
379 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
385 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
386 * release ipage in this function.
388 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
389 struct f2fs_inline_dentry *inline_dentry)
392 struct dnode_of_data dn;
393 struct f2fs_dentry_block *dentry_blk;
396 page = grab_cache_page(dir->i_mapping, 0);
398 f2fs_put_page(ipage, 1);
402 set_new_dnode(&dn, dir, ipage, NULL, 0);
403 err = f2fs_reserve_block(&dn, 0);
407 f2fs_wait_on_page_writeback(page, DATA);
408 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
410 dentry_blk = kmap_atomic(page);
412 /* copy data from inline dentry block to new dentry block */
413 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
414 INLINE_DENTRY_BITMAP_SIZE);
415 memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
416 SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
418 * we do not need to zero out remainder part of dentry and filename
419 * field, since we have used bitmap for marking the usage status of
420 * them, besides, we can also ignore copying/zeroing reserved space
421 * of dentry block, because them haven't been used so far.
423 memcpy(dentry_blk->dentry, inline_dentry->dentry,
424 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
425 memcpy(dentry_blk->filename, inline_dentry->filename,
426 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
428 kunmap_atomic(dentry_blk);
429 SetPageUptodate(page);
430 set_page_dirty(page);
432 /* clear inline dir and flag after data writeback */
433 truncate_inline_inode(ipage, 0);
435 stat_dec_inline_dir(dir);
436 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
438 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
439 i_size_write(dir, PAGE_CACHE_SIZE);
440 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
443 sync_inode_page(&dn);
445 f2fs_put_page(page, 1);
449 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
450 struct inode *inode, nid_t ino, umode_t mode)
452 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
454 unsigned int bit_pos;
455 f2fs_hash_t name_hash;
456 size_t namelen = name->len;
457 struct f2fs_inline_dentry *dentry_blk = NULL;
458 struct f2fs_dentry_ptr d;
459 int slots = GET_DENTRY_SLOTS(namelen);
460 struct page *page = NULL;
463 ipage = get_node_page(sbi, dir->i_ino);
465 return PTR_ERR(ipage);
467 dentry_blk = inline_data_addr(ipage);
468 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
469 slots, NR_INLINE_DENTRY);
470 if (bit_pos >= NR_INLINE_DENTRY) {
471 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
479 down_write(&F2FS_I(inode)->i_sem);
480 page = init_inode_metadata(inode, dir, name, ipage);
487 f2fs_wait_on_page_writeback(ipage, NODE);
489 name_hash = f2fs_dentry_hash(name);
490 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
491 f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
493 set_page_dirty(ipage);
495 /* we don't need to mark_inode_dirty now */
497 F2FS_I(inode)->i_pino = dir->i_ino;
498 update_inode(inode, page);
499 f2fs_put_page(page, 1);
502 update_parent_metadata(dir, inode, 0);
505 up_write(&F2FS_I(inode)->i_sem);
507 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
508 update_inode(dir, ipage);
509 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
512 f2fs_put_page(ipage, 1);
516 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
517 struct inode *dir, struct inode *inode)
519 struct f2fs_inline_dentry *inline_dentry;
520 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
521 unsigned int bit_pos;
525 f2fs_wait_on_page_writeback(page, NODE);
527 inline_dentry = inline_data_addr(page);
528 bit_pos = dentry - inline_dentry->dentry;
529 for (i = 0; i < slots; i++)
530 test_and_clear_bit_le(bit_pos + i,
531 &inline_dentry->dentry_bitmap);
533 set_page_dirty(page);
535 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
538 f2fs_drop_nlink(dir, inode, page);
540 f2fs_put_page(page, 1);
543 bool f2fs_empty_inline_dir(struct inode *dir)
545 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
547 unsigned int bit_pos = 2;
548 struct f2fs_inline_dentry *dentry_blk;
550 ipage = get_node_page(sbi, dir->i_ino);
554 dentry_blk = inline_data_addr(ipage);
555 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
559 f2fs_put_page(ipage, 1);
561 if (bit_pos < NR_INLINE_DENTRY)
567 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
568 struct f2fs_str *fstr)
570 struct inode *inode = file_inode(file);
571 struct f2fs_inline_dentry *inline_dentry = NULL;
572 struct page *ipage = NULL;
573 struct f2fs_dentry_ptr d;
575 if (ctx->pos == NR_INLINE_DENTRY)
578 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
580 return PTR_ERR(ipage);
582 inline_dentry = inline_data_addr(ipage);
584 make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
586 if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
587 ctx->pos = NR_INLINE_DENTRY;
589 f2fs_put_page(ipage, 1);
593 int f2fs_inline_data_fiemap(struct inode *inode,
594 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
596 __u64 byteaddr, ilen;
597 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
603 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
605 return PTR_ERR(ipage);
607 if (!f2fs_has_inline_data(inode)) {
612 ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
615 if (start + len < ilen)
619 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
620 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
621 byteaddr += (char *)inline_data_addr(ipage) - (char *)F2FS_INODE(ipage);
622 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
624 f2fs_put_page(ipage, 1);