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))
27 if (i_size_read(inode) > MAX_INLINE_DATA)
33 void read_inline_data(struct page *page, struct page *ipage)
35 void *src_addr, *dst_addr;
37 if (PageUptodate(page))
40 f2fs_bug_on(F2FS_P_SB(page), page->index);
42 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
44 /* Copy the whole inline data block */
45 src_addr = inline_data_addr(ipage);
46 dst_addr = kmap_atomic(page);
47 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
48 flush_dcache_page(page);
49 kunmap_atomic(dst_addr);
50 SetPageUptodate(page);
53 int f2fs_read_inline_data(struct inode *inode, struct page *page)
57 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
60 return PTR_ERR(ipage);
63 if (!f2fs_has_inline_data(inode)) {
64 f2fs_put_page(ipage, 1);
69 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
71 read_inline_data(page, ipage);
73 SetPageUptodate(page);
74 f2fs_put_page(ipage, 1);
79 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
81 void *src_addr, *dst_addr;
83 struct f2fs_io_info fio = {
85 .rw = WRITE_SYNC | REQ_PRIO,
89 f2fs_bug_on(F2FS_I_SB(dn->inode), page->index);
91 if (!f2fs_exist_data(dn->inode))
94 err = f2fs_reserve_block(dn, 0);
98 f2fs_wait_on_page_writeback(page, DATA);
100 if (PageUptodate(page))
103 zero_user_segment(page, MAX_INLINE_DATA, PAGE_CACHE_SIZE);
105 /* Copy the whole inline data block */
106 src_addr = inline_data_addr(dn->inode_page);
107 dst_addr = kmap_atomic(page);
108 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
109 kunmap_atomic(dst_addr);
110 SetPageUptodate(page);
112 /* write data page to try to make data consistent */
113 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 truncate_inline_data(dn->inode_page, 0);
122 stat_dec_inline_inode(dn->inode);
123 f2fs_clear_inline_inode(dn->inode);
129 int f2fs_convert_inline_inode(struct inode *inode)
131 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
132 struct dnode_of_data dn;
133 struct page *ipage, *page;
136 page = grab_cache_page(inode->i_mapping, 0);
142 ipage = get_node_page(sbi, inode->i_ino);
144 err = PTR_ERR(ipage);
148 set_new_dnode(&dn, inode, ipage, ipage, 0);
150 if (f2fs_has_inline_data(inode))
151 err = f2fs_convert_inline_page(&dn, page);
157 f2fs_put_page(page, 1);
161 int f2fs_write_inline_data(struct inode *inode, struct page *page)
163 void *src_addr, *dst_addr;
164 struct dnode_of_data dn;
167 set_new_dnode(&dn, inode, NULL, NULL, 0);
168 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
172 if (!f2fs_has_inline_data(inode)) {
177 f2fs_bug_on(F2FS_I_SB(inode), page->index);
179 f2fs_wait_on_page_writeback(dn.inode_page, NODE);
180 src_addr = kmap_atomic(page);
181 dst_addr = inline_data_addr(dn.inode_page);
182 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
183 kunmap_atomic(src_addr);
185 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
186 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
188 sync_inode_page(&dn);
193 void truncate_inline_data(struct page *ipage, u64 from)
197 if (from >= MAX_INLINE_DATA)
200 f2fs_wait_on_page_writeback(ipage, NODE);
202 addr = inline_data_addr(ipage);
203 memset(addr + from, 0, MAX_INLINE_DATA - from);
206 bool recover_inline_data(struct inode *inode, struct page *npage)
208 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
209 struct f2fs_inode *ri = NULL;
210 void *src_addr, *dst_addr;
214 * The inline_data recovery policy is as follows.
215 * [prev.] [next] of inline_data flag
216 * o o -> recover inline_data
217 * o x -> remove inline_data, and then recover data blocks
218 * x o -> remove inline_data, and then recover inline_data
219 * x x -> recover data blocks
222 ri = F2FS_INODE(npage);
224 if (f2fs_has_inline_data(inode) &&
225 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
227 ipage = get_node_page(sbi, inode->i_ino);
228 f2fs_bug_on(sbi, IS_ERR(ipage));
230 f2fs_wait_on_page_writeback(ipage, NODE);
232 src_addr = inline_data_addr(npage);
233 dst_addr = inline_data_addr(ipage);
234 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
236 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
237 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
239 update_inode(inode, ipage);
240 f2fs_put_page(ipage, 1);
244 if (f2fs_has_inline_data(inode)) {
245 ipage = get_node_page(sbi, inode->i_ino);
246 f2fs_bug_on(sbi, IS_ERR(ipage));
247 truncate_inline_data(ipage, 0);
248 f2fs_clear_inline_inode(inode);
249 update_inode(inode, ipage);
250 f2fs_put_page(ipage, 1);
251 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
252 truncate_blocks(inode, 0, false);
258 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
259 struct qstr *name, struct page **res_page)
261 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
262 struct f2fs_inline_dentry *inline_dentry;
263 struct f2fs_dir_entry *de;
264 struct f2fs_dentry_ptr d;
267 ipage = get_node_page(sbi, dir->i_ino);
271 inline_dentry = inline_data_addr(ipage);
273 make_dentry_ptr(&d, (void *)inline_dentry, 2);
274 de = find_target_dentry(name, NULL, &d);
280 f2fs_put_page(ipage, 0);
283 * For the most part, it should be a bug when name_len is zero.
284 * We stop here for figuring out where the bugs has occurred.
286 f2fs_bug_on(sbi, d.max < 0);
290 struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
293 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
295 struct f2fs_dir_entry *de;
296 struct f2fs_inline_dentry *dentry_blk;
298 ipage = get_node_page(sbi, dir->i_ino);
302 dentry_blk = inline_data_addr(ipage);
303 de = &dentry_blk->dentry[1];
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(&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 i_size_write(inode, MAX_INLINE_DATA);
325 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
330 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
331 struct f2fs_inline_dentry *inline_dentry)
334 struct dnode_of_data dn;
335 struct f2fs_dentry_block *dentry_blk;
338 page = grab_cache_page(dir->i_mapping, 0);
342 set_new_dnode(&dn, dir, ipage, NULL, 0);
343 err = f2fs_reserve_block(&dn, 0);
347 f2fs_wait_on_page_writeback(page, DATA);
348 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
350 dentry_blk = kmap_atomic(page);
352 /* copy data from inline dentry block to new dentry block */
353 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
354 INLINE_DENTRY_BITMAP_SIZE);
355 memcpy(dentry_blk->dentry, inline_dentry->dentry,
356 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
357 memcpy(dentry_blk->filename, inline_dentry->filename,
358 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
360 kunmap_atomic(dentry_blk);
361 SetPageUptodate(page);
362 set_page_dirty(page);
364 /* clear inline dir and flag after data writeback */
365 truncate_inline_data(ipage, 0);
367 stat_dec_inline_dir(dir);
368 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
370 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
371 i_size_write(dir, PAGE_CACHE_SIZE);
372 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
375 sync_inode_page(&dn);
377 f2fs_put_page(page, 1);
381 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
384 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
386 unsigned int bit_pos;
387 f2fs_hash_t name_hash;
388 struct f2fs_dir_entry *de;
389 size_t namelen = name->len;
390 struct f2fs_inline_dentry *dentry_blk = NULL;
391 int slots = GET_DENTRY_SLOTS(namelen);
396 name_hash = f2fs_dentry_hash(name);
398 ipage = get_node_page(sbi, dir->i_ino);
400 return PTR_ERR(ipage);
402 dentry_blk = inline_data_addr(ipage);
403 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
404 slots, NR_INLINE_DENTRY);
405 if (bit_pos >= NR_INLINE_DENTRY) {
406 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
412 down_write(&F2FS_I(inode)->i_sem);
413 page = init_inode_metadata(inode, dir, name, ipage);
419 f2fs_wait_on_page_writeback(ipage, NODE);
420 de = &dentry_blk->dentry[bit_pos];
421 de->hash_code = name_hash;
422 de->name_len = cpu_to_le16(namelen);
423 memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
424 de->ino = cpu_to_le32(inode->i_ino);
425 set_de_type(de, inode);
426 for (i = 0; i < slots; i++)
427 test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
428 set_page_dirty(ipage);
430 /* we don't need to mark_inode_dirty now */
431 F2FS_I(inode)->i_pino = dir->i_ino;
432 update_inode(inode, page);
433 f2fs_put_page(page, 1);
435 update_parent_metadata(dir, inode, 0);
437 up_write(&F2FS_I(inode)->i_sem);
439 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
440 update_inode(dir, ipage);
441 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
444 f2fs_put_page(ipage, 1);
448 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
449 struct inode *dir, struct inode *inode)
451 struct f2fs_inline_dentry *inline_dentry;
452 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
453 unsigned int bit_pos;
457 f2fs_wait_on_page_writeback(page, NODE);
459 inline_dentry = inline_data_addr(page);
460 bit_pos = dentry - inline_dentry->dentry;
461 for (i = 0; i < slots; i++)
462 test_and_clear_bit_le(bit_pos + i,
463 &inline_dentry->dentry_bitmap);
465 set_page_dirty(page);
467 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
470 f2fs_drop_nlink(dir, inode, page);
472 f2fs_put_page(page, 1);
475 bool f2fs_empty_inline_dir(struct inode *dir)
477 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
479 unsigned int bit_pos = 2;
480 struct f2fs_inline_dentry *dentry_blk;
482 ipage = get_node_page(sbi, dir->i_ino);
486 dentry_blk = inline_data_addr(ipage);
487 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
491 f2fs_put_page(ipage, 1);
493 if (bit_pos < NR_INLINE_DENTRY)
499 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx)
501 struct inode *inode = file_inode(file);
502 struct f2fs_inline_dentry *inline_dentry = NULL;
503 struct page *ipage = NULL;
504 struct f2fs_dentry_ptr d;
506 if (ctx->pos == NR_INLINE_DENTRY)
509 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
511 return PTR_ERR(ipage);
513 inline_dentry = inline_data_addr(ipage);
515 make_dentry_ptr(&d, (void *)inline_dentry, 2);
517 if (!f2fs_fill_dentries(ctx, &d, 0))
518 ctx->pos = NR_INLINE_DENTRY;
520 f2fs_put_page(ipage, 1);