1 // SPDX-License-Identifier: GPL-2.0
2 /*
3 * fs/f2fs/inline.c
4 * Copyright (c) 2013, Intel Corporation
5 * Authors: Huajun Li <huajun.li@intel.com>
6 * Haicheng Li <haicheng.li@intel.com>
7 */
8
9 #include <linux/fs.h>
10 #include <linux/f2fs_fs.h>
11 #include <linux/fiemap.h>
12
13 #include "f2fs.h"
14 #include "node.h"
15 #include <trace/events/f2fs.h>
16
f2fs_may_inline_data(struct inode * inode)17 bool f2fs_may_inline_data(struct inode *inode)
18 {
19 if (f2fs_is_atomic_file(inode))
20 return false;
21
22 if (!S_ISREG(inode->i_mode) && !S_ISLNK(inode->i_mode))
23 return false;
24
25 if (i_size_read(inode) > MAX_INLINE_DATA(inode))
26 return false;
27
28 if (f2fs_post_read_required(inode))
29 return false;
30
31 return true;
32 }
33
f2fs_may_inline_dentry(struct inode * inode)34 bool f2fs_may_inline_dentry(struct inode *inode)
35 {
36 if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
37 return false;
38
39 if (!S_ISDIR(inode->i_mode))
40 return false;
41
42 return true;
43 }
44
f2fs_do_read_inline_data(struct page * page,struct page * ipage)45 void f2fs_do_read_inline_data(struct page *page, struct page *ipage)
46 {
47 struct inode *inode = page->mapping->host;
48 void *src_addr, *dst_addr;
49
50 if (PageUptodate(page))
51 return;
52
53 f2fs_bug_on(F2FS_P_SB(page), page->index);
54
55 zero_user_segment(page, MAX_INLINE_DATA(inode), PAGE_SIZE);
56
57 /* Copy the whole inline data block */
58 src_addr = inline_data_addr(inode, ipage);
59 dst_addr = kmap_atomic(page);
60 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
61 flush_dcache_page(page);
62 kunmap_atomic(dst_addr);
63 if (!PageUptodate(page))
64 SetPageUptodate(page);
65 }
66
f2fs_truncate_inline_inode(struct inode * inode,struct page * ipage,u64 from)67 void f2fs_truncate_inline_inode(struct inode *inode,
68 struct page *ipage, u64 from)
69 {
70 void *addr;
71
72 if (from >= MAX_INLINE_DATA(inode))
73 return;
74
75 addr = inline_data_addr(inode, ipage);
76
77 f2fs_wait_on_page_writeback(ipage, NODE, true, true);
78 memset(addr + from, 0, MAX_INLINE_DATA(inode) - from);
79 set_page_dirty(ipage);
80
81 if (from == 0)
82 clear_inode_flag(inode, FI_DATA_EXIST);
83 }
84
f2fs_read_inline_data(struct inode * inode,struct page * page)85 int f2fs_read_inline_data(struct inode *inode, struct page *page)
86 {
87 struct page *ipage;
88
89 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
90 if (IS_ERR(ipage)) {
91 unlock_page(page);
92 return PTR_ERR(ipage);
93 }
94
95 if (!f2fs_has_inline_data(inode)) {
96 f2fs_put_page(ipage, 1);
97 return -EAGAIN;
98 }
99
100 if (page->index)
101 zero_user_segment(page, 0, PAGE_SIZE);
102 else
103 f2fs_do_read_inline_data(page, ipage);
104
105 if (!PageUptodate(page))
106 SetPageUptodate(page);
107 f2fs_put_page(ipage, 1);
108 unlock_page(page);
109 return 0;
110 }
111
f2fs_convert_inline_page(struct dnode_of_data * dn,struct page * page)112 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
113 {
114 struct f2fs_io_info fio = {
115 .sbi = F2FS_I_SB(dn->inode),
116 .ino = dn->inode->i_ino,
117 .type = DATA,
118 .op = REQ_OP_WRITE,
119 .op_flags = REQ_SYNC | REQ_PRIO,
120 .page = page,
121 .encrypted_page = NULL,
122 .io_type = FS_DATA_IO,
123 };
124 struct node_info ni;
125 int dirty, err;
126
127 if (!f2fs_exist_data(dn->inode))
128 goto clear_out;
129
130 err = f2fs_reserve_block(dn, 0);
131 if (err)
132 return err;
133
134 err = f2fs_get_node_info(fio.sbi, dn->nid, &ni);
135 if (err) {
136 f2fs_truncate_data_blocks_range(dn, 1);
137 f2fs_put_dnode(dn);
138 return err;
139 }
140
141 fio.version = ni.version;
142
143 if (unlikely(dn->data_blkaddr != NEW_ADDR)) {
144 f2fs_put_dnode(dn);
145 set_sbi_flag(fio.sbi, SBI_NEED_FSCK);
146 f2fs_warn(fio.sbi, "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, run fsck to fix.",
147 __func__, dn->inode->i_ino, dn->data_blkaddr);
148 return -EFSCORRUPTED;
149 }
150
151 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
152
153 f2fs_do_read_inline_data(page, dn->inode_page);
154 set_page_dirty(page);
155
156 /* clear dirty state */
157 dirty = clear_page_dirty_for_io(page);
158
159 /* write data page to try to make data consistent */
160 set_page_writeback(page);
161 ClearPageError(page);
162 fio.old_blkaddr = dn->data_blkaddr;
163 set_inode_flag(dn->inode, FI_HOT_DATA);
164 f2fs_outplace_write_data(dn, &fio);
165 f2fs_wait_on_page_writeback(page, DATA, true, true);
166 if (dirty) {
167 inode_dec_dirty_pages(dn->inode);
168 f2fs_remove_dirty_inode(dn->inode);
169 }
170
171 /* this converted inline_data should be recovered. */
172 set_inode_flag(dn->inode, FI_APPEND_WRITE);
173
174 /* clear inline data and flag after data writeback */
175 f2fs_truncate_inline_inode(dn->inode, dn->inode_page, 0);
176 clear_inline_node(dn->inode_page);
177 clear_out:
178 stat_dec_inline_inode(dn->inode);
179 clear_inode_flag(dn->inode, FI_INLINE_DATA);
180 f2fs_put_dnode(dn);
181 return 0;
182 }
183
f2fs_convert_inline_inode(struct inode * inode)184 int f2fs_convert_inline_inode(struct inode *inode)
185 {
186 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
187 struct dnode_of_data dn;
188 struct page *ipage, *page;
189 int err = 0;
190
191 if (!f2fs_has_inline_data(inode))
192 return 0;
193
194 err = dquot_initialize(inode);
195 if (err)
196 return err;
197
198 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
199 if (!page)
200 return -ENOMEM;
201
202 f2fs_lock_op(sbi);
203
204 ipage = f2fs_get_node_page(sbi, inode->i_ino);
205 if (IS_ERR(ipage)) {
206 err = PTR_ERR(ipage);
207 goto out;
208 }
209
210 set_new_dnode(&dn, inode, ipage, ipage, 0);
211
212 if (f2fs_has_inline_data(inode))
213 err = f2fs_convert_inline_page(&dn, page);
214
215 f2fs_put_dnode(&dn);
216 out:
217 f2fs_unlock_op(sbi);
218
219 f2fs_put_page(page, 1);
220
221 if (!err)
222 f2fs_balance_fs(sbi, dn.node_changed);
223
224 return err;
225 }
226
f2fs_write_inline_data(struct inode * inode,struct page * page)227 int f2fs_write_inline_data(struct inode *inode, struct page *page)
228 {
229 void *src_addr, *dst_addr;
230 struct dnode_of_data dn;
231 int err;
232
233 set_new_dnode(&dn, inode, NULL, NULL, 0);
234 err = f2fs_get_dnode_of_data(&dn, 0, LOOKUP_NODE);
235 if (err)
236 return err;
237
238 if (!f2fs_has_inline_data(inode)) {
239 f2fs_put_dnode(&dn);
240 return -EAGAIN;
241 }
242
243 f2fs_bug_on(F2FS_I_SB(inode), page->index);
244
245 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true, true);
246 src_addr = kmap_atomic(page);
247 dst_addr = inline_data_addr(inode, dn.inode_page);
248 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
249 kunmap_atomic(src_addr);
250 set_page_dirty(dn.inode_page);
251
252 f2fs_clear_page_cache_dirty_tag(page);
253
254 set_inode_flag(inode, FI_APPEND_WRITE);
255 set_inode_flag(inode, FI_DATA_EXIST);
256
257 clear_inline_node(dn.inode_page);
258 f2fs_put_dnode(&dn);
259 return 0;
260 }
261
f2fs_recover_inline_data(struct inode * inode,struct page * npage)262 int f2fs_recover_inline_data(struct inode *inode, struct page *npage)
263 {
264 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
265 struct f2fs_inode *ri = NULL;
266 void *src_addr, *dst_addr;
267 struct page *ipage;
268
269 /*
270 * The inline_data recovery policy is as follows.
271 * [prev.] [next] of inline_data flag
272 * o o -> recover inline_data
273 * o x -> remove inline_data, and then recover data blocks
274 * x o -> remove inline_data, and then recover inline_data
275 * x x -> recover data blocks
276 */
277 if (IS_INODE(npage))
278 ri = F2FS_INODE(npage);
279
280 if (f2fs_has_inline_data(inode) &&
281 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
282 process_inline:
283 ipage = f2fs_get_node_page(sbi, inode->i_ino);
284 if (IS_ERR(ipage))
285 return PTR_ERR(ipage);
286
287 f2fs_wait_on_page_writeback(ipage, NODE, true, true);
288
289 src_addr = inline_data_addr(inode, npage);
290 dst_addr = inline_data_addr(inode, ipage);
291 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
292
293 set_inode_flag(inode, FI_INLINE_DATA);
294 set_inode_flag(inode, FI_DATA_EXIST);
295
296 set_page_dirty(ipage);
297 f2fs_put_page(ipage, 1);
298 return 1;
299 }
300
301 if (f2fs_has_inline_data(inode)) {
302 ipage = f2fs_get_node_page(sbi, inode->i_ino);
303 if (IS_ERR(ipage))
304 return PTR_ERR(ipage);
305 f2fs_truncate_inline_inode(inode, ipage, 0);
306 clear_inode_flag(inode, FI_INLINE_DATA);
307 f2fs_put_page(ipage, 1);
308 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
309 int ret;
310
311 ret = f2fs_truncate_blocks(inode, 0, false);
312 if (ret)
313 return ret;
314 goto process_inline;
315 }
316 return 0;
317 }
318
f2fs_find_in_inline_dir(struct inode * dir,const struct f2fs_filename * fname,struct page ** res_page)319 struct f2fs_dir_entry *f2fs_find_in_inline_dir(struct inode *dir,
320 const struct f2fs_filename *fname,
321 struct page **res_page)
322 {
323 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
324 struct f2fs_dir_entry *de;
325 struct f2fs_dentry_ptr d;
326 struct page *ipage;
327 void *inline_dentry;
328
329 ipage = f2fs_get_node_page(sbi, dir->i_ino);
330 if (IS_ERR(ipage)) {
331 *res_page = ipage;
332 return NULL;
333 }
334
335 inline_dentry = inline_data_addr(dir, ipage);
336
337 make_dentry_ptr_inline(dir, &d, inline_dentry);
338 de = f2fs_find_target_dentry(&d, fname, NULL);
339 unlock_page(ipage);
340 if (de)
341 *res_page = ipage;
342 else
343 f2fs_put_page(ipage, 0);
344
345 return de;
346 }
347
f2fs_make_empty_inline_dir(struct inode * inode,struct inode * parent,struct page * ipage)348 int f2fs_make_empty_inline_dir(struct inode *inode, struct inode *parent,
349 struct page *ipage)
350 {
351 struct f2fs_dentry_ptr d;
352 void *inline_dentry;
353
354 inline_dentry = inline_data_addr(inode, ipage);
355
356 make_dentry_ptr_inline(inode, &d, inline_dentry);
357 f2fs_do_make_empty_dir(inode, parent, &d);
358
359 set_page_dirty(ipage);
360
361 /* update i_size to MAX_INLINE_DATA */
362 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
363 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
364 return 0;
365 }
366
367 /*
368 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
369 * release ipage in this function.
370 */
f2fs_move_inline_dirents(struct inode * dir,struct page * ipage,void * inline_dentry)371 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
372 void *inline_dentry)
373 {
374 struct page *page;
375 struct dnode_of_data dn;
376 struct f2fs_dentry_block *dentry_blk;
377 struct f2fs_dentry_ptr src, dst;
378 int err;
379
380 page = f2fs_grab_cache_page(dir->i_mapping, 0, true);
381 if (!page) {
382 f2fs_put_page(ipage, 1);
383 return -ENOMEM;
384 }
385
386 set_new_dnode(&dn, dir, ipage, NULL, 0);
387 err = f2fs_reserve_block(&dn, 0);
388 if (err)
389 goto out;
390
391 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
392 f2fs_put_dnode(&dn);
393 set_sbi_flag(F2FS_P_SB(page), SBI_NEED_FSCK);
394 f2fs_warn(F2FS_P_SB(page), "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, run fsck to fix.",
395 __func__, dir->i_ino, dn.data_blkaddr);
396 err = -EFSCORRUPTED;
397 goto out;
398 }
399
400 f2fs_wait_on_page_writeback(page, DATA, true, true);
401
402 dentry_blk = page_address(page);
403
404 make_dentry_ptr_inline(dir, &src, inline_dentry);
405 make_dentry_ptr_block(dir, &dst, dentry_blk);
406
407 /* copy data from inline dentry block to new dentry block */
408 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
409 memset(dst.bitmap + src.nr_bitmap, 0, dst.nr_bitmap - src.nr_bitmap);
410 /*
411 * we do not need to zero out remainder part of dentry and filename
412 * field, since we have used bitmap for marking the usage status of
413 * them, besides, we can also ignore copying/zeroing reserved space
414 * of dentry block, because them haven't been used so far.
415 */
416 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
417 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
418
419 if (!PageUptodate(page))
420 SetPageUptodate(page);
421 set_page_dirty(page);
422
423 /* clear inline dir and flag after data writeback */
424 f2fs_truncate_inline_inode(dir, ipage, 0);
425
426 stat_dec_inline_dir(dir);
427 clear_inode_flag(dir, FI_INLINE_DENTRY);
428
429 /*
430 * should retrieve reserved space which was used to keep
431 * inline_dentry's structure for backward compatibility.
432 */
433 if (!f2fs_sb_has_flexible_inline_xattr(F2FS_I_SB(dir)) &&
434 !f2fs_has_inline_xattr(dir))
435 F2FS_I(dir)->i_inline_xattr_size = 0;
436
437 f2fs_i_depth_write(dir, 1);
438 if (i_size_read(dir) < PAGE_SIZE)
439 f2fs_i_size_write(dir, PAGE_SIZE);
440 out:
441 f2fs_put_page(page, 1);
442 return err;
443 }
444
f2fs_add_inline_entries(struct inode * dir,void * inline_dentry)445 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
446 {
447 struct f2fs_dentry_ptr d;
448 unsigned long bit_pos = 0;
449 int err = 0;
450
451 make_dentry_ptr_inline(dir, &d, inline_dentry);
452
453 while (bit_pos < d.max) {
454 struct f2fs_dir_entry *de;
455 struct f2fs_filename fname;
456 nid_t ino;
457 umode_t fake_mode;
458
459 if (!test_bit_le(bit_pos, d.bitmap)) {
460 bit_pos++;
461 continue;
462 }
463
464 de = &d.dentry[bit_pos];
465
466 if (unlikely(!de->name_len)) {
467 bit_pos++;
468 continue;
469 }
470
471 /*
472 * We only need the disk_name and hash to move the dentry.
473 * We don't need the original or casefolded filenames.
474 */
475 memset(&fname, 0, sizeof(fname));
476 fname.disk_name.name = d.filename[bit_pos];
477 fname.disk_name.len = le16_to_cpu(de->name_len);
478 fname.hash = de->hash_code;
479
480 ino = le32_to_cpu(de->ino);
481 fake_mode = f2fs_get_de_type(de) << S_SHIFT;
482
483 err = f2fs_add_regular_entry(dir, &fname, NULL, ino, fake_mode);
484 if (err)
485 goto punch_dentry_pages;
486
487 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
488 }
489 return 0;
490 punch_dentry_pages:
491 truncate_inode_pages(&dir->i_data, 0);
492 f2fs_truncate_blocks(dir, 0, false);
493 f2fs_remove_dirty_inode(dir);
494 return err;
495 }
496
f2fs_move_rehashed_dirents(struct inode * dir,struct page * ipage,void * inline_dentry)497 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
498 void *inline_dentry)
499 {
500 void *backup_dentry;
501 int err;
502
503 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
504 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
505 if (!backup_dentry) {
506 f2fs_put_page(ipage, 1);
507 return -ENOMEM;
508 }
509
510 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
511 f2fs_truncate_inline_inode(dir, ipage, 0);
512
513 unlock_page(ipage);
514
515 err = f2fs_add_inline_entries(dir, backup_dentry);
516 if (err)
517 goto recover;
518
519 lock_page(ipage);
520
521 stat_dec_inline_dir(dir);
522 clear_inode_flag(dir, FI_INLINE_DENTRY);
523
524 /*
525 * should retrieve reserved space which was used to keep
526 * inline_dentry's structure for backward compatibility.
527 */
528 if (!f2fs_sb_has_flexible_inline_xattr(F2FS_I_SB(dir)) &&
529 !f2fs_has_inline_xattr(dir))
530 F2FS_I(dir)->i_inline_xattr_size = 0;
531
532 kfree(backup_dentry);
533 return 0;
534 recover:
535 lock_page(ipage);
536 f2fs_wait_on_page_writeback(ipage, NODE, true, true);
537 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
538 f2fs_i_depth_write(dir, 0);
539 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
540 set_page_dirty(ipage);
541 f2fs_put_page(ipage, 1);
542
543 kfree(backup_dentry);
544 return err;
545 }
546
do_convert_inline_dir(struct inode * dir,struct page * ipage,void * inline_dentry)547 static int do_convert_inline_dir(struct inode *dir, struct page *ipage,
548 void *inline_dentry)
549 {
550 if (!F2FS_I(dir)->i_dir_level)
551 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
552 else
553 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
554 }
555
f2fs_try_convert_inline_dir(struct inode * dir,struct dentry * dentry)556 int f2fs_try_convert_inline_dir(struct inode *dir, struct dentry *dentry)
557 {
558 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
559 struct page *ipage;
560 struct f2fs_filename fname;
561 void *inline_dentry = NULL;
562 int err = 0;
563
564 if (!f2fs_has_inline_dentry(dir))
565 return 0;
566
567 f2fs_lock_op(sbi);
568
569 err = f2fs_setup_filename(dir, &dentry->d_name, 0, &fname);
570 if (err)
571 goto out;
572
573 ipage = f2fs_get_node_page(sbi, dir->i_ino);
574 if (IS_ERR(ipage)) {
575 err = PTR_ERR(ipage);
576 goto out_fname;
577 }
578
579 if (f2fs_has_enough_room(dir, ipage, &fname)) {
580 f2fs_put_page(ipage, 1);
581 goto out_fname;
582 }
583
584 inline_dentry = inline_data_addr(dir, ipage);
585
586 err = do_convert_inline_dir(dir, ipage, inline_dentry);
587 if (!err)
588 f2fs_put_page(ipage, 1);
589 out_fname:
590 f2fs_free_filename(&fname);
591 out:
592 f2fs_unlock_op(sbi);
593 return err;
594 }
595
f2fs_add_inline_entry(struct inode * dir,const struct f2fs_filename * fname,struct inode * inode,nid_t ino,umode_t mode)596 int f2fs_add_inline_entry(struct inode *dir, const struct f2fs_filename *fname,
597 struct inode *inode, nid_t ino, umode_t mode)
598 {
599 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
600 struct page *ipage;
601 unsigned int bit_pos;
602 void *inline_dentry = NULL;
603 struct f2fs_dentry_ptr d;
604 int slots = GET_DENTRY_SLOTS(fname->disk_name.len);
605 struct page *page = NULL;
606 int err = 0;
607
608 ipage = f2fs_get_node_page(sbi, dir->i_ino);
609 if (IS_ERR(ipage))
610 return PTR_ERR(ipage);
611
612 inline_dentry = inline_data_addr(dir, ipage);
613 make_dentry_ptr_inline(dir, &d, inline_dentry);
614
615 bit_pos = f2fs_room_for_filename(d.bitmap, slots, d.max);
616 if (bit_pos >= d.max) {
617 err = do_convert_inline_dir(dir, ipage, inline_dentry);
618 if (err)
619 return err;
620 err = -EAGAIN;
621 goto out;
622 }
623
624 if (inode) {
625 down_write(&F2FS_I(inode)->i_sem);
626 page = f2fs_init_inode_metadata(inode, dir, fname, ipage);
627 if (IS_ERR(page)) {
628 err = PTR_ERR(page);
629 goto fail;
630 }
631 }
632
633 f2fs_wait_on_page_writeback(ipage, NODE, true, true);
634
635 f2fs_update_dentry(ino, mode, &d, &fname->disk_name, fname->hash,
636 bit_pos);
637
638 set_page_dirty(ipage);
639
640 /* we don't need to mark_inode_dirty now */
641 if (inode) {
642 f2fs_i_pino_write(inode, dir->i_ino);
643
644 /* synchronize inode page's data from inode cache */
645 if (is_inode_flag_set(inode, FI_NEW_INODE))
646 f2fs_update_inode(inode, page);
647
648 f2fs_put_page(page, 1);
649 }
650
651 f2fs_update_parent_metadata(dir, inode, 0);
652 fail:
653 if (inode)
654 up_write(&F2FS_I(inode)->i_sem);
655 out:
656 f2fs_put_page(ipage, 1);
657 return err;
658 }
659
f2fs_delete_inline_entry(struct f2fs_dir_entry * dentry,struct page * page,struct inode * dir,struct inode * inode)660 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
661 struct inode *dir, struct inode *inode)
662 {
663 struct f2fs_dentry_ptr d;
664 void *inline_dentry;
665 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
666 unsigned int bit_pos;
667 int i;
668
669 lock_page(page);
670 f2fs_wait_on_page_writeback(page, NODE, true, true);
671
672 inline_dentry = inline_data_addr(dir, page);
673 make_dentry_ptr_inline(dir, &d, inline_dentry);
674
675 bit_pos = dentry - d.dentry;
676 for (i = 0; i < slots; i++)
677 __clear_bit_le(bit_pos + i, d.bitmap);
678
679 set_page_dirty(page);
680 f2fs_put_page(page, 1);
681
682 dir->i_ctime = dir->i_mtime = current_time(dir);
683 f2fs_mark_inode_dirty_sync(dir, false);
684
685 if (inode)
686 f2fs_drop_nlink(dir, inode);
687 }
688
f2fs_empty_inline_dir(struct inode * dir)689 bool f2fs_empty_inline_dir(struct inode *dir)
690 {
691 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
692 struct page *ipage;
693 unsigned int bit_pos = 2;
694 void *inline_dentry;
695 struct f2fs_dentry_ptr d;
696
697 ipage = f2fs_get_node_page(sbi, dir->i_ino);
698 if (IS_ERR(ipage))
699 return false;
700
701 inline_dentry = inline_data_addr(dir, ipage);
702 make_dentry_ptr_inline(dir, &d, inline_dentry);
703
704 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
705
706 f2fs_put_page(ipage, 1);
707
708 if (bit_pos < d.max)
709 return false;
710
711 return true;
712 }
713
f2fs_read_inline_dir(struct file * file,struct dir_context * ctx,struct fscrypt_str * fstr)714 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
715 struct fscrypt_str *fstr)
716 {
717 struct inode *inode = file_inode(file);
718 struct page *ipage = NULL;
719 struct f2fs_dentry_ptr d;
720 void *inline_dentry = NULL;
721 int err;
722
723 make_dentry_ptr_inline(inode, &d, inline_dentry);
724
725 if (ctx->pos == d.max)
726 return 0;
727
728 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
729 if (IS_ERR(ipage))
730 return PTR_ERR(ipage);
731
732 /*
733 * f2fs_readdir was protected by inode.i_rwsem, it is safe to access
734 * ipage without page's lock held.
735 */
736 unlock_page(ipage);
737
738 inline_dentry = inline_data_addr(inode, ipage);
739
740 make_dentry_ptr_inline(inode, &d, inline_dentry);
741
742 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
743 if (!err)
744 ctx->pos = d.max;
745
746 f2fs_put_page(ipage, 0);
747 return err < 0 ? err : 0;
748 }
749
f2fs_inline_data_fiemap(struct inode * inode,struct fiemap_extent_info * fieinfo,__u64 start,__u64 len)750 int f2fs_inline_data_fiemap(struct inode *inode,
751 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
752 {
753 __u64 byteaddr, ilen;
754 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
755 FIEMAP_EXTENT_LAST;
756 struct node_info ni;
757 struct page *ipage;
758 int err = 0;
759
760 ipage = f2fs_get_node_page(F2FS_I_SB(inode), inode->i_ino);
761 if (IS_ERR(ipage))
762 return PTR_ERR(ipage);
763
764 if ((S_ISREG(inode->i_mode) || S_ISLNK(inode->i_mode)) &&
765 !f2fs_has_inline_data(inode)) {
766 err = -EAGAIN;
767 goto out;
768 }
769
770 if (S_ISDIR(inode->i_mode) && !f2fs_has_inline_dentry(inode)) {
771 err = -EAGAIN;
772 goto out;
773 }
774
775 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
776 if (start >= ilen)
777 goto out;
778 if (start + len < ilen)
779 ilen = start + len;
780 ilen -= start;
781
782 err = f2fs_get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
783 if (err)
784 goto out;
785
786 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
787 byteaddr += (char *)inline_data_addr(inode, ipage) -
788 (char *)F2FS_INODE(ipage);
789 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
790 trace_f2fs_fiemap(inode, start, byteaddr, ilen, flags, err);
791 out:
792 f2fs_put_page(ipage, 1);
793 return err;
794 }
795