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 bool f2fs_may_inline_data(struct inode
*inode
)
18 if (!test_opt(F2FS_I_SB(inode
), INLINE_DATA
))
21 if (f2fs_is_atomic_file(inode
))
24 if (!S_ISREG(inode
->i_mode
) && !S_ISLNK(inode
->i_mode
))
27 if (i_size_read(inode
) > MAX_INLINE_DATA
)
30 if (f2fs_encrypted_inode(inode
) && S_ISREG(inode
->i_mode
))
36 bool f2fs_may_inline_dentry(struct inode
*inode
)
38 if (!test_opt(F2FS_I_SB(inode
), INLINE_DENTRY
))
41 if (!S_ISDIR(inode
->i_mode
))
47 void read_inline_data(struct page
*page
, struct page
*ipage
)
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
, PAGE_CACHE_SIZE
);
58 /* Copy the whole inline data block */
59 src_addr
= inline_data_addr(ipage
);
60 dst_addr
= kmap_atomic(page
);
61 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
62 flush_dcache_page(page
);
63 kunmap_atomic(dst_addr
);
64 SetPageUptodate(page
);
67 bool truncate_inline_inode(struct page
*ipage
, u64 from
)
71 if (from
>= MAX_INLINE_DATA
)
74 addr
= inline_data_addr(ipage
);
76 f2fs_wait_on_page_writeback(ipage
, NODE
);
77 memset(addr
+ from
, 0, MAX_INLINE_DATA
- from
);
82 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
86 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
89 return PTR_ERR(ipage
);
92 if (!f2fs_has_inline_data(inode
)) {
93 f2fs_put_page(ipage
, 1);
98 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
100 read_inline_data(page
, ipage
);
102 SetPageUptodate(page
);
103 f2fs_put_page(ipage
, 1);
108 int f2fs_convert_inline_page(struct dnode_of_data
*dn
, struct page
*page
)
110 void *src_addr
, *dst_addr
;
111 struct f2fs_io_info fio
= {
112 .sbi
= F2FS_I_SB(dn
->inode
),
114 .rw
= WRITE_SYNC
| REQ_PRIO
,
119 f2fs_bug_on(F2FS_I_SB(dn
->inode
), page
->index
);
121 if (!f2fs_exist_data(dn
->inode
))
124 err
= f2fs_reserve_block(dn
, 0);
128 f2fs_wait_on_page_writeback(page
, DATA
);
130 if (PageUptodate(page
))
133 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
135 /* Copy the whole inline data block */
136 src_addr
= inline_data_addr(dn
->inode_page
);
137 dst_addr
= kmap_atomic(page
);
138 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
139 flush_dcache_page(page
);
140 kunmap_atomic(dst_addr
);
141 SetPageUptodate(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
);
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);
162 stat_dec_inline_inode(dn
->inode
);
163 f2fs_clear_inline_inode(dn
->inode
);
169 int f2fs_convert_inline_inode(struct inode
*inode
)
171 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
172 struct dnode_of_data dn
;
173 struct page
*ipage
, *page
;
176 page
= grab_cache_page(inode
->i_mapping
, 0);
182 ipage
= get_node_page(sbi
, inode
->i_ino
);
184 err
= PTR_ERR(ipage
);
188 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
190 if (f2fs_has_inline_data(inode
))
191 err
= f2fs_convert_inline_page(&dn
, page
);
197 f2fs_put_page(page
, 1);
201 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
203 void *src_addr
, *dst_addr
;
204 struct dnode_of_data dn
;
207 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
208 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
212 if (!f2fs_has_inline_data(inode
)) {
217 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
219 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
);
220 src_addr
= kmap_atomic(page
);
221 dst_addr
= inline_data_addr(dn
.inode_page
);
222 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
223 kunmap_atomic(src_addr
);
225 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
226 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
228 sync_inode_page(&dn
);
233 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
235 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
236 struct f2fs_inode
*ri
= NULL
;
237 void *src_addr
, *dst_addr
;
241 * The inline_data recovery policy is as follows.
242 * [prev.] [next] of inline_data flag
243 * o o -> recover inline_data
244 * o x -> remove inline_data, and then recover data blocks
245 * x o -> remove inline_data, and then recover inline_data
246 * x x -> recover data blocks
249 ri
= F2FS_INODE(npage
);
251 if (f2fs_has_inline_data(inode
) &&
252 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
254 ipage
= get_node_page(sbi
, inode
->i_ino
);
255 f2fs_bug_on(sbi
, IS_ERR(ipage
));
257 f2fs_wait_on_page_writeback(ipage
, NODE
);
259 src_addr
= inline_data_addr(npage
);
260 dst_addr
= inline_data_addr(ipage
);
261 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
263 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
264 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
266 update_inode(inode
, ipage
);
267 f2fs_put_page(ipage
, 1);
271 if (f2fs_has_inline_data(inode
)) {
272 ipage
= get_node_page(sbi
, inode
->i_ino
);
273 f2fs_bug_on(sbi
, IS_ERR(ipage
));
274 truncate_inline_inode(ipage
, 0);
275 f2fs_clear_inline_inode(inode
);
276 update_inode(inode
, ipage
);
277 f2fs_put_page(ipage
, 1);
278 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
279 truncate_blocks(inode
, 0, false);
285 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
286 struct qstr
*name
, struct page
**res_page
)
288 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
289 struct f2fs_inline_dentry
*inline_dentry
;
290 struct f2fs_dir_entry
*de
;
291 struct f2fs_dentry_ptr d
;
294 ipage
= get_node_page(sbi
, dir
->i_ino
);
298 inline_dentry
= inline_data_addr(ipage
);
300 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
301 de
= find_target_dentry(name
, NULL
, &d
);
307 f2fs_put_page(ipage
, 0);
310 * For the most part, it should be a bug when name_len is zero.
311 * We stop here for figuring out where the bugs has occurred.
313 f2fs_bug_on(sbi
, d
.max
< 0);
317 struct f2fs_dir_entry
*f2fs_parent_inline_dir(struct inode
*dir
,
320 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
322 struct f2fs_dir_entry
*de
;
323 struct f2fs_inline_dentry
*dentry_blk
;
325 ipage
= get_node_page(sbi
, dir
->i_ino
);
329 dentry_blk
= inline_data_addr(ipage
);
330 de
= &dentry_blk
->dentry
[1];
336 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
339 struct f2fs_inline_dentry
*dentry_blk
;
340 struct f2fs_dentry_ptr d
;
342 dentry_blk
= inline_data_addr(ipage
);
344 make_dentry_ptr(&d
, (void *)dentry_blk
, 2);
345 do_make_empty_dir(inode
, parent
, &d
);
347 set_page_dirty(ipage
);
349 /* update i_size to MAX_INLINE_DATA */
350 if (i_size_read(inode
) < MAX_INLINE_DATA
) {
351 i_size_write(inode
, MAX_INLINE_DATA
);
352 set_inode_flag(F2FS_I(inode
), FI_UPDATE_DIR
);
357 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
358 struct f2fs_inline_dentry
*inline_dentry
)
361 struct dnode_of_data dn
;
362 struct f2fs_dentry_block
*dentry_blk
;
365 page
= grab_cache_page(dir
->i_mapping
, 0);
369 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
370 err
= f2fs_reserve_block(&dn
, 0);
374 f2fs_wait_on_page_writeback(page
, DATA
);
375 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
377 dentry_blk
= kmap_atomic(page
);
379 /* copy data from inline dentry block to new dentry block */
380 memcpy(dentry_blk
->dentry_bitmap
, inline_dentry
->dentry_bitmap
,
381 INLINE_DENTRY_BITMAP_SIZE
);
382 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
383 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
384 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
385 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
387 kunmap_atomic(dentry_blk
);
388 SetPageUptodate(page
);
389 set_page_dirty(page
);
391 /* clear inline dir and flag after data writeback */
392 truncate_inline_inode(ipage
, 0);
394 stat_dec_inline_dir(dir
);
395 clear_inode_flag(F2FS_I(dir
), FI_INLINE_DENTRY
);
397 if (i_size_read(dir
) < PAGE_CACHE_SIZE
) {
398 i_size_write(dir
, PAGE_CACHE_SIZE
);
399 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
402 sync_inode_page(&dn
);
404 f2fs_put_page(page
, 1);
408 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*name
,
409 struct inode
*inode
, nid_t ino
, umode_t mode
)
411 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
413 unsigned int bit_pos
;
414 f2fs_hash_t name_hash
;
415 size_t namelen
= name
->len
;
416 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
417 struct f2fs_dentry_ptr d
;
418 int slots
= GET_DENTRY_SLOTS(namelen
);
419 struct page
*page
= NULL
;
422 ipage
= get_node_page(sbi
, dir
->i_ino
);
424 return PTR_ERR(ipage
);
426 dentry_blk
= inline_data_addr(ipage
);
427 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
428 slots
, NR_INLINE_DENTRY
);
429 if (bit_pos
>= NR_INLINE_DENTRY
) {
430 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
437 down_write(&F2FS_I(inode
)->i_sem
);
438 page
= init_inode_metadata(inode
, dir
, name
, ipage
);
445 f2fs_wait_on_page_writeback(ipage
, NODE
);
447 name_hash
= f2fs_dentry_hash(name
);
448 make_dentry_ptr(&d
, (void *)dentry_blk
, 2);
449 f2fs_update_dentry(ino
, mode
, &d
, name
, name_hash
, bit_pos
);
451 set_page_dirty(ipage
);
453 /* we don't need to mark_inode_dirty now */
455 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
456 update_inode(inode
, page
);
457 f2fs_put_page(page
, 1);
460 update_parent_metadata(dir
, inode
, 0);
463 up_write(&F2FS_I(inode
)->i_sem
);
465 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
466 update_inode(dir
, ipage
);
467 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
470 f2fs_put_page(ipage
, 1);
474 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
475 struct inode
*dir
, struct inode
*inode
)
477 struct f2fs_inline_dentry
*inline_dentry
;
478 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
479 unsigned int bit_pos
;
483 f2fs_wait_on_page_writeback(page
, NODE
);
485 inline_dentry
= inline_data_addr(page
);
486 bit_pos
= dentry
- inline_dentry
->dentry
;
487 for (i
= 0; i
< slots
; i
++)
488 test_and_clear_bit_le(bit_pos
+ i
,
489 &inline_dentry
->dentry_bitmap
);
491 set_page_dirty(page
);
493 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
496 f2fs_drop_nlink(dir
, inode
, page
);
498 f2fs_put_page(page
, 1);
501 bool f2fs_empty_inline_dir(struct inode
*dir
)
503 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
505 unsigned int bit_pos
= 2;
506 struct f2fs_inline_dentry
*dentry_blk
;
508 ipage
= get_node_page(sbi
, dir
->i_ino
);
512 dentry_blk
= inline_data_addr(ipage
);
513 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
517 f2fs_put_page(ipage
, 1);
519 if (bit_pos
< NR_INLINE_DENTRY
)
525 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
)
527 struct inode
*inode
= file_inode(file
);
528 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
529 struct page
*ipage
= NULL
;
530 struct f2fs_dentry_ptr d
;
532 if (ctx
->pos
== NR_INLINE_DENTRY
)
535 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
537 return PTR_ERR(ipage
);
539 inline_dentry
= inline_data_addr(ipage
);
541 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
543 if (!f2fs_fill_dentries(ctx
, &d
, 0))
544 ctx
->pos
= NR_INLINE_DENTRY
;
546 f2fs_put_page(ipage
, 1);