arm64: kgdb: Fix single-step exception handling oops
[linux/fpc-iii.git] / fs / f2fs / inline.c
blob482888ee8942966676b84dd14b12ee8154b7b853
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 */
11 #include <linux/fs.h>
12 #include <linux/f2fs_fs.h>
14 #include "f2fs.h"
15 #include "node.h"
17 bool f2fs_may_inline_data(struct inode *inode)
19 if (f2fs_is_atomic_file(inode))
20 return false;
22 if (!S_ISREG(inode->i_mode) && !S_ISLNK(inode->i_mode))
23 return false;
25 if (i_size_read(inode) > MAX_INLINE_DATA)
26 return false;
28 if (f2fs_encrypted_inode(inode) && S_ISREG(inode->i_mode))
29 return false;
31 return true;
34 bool f2fs_may_inline_dentry(struct inode *inode)
36 if (!test_opt(F2FS_I_SB(inode), INLINE_DENTRY))
37 return false;
39 if (!S_ISDIR(inode->i_mode))
40 return false;
42 return true;
45 void read_inline_data(struct page *page, struct page *ipage)
47 void *src_addr, *dst_addr;
49 if (PageUptodate(page))
50 return;
52 f2fs_bug_on(F2FS_P_SB(page), page->index);
54 zero_user_segment(page, MAX_INLINE_DATA, PAGE_SIZE);
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);
66 bool truncate_inline_inode(struct page *ipage, u64 from)
68 void *addr;
70 if (from >= MAX_INLINE_DATA)
71 return false;
73 addr = inline_data_addr(ipage);
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;
81 int f2fs_read_inline_data(struct inode *inode, struct page *page)
83 struct page *ipage;
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);
91 if (!f2fs_has_inline_data(inode)) {
92 f2fs_put_page(ipage, 1);
93 return -EAGAIN;
96 if (page->index)
97 zero_user_segment(page, 0, PAGE_SIZE);
98 else
99 read_inline_data(page, ipage);
101 if (!PageUptodate(page))
102 SetPageUptodate(page);
103 f2fs_put_page(ipage, 1);
104 unlock_page(page);
105 return 0;
108 int f2fs_convert_inline_page(struct dnode_of_data *dn, struct page *page)
110 struct f2fs_io_info fio = {
111 .sbi = F2FS_I_SB(dn->inode),
112 .type = DATA,
113 .op = REQ_OP_WRITE,
114 .op_flags = WRITE_SYNC | REQ_PRIO,
115 .page = page,
116 .encrypted_page = NULL,
118 int dirty, err;
120 if (!f2fs_exist_data(dn->inode))
121 goto clear_out;
123 err = f2fs_reserve_block(dn, 0);
124 if (err)
125 return err;
127 if (unlikely(dn->data_blkaddr != NEW_ADDR)) {
128 f2fs_put_dnode(dn);
129 set_sbi_flag(fio.sbi, SBI_NEED_FSCK);
130 f2fs_msg(fio.sbi->sb, KERN_WARNING,
131 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
132 "run fsck to fix.",
133 __func__, dn->inode->i_ino, dn->data_blkaddr);
134 return -EINVAL;
137 f2fs_bug_on(F2FS_P_SB(page), PageWriteback(page));
139 read_inline_data(page, dn->inode_page);
140 set_page_dirty(page);
142 /* clear dirty state */
143 dirty = clear_page_dirty_for_io(page);
145 /* write data page to try to make data consistent */
146 set_page_writeback(page);
147 fio.old_blkaddr = dn->data_blkaddr;
148 write_data_page(dn, &fio);
149 f2fs_wait_on_page_writeback(page, DATA, true);
150 if (dirty)
151 inode_dec_dirty_pages(dn->inode);
153 /* this converted inline_data should be recovered. */
154 set_inode_flag(dn->inode, FI_APPEND_WRITE);
156 /* clear inline data and flag after data writeback */
157 truncate_inline_inode(dn->inode_page, 0);
158 clear_inline_node(dn->inode_page);
159 clear_out:
160 stat_dec_inline_inode(dn->inode);
161 f2fs_clear_inline_inode(dn->inode);
162 f2fs_put_dnode(dn);
163 return 0;
166 int f2fs_convert_inline_inode(struct inode *inode)
168 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
169 struct dnode_of_data dn;
170 struct page *ipage, *page;
171 int err = 0;
173 if (!f2fs_has_inline_data(inode))
174 return 0;
176 page = f2fs_grab_cache_page(inode->i_mapping, 0, false);
177 if (!page)
178 return -ENOMEM;
180 f2fs_lock_op(sbi);
182 ipage = get_node_page(sbi, inode->i_ino);
183 if (IS_ERR(ipage)) {
184 err = PTR_ERR(ipage);
185 goto out;
188 set_new_dnode(&dn, inode, ipage, ipage, 0);
190 if (f2fs_has_inline_data(inode))
191 err = f2fs_convert_inline_page(&dn, page);
193 f2fs_put_dnode(&dn);
194 out:
195 f2fs_unlock_op(sbi);
197 f2fs_put_page(page, 1);
199 f2fs_balance_fs(sbi, dn.node_changed);
201 return err;
204 int f2fs_write_inline_data(struct inode *inode, struct page *page)
206 void *src_addr, *dst_addr;
207 struct dnode_of_data dn;
208 int err;
210 set_new_dnode(&dn, inode, NULL, NULL, 0);
211 err = get_dnode_of_data(&dn, 0, LOOKUP_NODE);
212 if (err)
213 return err;
215 if (!f2fs_has_inline_data(inode)) {
216 f2fs_put_dnode(&dn);
217 return -EAGAIN;
220 f2fs_bug_on(F2FS_I_SB(inode), page->index);
222 f2fs_wait_on_page_writeback(dn.inode_page, NODE, true);
223 src_addr = kmap_atomic(page);
224 dst_addr = inline_data_addr(dn.inode_page);
225 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
226 kunmap_atomic(src_addr);
227 set_page_dirty(dn.inode_page);
229 set_inode_flag(inode, FI_APPEND_WRITE);
230 set_inode_flag(inode, FI_DATA_EXIST);
232 clear_inline_node(dn.inode_page);
233 f2fs_put_dnode(&dn);
234 return 0;
237 bool recover_inline_data(struct inode *inode, struct page *npage)
239 struct f2fs_sb_info *sbi = F2FS_I_SB(inode);
240 struct f2fs_inode *ri = NULL;
241 void *src_addr, *dst_addr;
242 struct page *ipage;
245 * The inline_data recovery policy is as follows.
246 * [prev.] [next] of inline_data flag
247 * o o -> recover inline_data
248 * o x -> remove inline_data, and then recover data blocks
249 * x o -> remove inline_data, and then recover inline_data
250 * x x -> recover data blocks
252 if (IS_INODE(npage))
253 ri = F2FS_INODE(npage);
255 if (f2fs_has_inline_data(inode) &&
256 ri && (ri->i_inline & F2FS_INLINE_DATA)) {
257 process_inline:
258 ipage = get_node_page(sbi, inode->i_ino);
259 f2fs_bug_on(sbi, IS_ERR(ipage));
261 f2fs_wait_on_page_writeback(ipage, NODE, true);
263 src_addr = inline_data_addr(npage);
264 dst_addr = inline_data_addr(ipage);
265 memcpy(dst_addr, src_addr, MAX_INLINE_DATA);
267 set_inode_flag(inode, FI_INLINE_DATA);
268 set_inode_flag(inode, FI_DATA_EXIST);
270 set_page_dirty(ipage);
271 f2fs_put_page(ipage, 1);
272 return true;
275 if (f2fs_has_inline_data(inode)) {
276 ipage = get_node_page(sbi, inode->i_ino);
277 f2fs_bug_on(sbi, IS_ERR(ipage));
278 if (!truncate_inline_inode(ipage, 0))
279 return false;
280 f2fs_clear_inline_inode(inode);
281 f2fs_put_page(ipage, 1);
282 } else if (ri && (ri->i_inline & F2FS_INLINE_DATA)) {
283 if (truncate_blocks(inode, 0, false))
284 return false;
285 goto process_inline;
287 return false;
290 struct f2fs_dir_entry *find_in_inline_dir(struct inode *dir,
291 struct fscrypt_name *fname, struct page **res_page)
293 struct f2fs_sb_info *sbi = F2FS_SB(dir->i_sb);
294 struct f2fs_inline_dentry *inline_dentry;
295 struct qstr name = FSTR_TO_QSTR(&fname->disk_name);
296 struct f2fs_dir_entry *de;
297 struct f2fs_dentry_ptr d;
298 struct page *ipage;
299 f2fs_hash_t namehash;
301 ipage = get_node_page(sbi, dir->i_ino);
302 if (IS_ERR(ipage)) {
303 *res_page = ipage;
304 return NULL;
307 namehash = f2fs_dentry_hash(&name, fname);
309 inline_dentry = inline_data_addr(ipage);
311 make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
312 de = find_target_dentry(fname, namehash, NULL, &d);
313 unlock_page(ipage);
314 if (de)
315 *res_page = ipage;
316 else
317 f2fs_put_page(ipage, 0);
319 return de;
322 int make_empty_inline_dir(struct inode *inode, struct inode *parent,
323 struct page *ipage)
325 struct f2fs_inline_dentry *dentry_blk;
326 struct f2fs_dentry_ptr d;
328 dentry_blk = inline_data_addr(ipage);
330 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
331 do_make_empty_dir(inode, parent, &d);
333 set_page_dirty(ipage);
335 /* update i_size to MAX_INLINE_DATA */
336 if (i_size_read(inode) < MAX_INLINE_DATA)
337 f2fs_i_size_write(inode, MAX_INLINE_DATA);
338 return 0;
342 * NOTE: ipage is grabbed by caller, but if any error occurs, we should
343 * release ipage in this function.
345 static int f2fs_move_inline_dirents(struct inode *dir, struct page *ipage,
346 struct f2fs_inline_dentry *inline_dentry)
348 struct page *page;
349 struct dnode_of_data dn;
350 struct f2fs_dentry_block *dentry_blk;
351 int err;
353 page = f2fs_grab_cache_page(dir->i_mapping, 0, false);
354 if (!page) {
355 f2fs_put_page(ipage, 1);
356 return -ENOMEM;
359 set_new_dnode(&dn, dir, ipage, NULL, 0);
360 err = f2fs_reserve_block(&dn, 0);
361 if (err)
362 goto out;
364 if (unlikely(dn.data_blkaddr != NEW_ADDR)) {
365 f2fs_put_dnode(&dn);
366 set_sbi_flag(F2FS_P_SB(page), SBI_NEED_FSCK);
367 f2fs_msg(F2FS_P_SB(page)->sb, KERN_WARNING,
368 "%s: corrupted inline inode ino=%lx, i_addr[0]:0x%x, "
369 "run fsck to fix.",
370 __func__, dir->i_ino, dn.data_blkaddr);
371 err = -EINVAL;
372 goto out;
375 f2fs_wait_on_page_writeback(page, DATA, true);
376 zero_user_segment(page, MAX_INLINE_DATA, PAGE_SIZE);
378 dentry_blk = kmap_atomic(page);
380 /* copy data from inline dentry block to new dentry block */
381 memcpy(dentry_blk->dentry_bitmap, inline_dentry->dentry_bitmap,
382 INLINE_DENTRY_BITMAP_SIZE);
383 memset(dentry_blk->dentry_bitmap + INLINE_DENTRY_BITMAP_SIZE, 0,
384 SIZE_OF_DENTRY_BITMAP - INLINE_DENTRY_BITMAP_SIZE);
386 * we do not need to zero out remainder part of dentry and filename
387 * field, since we have used bitmap for marking the usage status of
388 * them, besides, we can also ignore copying/zeroing reserved space
389 * of dentry block, because them haven't been used so far.
391 memcpy(dentry_blk->dentry, inline_dentry->dentry,
392 sizeof(struct f2fs_dir_entry) * NR_INLINE_DENTRY);
393 memcpy(dentry_blk->filename, inline_dentry->filename,
394 NR_INLINE_DENTRY * F2FS_SLOT_LEN);
396 kunmap_atomic(dentry_blk);
397 if (!PageUptodate(page))
398 SetPageUptodate(page);
399 set_page_dirty(page);
401 /* clear inline dir and flag after data writeback */
402 truncate_inline_inode(ipage, 0);
404 stat_dec_inline_dir(dir);
405 clear_inode_flag(dir, FI_INLINE_DENTRY);
407 f2fs_i_depth_write(dir, 1);
408 if (i_size_read(dir) < PAGE_SIZE)
409 f2fs_i_size_write(dir, PAGE_SIZE);
410 out:
411 f2fs_put_page(page, 1);
412 return err;
415 static int f2fs_add_inline_entries(struct inode *dir,
416 struct f2fs_inline_dentry *inline_dentry)
418 struct f2fs_dentry_ptr d;
419 unsigned long bit_pos = 0;
420 int err = 0;
422 make_dentry_ptr(NULL, &d, (void *)inline_dentry, 2);
424 while (bit_pos < d.max) {
425 struct f2fs_dir_entry *de;
426 struct qstr new_name;
427 nid_t ino;
428 umode_t fake_mode;
430 if (!test_bit_le(bit_pos, d.bitmap)) {
431 bit_pos++;
432 continue;
435 de = &d.dentry[bit_pos];
437 if (unlikely(!de->name_len)) {
438 bit_pos++;
439 continue;
442 new_name.name = d.filename[bit_pos];
443 new_name.len = de->name_len;
445 ino = le32_to_cpu(de->ino);
446 fake_mode = get_de_type(de) << S_SHIFT;
448 err = f2fs_add_regular_entry(dir, &new_name, NULL, NULL,
449 ino, fake_mode);
450 if (err)
451 goto punch_dentry_pages;
453 bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len));
455 return 0;
456 punch_dentry_pages:
457 truncate_inode_pages(&dir->i_data, 0);
458 truncate_blocks(dir, 0, false);
459 remove_dirty_inode(dir);
460 return err;
463 static int f2fs_move_rehashed_dirents(struct inode *dir, struct page *ipage,
464 struct f2fs_inline_dentry *inline_dentry)
466 struct f2fs_inline_dentry *backup_dentry;
467 int err;
469 backup_dentry = f2fs_kmalloc(F2FS_I_SB(dir),
470 sizeof(struct f2fs_inline_dentry), GFP_F2FS_ZERO);
471 if (!backup_dentry) {
472 f2fs_put_page(ipage, 1);
473 return -ENOMEM;
476 memcpy(backup_dentry, inline_dentry, MAX_INLINE_DATA);
477 truncate_inline_inode(ipage, 0);
479 unlock_page(ipage);
481 err = f2fs_add_inline_entries(dir, backup_dentry);
482 if (err)
483 goto recover;
485 lock_page(ipage);
487 stat_dec_inline_dir(dir);
488 clear_inode_flag(dir, FI_INLINE_DENTRY);
489 kfree(backup_dentry);
490 return 0;
491 recover:
492 lock_page(ipage);
493 memcpy(inline_dentry, backup_dentry, MAX_INLINE_DATA);
494 f2fs_i_depth_write(dir, 0);
495 f2fs_i_size_write(dir, MAX_INLINE_DATA);
496 set_page_dirty(ipage);
497 f2fs_put_page(ipage, 1);
499 kfree(backup_dentry);
500 return err;
503 static int f2fs_convert_inline_dir(struct inode *dir, struct page *ipage,
504 struct f2fs_inline_dentry *inline_dentry)
506 if (!F2FS_I(dir)->i_dir_level)
507 return f2fs_move_inline_dirents(dir, ipage, inline_dentry);
508 else
509 return f2fs_move_rehashed_dirents(dir, ipage, inline_dentry);
512 int f2fs_add_inline_entry(struct inode *dir, const struct qstr *new_name,
513 const struct qstr *orig_name,
514 struct inode *inode, nid_t ino, umode_t mode)
516 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
517 struct page *ipage;
518 unsigned int bit_pos;
519 f2fs_hash_t name_hash;
520 struct f2fs_inline_dentry *dentry_blk = NULL;
521 struct f2fs_dentry_ptr d;
522 int slots = GET_DENTRY_SLOTS(new_name->len);
523 struct page *page = NULL;
524 int err = 0;
526 ipage = get_node_page(sbi, dir->i_ino);
527 if (IS_ERR(ipage))
528 return PTR_ERR(ipage);
530 dentry_blk = inline_data_addr(ipage);
531 bit_pos = room_for_filename(&dentry_blk->dentry_bitmap,
532 slots, NR_INLINE_DENTRY);
533 if (bit_pos >= NR_INLINE_DENTRY) {
534 err = f2fs_convert_inline_dir(dir, ipage, dentry_blk);
535 if (err)
536 return err;
537 err = -EAGAIN;
538 goto out;
541 if (inode) {
542 down_write(&F2FS_I(inode)->i_sem);
543 page = init_inode_metadata(inode, dir, new_name,
544 orig_name, ipage);
545 if (IS_ERR(page)) {
546 err = PTR_ERR(page);
547 goto fail;
549 if (f2fs_encrypted_inode(dir))
550 file_set_enc_name(inode);
553 f2fs_wait_on_page_writeback(ipage, NODE, true);
555 name_hash = f2fs_dentry_hash(new_name, NULL);
556 make_dentry_ptr(NULL, &d, (void *)dentry_blk, 2);
557 f2fs_update_dentry(ino, mode, &d, new_name, name_hash, bit_pos);
559 set_page_dirty(ipage);
561 /* we don't need to mark_inode_dirty now */
562 if (inode) {
563 f2fs_i_pino_write(inode, dir->i_ino);
564 f2fs_put_page(page, 1);
567 update_parent_metadata(dir, inode, 0);
568 fail:
569 if (inode)
570 up_write(&F2FS_I(inode)->i_sem);
571 out:
572 f2fs_put_page(ipage, 1);
573 return err;
576 void f2fs_delete_inline_entry(struct f2fs_dir_entry *dentry, struct page *page,
577 struct inode *dir, struct inode *inode)
579 struct f2fs_inline_dentry *inline_dentry;
580 int slots = GET_DENTRY_SLOTS(le16_to_cpu(dentry->name_len));
581 unsigned int bit_pos;
582 int i;
584 lock_page(page);
585 f2fs_wait_on_page_writeback(page, NODE, true);
587 inline_dentry = inline_data_addr(page);
588 bit_pos = dentry - inline_dentry->dentry;
589 for (i = 0; i < slots; i++)
590 __clear_bit_le(bit_pos + i,
591 &inline_dentry->dentry_bitmap);
593 set_page_dirty(page);
594 f2fs_put_page(page, 1);
596 dir->i_ctime = dir->i_mtime = current_time(dir);
597 f2fs_mark_inode_dirty_sync(dir);
599 if (inode)
600 f2fs_drop_nlink(dir, inode);
603 bool f2fs_empty_inline_dir(struct inode *dir)
605 struct f2fs_sb_info *sbi = F2FS_I_SB(dir);
606 struct page *ipage;
607 unsigned int bit_pos = 2;
608 struct f2fs_inline_dentry *dentry_blk;
610 ipage = get_node_page(sbi, dir->i_ino);
611 if (IS_ERR(ipage))
612 return false;
614 dentry_blk = inline_data_addr(ipage);
615 bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap,
616 NR_INLINE_DENTRY,
617 bit_pos);
619 f2fs_put_page(ipage, 1);
621 if (bit_pos < NR_INLINE_DENTRY)
622 return false;
624 return true;
627 int f2fs_read_inline_dir(struct file *file, struct dir_context *ctx,
628 struct fscrypt_str *fstr)
630 struct inode *inode = file_inode(file);
631 struct f2fs_inline_dentry *inline_dentry = NULL;
632 struct page *ipage = NULL;
633 struct f2fs_dentry_ptr d;
635 if (ctx->pos == NR_INLINE_DENTRY)
636 return 0;
638 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
639 if (IS_ERR(ipage))
640 return PTR_ERR(ipage);
642 inline_dentry = inline_data_addr(ipage);
644 make_dentry_ptr(inode, &d, (void *)inline_dentry, 2);
646 if (!f2fs_fill_dentries(ctx, &d, 0, fstr))
647 ctx->pos = NR_INLINE_DENTRY;
649 f2fs_put_page(ipage, 1);
650 return 0;
653 int f2fs_inline_data_fiemap(struct inode *inode,
654 struct fiemap_extent_info *fieinfo, __u64 start, __u64 len)
656 __u64 byteaddr, ilen;
657 __u32 flags = FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_NOT_ALIGNED |
658 FIEMAP_EXTENT_LAST;
659 struct node_info ni;
660 struct page *ipage;
661 int err = 0;
663 ipage = get_node_page(F2FS_I_SB(inode), inode->i_ino);
664 if (IS_ERR(ipage))
665 return PTR_ERR(ipage);
667 if (!f2fs_has_inline_data(inode)) {
668 err = -EAGAIN;
669 goto out;
672 ilen = min_t(size_t, MAX_INLINE_DATA, i_size_read(inode));
673 if (start >= ilen)
674 goto out;
675 if (start + len < ilen)
676 ilen = start + len;
677 ilen -= start;
679 get_node_info(F2FS_I_SB(inode), inode->i_ino, &ni);
680 byteaddr = (__u64)ni.blk_addr << inode->i_sb->s_blocksize_bits;
681 byteaddr += (char *)inline_data_addr(ipage) - (char *)F2FS_INODE(ipage);
682 err = fiemap_fill_next_extent(fieinfo, start, byteaddr, ilen, flags);
683 out:
684 f2fs_put_page(ipage, 1);
685 return err;