Merge remote-tracking branch 'regulator/for-next'
[deliverable/linux.git] / fs / f2fs / recovery.c
1 /*
2 * fs/f2fs/recovery.c
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
10 */
11 #include <linux/fs.h>
12 #include <linux/f2fs_fs.h>
13 #include "f2fs.h"
14 #include "node.h"
15 #include "segment.h"
16
17 /*
18 * Roll forward recovery scenarios.
19 *
20 * [Term] F: fsync_mark, D: dentry_mark
21 *
22 * 1. inode(x) | CP | inode(x) | dnode(F)
23 * -> Update the latest inode(x).
24 *
25 * 2. inode(x) | CP | inode(F) | dnode(F)
26 * -> No problem.
27 *
28 * 3. inode(x) | CP | dnode(F) | inode(x)
29 * -> Recover to the latest dnode(F), and drop the last inode(x)
30 *
31 * 4. inode(x) | CP | dnode(F) | inode(F)
32 * -> No problem.
33 *
34 * 5. CP | inode(x) | dnode(F)
35 * -> The inode(DF) was missing. Should drop this dnode(F).
36 *
37 * 6. CP | inode(DF) | dnode(F)
38 * -> No problem.
39 *
40 * 7. CP | dnode(F) | inode(DF)
41 * -> If f2fs_iget fails, then goto next to find inode(DF).
42 *
43 * 8. CP | dnode(F) | inode(x)
44 * -> If f2fs_iget fails, then goto next to find inode(DF).
45 * But it will fail due to no inode(DF).
46 */
47
48 static struct kmem_cache *fsync_entry_slab;
49
50 bool space_for_roll_forward(struct f2fs_sb_info *sbi)
51 {
52 s64 nalloc = percpu_counter_sum_positive(&sbi->alloc_valid_block_count);
53
54 if (sbi->last_valid_block_count + nalloc > sbi->user_block_count)
55 return false;
56 return true;
57 }
58
59 static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
60 nid_t ino)
61 {
62 struct fsync_inode_entry *entry;
63
64 list_for_each_entry(entry, head, list)
65 if (entry->inode->i_ino == ino)
66 return entry;
67
68 return NULL;
69 }
70
71 static struct fsync_inode_entry *add_fsync_inode(struct list_head *head,
72 struct inode *inode)
73 {
74 struct fsync_inode_entry *entry;
75
76 entry = kmem_cache_alloc(fsync_entry_slab, GFP_F2FS_ZERO);
77 if (!entry)
78 return NULL;
79
80 entry->inode = inode;
81 list_add_tail(&entry->list, head);
82
83 return entry;
84 }
85
86 static void del_fsync_inode(struct fsync_inode_entry *entry)
87 {
88 iput(entry->inode);
89 list_del(&entry->list);
90 kmem_cache_free(fsync_entry_slab, entry);
91 }
92
93 static int recover_dentry(struct inode *inode, struct page *ipage,
94 struct list_head *dir_list)
95 {
96 struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
97 nid_t pino = le32_to_cpu(raw_inode->i_pino);
98 struct f2fs_dir_entry *de;
99 struct fscrypt_name fname;
100 struct page *page;
101 struct inode *dir, *einode;
102 struct fsync_inode_entry *entry;
103 int err = 0;
104 char *name;
105
106 entry = get_fsync_inode(dir_list, pino);
107 if (!entry) {
108 dir = f2fs_iget(inode->i_sb, pino);
109 if (IS_ERR(dir)) {
110 err = PTR_ERR(dir);
111 goto out;
112 }
113
114 entry = add_fsync_inode(dir_list, dir);
115 if (!entry) {
116 err = -ENOMEM;
117 iput(dir);
118 goto out;
119 }
120 }
121
122 dir = entry->inode;
123
124 memset(&fname, 0, sizeof(struct fscrypt_name));
125 fname.disk_name.len = le32_to_cpu(raw_inode->i_namelen);
126 fname.disk_name.name = raw_inode->i_name;
127
128 if (unlikely(fname.disk_name.len > F2FS_NAME_LEN)) {
129 WARN_ON(1);
130 err = -ENAMETOOLONG;
131 goto out;
132 }
133 retry:
134 de = __f2fs_find_entry(dir, &fname, &page);
135 if (de && inode->i_ino == le32_to_cpu(de->ino))
136 goto out_unmap_put;
137
138 if (de) {
139 einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
140 if (IS_ERR(einode)) {
141 WARN_ON(1);
142 err = PTR_ERR(einode);
143 if (err == -ENOENT)
144 err = -EEXIST;
145 goto out_unmap_put;
146 }
147 err = acquire_orphan_inode(F2FS_I_SB(inode));
148 if (err) {
149 iput(einode);
150 goto out_unmap_put;
151 }
152 f2fs_delete_entry(de, page, dir, einode);
153 iput(einode);
154 goto retry;
155 } else if (IS_ERR(page)) {
156 err = PTR_ERR(page);
157 } else {
158 err = __f2fs_do_add_link(dir, &fname, inode,
159 inode->i_ino, inode->i_mode);
160 }
161 goto out;
162
163 out_unmap_put:
164 f2fs_dentry_kunmap(dir, page);
165 f2fs_put_page(page, 0);
166 out:
167 if (file_enc_name(inode))
168 name = "<encrypted>";
169 else
170 name = raw_inode->i_name;
171 f2fs_msg(inode->i_sb, KERN_NOTICE,
172 "%s: ino = %x, name = %s, dir = %lx, err = %d",
173 __func__, ino_of_node(ipage), name,
174 IS_ERR(dir) ? 0 : dir->i_ino, err);
175 return err;
176 }
177
178 static void recover_inode(struct inode *inode, struct page *page)
179 {
180 struct f2fs_inode *raw = F2FS_INODE(page);
181 char *name;
182
183 inode->i_mode = le16_to_cpu(raw->i_mode);
184 f2fs_i_size_write(inode, le64_to_cpu(raw->i_size));
185 inode->i_atime.tv_sec = le64_to_cpu(raw->i_mtime);
186 inode->i_ctime.tv_sec = le64_to_cpu(raw->i_ctime);
187 inode->i_mtime.tv_sec = le64_to_cpu(raw->i_mtime);
188 inode->i_atime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
189 inode->i_ctime.tv_nsec = le32_to_cpu(raw->i_ctime_nsec);
190 inode->i_mtime.tv_nsec = le32_to_cpu(raw->i_mtime_nsec);
191
192 if (file_enc_name(inode))
193 name = "<encrypted>";
194 else
195 name = F2FS_INODE(page)->i_name;
196
197 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
198 ino_of_node(page), name);
199 }
200
201 static bool is_same_inode(struct inode *inode, struct page *ipage)
202 {
203 struct f2fs_inode *ri = F2FS_INODE(ipage);
204 struct timespec disk;
205
206 if (!IS_INODE(ipage))
207 return true;
208
209 disk.tv_sec = le64_to_cpu(ri->i_ctime);
210 disk.tv_nsec = le32_to_cpu(ri->i_ctime_nsec);
211 if (timespec_compare(&inode->i_ctime, &disk) > 0)
212 return false;
213
214 disk.tv_sec = le64_to_cpu(ri->i_atime);
215 disk.tv_nsec = le32_to_cpu(ri->i_atime_nsec);
216 if (timespec_compare(&inode->i_atime, &disk) > 0)
217 return false;
218
219 disk.tv_sec = le64_to_cpu(ri->i_mtime);
220 disk.tv_nsec = le32_to_cpu(ri->i_mtime_nsec);
221 if (timespec_compare(&inode->i_mtime, &disk) > 0)
222 return false;
223
224 return true;
225 }
226
227 static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
228 {
229 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
230 struct curseg_info *curseg;
231 struct inode *inode;
232 struct page *page = NULL;
233 block_t blkaddr;
234 int err = 0;
235
236 /* get node pages in the current segment */
237 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
238 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
239
240 while (1) {
241 struct fsync_inode_entry *entry;
242
243 if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
244 return 0;
245
246 page = get_tmp_page(sbi, blkaddr);
247
248 if (cp_ver != cpver_of_node(page))
249 break;
250
251 if (!is_fsync_dnode(page))
252 goto next;
253
254 entry = get_fsync_inode(head, ino_of_node(page));
255 if (entry) {
256 if (!is_same_inode(entry->inode, page))
257 goto next;
258 } else {
259 if (IS_INODE(page) && is_dent_dnode(page)) {
260 err = recover_inode_page(sbi, page);
261 if (err)
262 break;
263 }
264
265 /*
266 * CP | dnode(F) | inode(DF)
267 * For this case, we should not give up now.
268 */
269 inode = f2fs_iget(sbi->sb, ino_of_node(page));
270 if (IS_ERR(inode)) {
271 err = PTR_ERR(inode);
272 if (err == -ENOENT) {
273 err = 0;
274 goto next;
275 }
276 break;
277 }
278
279 /* add this fsync inode to the list */
280 entry = add_fsync_inode(head, inode);
281 if (!entry) {
282 err = -ENOMEM;
283 iput(inode);
284 break;
285 }
286 }
287 entry->blkaddr = blkaddr;
288
289 if (IS_INODE(page) && is_dent_dnode(page))
290 entry->last_dentry = blkaddr;
291 next:
292 /* check next segment */
293 blkaddr = next_blkaddr_of_node(page);
294 f2fs_put_page(page, 1);
295
296 ra_meta_pages_cond(sbi, blkaddr);
297 }
298 f2fs_put_page(page, 1);
299 return err;
300 }
301
302 static void destroy_fsync_dnodes(struct list_head *head)
303 {
304 struct fsync_inode_entry *entry, *tmp;
305
306 list_for_each_entry_safe(entry, tmp, head, list)
307 del_fsync_inode(entry);
308 }
309
310 static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
311 block_t blkaddr, struct dnode_of_data *dn)
312 {
313 struct seg_entry *sentry;
314 unsigned int segno = GET_SEGNO(sbi, blkaddr);
315 unsigned short blkoff = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
316 struct f2fs_summary_block *sum_node;
317 struct f2fs_summary sum;
318 struct page *sum_page, *node_page;
319 struct dnode_of_data tdn = *dn;
320 nid_t ino, nid;
321 struct inode *inode;
322 unsigned int offset;
323 block_t bidx;
324 int i;
325
326 sentry = get_seg_entry(sbi, segno);
327 if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
328 return 0;
329
330 /* Get the previous summary */
331 for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
332 struct curseg_info *curseg = CURSEG_I(sbi, i);
333 if (curseg->segno == segno) {
334 sum = curseg->sum_blk->entries[blkoff];
335 goto got_it;
336 }
337 }
338
339 sum_page = get_sum_page(sbi, segno);
340 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
341 sum = sum_node->entries[blkoff];
342 f2fs_put_page(sum_page, 1);
343 got_it:
344 /* Use the locked dnode page and inode */
345 nid = le32_to_cpu(sum.nid);
346 if (dn->inode->i_ino == nid) {
347 tdn.nid = nid;
348 if (!dn->inode_page_locked)
349 lock_page(dn->inode_page);
350 tdn.node_page = dn->inode_page;
351 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
352 goto truncate_out;
353 } else if (dn->nid == nid) {
354 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
355 goto truncate_out;
356 }
357
358 /* Get the node page */
359 node_page = get_node_page(sbi, nid);
360 if (IS_ERR(node_page))
361 return PTR_ERR(node_page);
362
363 offset = ofs_of_node(node_page);
364 ino = ino_of_node(node_page);
365 f2fs_put_page(node_page, 1);
366
367 if (ino != dn->inode->i_ino) {
368 /* Deallocate previous index in the node page */
369 inode = f2fs_iget(sbi->sb, ino);
370 if (IS_ERR(inode))
371 return PTR_ERR(inode);
372 } else {
373 inode = dn->inode;
374 }
375
376 bidx = start_bidx_of_node(offset, inode) + le16_to_cpu(sum.ofs_in_node);
377
378 /*
379 * if inode page is locked, unlock temporarily, but its reference
380 * count keeps alive.
381 */
382 if (ino == dn->inode->i_ino && dn->inode_page_locked)
383 unlock_page(dn->inode_page);
384
385 set_new_dnode(&tdn, inode, NULL, NULL, 0);
386 if (get_dnode_of_data(&tdn, bidx, LOOKUP_NODE))
387 goto out;
388
389 if (tdn.data_blkaddr == blkaddr)
390 truncate_data_blocks_range(&tdn, 1);
391
392 f2fs_put_dnode(&tdn);
393 out:
394 if (ino != dn->inode->i_ino)
395 iput(inode);
396 else if (dn->inode_page_locked)
397 lock_page(dn->inode_page);
398 return 0;
399
400 truncate_out:
401 if (datablock_addr(tdn.node_page, tdn.ofs_in_node) == blkaddr)
402 truncate_data_blocks_range(&tdn, 1);
403 if (dn->inode->i_ino == nid && !dn->inode_page_locked)
404 unlock_page(dn->inode_page);
405 return 0;
406 }
407
408 static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
409 struct page *page, block_t blkaddr)
410 {
411 struct dnode_of_data dn;
412 struct node_info ni;
413 unsigned int start, end;
414 int err = 0, recovered = 0;
415
416 /* step 1: recover xattr */
417 if (IS_INODE(page)) {
418 recover_inline_xattr(inode, page);
419 } else if (f2fs_has_xattr_block(ofs_of_node(page))) {
420 /*
421 * Deprecated; xattr blocks should be found from cold log.
422 * But, we should remain this for backward compatibility.
423 */
424 recover_xattr_data(inode, page, blkaddr);
425 goto out;
426 }
427
428 /* step 2: recover inline data */
429 if (recover_inline_data(inode, page))
430 goto out;
431
432 /* step 3: recover data indices */
433 start = start_bidx_of_node(ofs_of_node(page), inode);
434 end = start + ADDRS_PER_PAGE(page, inode);
435
436 set_new_dnode(&dn, inode, NULL, NULL, 0);
437
438 err = get_dnode_of_data(&dn, start, ALLOC_NODE);
439 if (err)
440 goto out;
441
442 f2fs_wait_on_page_writeback(dn.node_page, NODE, true);
443
444 get_node_info(sbi, dn.nid, &ni);
445 f2fs_bug_on(sbi, ni.ino != ino_of_node(page));
446 f2fs_bug_on(sbi, ofs_of_node(dn.node_page) != ofs_of_node(page));
447
448 for (; start < end; start++, dn.ofs_in_node++) {
449 block_t src, dest;
450
451 src = datablock_addr(dn.node_page, dn.ofs_in_node);
452 dest = datablock_addr(page, dn.ofs_in_node);
453
454 /* skip recovering if dest is the same as src */
455 if (src == dest)
456 continue;
457
458 /* dest is invalid, just invalidate src block */
459 if (dest == NULL_ADDR) {
460 truncate_data_blocks_range(&dn, 1);
461 continue;
462 }
463
464 if ((start + 1) << PAGE_SHIFT > i_size_read(inode))
465 f2fs_i_size_write(inode, (start + 1) << PAGE_SHIFT);
466
467 /*
468 * dest is reserved block, invalidate src block
469 * and then reserve one new block in dnode page.
470 */
471 if (dest == NEW_ADDR) {
472 truncate_data_blocks_range(&dn, 1);
473 reserve_new_block(&dn);
474 continue;
475 }
476
477 /* dest is valid block, try to recover from src to dest */
478 if (is_valid_blkaddr(sbi, dest, META_POR)) {
479
480 if (src == NULL_ADDR) {
481 err = reserve_new_block(&dn);
482 #ifdef CONFIG_F2FS_FAULT_INJECTION
483 while (err)
484 err = reserve_new_block(&dn);
485 #endif
486 /* We should not get -ENOSPC */
487 f2fs_bug_on(sbi, err);
488 if (err)
489 goto err;
490 }
491
492 /* Check the previous node page having this index */
493 err = check_index_in_prev_nodes(sbi, dest, &dn);
494 if (err)
495 goto err;
496
497 /* write dummy data page */
498 f2fs_replace_block(sbi, &dn, src, dest,
499 ni.version, false, false);
500 recovered++;
501 }
502 }
503
504 copy_node_footer(dn.node_page, page);
505 fill_node_footer(dn.node_page, dn.nid, ni.ino,
506 ofs_of_node(page), false);
507 set_page_dirty(dn.node_page);
508 err:
509 f2fs_put_dnode(&dn);
510 out:
511 f2fs_msg(sbi->sb, KERN_NOTICE,
512 "recover_data: ino = %lx, recovered = %d blocks, err = %d",
513 inode->i_ino, recovered, err);
514 return err;
515 }
516
517 static int recover_data(struct f2fs_sb_info *sbi, struct list_head *inode_list,
518 struct list_head *dir_list)
519 {
520 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
521 struct curseg_info *curseg;
522 struct page *page = NULL;
523 int err = 0;
524 block_t blkaddr;
525
526 /* get node pages in the current segment */
527 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
528 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
529
530 while (1) {
531 struct fsync_inode_entry *entry;
532
533 if (!is_valid_blkaddr(sbi, blkaddr, META_POR))
534 break;
535
536 ra_meta_pages_cond(sbi, blkaddr);
537
538 page = get_tmp_page(sbi, blkaddr);
539
540 if (cp_ver != cpver_of_node(page)) {
541 f2fs_put_page(page, 1);
542 break;
543 }
544
545 entry = get_fsync_inode(inode_list, ino_of_node(page));
546 if (!entry)
547 goto next;
548 /*
549 * inode(x) | CP | inode(x) | dnode(F)
550 * In this case, we can lose the latest inode(x).
551 * So, call recover_inode for the inode update.
552 */
553 if (IS_INODE(page))
554 recover_inode(entry->inode, page);
555 if (entry->last_dentry == blkaddr) {
556 err = recover_dentry(entry->inode, page, dir_list);
557 if (err) {
558 f2fs_put_page(page, 1);
559 break;
560 }
561 }
562 err = do_recover_data(sbi, entry->inode, page, blkaddr);
563 if (err) {
564 f2fs_put_page(page, 1);
565 break;
566 }
567
568 if (entry->blkaddr == blkaddr)
569 del_fsync_inode(entry);
570 next:
571 /* check next segment */
572 blkaddr = next_blkaddr_of_node(page);
573 f2fs_put_page(page, 1);
574 }
575 if (!err)
576 allocate_new_segments(sbi);
577 return err;
578 }
579
580 int recover_fsync_data(struct f2fs_sb_info *sbi, bool check_only)
581 {
582 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
583 struct list_head inode_list;
584 struct list_head dir_list;
585 block_t blkaddr;
586 int err;
587 int ret = 0;
588 bool need_writecp = false;
589
590 fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
591 sizeof(struct fsync_inode_entry));
592 if (!fsync_entry_slab)
593 return -ENOMEM;
594
595 INIT_LIST_HEAD(&inode_list);
596 INIT_LIST_HEAD(&dir_list);
597
598 /* prevent checkpoint */
599 mutex_lock(&sbi->cp_mutex);
600
601 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
602
603 /* step #1: find fsynced inode numbers */
604 err = find_fsync_dnodes(sbi, &inode_list);
605 if (err || list_empty(&inode_list))
606 goto out;
607
608 if (check_only) {
609 ret = 1;
610 goto out;
611 }
612
613 need_writecp = true;
614
615 /* step #2: recover data */
616 err = recover_data(sbi, &inode_list, &dir_list);
617 if (!err)
618 f2fs_bug_on(sbi, !list_empty(&inode_list));
619 out:
620 destroy_fsync_dnodes(&inode_list);
621
622 /* truncate meta pages to be used by the recovery */
623 truncate_inode_pages_range(META_MAPPING(sbi),
624 (loff_t)MAIN_BLKADDR(sbi) << PAGE_SHIFT, -1);
625
626 if (err) {
627 truncate_inode_pages_final(NODE_MAPPING(sbi));
628 truncate_inode_pages_final(META_MAPPING(sbi));
629 }
630
631 clear_sbi_flag(sbi, SBI_POR_DOING);
632 if (err) {
633 bool invalidate = false;
634
635 if (test_opt(sbi, LFS)) {
636 update_meta_page(sbi, NULL, blkaddr);
637 invalidate = true;
638 } else if (discard_next_dnode(sbi, blkaddr)) {
639 invalidate = true;
640 }
641
642 f2fs_wait_all_discard_bio(sbi);
643
644 /* Flush all the NAT/SIT pages */
645 while (get_pages(sbi, F2FS_DIRTY_META))
646 sync_meta_pages(sbi, META, LONG_MAX);
647
648 /* invalidate temporary meta page */
649 if (invalidate)
650 invalidate_mapping_pages(META_MAPPING(sbi),
651 blkaddr, blkaddr);
652
653 set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
654 mutex_unlock(&sbi->cp_mutex);
655 } else if (need_writecp) {
656 struct cp_control cpc = {
657 .reason = CP_RECOVERY,
658 };
659 mutex_unlock(&sbi->cp_mutex);
660 err = write_checkpoint(sbi, &cpc);
661 } else {
662 mutex_unlock(&sbi->cp_mutex);
663 }
664
665 destroy_fsync_dnodes(&dir_list);
666 kmem_cache_destroy(fsync_entry_slab);
667 return ret ? ret: err;
668 }
This page took 0.049392 seconds and 5 git commands to generate.