3 * Copyright (c) 2013, Intel Corporation
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 flush_dcache_page(page);
110 kunmap_atomic(dst_addr);
111 SetPageUptodate(page);
113 /* clear dirty state */
114 dirty = clear_page_dirty_for_io(page);
116 /* write data page to try to make data consistent */
117 set_page_writeback(page);
119 write_data_page(page, dn, &new_blk_addr, &fio);
120 update_extent_cache(new_blk_addr, dn);
121 f2fs_wait_on_page_writeback(page, DATA);
123 inode_dec_dirty_pages(dn->inode);
125 /* this converted inline_data should be recovered. */
126 set_inode_flag(F2FS_I(dn->inode), FI_APPEND_WRITE);
128 /* clear inline data and flag after data writeback */
129 truncate_inline_data(dn->inode_page, 0);
131 stat_dec_inline_inode(dn->inode);
132 f2fs_clear_inline_inode(dn->inode);
138 int f2fs_convert_inline_inode(struct inode *inode)
140 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
141 struct dnode_of_data dn;
142 struct page *ipage, *page;
145 page = grab_cache_page(inode->i_mapping, 0);
151 ipage = get_node_page(sbi, inode->i_ino);
153 err = PTR_ERR(ipage);
157 set_new_dnode(&dn, inode, ipage, ipage, 0);
159 if (f2fs_has_inline_data(inode))
160 err = f2fs_convert_inline_page(&dn, page);
166 f2fs_put_page(page, 1);
170 int f2fs_write_inline_data(struct inode *inode, struct page *page)
172 void *src_addr, *dst_addr;
173 struct dnode_of_data dn;
176 set_new_dnode(&dn, inode, NULL, NULL, 0);
177 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
181 if (!f2fs_has_inline_data(inode)) {
186 f2fs_bug_on(F2FS_I_SB(inode), page->index);
188 f2fs_wait_on_page_writeback(dn.inode_page, NODE);
189 src_addr = kmap_atomic(page);
190 dst_addr = inline_data_addr(dn.inode_page);
191 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
192 kunmap_atomic(src_addr);
194 set_inode_flag(F2FS_I(inode), FI_APPEND_WRITE);
195 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
197 sync_inode_page(&dn);
202 void truncate_inline_data(struct page *ipage, u64 from)
206 if (from >= MAX_INLINE_DATA)
209 f2fs_wait_on_page_writeback(ipage, NODE);
211 addr = inline_data_addr(ipage);
212 memset(addr + from, 0, MAX_INLINE_DATA - from);
215 bool recover_inline_data(struct inode *inode, struct page *npage)
217 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
218 struct f2fs_inode *ri = NULL;
219 void *src_addr, *dst_addr;
223 * The inline_data recovery policy is as follows.
224 * [prev.] [next] of inline_data flag
225 * o o -> recover inline_data
226 * o x -> remove inline_data, and then recover data blocks
227 * x o -> remove inline_data, and then recover inline_data
228 * x x -> recover data blocks
231 ri = F2FS_INODE(npage);
233 if (f2fs_has_inline_data(inode) &&
234 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
236 ipage = get_node_page(sbi, inode->i_ino);
237 f2fs_bug_on(sbi, IS_ERR(ipage));
239 f2fs_wait_on_page_writeback(ipage, NODE);
241 src_addr = inline_data_addr(npage);
242 dst_addr = inline_data_addr(ipage);
243 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
245 set_inode_flag(F2FS_I(inode), FI_INLINE_DATA);
246 set_inode_flag(F2FS_I(inode), FI_DATA_EXIST);
248 update_inode(inode, ipage);
249 f2fs_put_page(ipage, 1);
253 if (f2fs_has_inline_data(inode)) {
254 ipage = get_node_page(sbi, inode->i_ino);
255 f2fs_bug_on(sbi, IS_ERR(ipage));
256 truncate_inline_data(ipage, 0);
257 f2fs_clear_inline_inode(inode);
258 update_inode(inode, ipage);
259 f2fs_put_page(ipage, 1);
260 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
261 truncate_blocks(inode, 0, false);
267 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
268 struct qstr *name, struct page **res_page)
270 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
271 struct f2fs_inline_dentry *inline_dentry;
272 struct f2fs_dir_entry *de;
273 struct f2fs_dentry_ptr d;
276 ipage = get_node_page(sbi, dir->i_ino);
280 inline_dentry = inline_data_addr(ipage);
282 make_dentry_ptr(&d, (void *)inline_dentry, 2);
283 de = find_target_dentry(name, NULL, &d);
289 f2fs_put_page(ipage, 0);
292 * For the most part, it should be a bug when name_len is zero.
293 * We stop here for figuring out where the bugs has occurred.
295 f2fs_bug_on(sbi, d.max < 0);
299 struct f2fs_dir_entry *f2fs_parent_inline_dir(struct inode *dir,
302 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
304 struct f2fs_dir_entry *de;
305 struct f2fs_inline_dentry *dentry_blk;
307 ipage = get_node_page(sbi, dir->i_ino);
311 dentry_blk = inline_data_addr(ipage);
312 de = &dentry_blk->dentry[1];
318 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
321 struct f2fs_inline_dentry *dentry_blk;
322 struct f2fs_dentry_ptr d;
324 dentry_blk = inline_data_addr(ipage);
326 make_dentry_ptr(&d, (void *)dentry_blk, 2);
327 do_make_empty_dir(inode, parent, &d);
329 set_page_dirty(ipage);
331 /* update i_size to MAX_INLINE_DATA */
332 if (i_size_read(inode) < MAX_INLINE_DATA) {
333 i_size_write(inode, MAX_INLINE_DATA);
334 set_inode_flag(F2FS_I(inode), FI_UPDATE_DIR);
339 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
340 struct f2fs_inline_dentry *inline_dentry)
343 struct dnode_of_data dn;
344 struct f2fs_dentry_block *dentry_blk;
347 page = grab_cache_page(dir->i_mapping, 0);
351 set_new_dnode(&dn, dir, ipage, NULL, 0);
352 err = f2fs_reserve_block(&dn, 0);
356 f2fs_wait_on_page_writeback(page, DATA);
357 zero_user_segment(page, 0, PAGE_CACHE_SIZE);
359 dentry_blk = kmap_atomic(page);
361 /* copy data from inline dentry block to new dentry block */
362 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
363 INLINE_DENTRY_BITMAP_SIZE);
364 memcpy(dentry_blk->dentry, inline_dentry->dentry,
365 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
366 memcpy(dentry_blk->filename, inline_dentry->filename,
367 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
369 kunmap_atomic(dentry_blk);
370 SetPageUptodate(page);
371 set_page_dirty(page);
373 /* clear inline dir and flag after data writeback */
374 truncate_inline_data(ipage, 0);
376 stat_dec_inline_dir(dir);
377 clear_inode_flag(F2FS_I(dir), FI_INLINE_DENTRY);
379 if (i_size_read(dir) < PAGE_CACHE_SIZE) {
380 i_size_write(dir, PAGE_CACHE_SIZE);
381 set_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
384 sync_inode_page(&dn);
386 f2fs_put_page(page, 1);
390 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *name,
393 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
395 unsigned int bit_pos;
396 f2fs_hash_t name_hash;
397 struct f2fs_dir_entry *de;
398 size_t namelen = name->len;
399 struct f2fs_inline_dentry *dentry_blk = NULL;
400 int slots = GET_DENTRY_SLOTS(namelen);
405 name_hash = f2fs_dentry_hash(name);
407 ipage = get_node_page(sbi, dir->i_ino);
409 return PTR_ERR(ipage);
411 dentry_blk = inline_data_addr(ipage);
412 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
413 slots, NR_INLINE_DENTRY);
414 if (bit_pos >= NR_INLINE_DENTRY) {
415 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
421 down_write(&F2FS_I(inode)->i_sem);
422 page = init_inode_metadata(inode, dir, name, ipage);
428 f2fs_wait_on_page_writeback(ipage, NODE);
429 de = &dentry_blk->dentry[bit_pos];
430 de->hash_code = name_hash;
431 de->name_len = cpu_to_le16(namelen);
432 memcpy(dentry_blk->filename[bit_pos], name->name, name->len);
433 de->ino = cpu_to_le32(inode->i_ino);
434 set_de_type(de, inode);
435 for (i = 0; i < slots; i++)
436 test_and_set_bit_le(bit_pos + i, &dentry_blk->dentry_bitmap);
437 set_page_dirty(ipage);
439 /* we don't need to mark_inode_dirty now */
440 F2FS_I(inode)->i_pino = dir->i_ino;
441 update_inode(inode, page);
442 f2fs_put_page(page, 1);
444 update_parent_metadata(dir, inode, 0);
446 up_write(&F2FS_I(inode)->i_sem);
448 if (is_inode_flag_set(F2FS_I(dir), FI_UPDATE_DIR)) {
449 update_inode(dir, ipage);
450 clear_inode_flag(F2FS_I(dir), FI_UPDATE_DIR);
453 f2fs_put_page(ipage, 1);
457 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
458 struct inode *dir, struct inode *inode)
460 struct f2fs_inline_dentry *inline_dentry;
461 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
462 unsigned int bit_pos;
466 f2fs_wait_on_page_writeback(page, NODE);
468 inline_dentry = inline_data_addr(page);
469 bit_pos = dentry - inline_dentry->dentry;
470 for (i = 0; i < slots; i++)
471 test_and_clear_bit_le(bit_pos + i,
472 &inline_dentry->dentry_bitmap);
474 set_page_dirty(page);
476 dir->i_ctime = dir->i_mtime = CURRENT_TIME;
479 f2fs_drop_nlink(dir, inode, page);
481 f2fs_put_page(page, 1);
484 bool f2fs_empty_inline_dir(struct inode *dir)
486 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
488 unsigned int bit_pos = 2;
489 struct f2fs_inline_dentry *dentry_blk;
491 ipage = get_node_page(sbi, dir->i_ino);
495 dentry_blk = inline_data_addr(ipage);
496 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
500 f2fs_put_page(ipage, 1);
502 if (bit_pos < NR_INLINE_DENTRY)
508 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx)
510 struct inode *inode = file_inode(file);
511 struct f2fs_inline_dentry *inline_dentry = NULL;
512 struct page *ipage = NULL;
513 struct f2fs_dentry_ptr d;
515 if (ctx->pos == NR_INLINE_DENTRY)
518 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
520 return PTR_ERR(ipage);
522 inline_dentry = inline_data_addr(ipage);
524 make_dentry_ptr(&d, (void *)inline_dentry, 2);
526 if (!f2fs_fill_dentries(ctx, &d, 0))
527 ctx->pos = NR_INLINE_DENTRY;
529 f2fs_put_page(ipage, 1);