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 (f2fs_is_atomic_file(inode
))
23 if (!S_ISREG(inode
->i_mode
) && !S_ISLNK(inode
->i_mode
))
26 if (i_size_read(inode
) > MAX_INLINE_DATA(inode
))
29 if (f2fs_encrypted_file(inode
))
35 bool f2fs_may_inline_dentry(struct inode
*inode
)
37 if (!test_opt(F2FS_I_SB(inode
), INLINE_DENTRY
))
40 if (!S_ISDIR(inode
->i_mode
))
46 void read_inline_data(struct page
*page
, struct page
*ipage
)
48 struct inode
*inode
= page
->mapping
->host
;
49 void *src_addr
, *dst_addr
;
51 if (PageUptodate(page
))
54 f2fs_bug_on(F2FS_P_SB(page
), page
->index
);
56 zero_user_segment(page
, MAX_INLINE_DATA(inode
), PAGE_SIZE
);
58 /* Copy the whole inline data block */
59 src_addr
= inline_data_addr(inode
, ipage
);
60 dst_addr
= kmap_atomic(page
);
61 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA(inode
));
62 flush_dcache_page(page
);
63 kunmap_atomic(dst_addr
);
64 if (!PageUptodate(page
))
65 SetPageUptodate(page
);
68 void truncate_inline_inode(struct inode
*inode
, struct page
*ipage
, u64 from
)
72 if (from
>= MAX_INLINE_DATA(inode
))
75 addr
= inline_data_addr(inode
, ipage
);
77 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
78 memset(addr
+ from
, 0, MAX_INLINE_DATA(inode
) - from
);
79 set_page_dirty(ipage
);
82 clear_inode_flag(inode
, FI_DATA_EXIST
);
85 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
89 if (trace_android_fs_dataread_start_enabled()) {
90 char *path
, pathbuf
[MAX_TRACE_PATHBUF_LEN
];
92 path
= android_fstrace_get_pathname(pathbuf
,
93 MAX_TRACE_PATHBUF_LEN
,
95 trace_android_fs_dataread_start(inode
, page_offset(page
),
96 PAGE_SIZE
, current
->pid
,
100 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
102 trace_android_fs_dataread_end(inode
, page_offset(page
),
105 return PTR_ERR(ipage
);
108 if (!f2fs_has_inline_data(inode
)) {
109 f2fs_put_page(ipage
, 1);
110 trace_android_fs_dataread_end(inode
, page_offset(page
),
116 zero_user_segment(page
, 0, PAGE_SIZE
);
118 read_inline_data(page
, ipage
);
120 if (!PageUptodate(page
))
121 SetPageUptodate(page
);
122 f2fs_put_page(ipage
, 1);
123 trace_android_fs_dataread_end(inode
, page_offset(page
),
129 int f2fs_convert_inline_page(struct dnode_of_data
*dn
, struct page
*page
)
131 struct f2fs_io_info fio
= {
132 .sbi
= F2FS_I_SB(dn
->inode
),
135 .op_flags
= REQ_SYNC
| REQ_NOIDLE
| REQ_PRIO
,
137 .encrypted_page
= NULL
,
138 .io_type
= FS_DATA_IO
,
142 if (!f2fs_exist_data(dn
->inode
))
145 err
= f2fs_reserve_block(dn
, 0);
149 f2fs_bug_on(F2FS_P_SB(page
), PageWriteback(page
));
151 read_inline_data(page
, dn
->inode_page
);
152 set_page_dirty(page
);
154 /* clear dirty state */
155 dirty
= clear_page_dirty_for_io(page
);
157 /* write data page to try to make data consistent */
158 set_page_writeback(page
);
159 fio
.old_blkaddr
= dn
->data_blkaddr
;
160 set_inode_flag(dn
->inode
, FI_HOT_DATA
);
161 write_data_page(dn
, &fio
);
162 f2fs_wait_on_page_writeback(page
, DATA
, true);
164 inode_dec_dirty_pages(dn
->inode
);
165 remove_dirty_inode(dn
->inode
);
168 /* this converted inline_data should be recovered. */
169 set_inode_flag(dn
->inode
, FI_APPEND_WRITE
);
171 /* clear inline data and flag after data writeback */
172 truncate_inline_inode(dn
->inode
, dn
->inode_page
, 0);
173 clear_inline_node(dn
->inode_page
);
175 stat_dec_inline_inode(dn
->inode
);
176 clear_inode_flag(dn
->inode
, FI_INLINE_DATA
);
181 int f2fs_convert_inline_inode(struct inode
*inode
)
183 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
184 struct dnode_of_data dn
;
185 struct page
*ipage
, *page
;
188 if (!f2fs_has_inline_data(inode
))
191 page
= f2fs_grab_cache_page(inode
->i_mapping
, 0, false);
197 ipage
= get_node_page(sbi
, inode
->i_ino
);
199 err
= PTR_ERR(ipage
);
203 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
205 if (f2fs_has_inline_data(inode
))
206 err
= f2fs_convert_inline_page(&dn
, page
);
212 f2fs_put_page(page
, 1);
214 f2fs_balance_fs(sbi
, dn
.node_changed
);
219 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
221 void *src_addr
, *dst_addr
;
222 struct dnode_of_data dn
;
223 struct address_space
*mapping
= page_mapping(page
);
227 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
228 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
232 if (!f2fs_has_inline_data(inode
)) {
237 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
239 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
, true);
240 src_addr
= kmap_atomic(page
);
241 dst_addr
= inline_data_addr(inode
, dn
.inode_page
);
242 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA(inode
));
243 kunmap_atomic(src_addr
);
244 set_page_dirty(dn
.inode_page
);
246 spin_lock_irqsave(&mapping
->tree_lock
, flags
);
247 radix_tree_tag_clear(&mapping
->page_tree
, page_index(page
),
248 PAGECACHE_TAG_DIRTY
);
249 spin_unlock_irqrestore(&mapping
->tree_lock
, flags
);
251 set_inode_flag(inode
, FI_APPEND_WRITE
);
252 set_inode_flag(inode
, FI_DATA_EXIST
);
254 clear_inline_node(dn
.inode_page
);
259 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
261 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
262 struct f2fs_inode
*ri
= NULL
;
263 void *src_addr
, *dst_addr
;
267 * The inline_data recovery policy is as follows.
268 * [prev.] [next] of inline_data flag
269 * o o -> recover inline_data
270 * o x -> remove inline_data, and then recover data blocks
271 * x o -> remove inline_data, and then recover inline_data
272 * x x -> recover data blocks
275 ri
= F2FS_INODE(npage
);
277 if (f2fs_has_inline_data(inode
) &&
278 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
280 ipage
= get_node_page(sbi
, inode
->i_ino
);
281 f2fs_bug_on(sbi
, IS_ERR(ipage
));
283 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
285 src_addr
= inline_data_addr(inode
, npage
);
286 dst_addr
= inline_data_addr(inode
, ipage
);
287 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA(inode
));
289 set_inode_flag(inode
, FI_INLINE_DATA
);
290 set_inode_flag(inode
, FI_DATA_EXIST
);
292 set_page_dirty(ipage
);
293 f2fs_put_page(ipage
, 1);
297 if (f2fs_has_inline_data(inode
)) {
298 ipage
= get_node_page(sbi
, inode
->i_ino
);
299 f2fs_bug_on(sbi
, IS_ERR(ipage
));
300 truncate_inline_inode(inode
, ipage
, 0);
301 clear_inode_flag(inode
, FI_INLINE_DATA
);
302 f2fs_put_page(ipage
, 1);
303 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
304 if (truncate_blocks(inode
, 0, false))
311 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
312 struct fscrypt_name
*fname
, struct page
**res_page
)
314 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
315 struct qstr name
= FSTR_TO_QSTR(&fname
->disk_name
);
316 struct f2fs_dir_entry
*de
;
317 struct f2fs_dentry_ptr d
;
320 f2fs_hash_t namehash
;
322 ipage
= get_node_page(sbi
, dir
->i_ino
);
328 namehash
= f2fs_dentry_hash(&name
, fname
);
330 inline_dentry
= inline_data_addr(dir
, ipage
);
332 make_dentry_ptr_inline(dir
, &d
, inline_dentry
);
333 de
= find_target_dentry(fname
, namehash
, NULL
, &d
);
338 f2fs_put_page(ipage
, 0);
343 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
346 struct f2fs_dentry_ptr d
;
349 inline_dentry
= inline_data_addr(inode
, ipage
);
351 make_dentry_ptr_inline(inode
, &d
, inline_dentry
);
352 do_make_empty_dir(inode
, parent
, &d
);
354 set_page_dirty(ipage
);
356 /* update i_size to MAX_INLINE_DATA */
357 if (i_size_read(inode
) < MAX_INLINE_DATA(inode
))
358 f2fs_i_size_write(inode
, MAX_INLINE_DATA(inode
));
363 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
364 * release ipage in this function.
366 static int f2fs_move_inline_dirents(struct inode
*dir
, struct page
*ipage
,
370 struct dnode_of_data dn
;
371 struct f2fs_dentry_block
*dentry_blk
;
372 struct f2fs_dentry_ptr src
, dst
;
375 page
= f2fs_grab_cache_page(dir
->i_mapping
, 0, false);
377 f2fs_put_page(ipage
, 1);
381 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
382 err
= f2fs_reserve_block(&dn
, 0);
386 f2fs_wait_on_page_writeback(page
, DATA
, true);
387 zero_user_segment(page
, MAX_INLINE_DATA(dir
), PAGE_SIZE
);
389 dentry_blk
= kmap_atomic(page
);
391 make_dentry_ptr_inline(dir
, &src
, inline_dentry
);
392 make_dentry_ptr_block(dir
, &dst
, dentry_blk
);
394 /* copy data from inline dentry block to new dentry block */
395 memcpy(dst
.bitmap
, src
.bitmap
, src
.nr_bitmap
);
396 memset(dst
.bitmap
+ src
.nr_bitmap
, 0, dst
.nr_bitmap
- src
.nr_bitmap
);
398 * we do not need to zero out remainder part of dentry and filename
399 * field, since we have used bitmap for marking the usage status of
400 * them, besides, we can also ignore copying/zeroing reserved space
401 * of dentry block, because them haven't been used so far.
403 memcpy(dst
.dentry
, src
.dentry
, SIZE_OF_DIR_ENTRY
* src
.max
);
404 memcpy(dst
.filename
, src
.filename
, src
.max
* F2FS_SLOT_LEN
);
406 kunmap_atomic(dentry_blk
);
407 if (!PageUptodate(page
))
408 SetPageUptodate(page
);
409 set_page_dirty(page
);
411 /* clear inline dir and flag after data writeback */
412 truncate_inline_inode(dir
, ipage
, 0);
414 stat_dec_inline_dir(dir
);
415 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
417 f2fs_i_depth_write(dir
, 1);
418 if (i_size_read(dir
) < PAGE_SIZE
)
419 f2fs_i_size_write(dir
, PAGE_SIZE
);
421 f2fs_put_page(page
, 1);
425 static int f2fs_add_inline_entries(struct inode
*dir
, void *inline_dentry
)
427 struct f2fs_dentry_ptr d
;
428 unsigned long bit_pos
= 0;
431 make_dentry_ptr_inline(dir
, &d
, inline_dentry
);
433 while (bit_pos
< d
.max
) {
434 struct f2fs_dir_entry
*de
;
435 struct qstr new_name
;
439 if (!test_bit_le(bit_pos
, d
.bitmap
)) {
444 de
= &d
.dentry
[bit_pos
];
446 if (unlikely(!de
->name_len
)) {
451 new_name
.name
= d
.filename
[bit_pos
];
452 new_name
.len
= le16_to_cpu(de
->name_len
);
454 ino
= le32_to_cpu(de
->ino
);
455 fake_mode
= get_de_type(de
) << S_SHIFT
;
457 err
= f2fs_add_regular_entry(dir
, &new_name
, NULL
, NULL
,
460 goto punch_dentry_pages
;
462 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
466 truncate_inode_pages(&dir
->i_data
, 0);
467 truncate_blocks(dir
, 0, false);
468 remove_dirty_inode(dir
);
472 static int f2fs_move_rehashed_dirents(struct inode
*dir
, struct page
*ipage
,
478 backup_dentry
= f2fs_kmalloc(F2FS_I_SB(dir
),
479 MAX_INLINE_DATA(dir
), GFP_F2FS_ZERO
);
480 if (!backup_dentry
) {
481 f2fs_put_page(ipage
, 1);
485 memcpy(backup_dentry
, inline_dentry
, MAX_INLINE_DATA(dir
));
486 truncate_inline_inode(dir
, ipage
, 0);
490 err
= f2fs_add_inline_entries(dir
, backup_dentry
);
496 stat_dec_inline_dir(dir
);
497 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
498 kfree(backup_dentry
);
502 memcpy(inline_dentry
, backup_dentry
, MAX_INLINE_DATA(dir
));
503 f2fs_i_depth_write(dir
, 0);
504 f2fs_i_size_write(dir
, MAX_INLINE_DATA(dir
));
505 set_page_dirty(ipage
);
506 f2fs_put_page(ipage
, 1);
508 kfree(backup_dentry
);
512 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
515 if (!F2FS_I(dir
)->i_dir_level
)
516 return f2fs_move_inline_dirents(dir
, ipage
, inline_dentry
);
518 return f2fs_move_rehashed_dirents(dir
, ipage
, inline_dentry
);
521 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*new_name
,
522 const struct qstr
*orig_name
,
523 struct inode
*inode
, nid_t ino
, umode_t mode
)
525 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
527 unsigned int bit_pos
;
528 f2fs_hash_t name_hash
;
529 void *inline_dentry
= NULL
;
530 struct f2fs_dentry_ptr d
;
531 int slots
= GET_DENTRY_SLOTS(new_name
->len
);
532 struct page
*page
= NULL
;
535 ipage
= get_node_page(sbi
, dir
->i_ino
);
537 return PTR_ERR(ipage
);
539 inline_dentry
= inline_data_addr(dir
, ipage
);
540 make_dentry_ptr_inline(dir
, &d
, inline_dentry
);
542 bit_pos
= room_for_filename(d
.bitmap
, slots
, d
.max
);
543 if (bit_pos
>= d
.max
) {
544 err
= f2fs_convert_inline_dir(dir
, ipage
, inline_dentry
);
552 down_write(&F2FS_I(inode
)->i_sem
);
553 page
= init_inode_metadata(inode
, dir
, new_name
,
561 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
563 name_hash
= f2fs_dentry_hash(new_name
, NULL
);
564 f2fs_update_dentry(ino
, mode
, &d
, new_name
, name_hash
, bit_pos
);
566 set_page_dirty(ipage
);
568 /* we don't need to mark_inode_dirty now */
570 f2fs_i_pino_write(inode
, dir
->i_ino
);
571 f2fs_put_page(page
, 1);
574 update_parent_metadata(dir
, inode
, 0);
577 up_write(&F2FS_I(inode
)->i_sem
);
579 f2fs_put_page(ipage
, 1);
583 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
584 struct inode
*dir
, struct inode
*inode
)
586 struct f2fs_dentry_ptr d
;
588 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
589 unsigned int bit_pos
;
593 f2fs_wait_on_page_writeback(page
, NODE
, true);
595 inline_dentry
= inline_data_addr(dir
, page
);
596 make_dentry_ptr_inline(dir
, &d
, inline_dentry
);
598 bit_pos
= dentry
- d
.dentry
;
599 for (i
= 0; i
< slots
; i
++)
600 __clear_bit_le(bit_pos
+ i
, d
.bitmap
);
602 set_page_dirty(page
);
603 f2fs_put_page(page
, 1);
605 dir
->i_ctime
= dir
->i_mtime
= current_time(dir
);
606 f2fs_mark_inode_dirty_sync(dir
, false);
609 f2fs_drop_nlink(dir
, inode
);
612 bool f2fs_empty_inline_dir(struct inode
*dir
)
614 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
616 unsigned int bit_pos
= 2;
618 struct f2fs_dentry_ptr d
;
620 ipage
= get_node_page(sbi
, dir
->i_ino
);
624 inline_dentry
= inline_data_addr(dir
, ipage
);
625 make_dentry_ptr_inline(dir
, &d
, inline_dentry
);
627 bit_pos
= find_next_bit_le(d
.bitmap
, d
.max
, bit_pos
);
629 f2fs_put_page(ipage
, 1);
637 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
,
638 struct fscrypt_str
*fstr
)
640 struct inode
*inode
= file_inode(file
);
641 struct page
*ipage
= NULL
;
642 struct f2fs_dentry_ptr d
;
643 void *inline_dentry
= NULL
;
646 make_dentry_ptr_inline(inode
, &d
, inline_dentry
);
648 if (ctx
->pos
== d
.max
)
651 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
653 return PTR_ERR(ipage
);
655 inline_dentry
= inline_data_addr(inode
, ipage
);
657 make_dentry_ptr_inline(inode
, &d
, inline_dentry
);
659 err
= f2fs_fill_dentries(ctx
, &d
, 0, fstr
);
663 f2fs_put_page(ipage
, 1);
664 return err
< 0 ? err
: 0;
667 int f2fs_inline_data_fiemap(struct inode
*inode
,
668 struct fiemap_extent_info
*fieinfo
, __u64 start
, __u64 len
)
670 __u64 byteaddr
, ilen
;
671 __u32 flags
= FIEMAP_EXTENT_DATA_INLINE
| FIEMAP_EXTENT_NOT_ALIGNED
|
677 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
679 return PTR_ERR(ipage
);
681 if (!f2fs_has_inline_data(inode
)) {
686 ilen
= min_t(size_t, MAX_INLINE_DATA(inode
), i_size_read(inode
));
689 if (start
+ len
< ilen
)
693 get_node_info(F2FS_I_SB(inode
), inode
->i_ino
, &ni
);
694 byteaddr
= (__u64
)ni
.blk_addr
<< inode
->i_sb
->s_blocksize_bits
;
695 byteaddr
+= (char *)inline_data_addr(inode
, ipage
) -
696 (char *)F2FS_INODE(ipage
);
697 err
= fiemap_fill_next_extent(fieinfo
, start
, byteaddr
, ilen
, flags
);
699 f2fs_put_page(ipage
, 1);