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)
33 bool f2fs_may_inline_dentry(struct inode *inode)
35 if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
38 if (!S_ISDIR(inode->i_mode))
44 void read_inline_data(struct page *page, struct page *ipage)
46 void *src_addr, *dst_addr;
48 if (PageUptodate(page))
51 f2fs_bug_on(F2FS_P_SB(page), page->index);
53 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
55 /* Copy the whole inline data block */
56 src_addr = inline_data_addr(ipage);
57 dst_addr = kmap_atomic(page);
58 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
59 flush_dcache_page(page);
60 kunmap_atomic(dst_addr);
61 SetPageUptodate(page);
64 bool truncate_inline_inode(struct page *ipage, u64 from)
68 if (from >= MAX_INLINE_DATA)
71 addr = inline_data_addr(ipage);
73 f2fs_wait_on_page_writeback(ipage, NODE);
74 memset(addr + from, 0, MAX_INLINE_DATA - from);
79 int f2fs_read_inline_data(struct inode *inode, struct page *page)
83 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
86 return PTR_ERR(ipage);
89 if (!f2fs_has_inline_data(inode)) {
90 f2fs_put_page(ipage, 1);
95 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
97 read_inline_data(page, ipage);
99 SetPageUptodate(page);
100 f2fs_put_page(ipage, 1);
105 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
107 void *src_addr, *dst_addr;
108 struct f2fs_io_info fio = {
110 .rw = WRITE_SYNC | REQ_PRIO,
114 f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
116 if (!f2fs_exist_data(dn->inode))
119 err = f2fs_reserve_block(dn, 0);
123 f2fs_wait_on_page_writeback(page, DATA);
125 if (PageUptodate(page))
128 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
130 /* Copy the whole inline data block */
131 src_addr = inline_data_addr(dn->inode_page);
132 dst_addr = kmap_atomic(page);
133 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
134 flush_dcache_page(page);
135 kunmap_atomic(dst_addr);
136 SetPageUptodate(page);
138 /* clear dirty state */
139 dirty = clear_page_dirty_for_io(page);
141 /* write data page to try to make data consistent */
142 set_page_writeback(page);
143 fio.blk_addr = dn->data_blkaddr;
144 write_data_page(page, dn, &fio);
145 set_data_blkaddr(dn);
146 f2fs_update_extent_cache(dn);
147 f2fs_wait_on_page_writeback(page, DATA);
149 inode_dec_dirty_pages(dn->inode);
151 /* this converted inline_data should be recovered. */
152 set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
154 /* clear inline data and flag after data writeback */
155 truncate_inline_inode(dn->inode_page, 0);
157 stat_dec_inline_inode(dn->inode);
158 f2fs_clear_inline_inode(dn->inode);
164 int f2fs_convert_inline_inode(struct inode *inode)
166 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
167 struct dnode_of_data dn;
168 struct page *ipage, *page;
171 page = grab_cache_page(inode->i_mapping, 0);
177 ipage = get_node_page(sbi, inode->i_ino);
179 err = PTR_ERR(ipage);
183 set_new_dnode(&dn, inode, ipage, ipage, 0);
185 if (f2fs_has_inline_data(inode))
186 err = f2fs_convert_inline_page(&dn, page);
192 f2fs_put_page(page, 1);
196 int f2fs_write_inline_data(struct inode *inode, struct page *page)
198 void *src_addr, *dst_addr;
199 struct dnode_of_data dn;
202 set_new_dnode(&dn, inode, NULL, NULL, 0);
203 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
207 if (!f2fs_has_inline_data(inode)) {
212 f2fs_bug_on(F2FS_I_SB(inode), page->index);
214 f2fs_wait_on_page_writeback(dn.inode_page, NODE);
215 src_addr = kmap_atomic(page);
216 dst_addr = inline_data_addr(dn.inode_page);
217 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
218 kunmap_atomic(src_addr);
220 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
221 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
223 sync_inode_page(&dn);
228 bool recover_inline_data(struct inode *inode, struct page *npage)
230 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
231 struct f2fs_inode *ri = NULL;
232 void *src_addr, *dst_addr;
236 * The inline_data recovery policy is as follows.
237 * [prev.] [next] of inline_data flag
238 * o o -> recover inline_data
239 * o x -> remove inline_data, and then recover data blocks
240 * x o -> remove inline_data, and then recover inline_data
241 * x x -> recover data blocks
244 ri = F2FS_INODE(npage);
246 if (f2fs_has_inline_data(inode) &&
247 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
249 ipage = get_node_page(sbi, inode->i_ino);
250 f2fs_bug_on(sbi, IS_ERR(ipage));
252 f2fs_wait_on_page_writeback(ipage, NODE);
254 src_addr = inline_data_addr(npage);
255 dst_addr = inline_data_addr(ipage);
256 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
258 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
259 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
261 update_inode(inode, ipage);
262 f2fs_put_page(ipage, 1);
266 if (f2fs_has_inline_data(inode)) {
267 ipage = get_node_page(sbi, inode->i_ino);
268 f2fs_bug_on(sbi, IS_ERR(ipage));
269 truncate_inline_inode(ipage, 0);
270 f2fs_clear_inline_inode(inode);
271 update_inode(inode, ipage);
272 f2fs_put_page(ipage, 1);
273 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
274 truncate_blocks(inode, 0, false);
280 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
281 struct qstr *name, struct page **res_page)
283 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
284 struct f2fs_inline_dentry *inline_dentry;
285 struct f2fs_dir_entry *de;
286 struct f2fs_dentry_ptr d;
289 ipage = get_node_page(sbi, dir->i_ino);
293 inline_dentry = inline_data_addr(ipage);
295 make_dentry_ptr(&d, (void *)inline_dentry, 2);
296 de = find_target_dentry(name, NULL, &d);
302 f2fs_put_page(ipage, 0);
305 * For the most part, it should be a bug when name_len is zero.
306 * We stop here for figuring out where the bugs has occurred.
308 f2fs_bug_on(sbi, d.max < 0);
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_dentry_ptr d;
337 dentry_blk = inline_data_addr(ipage);
339 make_dentry_ptr(&d, (void *)dentry_blk, 2);
340 do_make_empty_dir(inode, parent, &d);
342 set_page_dirty(ipage);
344 /* update i_size to MAX_INLINE_DATA */
345 if (i_size_read(inode) < MAX_INLINE_DATA) {
346 i_size_write(inode, MAX_INLINE_DATA);
347 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
352 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
353 struct f2fs_inline_dentry *inline_dentry)
356 struct dnode_of_data dn;
357 struct f2fs_dentry_block *dentry_blk;
360 page = grab_cache_page(dir->i_mapping, 0);
364 set_new_dnode(&dn, dir, ipage, NULL, 0);
365 err = f2fs_reserve_block(&dn, 0);
369 f2fs_wait_on_page_writeback(page, DATA);
370 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
372 dentry_blk = kmap_atomic(page);
374 /* copy data from inline dentry block to new dentry block */
375 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
376 INLINE_DENTRY_BITMAP_SIZE);
377 memcpy(dentry_blk->dentry, inline_dentry->dentry,
378 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
379 memcpy(dentry_blk->filename, inline_dentry->filename,
380 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
382 kunmap_atomic(dentry_blk);
383 SetPageUptodate(page);
384 set_page_dirty(page);
386 /* clear inline dir and flag after data writeback */
387 truncate_inline_inode(ipage, 0);
389 stat_dec_inline_dir(dir);
390 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
392 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
393 i_size_write(dir, PAGE_CACHE_SIZE);
394 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
397 sync_inode_page(&dn);
399 f2fs_put_page(page, 1);
403 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
404 struct inode *inode, nid_t ino, umode_t mode)
406 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
408 unsigned int bit_pos;
409 f2fs_hash_t name_hash;
410 size_t namelen = name->len;
411 struct f2fs_inline_dentry *dentry_blk = NULL;
412 struct f2fs_dentry_ptr d;
413 int slots = GET_DENTRY_SLOTS(namelen);
414 struct page *page = NULL;
417 ipage = get_node_page(sbi, dir->i_ino);
419 return PTR_ERR(ipage);
421 dentry_blk = inline_data_addr(ipage);
422 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
423 slots, NR_INLINE_DENTRY);
424 if (bit_pos >= NR_INLINE_DENTRY) {
425 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
432 down_write(&F2FS_I(inode)->i_sem);
433 page = init_inode_metadata(inode, dir, name, ipage);
440 f2fs_wait_on_page_writeback(ipage, NODE);
442 name_hash = f2fs_dentry_hash(name);
443 make_dentry_ptr(&d, (void *)dentry_blk, 2);
444 f2fs_update_dentry(ino, mode, &d, name, name_hash, bit_pos);
446 set_page_dirty(ipage);
448 /* we don't need to mark_inode_dirty now */
450 F2FS_I(inode)->i_pino = dir->i_ino;
451 update_inode(inode, page);
452 f2fs_put_page(page, 1);
455 update_parent_metadata(dir, inode, 0);
458 up_write(&F2FS_I(inode)->i_sem);
460 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
461 update_inode(dir, ipage);
462 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
465 f2fs_put_page(ipage, 1);
469 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
470 struct inode *dir, struct inode *inode)
472 struct f2fs_inline_dentry *inline_dentry;
473 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
474 unsigned int bit_pos;
478 f2fs_wait_on_page_writeback(page, NODE);
480 inline_dentry = inline_data_addr(page);
481 bit_pos = dentry - inline_dentry->dentry;
482 for (i = 0; i < slots; i++)
483 test_and_clear_bit_le(bit_pos + i,
484 &inline_dentry->dentry_bitmap);
486 set_page_dirty(page);
488 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
491 f2fs_drop_nlink(dir, inode, page);
493 f2fs_put_page(page, 1);
496 bool f2fs_empty_inline_dir(struct inode *dir)
498 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
500 unsigned int bit_pos = 2;
501 struct f2fs_inline_dentry *dentry_blk;
503 ipage = get_node_page(sbi, dir->i_ino);
507 dentry_blk = inline_data_addr(ipage);
508 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
512 f2fs_put_page(ipage, 1);
514 if (bit_pos < NR_INLINE_DENTRY)
520 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx)
522 struct inode *inode = file_inode(file);
523 struct f2fs_inline_dentry *inline_dentry = NULL;
524 struct page *ipage = NULL;
525 struct f2fs_dentry_ptr d;
527 if (ctx->pos == NR_INLINE_DENTRY)
530 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
532 return PTR_ERR(ipage);
534 inline_dentry = inline_data_addr(ipage);
536 make_dentry_ptr(&d, (void *)inline_dentry, 2);
538 if (!f2fs_fill_dentries(ctx, &d, 0))
539 ctx->pos = NR_INLINE_DENTRY;
541 f2fs_put_page(ipage, 1);