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
support_inline_data(struct inode * inode)17 static 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
f2fs_may_inline_data(struct inode * inode)28 bool 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
inode_has_blocks(struct inode * inode,struct folio * ifolio)36 static bool inode_has_blocks(struct inode *inode, struct folio *ifolio)
37 {
38 struct f2fs_inode *ri = F2FS_INODE(ifolio);
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
f2fs_sanity_check_inline_data(struct inode * inode,struct folio * ifolio)51 bool f2fs_sanity_check_inline_data(struct inode *inode, struct folio *ifolio)
52 {
53 if (!f2fs_has_inline_data(inode))
54 return false;
55
56 if (inode_has_blocks(inode, ifolio))
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
f2fs_may_inline_dentry(struct inode * inode)71 bool 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
f2fs_do_read_inline_data(struct folio * folio,struct folio * ifolio)82 void f2fs_do_read_inline_data(struct folio *folio, struct folio *ifolio)
83 {
84 struct inode *inode = folio->mapping->host;
85
86 if (folio_test_uptodate(folio))
87 return;
88
89 f2fs_bug_on(F2FS_I_SB(inode), folio->index);
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, ifolio),
95 MAX_INLINE_DATA(inode));
96 if (!folio_test_uptodate(folio))
97 folio_mark_uptodate(folio);
98 }
99
f2fs_truncate_inline_inode(struct inode * inode,struct folio * ifolio,u64 from)100 void f2fs_truncate_inline_inode(struct inode *inode, struct folio *ifolio,
101 u64 from)
102 {
103 void *addr;
104
105 if (from >= MAX_INLINE_DATA(inode))
106 return;
107
108 addr = inline_data_addr(inode, ifolio);
109
110 f2fs_folio_wait_writeback(ifolio, NODE, true, true);
111 memset(addr + from, 0, MAX_INLINE_DATA(inode) - from);
112 folio_mark_dirty(ifolio);
113
114 if (from == 0)
115 clear_inode_flag(inode, FI_DATA_EXIST);
116 }
117
f2fs_read_inline_data(struct inode * inode,struct folio * folio)118 int f2fs_read_inline_data(struct inode *inode, struct folio *folio)
119 {
120 struct folio *ifolio;
121
122 ifolio = f2fs_get_inode_folio(F2FS_I_SB(inode), inode->i_ino);
123 if (IS_ERR(ifolio)) {
124 folio_unlock(folio);
125 return PTR_ERR(ifolio);
126 }
127
128 if (!f2fs_has_inline_data(inode)) {
129 f2fs_folio_put(ifolio, true);
130 return -EAGAIN;
131 }
132
133 if (folio->index)
134 folio_zero_segment(folio, 0, folio_size(folio));
135 else
136 f2fs_do_read_inline_data(folio, ifolio);
137
138 if (!folio_test_uptodate(folio))
139 folio_mark_uptodate(folio);
140 f2fs_folio_put(ifolio, true);
141 folio_unlock(folio);
142 return 0;
143 }
144
f2fs_convert_inline_folio(struct dnode_of_data * dn,struct folio * folio)145 int f2fs_convert_inline_folio(struct dnode_of_data *dn, struct folio *folio)
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 .folio = folio,
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_F_SB(folio), folio_test_writeback(folio));
186
187 f2fs_do_read_inline_data(folio, dn->inode_folio);
188 folio_mark_dirty(folio);
189
190 /* clear dirty state */
191 dirty = folio_clear_dirty_for_io(folio);
192
193 /* write data page to try to make data consistent */
194 folio_start_writeback(folio);
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_folio_wait_writeback(folio, 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_folio, 0);
209 folio_clear_f2fs_inline(dn->inode_folio);
210 clear_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
f2fs_convert_inline_inode(struct inode * inode)217 int 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 f2fs_lock_context lc;
222 struct folio *ifolio, *folio;
223 int err = 0;
224
225 if (f2fs_hw_is_readonly(sbi) || f2fs_readonly(sbi->sb))
226 return -EROFS;
227
228 if (!f2fs_has_inline_data(inode))
229 return 0;
230
231 err = f2fs_dquot_initialize(inode);
232 if (err)
233 return err;
234
235 folio = f2fs_grab_cache_folio(inode->i_mapping, 0, false);
236 if (IS_ERR(folio))
237 return PTR_ERR(folio);
238
239 f2fs_lock_op(sbi, &lc);
240
241 ifolio = f2fs_get_inode_folio(sbi, inode->i_ino);
242 if (IS_ERR(ifolio)) {
243 err = PTR_ERR(ifolio);
244 goto out;
245 }
246
247 set_new_dnode(&dn, inode, ifolio, ifolio, 0);
248
249 if (f2fs_has_inline_data(inode))
250 err = f2fs_convert_inline_folio(&dn, folio);
251
252 f2fs_put_dnode(&dn);
253 out:
254 f2fs_unlock_op(sbi, &lc);
255
256 f2fs_folio_put(folio, true);
257
258 if (!err)
259 f2fs_balance_fs(sbi, dn.node_changed);
260
261 return err;
262 }
263
f2fs_write_inline_data(struct inode * inode,struct folio * folio)264 int f2fs_write_inline_data(struct inode *inode, struct folio *folio)
265 {
266 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
267 struct folio *ifolio;
268
269 ifolio = f2fs_get_inode_folio(sbi, inode->i_ino);
270 if (IS_ERR(ifolio))
271 return PTR_ERR(ifolio);
272
273 if (!f2fs_has_inline_data(inode)) {
274 f2fs_folio_put(ifolio, true);
275 return -EAGAIN;
276 }
277
278 f2fs_bug_on(F2FS_I_SB(inode), folio->index);
279
280 f2fs_folio_wait_writeback(ifolio, NODE, true, true);
281 memcpy_from_folio(inline_data_addr(inode, ifolio),
282 folio, 0, MAX_INLINE_DATA(inode));
283 folio_mark_dirty(ifolio);
284
285 f2fs_clear_page_cache_dirty_tag(folio);
286
287 set_inode_flag(inode, FI_APPEND_WRITE);
288 set_inode_flag(inode, FI_DATA_EXIST);
289
290 folio_clear_f2fs_inline(ifolio);
291 f2fs_folio_put(ifolio, true);
292 return 0;
293 }
294
f2fs_recover_inline_data(struct inode * inode,struct folio * nfolio)295 int f2fs_recover_inline_data(struct inode *inode, struct folio *nfolio)
296 {
297 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
298 struct f2fs_inode *ri = NULL;
299 void *src_addr, *dst_addr;
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(nfolio))
310 ri = F2FS_INODE(nfolio);
311
312 if (f2fs_has_inline_data(inode) &&
313 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
314 struct folio *ifolio;
315 process_inline:
316 ifolio = f2fs_get_inode_folio(sbi, inode->i_ino);
317 if (IS_ERR(ifolio))
318 return PTR_ERR(ifolio);
319
320 f2fs_folio_wait_writeback(ifolio, NODE, true, true);
321
322 src_addr = inline_data_addr(inode, nfolio);
323 dst_addr = inline_data_addr(inode, ifolio);
324 memcpy(dst_addr, src_addr, MAX_INLINE_DATA(inode));
325
326 set_inode_flag(inode, FI_INLINE_DATA);
327 set_inode_flag(inode, FI_DATA_EXIST);
328
329 folio_mark_dirty(ifolio);
330 f2fs_folio_put(ifolio, true);
331 return 1;
332 }
333
334 if (f2fs_has_inline_data(inode)) {
335 struct folio *ifolio = f2fs_get_inode_folio(sbi, inode->i_ino);
336 if (IS_ERR(ifolio))
337 return PTR_ERR(ifolio);
338 f2fs_truncate_inline_inode(inode, ifolio, 0);
339 stat_dec_inline_inode(inode);
340 clear_inode_flag(inode, FI_INLINE_DATA);
341 f2fs_folio_put(ifolio, true);
342 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
343 int ret;
344
345 ret = f2fs_truncate_blocks(inode, 0, false);
346 if (ret)
347 return ret;
348 stat_inc_inline_inode(inode);
349 goto process_inline;
350 }
351 return 0;
352 }
353
f2fs_find_in_inline_dir(struct inode * dir,const struct f2fs_filename * fname,struct folio ** res_folio,bool use_hash)354 struct f2fs_dir_entry *f2fs_find_in_inline_dir(struct inode *dir,
355 const struct f2fs_filename *fname,
356 struct folio **res_folio,
357 bool use_hash)
358 {
359 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
360 struct f2fs_dir_entry *de;
361 struct f2fs_dentry_ptr d;
362 struct folio *ifolio;
363 void *inline_dentry;
364
365 ifolio = f2fs_get_inode_folio(sbi, dir->i_ino);
366 if (IS_ERR(ifolio)) {
367 *res_folio = ifolio;
368 return NULL;
369 }
370
371 inline_dentry = inline_data_addr(dir, ifolio);
372
373 make_dentry_ptr_inline(dir, &d, inline_dentry);
374 de = f2fs_find_target_dentry(&d, fname, NULL, use_hash);
375 folio_unlock(ifolio);
376 if (IS_ERR(de)) {
377 *res_folio = ERR_CAST(de);
378 de = NULL;
379 }
380 if (de)
381 *res_folio = ifolio;
382 else
383 f2fs_folio_put(ifolio, false);
384
385 return de;
386 }
387
f2fs_make_empty_inline_dir(struct inode * inode,struct inode * parent,struct folio * ifolio)388 int f2fs_make_empty_inline_dir(struct inode *inode, struct inode *parent,
389 struct folio *ifolio)
390 {
391 struct f2fs_dentry_ptr d;
392 void *inline_dentry;
393
394 inline_dentry = inline_data_addr(inode, ifolio);
395
396 make_dentry_ptr_inline(inode, &d, inline_dentry);
397 f2fs_do_make_empty_dir(inode, parent, &d);
398
399 folio_mark_dirty(ifolio);
400
401 /* update i_size to MAX_INLINE_DATA */
402 if (i_size_read(inode) < MAX_INLINE_DATA(inode))
403 f2fs_i_size_write(inode, MAX_INLINE_DATA(inode));
404 return 0;
405 }
406
407 /*
408 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
409 * release ipage in this function.
410 */
f2fs_move_inline_dirents(struct inode * dir,struct folio * ifolio,void * inline_dentry)411 static int f2fs_move_inline_dirents(struct inode *dir, struct folio *ifolio,
412 void *inline_dentry)
413 {
414 struct folio *folio;
415 struct dnode_of_data dn;
416 struct f2fs_dentry_block *dentry_blk;
417 struct f2fs_dentry_ptr src, dst;
418 int err;
419
420 folio = f2fs_grab_cache_folio(dir->i_mapping, 0, true);
421 if (IS_ERR(folio)) {
422 f2fs_folio_put(ifolio, true);
423 return PTR_ERR(folio);
424 }
425
426 set_new_dnode(&dn, dir, ifolio, NULL, 0);
427 err = f2fs_reserve_block(&dn, 0);
428 if (err)
429 goto out;
430
431 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
432 f2fs_put_dnode(&dn);
433 set_sbi_flag(F2FS_F_SB(folio), SBI_NEED_FSCK);
434 f2fs_warn(F2FS_F_SB(folio), "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, run fsck to fix.",
435 __func__, dir->i_ino, dn.data_blkaddr);
436 f2fs_handle_error(F2FS_F_SB(folio), ERROR_INVALID_BLKADDR);
437 err = -EFSCORRUPTED;
438 goto out;
439 }
440
441 f2fs_folio_wait_writeback(folio, DATA, true, true);
442
443 dentry_blk = folio_address(folio);
444
445 /*
446 * Start by zeroing the full block, to ensure that all unused space is
447 * zeroed and no uninitialized memory is leaked to disk.
448 */
449 memset(dentry_blk, 0, F2FS_BLKSIZE);
450
451 make_dentry_ptr_inline(dir, &src, inline_dentry);
452 make_dentry_ptr_block(dir, &dst, dentry_blk);
453
454 /* copy data from inline dentry block to new dentry block */
455 memcpy(dst.bitmap, src.bitmap, src.nr_bitmap);
456 memcpy(dst.dentry, src.dentry, SIZE_OF_DIR_ENTRY * src.max);
457 memcpy(dst.filename, src.filename, src.max * F2FS_SLOT_LEN);
458
459 if (!folio_test_uptodate(folio))
460 folio_mark_uptodate(folio);
461 folio_mark_dirty(folio);
462
463 /* clear inline dir and flag after data writeback */
464 f2fs_truncate_inline_inode(dir, ifolio, 0);
465
466 stat_dec_inline_dir(dir);
467 clear_inode_flag(dir, FI_INLINE_DENTRY);
468
469 /*
470 * should retrieve reserved space which was used to keep
471 * inline_dentry's structure for backward compatibility.
472 */
473 if (!f2fs_sb_has_flexible_inline_xattr(F2FS_I_SB(dir)) &&
474 !f2fs_has_inline_xattr(dir))
475 F2FS_I(dir)->i_inline_xattr_size = 0;
476
477 f2fs_i_depth_write(dir, 1);
478 if (i_size_read(dir) < PAGE_SIZE)
479 f2fs_i_size_write(dir, PAGE_SIZE);
480 out:
481 f2fs_folio_put(folio, true);
482 return err;
483 }
484
f2fs_add_inline_entries(struct inode * dir,void * inline_dentry)485 static int f2fs_add_inline_entries(struct inode *dir, void *inline_dentry)
486 {
487 struct f2fs_dentry_ptr d;
488 unsigned long bit_pos = 0;
489 int err = 0;
490
491 make_dentry_ptr_inline(dir, &d, inline_dentry);
492
493 while (bit_pos < d.max) {
494 struct f2fs_dir_entry *de;
495 struct f2fs_filename fname;
496 nid_t ino;
497 umode_t fake_mode;
498
499 if (!test_bit_le(bit_pos, d.bitmap)) {
500 bit_pos++;
501 continue;
502 }
503
504 de = &d.dentry[bit_pos];
505
506 if (unlikely(!de->name_len)) {
507 bit_pos++;
508 continue;
509 }
510
511 /*
512 * We only need the disk_name and hash to move the dentry.
513 * We don't need the original or casefolded filenames.
514 */
515 memset(&fname, 0, sizeof(fname));
516 fname.disk_name.name = d.filename[bit_pos];
517 fname.disk_name.len = le16_to_cpu(de->name_len);
518 fname.hash = de->hash_code;
519
520 ino = le32_to_cpu(de->ino);
521 fake_mode = fs_ftype_to_dtype(de->file_type) << S_DT_SHIFT;
522
523 err = f2fs_add_regular_entry(dir, &fname, NULL, ino, fake_mode);
524 if (err)
525 goto punch_dentry_pages;
526
527 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
528 }
529 return 0;
530 punch_dentry_pages:
531 truncate_inode_pages(&dir->i_data, 0);
532 f2fs_truncate_blocks(dir, 0, false);
533 f2fs_remove_dirty_inode(dir);
534 return err;
535 }
536
f2fs_move_rehashed_dirents(struct inode * dir,struct folio * ifolio,void * inline_dentry)537 static int f2fs_move_rehashed_dirents(struct inode *dir, struct folio *ifolio,
538 void *inline_dentry)
539 {
540 void *backup_dentry;
541 int err;
542
543 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
544 MAX_INLINE_DATA(dir), GFP_F2FS_ZERO);
545 if (!backup_dentry) {
546 f2fs_folio_put(ifolio, true);
547 return -ENOMEM;
548 }
549
550 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA(dir));
551 f2fs_truncate_inline_inode(dir, ifolio, 0);
552
553 folio_unlock(ifolio);
554
555 err = f2fs_add_inline_entries(dir, backup_dentry);
556 if (err)
557 goto recover;
558
559 folio_lock(ifolio);
560
561 stat_dec_inline_dir(dir);
562 clear_inode_flag(dir, FI_INLINE_DENTRY);
563
564 /*
565 * should retrieve reserved space which was used to keep
566 * inline_dentry's structure for backward compatibility.
567 */
568 if (!f2fs_sb_has_flexible_inline_xattr(F2FS_I_SB(dir)) &&
569 !f2fs_has_inline_xattr(dir))
570 F2FS_I(dir)->i_inline_xattr_size = 0;
571
572 kfree(backup_dentry);
573 return 0;
574 recover:
575 folio_lock(ifolio);
576 f2fs_folio_wait_writeback(ifolio, NODE, true, true);
577 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA(dir));
578 f2fs_i_depth_write(dir, 0);
579 f2fs_i_size_write(dir, MAX_INLINE_DATA(dir));
580 folio_mark_dirty(ifolio);
581 f2fs_folio_put(ifolio, true);
582
583 kfree(backup_dentry);
584 return err;
585 }
586
do_convert_inline_dir(struct inode * dir,struct folio * ifolio,void * inline_dentry)587 static int do_convert_inline_dir(struct inode *dir, struct folio *ifolio,
588 void *inline_dentry)
589 {
590 if (!F2FS_I(dir)->i_dir_level)
591 return f2fs_move_inline_dirents(dir, ifolio, inline_dentry);
592 else
593 return f2fs_move_rehashed_dirents(dir, ifolio, inline_dentry);
594 }
595
f2fs_try_convert_inline_dir(struct inode * dir,struct dentry * dentry)596 int f2fs_try_convert_inline_dir(struct inode *dir, struct dentry *dentry)
597 {
598 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
599 struct folio *ifolio;
600 struct f2fs_filename fname;
601 struct f2fs_lock_context lc;
602 void *inline_dentry = NULL;
603 int err = 0;
604
605 if (!f2fs_has_inline_dentry(dir))
606 return 0;
607
608 f2fs_lock_op(sbi, &lc);
609
610 err = f2fs_setup_filename(dir, &dentry->d_name, 0, &fname);
611 if (err)
612 goto out;
613
614 ifolio = f2fs_get_inode_folio(sbi, dir->i_ino);
615 if (IS_ERR(ifolio)) {
616 err = PTR_ERR(ifolio);
617 goto out_fname;
618 }
619
620 if (f2fs_has_enough_room(dir, ifolio, &fname)) {
621 f2fs_folio_put(ifolio, true);
622 goto out_fname;
623 }
624
625 inline_dentry = inline_data_addr(dir, ifolio);
626
627 err = do_convert_inline_dir(dir, ifolio, inline_dentry);
628 if (!err)
629 f2fs_folio_put(ifolio, true);
630 out_fname:
631 f2fs_free_filename(&fname);
632 out:
633 f2fs_unlock_op(sbi, &lc);
634 return err;
635 }
636
f2fs_add_inline_entry(struct inode * dir,const struct f2fs_filename * fname,struct inode * inode,nid_t ino,umode_t mode)637 int f2fs_add_inline_entry(struct inode *dir, const struct f2fs_filename *fname,
638 struct inode *inode, nid_t ino, umode_t mode)
639 {
640 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
641 struct folio *ifolio;
642 unsigned int bit_pos;
643 void *inline_dentry = NULL;
644 struct f2fs_dentry_ptr d;
645 int slots = GET_DENTRY_SLOTS(fname->disk_name.len);
646 struct folio *folio = NULL;
647 int err = 0;
648
649 ifolio = f2fs_get_inode_folio(sbi, dir->i_ino);
650 if (IS_ERR(ifolio))
651 return PTR_ERR(ifolio);
652
653 inline_dentry = inline_data_addr(dir, ifolio);
654 make_dentry_ptr_inline(dir, &d, inline_dentry);
655
656 bit_pos = f2fs_room_for_filename(d.bitmap, slots, d.max);
657 if (bit_pos >= d.max) {
658 err = do_convert_inline_dir(dir, ifolio, inline_dentry);
659 if (err)
660 return err;
661 err = -EAGAIN;
662 goto out;
663 }
664
665 if (inode) {
666 f2fs_down_write_nested(&F2FS_I(inode)->i_sem,
667 SINGLE_DEPTH_NESTING);
668 folio = f2fs_init_inode_metadata(inode, dir, fname, ifolio);
669 if (IS_ERR(folio)) {
670 err = PTR_ERR(folio);
671 goto fail;
672 }
673 }
674
675 f2fs_folio_wait_writeback(ifolio, NODE, true, true);
676
677 f2fs_update_dentry(ino, mode, &d, &fname->disk_name, fname->hash,
678 bit_pos);
679
680 folio_mark_dirty(ifolio);
681
682 /* we don't need to mark_inode_dirty now */
683 if (inode) {
684 f2fs_i_pino_write(inode, dir->i_ino);
685
686 /* synchronize inode page's data from inode cache */
687 if (is_inode_flag_set(inode, FI_NEW_INODE))
688 f2fs_update_inode(inode, folio);
689
690 f2fs_folio_put(folio, true);
691 }
692
693 f2fs_update_parent_metadata(dir, inode, 0);
694 fail:
695 if (inode)
696 f2fs_up_write(&F2FS_I(inode)->i_sem);
697 out:
698 f2fs_folio_put(ifolio, true);
699 return err;
700 }
701
f2fs_delete_inline_entry(struct f2fs_dir_entry * dentry,struct folio * folio,struct inode * dir,struct inode * inode)702 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry,
703 struct folio *folio, struct inode *dir, struct inode *inode)
704 {
705 struct f2fs_dentry_ptr d;
706 void *inline_dentry;
707 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
708 unsigned int bit_pos;
709 int i;
710
711 folio_lock(folio);
712 f2fs_folio_wait_writeback(folio, NODE, true, true);
713
714 inline_dentry = inline_data_addr(dir, folio);
715 make_dentry_ptr_inline(dir, &d, inline_dentry);
716
717 bit_pos = dentry - d.dentry;
718 for (i = 0; i < slots; i++)
719 __clear_bit_le(bit_pos + i, d.bitmap);
720
721 folio_mark_dirty(folio);
722 f2fs_folio_put(folio, true);
723
724 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
725 f2fs_mark_inode_dirty_sync(dir, false);
726
727 if (inode)
728 f2fs_drop_nlink(dir, inode);
729 }
730
f2fs_empty_inline_dir(struct inode * dir)731 bool f2fs_empty_inline_dir(struct inode *dir)
732 {
733 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
734 struct folio *ifolio;
735 unsigned int bit_pos = 2;
736 void *inline_dentry;
737 struct f2fs_dentry_ptr d;
738
739 ifolio = f2fs_get_inode_folio(sbi, dir->i_ino);
740 if (IS_ERR(ifolio))
741 return false;
742
743 inline_dentry = inline_data_addr(dir, ifolio);
744 make_dentry_ptr_inline(dir, &d, inline_dentry);
745
746 bit_pos = find_next_bit_le(d.bitmap, d.max, bit_pos);
747
748 f2fs_folio_put(ifolio, true);
749
750 if (bit_pos < d.max)
751 return false;
752
753 return true;
754 }
755
f2fs_read_inline_dir(struct file * file,struct dir_context * ctx,struct fscrypt_str * fstr)756 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
757 struct fscrypt_str *fstr)
758 {
759 struct inode *inode = file_inode(file);
760 struct folio *ifolio = NULL;
761 struct f2fs_dentry_ptr d;
762 void *inline_dentry = NULL;
763 int err;
764
765 make_dentry_ptr_inline(inode, &d, inline_dentry);
766
767 if (ctx->pos == d.max)
768 return 0;
769
770 ifolio = f2fs_get_inode_folio(F2FS_I_SB(inode), inode->i_ino);
771 if (IS_ERR(ifolio))
772 return PTR_ERR(ifolio);
773
774 /*
775 * f2fs_readdir was protected by inode.i_rwsem, it is safe to access
776 * ipage without page's lock held.
777 */
778 folio_unlock(ifolio);
779
780 inline_dentry = inline_data_addr(inode, ifolio);
781
782 make_dentry_ptr_inline(inode, &d, inline_dentry);
783
784 err = f2fs_fill_dentries(ctx, &d, 0, fstr);
785 if (!err)
786 ctx->pos = d.max;
787
788 f2fs_folio_put(ifolio, false);
789 return err < 0 ? err : 0;
790 }
791
f2fs_inline_data_fiemap(struct inode * inode,struct fiemap_extent_info * fieinfo,__u64 start,__u64 len)792 int f2fs_inline_data_fiemap(struct inode *inode,
793 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
794 {
795 __u64 byteaddr, ilen;
796 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
797 FIEMAP_EXTENT_LAST;
798 struct node_info ni;
799 struct folio *ifolio;
800 int err = 0;
801
802 ifolio = f2fs_get_inode_folio(F2FS_I_SB(inode), inode->i_ino);
803 if (IS_ERR(ifolio))
804 return PTR_ERR(ifolio);
805
806 if ((S_ISREG(inode->i_mode) || S_ISLNK(inode->i_mode)) &&
807 !f2fs_has_inline_data(inode)) {
808 err = -EAGAIN;
809 goto out;
810 }
811
812 if (S_ISDIR(inode->i_mode) && !f2fs_has_inline_dentry(inode)) {
813 err = -EAGAIN;
814 goto out;
815 }
816
817 ilen = min_t(size_t, MAX_INLINE_DATA(inode), i_size_read(inode));
818 if (start >= ilen)
819 goto out;
820 if (start + len < ilen)
821 ilen = start + len;
822 ilen -= start;
823
824 err = f2fs_get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni, false);
825 if (err)
826 goto out;
827
828 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
829 byteaddr += (char *)inline_data_addr(inode, ifolio) -
830 (char *)F2FS_INODE(ifolio);
831 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
832 trace_f2fs_fiemap(inode, start, byteaddr, ilen, flags, err);
833 out:
834 f2fs_folio_put(ifolio, true);
835 return err;
836 }
837