]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blob - fs/f2fs/inline.c
UBUNTU: Ubuntu-4.15.0-96.97
[mirror_ubuntu-bionic-kernel.git] / fs / f2fs / inline.c
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
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_encrypted_file(inode))
29 return false;
30
31 return true;
32 }
33
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
45 void 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
67 void truncate_inline_inode(struct inode *inode, struct page *ipage, u64 from)
68 {
69 void *addr;
70
71 if (from >= MAX_INLINE_DATA(inode))
72 return;
73
74 addr = inline_data_addr(inode, ipage);
75
76 f2fs_wait_on_page_writeback(ipage, NODE, true);
77 memset(addr + from, 0, MAX_INLINE_DATA(inode) - from);
78 set_page_dirty(ipage);
79
80 if (from == 0)
81 clear_inode_flag(inode, FI_DATA_EXIST);
82 }
83
84 int f2fs_read_inline_data(struct inode *inode, struct page *page)
85 {
86 struct page *ipage;
87
88 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
89 if (IS_ERR(ipage)) {
90 unlock_page(page);
91 return PTR_ERR(ipage);
92 }
93
94 if (!f2fs_has_inline_data(inode)) {
95 f2fs_put_page(ipage, 1);
96 return -EAGAIN;
97 }
98
99 if (page->index)
100 zero_user_segment(page, 0, PAGE_SIZE);
101 else
102 read_inline_data(page, ipage);
103
104 if (!PageUptodate(page))
105 SetPageUptodate(page);
106 f2fs_put_page(ipage, 1);
107 unlock_page(page);
108 return 0;
109 }
110
111 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
112 {
113 struct f2fs_io_info fio = {
114 .sbi = F2FS_I_SB(dn->inode),
115 .ino = dn->inode->i_ino,
116 .type = DATA,
117 .op = REQ_OP_WRITE,
118 .op_flags = REQ_SYNC | REQ_PRIO,
119 .page = page,
120 .encrypted_page = NULL,
121 .io_type = FS_DATA_IO,
122 };
123 int dirty, err;
124
125 if (!f2fs_exist_data(dn->inode))
126 goto clear_out;
127
128 err = f2fs_reserve_block(dn, 0);
129 if (err)
130 return err;
131
132 if (unlikely(dn->data_blkaddr != NEW_ADDR)) {
133 f2fs_put_dnode(dn);
134 set_sbi_flag(fio.sbi, SBI_NEED_FSCK);
135 f2fs_msg(fio.sbi->sb, KERN_WARNING,
136 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
137 "run fsck to fix.",
138 __func__, dn->inode->i_ino, dn->data_blkaddr);
139 return -EFSCORRUPTED;
140 }
141
142 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
143
144 read_inline_data(page, dn->inode_page);
145 set_page_dirty(page);
146
147 /* clear dirty state */
148 dirty = clear_page_dirty_for_io(page);
149
150 /* write data page to try to make data consistent */
151 set_page_writeback(page);
152 fio.old_blkaddr = dn->data_blkaddr;
153 set_inode_flag(dn->inode, FI_HOT_DATA);
154 write_data_page(dn, &fio);
155 f2fs_wait_on_page_writeback(page, DATA, true);
156 if (dirty) {
157 inode_dec_dirty_pages(dn->inode);
158 remove_dirty_inode(dn->inode);
159 }
160
161 /* this converted inline_data should be recovered. */
162 set_inode_flag(dn->inode, FI_APPEND_WRITE);
163
164 /* clear inline data and flag after data writeback */
165 truncate_inline_inode(dn->inode, dn->inode_page, 0);
166 clear_inline_node(dn->inode_page);
167 clear_out:
168 stat_dec_inline_inode(dn->inode);
169 clear_inode_flag(dn->inode, FI_INLINE_DATA);
170 f2fs_put_dnode(dn);
171 return 0;
172 }
173
174 int f2fs_convert_inline_inode(struct inode *inode)
175 {
176 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
177 struct dnode_of_data dn;
178 struct page *ipage, *page;
179 int err = 0;
180
181 if (!f2fs_has_inline_data(inode))
182 return 0;
183
184 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
185 if (!page)
186 return -ENOMEM;
187
188 f2fs_lock_op(sbi);
189
190 ipage = get_node_page(sbi, inode->i_ino);
191 if (IS_ERR(ipage)) {
192 err = PTR_ERR(ipage);
193 goto out;
194 }
195
196 set_new_dnode(&dn, inode, ipage, ipage, 0);
197
198 if (f2fs_has_inline_data(inode))
199 err = f2fs_convert_inline_page(&dn, page);
200
201 f2fs_put_dnode(&dn);
202 out:
203 f2fs_unlock_op(sbi);
204
205 f2fs_put_page(page, 1);
206
207 f2fs_balance_fs(sbi, dn.node_changed);
208
209 return err;
210 }
211
212 int f2fs_write_inline_data(struct inode *inode, struct page *page)
213 {
214 void *src_addr, *dst_addr;
215 struct dnode_of_data dn;
216 struct address_space *mapping = page_mapping(page);
217 unsigned long flags;
218 int err;
219
220 set_new_dnode(&dn, inode, NULL, NULL, 0);
221 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
222 if (err)
223 return err;
224
225 if (!f2fs_has_inline_data(inode)) {
226 f2fs_put_dnode(&dn);
227 return -EAGAIN;
228 }
229
230 f2fs_bug_on(F2FS_I_SB(inode), page->index);
231
232 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
233 src_addr = kmap_atomic(page);
234 dst_addr = inline_data_addr(inode, dn.inode_page);
235 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
236 kunmap_atomic(src_addr);
237 set_page_dirty(dn.inode_page);
238
239 spin_lock_irqsave(&mapping->tree_lock, flags);
240 radix_tree_tag_clear(&mapping->page_tree, page_index(page),
241 PAGECACHE_TAG_DIRTY);
242 spin_unlock_irqrestore(&mapping->tree_lock, flags);
243
244 set_inode_flag(inode, FI_APPEND_WRITE);
245 set_inode_flag(inode, FI_DATA_EXIST);
246
247 clear_inline_node(dn.inode_page);
248 f2fs_put_dnode(&dn);
249 return 0;
250 }
251
252 bool recover_inline_data(struct inode *inode, struct page *npage)
253 {
254 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
255 struct f2fs_inode *ri = NULL;
256 void *src_addr, *dst_addr;
257 struct page *ipage;
258
259 /*
260 * The inline_data recovery policy is as follows.
261 * [prev.] [next] of inline_data flag
262 * o o -> recover inline_data
263 * o x -> remove inline_data, and then recover data blocks
264 * x o -> remove inline_data, and then recover inline_data
265 * x x -> recover data blocks
266 */
267 if (IS_INODE(npage))
268 ri = F2FS_INODE(npage);
269
270 if (f2fs_has_inline_data(inode) &&
271 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
272 process_inline:
273 ipage = get_node_page(sbi, inode->i_ino);
274 f2fs_bug_on(sbi, IS_ERR(ipage));
275
276 f2fs_wait_on_page_writeback(ipage, NODE, true);
277
278 src_addr = inline_data_addr(inode, npage);
279 dst_addr = inline_data_addr(inode, ipage);
280 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
281
282 set_inode_flag(inode, FI_INLINE_DATA);
283 set_inode_flag(inode, FI_DATA_EXIST);
284
285 set_page_dirty(ipage);
286 f2fs_put_page(ipage, 1);
287 return true;
288 }
289
290 if (f2fs_has_inline_data(inode)) {
291 ipage = get_node_page(sbi, inode->i_ino);
292 f2fs_bug_on(sbi, IS_ERR(ipage));
293 truncate_inline_inode(inode, ipage, 0);
294 clear_inode_flag(inode, FI_INLINE_DATA);
295 f2fs_put_page(ipage, 1);
296 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
297 if (truncate_blocks(inode, 0, false))
298 return false;
299 goto process_inline;
300 }
301 return false;
302 }
303
304 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
305 struct fscrypt_name *fname, struct page **res_page)
306 {
307 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
308 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
309 struct f2fs_dir_entry *de;
310 struct f2fs_dentry_ptr d;
311 struct page *ipage;
312 void *inline_dentry;
313 f2fs_hash_t namehash;
314
315 ipage = get_node_page(sbi, dir->i_ino);
316 if (IS_ERR(ipage)) {
317 *res_page = ipage;
318 return NULL;
319 }
320
321 namehash = f2fs_dentry_hash(&name, fname);
322
323 inline_dentry = inline_data_addr(dir, ipage);
324
325 make_dentry_ptr_inline(dir, &d, inline_dentry);
326 de = find_target_dentry(fname, namehash, NULL, &d);
327 unlock_page(ipage);
328 if (de)
329 *res_page = ipage;
330 else
331 f2fs_put_page(ipage, 0);
332
333 return de;
334 }
335
336 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
337 struct page *ipage)
338 {
339 struct f2fs_dentry_ptr d;
340 void *inline_dentry;
341
342 inline_dentry = inline_data_addr(inode, ipage);
343
344 make_dentry_ptr_inline(inode, &d, inline_dentry);
345 do_make_empty_dir(inode, parent, &d);
346
347 set_page_dirty(ipage);
348
349 /* update i_size to MAX_INLINE_DATA */
350 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
351 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
352 return 0;
353 }
354
355 /*
356 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
357 * release ipage in this function.
358 */
359 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
360 void *inline_dentry)
361 {
362 struct page *page;
363 struct dnode_of_data dn;
364 struct f2fs_dentry_block *dentry_blk;
365 struct f2fs_dentry_ptr src, dst;
366 int err;
367
368 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
369 if (!page) {
370 f2fs_put_page(ipage, 1);
371 return -ENOMEM;
372 }
373
374 set_new_dnode(&dn, dir, ipage, NULL, 0);
375 err = f2fs_reserve_block(&dn, 0);
376 if (err)
377 goto out;
378
379 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
380 f2fs_put_dnode(&dn);
381 set_sbi_flag(F2FS_P_SB(page), SBI_NEED_FSCK);
382 f2fs_msg(F2FS_P_SB(page)->sb, KERN_WARNING,
383 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
384 "run fsck to fix.",
385 __func__, dir->i_ino, dn.data_blkaddr);
386 err = -EFSCORRUPTED;
387 goto out;
388 }
389
390 f2fs_wait_on_page_writeback(page, DATA, true);
391 zero_user_segment(page, MAX_INLINE_DATA(dir), PAGE_SIZE);
392
393 dentry_blk = kmap_atomic(page);
394
395 make_dentry_ptr_inline(dir, &src, inline_dentry);
396 make_dentry_ptr_block(dir, &dst, dentry_blk);
397
398 /* copy data from inline dentry block to new dentry block */
399 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
400 memset(dst.bitmap + src.nr_bitmap, 0, dst.nr_bitmap - src.nr_bitmap);
401 /*
402 * we do not need to zero out remainder part of dentry and filename
403 * field, since we have used bitmap for marking the usage status of
404 * them, besides, we can also ignore copying/zeroing reserved space
405 * of dentry block, because them haven't been used so far.
406 */
407 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
408 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
409
410 kunmap_atomic(dentry_blk);
411 if (!PageUptodate(page))
412 SetPageUptodate(page);
413 set_page_dirty(page);
414
415 /* clear inline dir and flag after data writeback */
416 truncate_inline_inode(dir, ipage, 0);
417
418 stat_dec_inline_dir(dir);
419 clear_inode_flag(dir, FI_INLINE_DENTRY);
420
421 f2fs_i_depth_write(dir, 1);
422 if (i_size_read(dir) < PAGE_SIZE)
423 f2fs_i_size_write(dir, PAGE_SIZE);
424 out:
425 f2fs_put_page(page, 1);
426 return err;
427 }
428
429 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
430 {
431 struct f2fs_dentry_ptr d;
432 unsigned long bit_pos = 0;
433 int err = 0;
434
435 make_dentry_ptr_inline(dir, &d, inline_dentry);
436
437 while (bit_pos < d.max) {
438 struct f2fs_dir_entry *de;
439 struct qstr new_name;
440 nid_t ino;
441 umode_t fake_mode;
442
443 if (!test_bit_le(bit_pos, d.bitmap)) {
444 bit_pos++;
445 continue;
446 }
447
448 de = &d.dentry[bit_pos];
449
450 if (unlikely(!de->name_len)) {
451 bit_pos++;
452 continue;
453 }
454
455 new_name.name = d.filename[bit_pos];
456 new_name.len = le16_to_cpu(de->name_len);
457
458 ino = le32_to_cpu(de->ino);
459 fake_mode = get_de_type(de) << S_SHIFT;
460
461 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
462 ino, fake_mode);
463 if (err)
464 goto punch_dentry_pages;
465
466 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
467 }
468 return 0;
469 punch_dentry_pages:
470 truncate_inode_pages(&dir->i_data, 0);
471 truncate_blocks(dir, 0, false);
472 remove_dirty_inode(dir);
473 return err;
474 }
475
476 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
477 void *inline_dentry)
478 {
479 void *backup_dentry;
480 int err;
481
482 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
483 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
484 if (!backup_dentry) {
485 f2fs_put_page(ipage, 1);
486 return -ENOMEM;
487 }
488
489 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
490 truncate_inline_inode(dir, ipage, 0);
491
492 unlock_page(ipage);
493
494 err = f2fs_add_inline_entries(dir, backup_dentry);
495 if (err)
496 goto recover;
497
498 lock_page(ipage);
499
500 stat_dec_inline_dir(dir);
501 clear_inode_flag(dir, FI_INLINE_DENTRY);
502 kfree(backup_dentry);
503 return 0;
504 recover:
505 lock_page(ipage);
506 f2fs_wait_on_page_writeback(ipage, NODE, true);
507 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
508 f2fs_i_depth_write(dir, 0);
509 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
510 set_page_dirty(ipage);
511 f2fs_put_page(ipage, 1);
512
513 kfree(backup_dentry);
514 return err;
515 }
516
517 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
518 void *inline_dentry)
519 {
520 if (!F2FS_I(dir)->i_dir_level)
521 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
522 else
523 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
524 }
525
526 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
527 const struct qstr *orig_name,
528 struct inode *inode, nid_t ino, umode_t mode)
529 {
530 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
531 struct page *ipage;
532 unsigned int bit_pos;
533 f2fs_hash_t name_hash;
534 void *inline_dentry = NULL;
535 struct f2fs_dentry_ptr d;
536 int slots = GET_DENTRY_SLOTS(new_name->len);
537 struct page *page = NULL;
538 int err = 0;
539
540 ipage = get_node_page(sbi, dir->i_ino);
541 if (IS_ERR(ipage))
542 return PTR_ERR(ipage);
543
544 inline_dentry = inline_data_addr(dir, ipage);
545 make_dentry_ptr_inline(dir, &d, inline_dentry);
546
547 bit_pos = room_for_filename(d.bitmap, slots, d.max);
548 if (bit_pos >= d.max) {
549 err = f2fs_convert_inline_dir(dir, ipage, inline_dentry);
550 if (err)
551 return err;
552 err = -EAGAIN;
553 goto out;
554 }
555
556 if (inode) {
557 down_write(&F2FS_I(inode)->i_sem);
558 page = init_inode_metadata(inode, dir, new_name,
559 orig_name, ipage);
560 if (IS_ERR(page)) {
561 err = PTR_ERR(page);
562 goto fail;
563 }
564 }
565
566 f2fs_wait_on_page_writeback(ipage, NODE, true);
567
568 name_hash = f2fs_dentry_hash(new_name, NULL);
569 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
570
571 set_page_dirty(ipage);
572
573 /* we don't need to mark_inode_dirty now */
574 if (inode) {
575 f2fs_i_pino_write(inode, dir->i_ino);
576 f2fs_put_page(page, 1);
577 }
578
579 update_parent_metadata(dir, inode, 0);
580 fail:
581 if (inode)
582 up_write(&F2FS_I(inode)->i_sem);
583 out:
584 f2fs_put_page(ipage, 1);
585 return err;
586 }
587
588 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
589 struct inode *dir, struct inode *inode)
590 {
591 struct f2fs_dentry_ptr d;
592 void *inline_dentry;
593 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
594 unsigned int bit_pos;
595 int i;
596
597 lock_page(page);
598 f2fs_wait_on_page_writeback(page, NODE, true);
599
600 inline_dentry = inline_data_addr(dir, page);
601 make_dentry_ptr_inline(dir, &d, inline_dentry);
602
603 bit_pos = dentry - d.dentry;
604 for (i = 0; i < slots; i++)
605 __clear_bit_le(bit_pos + i, d.bitmap);
606
607 set_page_dirty(page);
608 f2fs_put_page(page, 1);
609
610 dir->i_ctime = dir->i_mtime = current_time(dir);
611 f2fs_mark_inode_dirty_sync(dir, false);
612
613 if (inode)
614 f2fs_drop_nlink(dir, inode);
615 }
616
617 bool f2fs_empty_inline_dir(struct inode *dir)
618 {
619 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
620 struct page *ipage;
621 unsigned int bit_pos = 2;
622 void *inline_dentry;
623 struct f2fs_dentry_ptr d;
624
625 ipage = get_node_page(sbi, dir->i_ino);
626 if (IS_ERR(ipage))
627 return false;
628
629 inline_dentry = inline_data_addr(dir, ipage);
630 make_dentry_ptr_inline(dir, &d, inline_dentry);
631
632 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
633
634 f2fs_put_page(ipage, 1);
635
636 if (bit_pos < d.max)
637 return false;
638
639 return true;
640 }
641
642 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
643 struct fscrypt_str *fstr)
644 {
645 struct inode *inode = file_inode(file);
646 struct page *ipage = NULL;
647 struct f2fs_dentry_ptr d;
648 void *inline_dentry = NULL;
649 int err;
650
651 make_dentry_ptr_inline(inode, &d, inline_dentry);
652
653 if (ctx->pos == d.max)
654 return 0;
655
656 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
657 if (IS_ERR(ipage))
658 return PTR_ERR(ipage);
659
660 /*
661 * f2fs_readdir was protected by inode.i_rwsem, it is safe to access
662 * ipage without page's lock held.
663 */
664 unlock_page(ipage);
665
666 inline_dentry = inline_data_addr(inode, ipage);
667
668 make_dentry_ptr_inline(inode, &d, inline_dentry);
669
670 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
671 if (!err)
672 ctx->pos = d.max;
673
674 f2fs_put_page(ipage, 0);
675 return err < 0 ? err : 0;
676 }
677
678 int f2fs_inline_data_fiemap(struct inode *inode,
679 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
680 {
681 __u64 byteaddr, ilen;
682 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
683 FIEMAP_EXTENT_LAST;
684 struct node_info ni;
685 struct page *ipage;
686 int err = 0;
687
688 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
689 if (IS_ERR(ipage))
690 return PTR_ERR(ipage);
691
692 if (!f2fs_has_inline_data(inode)) {
693 err = -EAGAIN;
694 goto out;
695 }
696
697 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
698 if (start >= ilen)
699 goto out;
700 if (start + len < ilen)
701 ilen = start + len;
702 ilen -= start;
703
704 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
705 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
706 byteaddr += (char *)inline_data_addr(inode, ipage) -
707 (char *)F2FS_INODE(ipage);
708 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
709 out:
710 f2fs_put_page(ipage, 1);
711 return err;
712 }