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