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