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
)
21 if (!test_opt(F2FS_I_SB(inode
), INLINE_DATA
))
24 if (f2fs_is_atomic_file(inode
))
27 nr_blocks
= F2FS_I(inode
)->i_xattr_nid
? 3 : 2;
28 if (inode
->i_blocks
> nr_blocks
)
31 i_size
= i_size_read(inode
);
32 if (i_size
> MAX_INLINE_DATA
)
38 int f2fs_read_inline_data(struct inode
*inode
, struct page
*page
)
41 void *src_addr
, *dst_addr
;
44 zero_user_segment(page
, 0, PAGE_CACHE_SIZE
);
48 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
51 return PTR_ERR(ipage
);
54 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
56 /* Copy the whole inline data block */
57 src_addr
= inline_data_addr(ipage
);
58 dst_addr
= kmap(page
);
59 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
61 f2fs_put_page(ipage
, 1);
64 SetPageUptodate(page
);
70 static int __f2fs_convert_inline_data(struct inode
*inode
, struct page
*page
)
74 struct dnode_of_data dn
;
75 void *src_addr
, *dst_addr
;
77 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
78 struct f2fs_io_info fio
= {
80 .rw
= WRITE_SYNC
| REQ_PRIO
,
84 ipage
= get_node_page(sbi
, inode
->i_ino
);
90 /* someone else converted inline_data already */
91 if (!f2fs_has_inline_data(inode
))
95 * i_addr[0] is not used for inline data,
96 * so reserving new block will not destroy inline data
98 set_new_dnode(&dn
, inode
, ipage
, NULL
, 0);
99 err
= f2fs_reserve_block(&dn
, 0);
103 f2fs_wait_on_page_writeback(page
, DATA
);
104 zero_user_segment(page
, MAX_INLINE_DATA
, PAGE_CACHE_SIZE
);
106 /* Copy the whole inline data block */
107 src_addr
= inline_data_addr(ipage
);
108 dst_addr
= kmap(page
);
109 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
111 SetPageUptodate(page
);
113 /* write data page to try to make data consistent */
114 set_page_writeback(page
);
115 write_data_page(page
, &dn
, &new_blk_addr
, &fio
);
116 update_extent_cache(new_blk_addr
, &dn
);
117 f2fs_wait_on_page_writeback(page
, DATA
);
119 /* clear inline data and flag after data writeback */
120 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
121 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
122 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
123 stat_dec_inline_inode(inode
);
125 sync_inode_page(&dn
);
132 int f2fs_convert_inline_data(struct inode
*inode
, pgoff_t to_size
,
135 struct page
*new_page
= page
;
138 if (!f2fs_has_inline_data(inode
))
140 else if (to_size
<= MAX_INLINE_DATA
)
143 if (!page
|| page
->index
!= 0) {
144 new_page
= grab_cache_page(inode
->i_mapping
, 0);
149 err
= __f2fs_convert_inline_data(inode
, new_page
);
150 if (!page
|| page
->index
!= 0)
151 f2fs_put_page(new_page
, 1);
155 int f2fs_write_inline_data(struct inode
*inode
,
156 struct page
*page
, unsigned size
)
158 void *src_addr
, *dst_addr
;
160 struct dnode_of_data dn
;
163 set_new_dnode(&dn
, inode
, NULL
, NULL
, 0);
164 err
= get_dnode_of_data(&dn
, 0, LOOKUP_NODE
);
167 ipage
= dn
.inode_page
;
169 /* Release any data block if it is allocated */
170 if (!f2fs_has_inline_data(inode
)) {
171 int count
= ADDRS_PER_PAGE(dn
.node_page
, F2FS_I(inode
));
172 truncate_data_blocks_range(&dn
, count
);
173 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
174 stat_inc_inline_inode(inode
);
177 f2fs_wait_on_page_writeback(ipage
, NODE
);
178 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
179 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
180 src_addr
= kmap(page
);
181 dst_addr
= inline_data_addr(ipage
);
182 memcpy(dst_addr
, src_addr
, size
);
185 set_inode_flag(F2FS_I(inode
), FI_APPEND_WRITE
);
186 sync_inode_page(&dn
);
192 void truncate_inline_data(struct inode
*inode
, u64 from
)
196 if (from
>= MAX_INLINE_DATA
)
199 ipage
= get_node_page(F2FS_I_SB(inode
), inode
->i_ino
);
203 f2fs_wait_on_page_writeback(ipage
, NODE
);
205 zero_user_segment(ipage
, INLINE_DATA_OFFSET
+ from
,
206 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
207 set_page_dirty(ipage
);
208 f2fs_put_page(ipage
, 1);
211 bool recover_inline_data(struct inode
*inode
, struct page
*npage
)
213 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
214 struct f2fs_inode
*ri
= NULL
;
215 void *src_addr
, *dst_addr
;
219 * The inline_data recovery policy is as follows.
220 * [prev.] [next] of inline_data flag
221 * o o -> recover inline_data
222 * o x -> remove inline_data, and then recover data blocks
223 * x o -> remove inline_data, and then recover inline_data
224 * x x -> recover data blocks
227 ri
= F2FS_INODE(npage
);
229 if (f2fs_has_inline_data(inode
) &&
230 ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
232 ipage
= get_node_page(sbi
, inode
->i_ino
);
233 f2fs_bug_on(sbi
, IS_ERR(ipage
));
235 f2fs_wait_on_page_writeback(ipage
, NODE
);
237 src_addr
= inline_data_addr(npage
);
238 dst_addr
= inline_data_addr(ipage
);
239 memcpy(dst_addr
, src_addr
, MAX_INLINE_DATA
);
240 update_inode(inode
, ipage
);
241 f2fs_put_page(ipage
, 1);
245 if (f2fs_has_inline_data(inode
)) {
246 ipage
= get_node_page(sbi
, inode
->i_ino
);
247 f2fs_bug_on(sbi
, IS_ERR(ipage
));
248 f2fs_wait_on_page_writeback(ipage
, NODE
);
249 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
250 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
251 clear_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
252 update_inode(inode
, ipage
);
253 f2fs_put_page(ipage
, 1);
254 } else if (ri
&& (ri
->i_inline
& F2FS_INLINE_DATA
)) {
255 truncate_blocks(inode
, 0, false);
256 set_inode_flag(F2FS_I(inode
), FI_INLINE_DATA
);
262 struct f2fs_dir_entry
*find_in_inline_dir(struct inode
*dir
,
263 struct qstr
*name
, struct page
**res_page
)
265 struct f2fs_sb_info
*sbi
= F2FS_SB(dir
->i_sb
);
267 struct f2fs_dir_entry
*de
;
268 f2fs_hash_t namehash
;
269 unsigned long bit_pos
= 0;
270 struct f2fs_inline_dentry
*dentry_blk
;
271 const void *dentry_bits
;
273 ipage
= get_node_page(sbi
, dir
->i_ino
);
277 namehash
= f2fs_dentry_hash(name
);
279 dentry_blk
= inline_data_addr(ipage
);
280 dentry_bits
= &dentry_blk
->dentry_bitmap
;
282 while (bit_pos
< NR_INLINE_DENTRY
) {
283 if (!test_bit_le(bit_pos
, dentry_bits
)) {
287 de
= &dentry_blk
->dentry
[bit_pos
];
288 if (early_match_name(name
->len
, namehash
, de
)) {
289 if (!memcmp(dentry_blk
->filename
[bit_pos
],
298 * For the most part, it should be a bug when name_len is zero.
299 * We stop here for figuring out where the bugs are occurred.
301 f2fs_bug_on(F2FS_P_SB(ipage
), !de
->name_len
);
303 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
312 struct f2fs_dir_entry
*f2fs_parent_inline_dir(struct inode
*dir
,
315 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
317 struct f2fs_dir_entry
*de
;
318 struct f2fs_inline_dentry
*dentry_blk
;
320 ipage
= get_node_page(sbi
, dir
->i_ino
);
324 dentry_blk
= inline_data_addr(ipage
);
325 de
= &dentry_blk
->dentry
[1];
331 int make_empty_inline_dir(struct inode
*inode
, struct inode
*parent
,
334 struct f2fs_inline_dentry
*dentry_blk
;
335 struct f2fs_dir_entry
*de
;
337 dentry_blk
= inline_data_addr(ipage
);
339 de
= &dentry_blk
->dentry
[0];
340 de
->name_len
= cpu_to_le16(1);
342 de
->ino
= cpu_to_le32(inode
->i_ino
);
343 memcpy(dentry_blk
->filename
[0], ".", 1);
344 set_de_type(de
, inode
);
346 de
= &dentry_blk
->dentry
[1];
348 de
->name_len
= cpu_to_le16(2);
349 de
->ino
= cpu_to_le32(parent
->i_ino
);
350 memcpy(dentry_blk
->filename
[1], "..", 2);
351 set_de_type(de
, inode
);
353 test_and_set_bit_le(0, &dentry_blk
->dentry_bitmap
);
354 test_and_set_bit_le(1, &dentry_blk
->dentry_bitmap
);
356 set_page_dirty(ipage
);
358 /* update i_size to MAX_INLINE_DATA */
359 if (i_size_read(inode
) < MAX_INLINE_DATA
) {
360 i_size_write(inode
, MAX_INLINE_DATA
);
361 set_inode_flag(F2FS_I(inode
), FI_UPDATE_DIR
);
366 int room_in_inline_dir(struct f2fs_inline_dentry
*dentry_blk
, int slots
)
369 int zero_start
, zero_end
;
371 zero_start
= find_next_zero_bit_le(&dentry_blk
->dentry_bitmap
,
374 if (zero_start
>= NR_INLINE_DENTRY
)
375 return NR_INLINE_DENTRY
;
377 zero_end
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
380 if (zero_end
- zero_start
>= slots
)
383 bit_start
= zero_end
+ 1;
385 if (zero_end
+ 1 >= NR_INLINE_DENTRY
)
386 return NR_INLINE_DENTRY
;
390 int f2fs_convert_inline_dir(struct inode
*dir
, struct page
*ipage
,
391 struct f2fs_inline_dentry
*inline_dentry
)
394 struct dnode_of_data dn
;
395 struct f2fs_dentry_block
*dentry_blk
;
398 page
= grab_cache_page(dir
->i_mapping
, 0);
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
, 0, PAGE_CACHE_SIZE
);
410 dentry_blk
= kmap(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 memcpy(dentry_blk
->dentry
, inline_dentry
->dentry
,
416 sizeof(struct f2fs_dir_entry
) * NR_INLINE_DENTRY
);
417 memcpy(dentry_blk
->filename
, inline_dentry
->filename
,
418 NR_INLINE_DENTRY
* F2FS_SLOT_LEN
);
421 SetPageUptodate(page
);
422 set_page_dirty(page
);
424 /* clear inline dir and flag after data writeback */
425 zero_user_segment(ipage
, INLINE_DATA_OFFSET
,
426 INLINE_DATA_OFFSET
+ MAX_INLINE_DATA
);
427 clear_inode_flag(F2FS_I(dir
), FI_INLINE_DENTRY
);
428 stat_dec_inline_inode(dir
);
430 if (i_size_read(dir
) < PAGE_CACHE_SIZE
) {
431 i_size_write(dir
, PAGE_CACHE_SIZE
);
432 set_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
435 sync_inode_page(&dn
);
437 f2fs_put_page(page
, 1);
441 int f2fs_add_inline_entry(struct inode
*dir
, const struct qstr
*name
,
444 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
446 unsigned int bit_pos
;
447 f2fs_hash_t name_hash
;
448 struct f2fs_dir_entry
*de
;
449 size_t namelen
= name
->len
;
450 struct f2fs_inline_dentry
*dentry_blk
= NULL
;
451 int slots
= GET_DENTRY_SLOTS(namelen
);
456 name_hash
= f2fs_dentry_hash(name
);
458 ipage
= get_node_page(sbi
, dir
->i_ino
);
460 return PTR_ERR(ipage
);
462 dentry_blk
= inline_data_addr(ipage
);
463 bit_pos
= room_in_inline_dir(dentry_blk
, slots
);
464 if (bit_pos
>= NR_INLINE_DENTRY
) {
465 err
= f2fs_convert_inline_dir(dir
, ipage
, dentry_blk
);
471 f2fs_wait_on_page_writeback(ipage
, DATA
);
473 down_write(&F2FS_I(inode
)->i_sem
);
474 page
= init_inode_metadata(inode
, dir
, name
);
479 de
= &dentry_blk
->dentry
[bit_pos
];
480 de
->hash_code
= name_hash
;
481 de
->name_len
= cpu_to_le16(namelen
);
482 memcpy(dentry_blk
->filename
[bit_pos
], name
->name
, name
->len
);
483 de
->ino
= cpu_to_le32(inode
->i_ino
);
484 set_de_type(de
, inode
);
485 for (i
= 0; i
< slots
; i
++)
486 test_and_set_bit_le(bit_pos
+ i
, &dentry_blk
->dentry_bitmap
);
487 set_page_dirty(ipage
);
489 /* we don't need to mark_inode_dirty now */
490 F2FS_I(inode
)->i_pino
= dir
->i_ino
;
491 update_inode(inode
, page
);
492 f2fs_put_page(page
, 1);
494 update_parent_metadata(dir
, inode
, 0);
496 up_write(&F2FS_I(inode
)->i_sem
);
498 if (is_inode_flag_set(F2FS_I(dir
), FI_UPDATE_DIR
)) {
499 update_inode(dir
, ipage
);
500 clear_inode_flag(F2FS_I(dir
), FI_UPDATE_DIR
);
503 f2fs_put_page(ipage
, 1);
507 void f2fs_delete_inline_entry(struct f2fs_dir_entry
*dentry
, struct page
*page
,
508 struct inode
*dir
, struct inode
*inode
)
510 struct f2fs_inline_dentry
*inline_dentry
;
511 int slots
= GET_DENTRY_SLOTS(le16_to_cpu(dentry
->name_len
));
512 unsigned int bit_pos
;
516 f2fs_wait_on_page_writeback(page
, DATA
);
518 inline_dentry
= inline_data_addr(page
);
519 bit_pos
= dentry
- inline_dentry
->dentry
;
520 for (i
= 0; i
< slots
; i
++)
521 test_and_clear_bit_le(bit_pos
+ i
,
522 &inline_dentry
->dentry_bitmap
);
524 set_page_dirty(page
);
526 dir
->i_ctime
= dir
->i_mtime
= CURRENT_TIME
;
529 f2fs_drop_nlink(dir
, inode
, page
);
531 f2fs_put_page(page
, 1);
534 bool f2fs_empty_inline_dir(struct inode
*dir
)
536 struct f2fs_sb_info
*sbi
= F2FS_I_SB(dir
);
538 unsigned int bit_pos
= 2;
539 struct f2fs_inline_dentry
*dentry_blk
;
541 ipage
= get_node_page(sbi
, dir
->i_ino
);
545 dentry_blk
= inline_data_addr(ipage
);
546 bit_pos
= find_next_bit_le(&dentry_blk
->dentry_bitmap
,
550 f2fs_put_page(ipage
, 1);
552 if (bit_pos
< NR_INLINE_DENTRY
)
558 int f2fs_read_inline_dir(struct file
*file
, struct dir_context
*ctx
)
560 struct inode
*inode
= file_inode(file
);
561 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
562 unsigned int bit_pos
= 0;
563 struct f2fs_inline_dentry
*inline_dentry
= NULL
;
564 struct f2fs_dir_entry
*de
= NULL
;
565 struct page
*ipage
= NULL
;
566 unsigned char d_type
= DT_UNKNOWN
;
568 if (ctx
->pos
== NR_INLINE_DENTRY
)
571 ipage
= get_node_page(sbi
, inode
->i_ino
);
573 return PTR_ERR(ipage
);
575 bit_pos
= ((unsigned long)ctx
->pos
% NR_INLINE_DENTRY
);
577 inline_dentry
= inline_data_addr(ipage
);
578 while (bit_pos
< NR_INLINE_DENTRY
) {
579 bit_pos
= find_next_bit_le(&inline_dentry
->dentry_bitmap
,
582 if (bit_pos
>= NR_INLINE_DENTRY
)
585 de
= &inline_dentry
->dentry
[bit_pos
];
586 if (de
->file_type
< F2FS_FT_MAX
)
587 d_type
= f2fs_filetype_table
[de
->file_type
];
592 inline_dentry
->filename
[bit_pos
],
593 le16_to_cpu(de
->name_len
),
594 le32_to_cpu(de
->ino
), d_type
))
597 bit_pos
+= GET_DENTRY_SLOTS(le16_to_cpu(de
->name_len
));
601 ctx
->pos
= NR_INLINE_DENTRY
;
603 f2fs_put_page(ipage
, 1);