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(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
))
30 void read_inline_data(struct page
*page
, struct page
*ipage
)
32 void *src_addr
, *dst_addr
;
34 if (PageUptodate(page
))
37 f2fs_bug_on(F2FS_P_SB(page
), page
->index
);
39 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
41 /* Copy the whole inline data block */
42 src_addr
= inline_data_addr(ipage
);
43 dst_addr
= kmap_atomic(page
);
44 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
45 flush_dcache_page(page
);
46 kunmap_atomic(dst_addr
);
47 SetPageUptodate(page
);
50 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
54 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
57 return PTR_ERR(ipage
);
60 if (!f2fs_has_inline_data(inode
)) {
61 f2fs_put_page(ipage
, 1);
66 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
68 read_inline_data(page
, ipage
);
70 SetPageUptodate(page
);
71 f2fs_put_page(ipage
, 1);
76 int f2fs_convert_inline_page(struct dnode_of_data
*dn
, struct page
*page
)
78 void *src_addr
, *dst_addr
;
80 struct f2fs_io_info fio
= {
82 .rw
= WRITE_SYNC
| REQ_PRIO
,
86 f2fs_bug_on(F2FS_I_SB(dn
->inode
), page
->index
);
88 if (!f2fs_exist_data(dn
->inode
))
91 err
= f2fs_reserve_block(dn
, 0);
95 f2fs_wait_on_page_writeback(page
, DATA
);
97 if (PageUptodate(page
))
100 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
102 /* Copy the whole inline data block */
103 src_addr
= inline_data_addr(dn
->inode_page
);
104 dst_addr
= kmap_atomic(page
);
105 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
106 kunmap_atomic(dst_addr
);
107 SetPageUptodate(page
);
109 /* write data page to try to make data consistent */
110 set_page_writeback(page
);
112 write_data_page(page
, dn
, &new_blk_addr
, &fio
);
113 update_extent_cache(new_blk_addr
, dn
);
114 f2fs_wait_on_page_writeback(page
, DATA
);
116 /* clear inline data and flag after data writeback */
117 truncate_inline_data(dn
->inode_page
, 0);
119 f2fs_clear_inline_inode(dn
->inode
);
120 stat_dec_inline_inode(dn
->inode
);
126 int f2fs_convert_inline_inode(struct inode
*inode
)
128 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
129 struct dnode_of_data dn
;
130 struct page
*ipage
, *page
;
133 page
= grab_cache_page(inode
->i_mapping
, 0);
139 ipage
= get_node_page(sbi
, inode
->i_ino
);
142 return PTR_ERR(ipage
);
145 set_new_dnode(&dn
, inode
, ipage
, ipage
, 0);
147 if (f2fs_has_inline_data(inode
))
148 err
= f2fs_convert_inline_page(&dn
, page
);
154 f2fs_put_page(page
, 1);
158 int f2fs_write_inline_data(struct inode
*inode
, struct page
*page
)
160 void *src_addr
, *dst_addr
;
161 struct dnode_of_data dn
;
164 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
165 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
169 if (!f2fs_has_inline_data(inode
)) {
174 f2fs_bug_on(F2FS_I_SB(inode
), page
->index
);
176 f2fs_wait_on_page_writeback(dn
.inode_page
, NODE
);
177 src_addr
= kmap_atomic(page
);
178 dst_addr
= inline_data_addr(dn
.inode_page
);
179 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
180 kunmap_atomic(src_addr
);
182 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
183 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
185 sync_inode_page(&dn
);
190 void truncate_inline_data(struct page
*ipage
, u64 from
)
194 if (from
>= MAX_INLINE_DATA
)
197 f2fs_wait_on_page_writeback(ipage
, NODE
);
199 addr
= inline_data_addr(ipage
);
200 memset(addr
+ from
, 0, MAX_INLINE_DATA
- from
);
203 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
205 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
206 struct f2fs_inode
*ri
= NULL
;
207 void *src_addr
, *dst_addr
;
211 * The inline_data recovery policy is as follows.
212 * [prev.] [next] of inline_data flag
213 * o o -> recover inline_data
214 * o x -> remove inline_data, and then recover data blocks
215 * x o -> remove inline_data, and then recover inline_data
216 * x x -> recover data blocks
219 ri
= F2FS_INODE(npage
);
221 if (f2fs_has_inline_data(inode
) &&
222 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
224 ipage
= get_node_page(sbi
, inode
->i_ino
);
225 f2fs_bug_on(sbi
, IS_ERR(ipage
));
227 f2fs_wait_on_page_writeback(ipage
, NODE
);
229 src_addr
= inline_data_addr(npage
);
230 dst_addr
= inline_data_addr(ipage
);
231 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
233 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
234 set_inode_flag(F2FS_I(inode
), FI_DATA_EXIST
);
236 update_inode(inode
, ipage
);
237 f2fs_put_page(ipage
, 1);
241 if (f2fs_has_inline_data(inode
)) {
242 ipage
= get_node_page(sbi
, inode
->i_ino
);
243 f2fs_bug_on(sbi
, IS_ERR(ipage
));
244 truncate_inline_data(ipage
, 0);
245 f2fs_clear_inline_inode(inode
);
246 update_inode(inode
, ipage
);
247 f2fs_put_page(ipage
, 1);
248 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
249 truncate_blocks(inode
, 0, false);
255 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
256 struct qstr
*name
, struct page
**res_page
)
258 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
259 struct f2fs_inline_dentry
*inline_dentry
;
260 struct f2fs_dir_entry
*de
;
261 struct f2fs_dentry_ptr d
;
264 ipage
= get_node_page(sbi
, dir
->i_ino
);
268 inline_dentry
= inline_data_addr(ipage
);
270 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
271 de
= find_target_dentry(name
, NULL
, &d
);
277 f2fs_put_page(ipage
, 0);
280 * For the most part, it should be a bug when name_len is zero.
281 * We stop here for figuring out where the bugs has occurred.
283 f2fs_bug_on(sbi
, d
.max
< 0);
287 struct f2fs_dir_entry
*f2fs_parent_inline_dir(struct inode
*dir
,
290 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
292 struct f2fs_dir_entry
*de
;
293 struct f2fs_inline_dentry
*dentry_blk
;
295 ipage
= get_node_page(sbi
, dir
->i_ino
);
299 dentry_blk
= inline_data_addr(ipage
);
300 de
= &dentry_blk
->dentry
[1];
306 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
309 struct f2fs_inline_dentry
*dentry_blk
;
310 struct f2fs_dentry_ptr d
;
312 dentry_blk
= inline_data_addr(ipage
);
314 make_dentry_ptr(&d
, (void *)dentry_blk
, 2);
315 do_make_empty_dir(inode
, parent
, &d
);
317 set_page_dirty(ipage
);
319 /* update i_size to MAX_INLINE_DATA */
320 if (i_size_read(inode
) < MAX_INLINE_DATA
) {
321 i_size_write(inode
, MAX_INLINE_DATA
);
322 set_inode_flag(F2FS_I(inode
), FI_UPDATE_DIR
);
327 static int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
328 struct f2fs_inline_dentry
*inline_dentry
)
331 struct dnode_of_data dn
;
332 struct f2fs_dentry_block
*dentry_blk
;
335 page
= grab_cache_page(dir
->i_mapping
, 0);
339 set_new_dnode(&dn
, dir
, ipage
, NULL
, 0);
340 err
= f2fs_reserve_block(&dn
, 0);
344 f2fs_wait_on_page_writeback(page
, DATA
);
345 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
347 dentry_blk
= kmap_atomic(page
);
349 /* copy data from inline dentry block to new dentry block */
350 memcpy(dentry_blk
->dentry_bitmap
, inline_dentry
->dentry_bitmap
,
351 INLINE_DENTRY_BITMAP_SIZE
);
352 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
353 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
354 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
355 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
357 kunmap_atomic(dentry_blk
);
358 SetPageUptodate(page
);
359 set_page_dirty(page
);
361 /* clear inline dir and flag after data writeback */
362 truncate_inline_data(ipage
, 0);
364 stat_dec_inline_dir(dir
);
365 clear_inode_flag(F2FS_I(dir
), FI_INLINE_DENTRY
);
367 if (i_size_read(dir
) < PAGE_CACHE_SIZE
) {
368 i_size_write(dir
, PAGE_CACHE_SIZE
);
369 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
372 sync_inode_page(&dn
);
374 f2fs_put_page(page
, 1);
378 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*name
,
381 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
383 unsigned int bit_pos
;
384 f2fs_hash_t name_hash
;
385 struct f2fs_dir_entry
*de
;
386 size_t namelen
= name
->len
;
387 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
388 int slots
= GET_DENTRY_SLOTS(namelen
);
393 name_hash
= f2fs_dentry_hash(name
);
395 ipage
= get_node_page(sbi
, dir
->i_ino
);
397 return PTR_ERR(ipage
);
399 dentry_blk
= inline_data_addr(ipage
);
400 bit_pos
= room_for_filename(&dentry_blk
->dentry_bitmap
,
401 slots
, NR_INLINE_DENTRY
);
402 if (bit_pos
>= NR_INLINE_DENTRY
) {
403 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
409 down_write(&F2FS_I(inode
)->i_sem
);
410 page
= init_inode_metadata(inode
, dir
, name
, ipage
);
416 f2fs_wait_on_page_writeback(ipage
, NODE
);
417 de
= &dentry_blk
->dentry
[bit_pos
];
418 de
->hash_code
= name_hash
;
419 de
->name_len
= cpu_to_le16(namelen
);
420 memcpy(dentry_blk
->filename
[bit_pos
], name
->name
, name
->len
);
421 de
->ino
= cpu_to_le32(inode
->i_ino
);
422 set_de_type(de
, inode
);
423 for (i
= 0; i
< slots
; i
++)
424 test_and_set_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
425 set_page_dirty(ipage
);
427 /* we don't need to mark_inode_dirty now */
428 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
429 update_inode(inode
, page
);
430 f2fs_put_page(page
, 1);
432 update_parent_metadata(dir
, inode
, 0);
434 up_write(&F2FS_I(inode
)->i_sem
);
436 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
437 update_inode(dir
, ipage
);
438 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
441 f2fs_put_page(ipage
, 1);
445 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
446 struct inode
*dir
, struct inode
*inode
)
448 struct f2fs_inline_dentry
*inline_dentry
;
449 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
450 unsigned int bit_pos
;
454 f2fs_wait_on_page_writeback(page
, NODE
);
456 inline_dentry
= inline_data_addr(page
);
457 bit_pos
= dentry
- inline_dentry
->dentry
;
458 for (i
= 0; i
< slots
; i
++)
459 test_and_clear_bit_le(bit_pos
+ i
,
460 &inline_dentry
->dentry_bitmap
);
462 set_page_dirty(page
);
464 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
467 f2fs_drop_nlink(dir
, inode
, page
);
469 f2fs_put_page(page
, 1);
472 bool f2fs_empty_inline_dir(struct inode
*dir
)
474 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
476 unsigned int bit_pos
= 2;
477 struct f2fs_inline_dentry
*dentry_blk
;
479 ipage
= get_node_page(sbi
, dir
->i_ino
);
483 dentry_blk
= inline_data_addr(ipage
);
484 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
488 f2fs_put_page(ipage
, 1);
490 if (bit_pos
< NR_INLINE_DENTRY
)
496 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
)
498 struct inode
*inode
= file_inode(file
);
499 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
500 struct page
*ipage
= NULL
;
501 struct f2fs_dentry_ptr d
;
503 if (ctx
->pos
== NR_INLINE_DENTRY
)
506 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
508 return PTR_ERR(ipage
);
510 inline_dentry
= inline_data_addr(ipage
);
512 make_dentry_ptr(&d
, (void *)inline_dentry
, 2);
514 if (!f2fs_fill_dentries(ctx
, &d
, 0))
515 ctx
->pos
= NR_INLINE_DENTRY
;
517 f2fs_put_page(ipage
, 1);