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