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_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
);
76 set_page_dirty(ipage
);
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_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 struct f2fs_io_info fio
= {
109 .sbi
= F2FS_I_SB(dn
->inode
),
111 .rw
= WRITE_SYNC
| REQ_PRIO
,
113 .encrypted_page
= NULL
,
117 if (!f2fs_exist_data(dn
->inode
))
120 err
= f2fs_reserve_block(dn
, 0);
124 f2fs_bug_on(F2FS_P_SB(page
), PageWriteback(page
));
126 read_inline_data(page
, dn
->inode_page
);
127 set_page_dirty(page
);
129 /* clear dirty state */
130 dirty
= clear_page_dirty_for_io(page
);
132 /* write data page to try to make data consistent */
133 set_page_writeback(page
);
134 fio
.old_blkaddr
= dn
->data_blkaddr
;
135 write_data_page(dn
, &fio
);
136 f2fs_wait_on_page_writeback(page
, DATA
, true);
138 inode_dec_dirty_pages(dn
->inode
);
140 /* this converted inline_data should be recovered. */
141 set_inode_flag(dn
->inode
, FI_APPEND_WRITE
);
143 /* clear inline data and flag after data writeback */
144 truncate_inline_inode(dn
->inode_page
, 0);
145 clear_inline_node(dn
->inode_page
);
147 stat_dec_inline_inode(dn
->inode
);
148 f2fs_clear_inline_inode(dn
->inode
);
153 int f2fs_convert_inline_inode(struct inode
*inode
)
155 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
156 struct dnode_of_data dn
;
157 struct page
*ipage
, *page
;
160 if (!f2fs_has_inline_data(inode
))
163 page
= f2fs_grab_cache_page(inode
->i_mapping
, 0, false);
169 ipage
= get_node_page(sbi
, inode
->i_ino
);
171 err
= PTR_ERR(ipage
);
175 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
177 if (f2fs_has_inline_data(inode
))
178 err
= f2fs_convert_inline_page(&dn
, page
);
184 f2fs_put_page(page
, 1);
186 f2fs_balance_fs(sbi
, dn
.node_changed
);
191 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
193 void *src_addr
, *dst_addr
;
194 struct dnode_of_data dn
;
197 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
198 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
202 if (!f2fs_has_inline_data(inode
)) {
207 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
209 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
, true);
210 src_addr
= kmap_atomic(page
);
211 dst_addr
= inline_data_addr(dn
.inode_page
);
212 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
213 kunmap_atomic(src_addr
);
214 set_page_dirty(dn
.inode_page
);
216 set_inode_flag(inode
, FI_APPEND_WRITE
);
217 set_inode_flag(inode
, FI_DATA_EXIST
);
219 clear_inline_node(dn
.inode_page
);
224 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
226 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
227 struct f2fs_inode
*ri
= NULL
;
228 void *src_addr
, *dst_addr
;
232 * The inline_data recovery policy is as follows.
233 * [prev.] [next] of inline_data flag
234 * o o -> recover inline_data
235 * o x -> remove inline_data, and then recover data blocks
236 * x o -> remove inline_data, and then recover inline_data
237 * x x -> recover data blocks
240 ri
= F2FS_INODE(npage
);
242 if (f2fs_has_inline_data(inode
) &&
243 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
245 ipage
= get_node_page(sbi
, inode
->i_ino
);
246 f2fs_bug_on(sbi
, IS_ERR(ipage
));
248 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
250 src_addr
= inline_data_addr(npage
);
251 dst_addr
= inline_data_addr(ipage
);
252 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
254 set_inode_flag(inode
, FI_INLINE_DATA
);
255 set_inode_flag(inode
, FI_DATA_EXIST
);
257 set_page_dirty(ipage
);
258 f2fs_put_page(ipage
, 1);
262 if (f2fs_has_inline_data(inode
)) {
263 ipage
= get_node_page(sbi
, inode
->i_ino
);
264 f2fs_bug_on(sbi
, IS_ERR(ipage
));
265 if (!truncate_inline_inode(ipage
, 0))
267 f2fs_clear_inline_inode(inode
);
268 f2fs_put_page(ipage
, 1);
269 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
270 if (truncate_blocks(inode
, 0, false))
277 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
278 struct fscrypt_name
*fname
, struct page
**res_page
)
280 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
281 struct f2fs_inline_dentry
*inline_dentry
;
282 struct qstr name
= FSTR_TO_QSTR(&fname
->disk_name
);
283 struct f2fs_dir_entry
*de
;
284 struct f2fs_dentry_ptr d
;
286 f2fs_hash_t namehash
;
288 ipage
= get_node_page(sbi
, dir
->i_ino
);
294 namehash
= f2fs_dentry_hash(&name
);
296 inline_dentry
= inline_data_addr(ipage
);
298 make_dentry_ptr(NULL
, &d
, (void *)inline_dentry
, 2);
299 de
= find_target_dentry(fname
, namehash
, NULL
, &d
);
304 f2fs_put_page(ipage
, 0);
309 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
312 struct f2fs_inline_dentry
*dentry_blk
;
313 struct f2fs_dentry_ptr d
;
315 dentry_blk
= inline_data_addr(ipage
);
317 make_dentry_ptr(NULL
, &d
, (void *)dentry_blk
, 2);
318 do_make_empty_dir(inode
, parent
, &d
);
320 set_page_dirty(ipage
);
322 /* update i_size to MAX_INLINE_DATA */
323 if (i_size_read(inode
) < MAX_INLINE_DATA
)
324 f2fs_i_size_write(inode
, MAX_INLINE_DATA
);
329 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
330 * release ipage in this function.
332 static int f2fs_move_inline_dirents(struct inode
*dir
, struct page
*ipage
,
333 struct f2fs_inline_dentry
*inline_dentry
)
336 struct dnode_of_data dn
;
337 struct f2fs_dentry_block
*dentry_blk
;
340 page
= f2fs_grab_cache_page(dir
->i_mapping
, 0, false);
342 f2fs_put_page(ipage
, 1);
346 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
347 err
= f2fs_reserve_block(&dn
, 0);
351 f2fs_wait_on_page_writeback(page
, DATA
, true);
352 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_SIZE
);
354 dentry_blk
= kmap_atomic(page
);
356 /* copy data from inline dentry block to new dentry block */
357 memcpy(dentry_blk
->dentry_bitmap
, inline_dentry
->dentry_bitmap
,
358 INLINE_DENTRY_BITMAP_SIZE
);
359 memset(dentry_blk
->dentry_bitmap
+ INLINE_DENTRY_BITMAP_SIZE
, 0,
360 SIZE_OF_DENTRY_BITMAP
- INLINE_DENTRY_BITMAP_SIZE
);
362 * we do not need to zero out remainder part of dentry and filename
363 * field, since we have used bitmap for marking the usage status of
364 * them, besides, we can also ignore copying/zeroing reserved space
365 * of dentry block, because them haven't been used so far.
367 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
368 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
369 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
370 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
372 kunmap_atomic(dentry_blk
);
373 SetPageUptodate(page
);
374 set_page_dirty(page
);
376 /* clear inline dir and flag after data writeback */
377 truncate_inline_inode(ipage
, 0);
379 stat_dec_inline_dir(dir
);
380 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
382 f2fs_i_depth_write(dir
, 1);
383 if (i_size_read(dir
) < PAGE_SIZE
)
384 f2fs_i_size_write(dir
, PAGE_SIZE
);
386 f2fs_put_page(page
, 1);
390 static int f2fs_add_inline_entries(struct inode
*dir
,
391 struct f2fs_inline_dentry
*inline_dentry
)
393 struct f2fs_dentry_ptr d
;
394 unsigned long bit_pos
= 0;
397 make_dentry_ptr(NULL
, &d
, (void *)inline_dentry
, 2);
399 while (bit_pos
< d
.max
) {
400 struct f2fs_dir_entry
*de
;
401 struct qstr new_name
;
405 if (!test_bit_le(bit_pos
, d
.bitmap
)) {
410 de
= &d
.dentry
[bit_pos
];
412 if (unlikely(!de
->name_len
)) {
417 new_name
.name
= d
.filename
[bit_pos
];
418 new_name
.len
= de
->name_len
;
420 ino
= le32_to_cpu(de
->ino
);
421 fake_mode
= get_de_type(de
) << S_SHIFT
;
423 err
= f2fs_add_regular_entry(dir
, &new_name
, NULL
,
426 goto punch_dentry_pages
;
428 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
432 truncate_inode_pages(&dir
->i_data
, 0);
433 truncate_blocks(dir
, 0, false);
434 remove_dirty_inode(dir
);
438 static int f2fs_move_rehashed_dirents(struct inode
*dir
, struct page
*ipage
,
439 struct f2fs_inline_dentry
*inline_dentry
)
441 struct f2fs_inline_dentry
*backup_dentry
;
444 backup_dentry
= f2fs_kmalloc(sizeof(struct f2fs_inline_dentry
),
446 if (!backup_dentry
) {
447 f2fs_put_page(ipage
, 1);
451 memcpy(backup_dentry
, inline_dentry
, MAX_INLINE_DATA
);
452 truncate_inline_inode(ipage
, 0);
456 err
= f2fs_add_inline_entries(dir
, backup_dentry
);
462 stat_dec_inline_dir(dir
);
463 clear_inode_flag(dir
, FI_INLINE_DENTRY
);
464 kfree(backup_dentry
);
468 memcpy(inline_dentry
, backup_dentry
, MAX_INLINE_DATA
);
469 f2fs_i_depth_write(dir
, 0);
470 f2fs_i_size_write(dir
, MAX_INLINE_DATA
);
471 set_page_dirty(ipage
);
472 f2fs_put_page(ipage
, 1);
474 kfree(backup_dentry
);
478 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
479 struct f2fs_inline_dentry
*inline_dentry
)
481 if (!F2FS_I(dir
)->i_dir_level
)
482 return f2fs_move_inline_dirents(dir
, ipage
, inline_dentry
);
484 return f2fs_move_rehashed_dirents(dir
, ipage
, inline_dentry
);
487 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*name
,
488 struct inode
*inode
, nid_t ino
, umode_t mode
)
490 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
492 unsigned int bit_pos
;
493 f2fs_hash_t name_hash
;
494 size_t namelen
= name
->len
;
495 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
496 struct f2fs_dentry_ptr d
;
497 int slots
= GET_DENTRY_SLOTS(namelen
);
498 struct page
*page
= NULL
;
501 ipage
= get_node_page(sbi
, dir
->i_ino
);
503 return PTR_ERR(ipage
);
505 dentry_blk
= inline_data_addr(ipage
);
506 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
507 slots
, NR_INLINE_DENTRY
);
508 if (bit_pos
>= NR_INLINE_DENTRY
) {
509 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
517 down_write(&F2FS_I(inode
)->i_sem
);
518 page
= init_inode_metadata(inode
, dir
, name
, ipage
);
525 f2fs_wait_on_page_writeback(ipage
, NODE
, true);
527 name_hash
= f2fs_dentry_hash(name
);
528 make_dentry_ptr(NULL
, &d
, (void *)dentry_blk
, 2);
529 f2fs_update_dentry(ino
, mode
, &d
, name
, name_hash
, bit_pos
);
531 set_page_dirty(ipage
);
533 /* we don't need to mark_inode_dirty now */
535 f2fs_i_pino_write(inode
, dir
->i_ino
);
536 f2fs_put_page(page
, 1);
539 update_parent_metadata(dir
, inode
, 0);
542 up_write(&F2FS_I(inode
)->i_sem
);
544 f2fs_put_page(ipage
, 1);
548 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
549 struct inode
*dir
, struct inode
*inode
)
551 struct f2fs_inline_dentry
*inline_dentry
;
552 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
553 unsigned int bit_pos
;
557 f2fs_wait_on_page_writeback(page
, NODE
, true);
559 inline_dentry
= inline_data_addr(page
);
560 bit_pos
= dentry
- inline_dentry
->dentry
;
561 for (i
= 0; i
< slots
; i
++)
562 test_and_clear_bit_le(bit_pos
+ i
,
563 &inline_dentry
->dentry_bitmap
);
565 set_page_dirty(page
);
566 f2fs_put_page(page
, 1);
568 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
569 mark_inode_dirty_sync(dir
);
572 f2fs_drop_nlink(dir
, inode
);
575 bool f2fs_empty_inline_dir(struct inode
*dir
)
577 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
579 unsigned int bit_pos
= 2;
580 struct f2fs_inline_dentry
*dentry_blk
;
582 ipage
= get_node_page(sbi
, dir
->i_ino
);
586 dentry_blk
= inline_data_addr(ipage
);
587 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
591 f2fs_put_page(ipage
, 1);
593 if (bit_pos
< NR_INLINE_DENTRY
)
599 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
,
600 struct fscrypt_str
*fstr
)
602 struct inode
*inode
= file_inode(file
);
603 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
604 struct page
*ipage
= NULL
;
605 struct f2fs_dentry_ptr d
;
607 if (ctx
->pos
== NR_INLINE_DENTRY
)
610 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
612 return PTR_ERR(ipage
);
614 inline_dentry
= inline_data_addr(ipage
);
616 make_dentry_ptr(inode
, &d
, (void *)inline_dentry
, 2);
618 if (!f2fs_fill_dentries(ctx
, &d
, 0, fstr
))
619 ctx
->pos
= NR_INLINE_DENTRY
;
621 f2fs_put_page(ipage
, 1);
625 int f2fs_inline_data_fiemap(struct inode
*inode
,
626 struct fiemap_extent_info
*fieinfo
, __u64 start
, __u64 len
)
628 __u64 byteaddr
, ilen
;
629 __u32 flags
= FIEMAP_EXTENT_DATA_INLINE
| FIEMAP_EXTENT_NOT_ALIGNED
|
635 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
637 return PTR_ERR(ipage
);
639 if (!f2fs_has_inline_data(inode
)) {
644 ilen
= min_t(size_t, MAX_INLINE_DATA
, i_size_read(inode
));
647 if (start
+ len
< ilen
)
651 get_node_info(F2FS_I_SB(inode
), inode
->i_ino
, &ni
);
652 byteaddr
= (__u64
)ni
.blk_addr
<< inode
->i_sb
->s_blocksize_bits
;
653 byteaddr
+= (char *)inline_data_addr(ipage
) - (char *)F2FS_INODE(ipage
);
654 err
= fiemap_fill_next_extent(fieinfo
, start
, byteaddr
, ilen
, flags
);
656 f2fs_put_page(ipage
, 1);