f2fs: fix conditions to remain recovery information in f2fs_sync_file
[linux-block.git] / fs / f2fs / recovery.c
CommitLineData
0a8165d7 1/*
d624c96f
JK
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
17static struct kmem_cache *fsync_entry_slab;
18
19bool space_for_roll_forward(struct f2fs_sb_info *sbi)
20{
21 if (sbi->last_valid_block_count + sbi->alloc_valid_block_count
22 > sbi->user_block_count)
23 return false;
24 return true;
25}
26
27static struct fsync_inode_entry *get_fsync_inode(struct list_head *head,
28 nid_t ino)
29{
d624c96f
JK
30 struct fsync_inode_entry *entry;
31
2d7b822a 32 list_for_each_entry(entry, head, list)
d624c96f
JK
33 if (entry->inode->i_ino == ino)
34 return entry;
2d7b822a 35
d624c96f
JK
36 return NULL;
37}
38
39static int recover_dentry(struct page *ipage, struct inode *inode)
40{
58bfaf44 41 struct f2fs_inode *raw_inode = F2FS_INODE(ipage);
74d0b917 42 nid_t pino = le32_to_cpu(raw_inode->i_pino);
6b8213d9 43 struct f2fs_dir_entry *de;
b7f7a5e0 44 struct qstr name;
d624c96f 45 struct page *page;
6b8213d9 46 struct inode *dir, *einode;
d624c96f
JK
47 int err = 0;
48
ed57c27f
JK
49 dir = f2fs_iget(inode->i_sb, pino);
50 if (IS_ERR(dir)) {
51 err = PTR_ERR(dir);
52 goto out;
53 }
54
b7f7a5e0
AV
55 name.len = le32_to_cpu(raw_inode->i_namelen);
56 name.name = raw_inode->i_name;
d96b1431
CY
57
58 if (unlikely(name.len > F2FS_NAME_LEN)) {
59 WARN_ON(1);
60 err = -ENAMETOOLONG;
86928f98 61 goto out_err;
d96b1431 62 }
6b8213d9
JK
63retry:
64 de = f2fs_find_entry(dir, &name, &page);
695facc0
JK
65 if (de && inode->i_ino == le32_to_cpu(de->ino)) {
66 clear_inode_flag(F2FS_I(inode), FI_INC_LINK);
2e5558f4 67 goto out_unmap_put;
695facc0 68 }
6b8213d9
JK
69 if (de) {
70 einode = f2fs_iget(inode->i_sb, le32_to_cpu(de->ino));
71 if (IS_ERR(einode)) {
72 WARN_ON(1);
5c1f9927
CY
73 err = PTR_ERR(einode);
74 if (err == -ENOENT)
6b8213d9 75 err = -EEXIST;
2e5558f4
RK
76 goto out_unmap_put;
77 }
4081363f 78 err = acquire_orphan_inode(F2FS_I_SB(inode));
2e5558f4
RK
79 if (err) {
80 iput(einode);
81 goto out_unmap_put;
6b8213d9
JK
82 }
83 f2fs_delete_entry(de, page, einode);
84 iput(einode);
85 goto retry;
d624c96f 86 }
6b8213d9 87 err = __f2fs_add_link(dir, &name, inode);
86928f98
JK
88 if (err)
89 goto out_err;
90
91 if (is_inode_flag_set(F2FS_I(dir), FI_DELAY_IPUT)) {
92 iput(dir);
93 } else {
94 add_dirty_dir_inode(dir);
95 set_inode_flag(F2FS_I(dir), FI_DELAY_IPUT);
96 }
97
2e5558f4
RK
98 goto out;
99
100out_unmap_put:
101 kunmap(page);
102 f2fs_put_page(page, 0);
86928f98
JK
103out_err:
104 iput(dir);
d624c96f 105out:
6c311ec6
CF
106 f2fs_msg(inode->i_sb, KERN_NOTICE,
107 "%s: ino = %x, name = %s, dir = %lx, err = %d",
108 __func__, ino_of_node(ipage), raw_inode->i_name,
f28c06fa 109 IS_ERR(dir) ? 0 : dir->i_ino, err);
d624c96f
JK
110 return err;
111}
112
113static int recover_inode(struct inode *inode, struct page *node_page)
114{
58bfaf44 115 struct f2fs_inode *raw_inode = F2FS_INODE(node_page);
d624c96f 116
f356fe0c
JK
117 if (!IS_INODE(node_page))
118 return 0;
119
25ca923b 120 inode->i_mode = le16_to_cpu(raw_inode->i_mode);
d624c96f
JK
121 i_size_write(inode, le64_to_cpu(raw_inode->i_size));
122 inode->i_atime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
123 inode->i_ctime.tv_sec = le64_to_cpu(raw_inode->i_ctime);
124 inode->i_mtime.tv_sec = le64_to_cpu(raw_inode->i_mtime);
125 inode->i_atime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
126 inode->i_ctime.tv_nsec = le32_to_cpu(raw_inode->i_ctime_nsec);
127 inode->i_mtime.tv_nsec = le32_to_cpu(raw_inode->i_mtime_nsec);
128
f356fe0c
JK
129 if (is_dent_dnode(node_page))
130 return recover_dentry(node_page, inode);
131
132 f2fs_msg(inode->i_sb, KERN_NOTICE, "recover_inode: ino = %x, name = %s",
133 ino_of_node(node_page), raw_inode->i_name);
134 return 0;
d624c96f
JK
135}
136
137static int find_fsync_dnodes(struct f2fs_sb_info *sbi, struct list_head *head)
138{
d71b5564 139 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f 140 struct curseg_info *curseg;
4c521f49 141 struct page *page = NULL;
d624c96f
JK
142 block_t blkaddr;
143 int err = 0;
144
145 /* get node pages in the current segment */
146 curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
695fd1ed 147 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
d624c96f 148
d624c96f
JK
149 while (1) {
150 struct fsync_inode_entry *entry;
151
4c521f49
JK
152 if (blkaddr < SM_I(sbi)->main_blkaddr ||
153 blkaddr >= (SM_I(sbi)->seg0_blkaddr + TOTAL_BLKS(sbi)))
154 return 0;
d624c96f 155
4c521f49 156 page = get_meta_page_ra(sbi, blkaddr);
393ff91f 157
6ead1142 158 if (cp_ver != cpver_of_node(page))
f356fe0c 159 break;
d624c96f
JK
160
161 if (!is_fsync_dnode(page))
162 goto next;
163
164 entry = get_fsync_inode(head, ino_of_node(page));
165 if (entry) {
d624c96f
JK
166 if (IS_INODE(page) && is_dent_dnode(page))
167 set_inode_flag(F2FS_I(entry->inode),
168 FI_INC_LINK);
169 } else {
170 if (IS_INODE(page) && is_dent_dnode(page)) {
6ead1142
JK
171 err = recover_inode_page(sbi, page);
172 if (err)
f356fe0c 173 break;
d624c96f
JK
174 }
175
176 /* add this fsync inode to the list */
177 entry = kmem_cache_alloc(fsync_entry_slab, GFP_NOFS);
178 if (!entry) {
179 err = -ENOMEM;
f356fe0c 180 break;
d624c96f
JK
181 }
182
d624c96f
JK
183 entry->inode = f2fs_iget(sbi->sb, ino_of_node(page));
184 if (IS_ERR(entry->inode)) {
185 err = PTR_ERR(entry->inode);
fd8bb65f 186 kmem_cache_free(fsync_entry_slab, entry);
f356fe0c 187 break;
d624c96f 188 }
fd8bb65f 189 list_add_tail(&entry->list, head);
d624c96f 190 }
addbe45b
JK
191 entry->blkaddr = blkaddr;
192
f356fe0c
JK
193 err = recover_inode(entry->inode, page);
194 if (err && err != -ENOENT)
195 break;
d624c96f
JK
196next:
197 /* check next segment */
198 blkaddr = next_blkaddr_of_node(page);
4c521f49 199 f2fs_put_page(page, 1);
d624c96f 200 }
4c521f49 201 f2fs_put_page(page, 1);
d624c96f
JK
202 return err;
203}
204
5ebefc5b 205static void destroy_fsync_dnodes(struct list_head *head)
d624c96f 206{
d8b79b2f
DC
207 struct fsync_inode_entry *entry, *tmp;
208
209 list_for_each_entry_safe(entry, tmp, head, list) {
d624c96f
JK
210 iput(entry->inode);
211 list_del(&entry->list);
212 kmem_cache_free(fsync_entry_slab, entry);
213 }
214}
215
39cf72cf 216static int check_index_in_prev_nodes(struct f2fs_sb_info *sbi,
b292dcab 217 block_t blkaddr, struct dnode_of_data *dn)
d624c96f
JK
218{
219 struct seg_entry *sentry;
220 unsigned int segno = GET_SEGNO(sbi, blkaddr);
491c0854 221 unsigned short blkoff = GET_BLKOFF_FROM_SEG0(sbi, blkaddr);
f6517cfc 222 struct f2fs_summary_block *sum_node;
d624c96f 223 struct f2fs_summary sum;
f6517cfc 224 struct page *sum_page, *node_page;
b292dcab 225 nid_t ino, nid;
d624c96f 226 struct inode *inode;
de93653f 227 unsigned int offset;
d624c96f
JK
228 block_t bidx;
229 int i;
230
231 sentry = get_seg_entry(sbi, segno);
232 if (!f2fs_test_bit(blkoff, sentry->cur_valid_map))
39cf72cf 233 return 0;
d624c96f
JK
234
235 /* Get the previous summary */
236 for (i = CURSEG_WARM_DATA; i <= CURSEG_COLD_DATA; i++) {
237 struct curseg_info *curseg = CURSEG_I(sbi, i);
238 if (curseg->segno == segno) {
239 sum = curseg->sum_blk->entries[blkoff];
f6517cfc 240 goto got_it;
d624c96f
JK
241 }
242 }
d624c96f 243
f6517cfc
JK
244 sum_page = get_sum_page(sbi, segno);
245 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
246 sum = sum_node->entries[blkoff];
247 f2fs_put_page(sum_page, 1);
248got_it:
b292dcab
JK
249 /* Use the locked dnode page and inode */
250 nid = le32_to_cpu(sum.nid);
251 if (dn->inode->i_ino == nid) {
252 struct dnode_of_data tdn = *dn;
253 tdn.nid = nid;
254 tdn.node_page = dn->inode_page;
060dd67b 255 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab 256 truncate_data_blocks_range(&tdn, 1);
39cf72cf 257 return 0;
b292dcab
JK
258 } else if (dn->nid == nid) {
259 struct dnode_of_data tdn = *dn;
060dd67b 260 tdn.ofs_in_node = le16_to_cpu(sum.ofs_in_node);
b292dcab 261 truncate_data_blocks_range(&tdn, 1);
39cf72cf 262 return 0;
b292dcab
JK
263 }
264
d624c96f 265 /* Get the node page */
b292dcab 266 node_page = get_node_page(sbi, nid);
39cf72cf
JK
267 if (IS_ERR(node_page))
268 return PTR_ERR(node_page);
de93653f
JK
269
270 offset = ofs_of_node(node_page);
d624c96f
JK
271 ino = ino_of_node(node_page);
272 f2fs_put_page(node_page, 1);
273
60979115
JK
274 if (ino != dn->inode->i_ino) {
275 /* Deallocate previous index in the node page */
276 inode = f2fs_iget(sbi->sb, ino);
277 if (IS_ERR(inode))
278 return PTR_ERR(inode);
279 } else {
280 inode = dn->inode;
281 }
06025f4d 282
de93653f 283 bidx = start_bidx_of_node(offset, F2FS_I(inode)) +
60979115 284 le16_to_cpu(sum.ofs_in_node);
de93653f 285
60979115
JK
286 if (ino != dn->inode->i_ino) {
287 truncate_hole(inode, bidx, bidx + 1);
288 iput(inode);
289 } else {
290 struct dnode_of_data tdn;
291 set_new_dnode(&tdn, inode, dn->inode_page, NULL, 0);
292 if (get_dnode_of_data(&tdn, bidx, LOOKUP_NODE))
293 return 0;
294 if (tdn.data_blkaddr != NULL_ADDR)
295 truncate_data_blocks_range(&tdn, 1);
296 f2fs_put_page(tdn.node_page, 1);
297 }
39cf72cf 298 return 0;
d624c96f
JK
299}
300
6ead1142 301static int do_recover_data(struct f2fs_sb_info *sbi, struct inode *inode,
d624c96f
JK
302 struct page *page, block_t blkaddr)
303{
de93653f 304 struct f2fs_inode_info *fi = F2FS_I(inode);
d624c96f
JK
305 unsigned int start, end;
306 struct dnode_of_data dn;
307 struct f2fs_summary sum;
308 struct node_info ni;
f356fe0c 309 int err = 0, recovered = 0;
d624c96f 310
1c35a90e
JK
311 /* step 1: recover xattr */
312 if (IS_INODE(page)) {
313 recover_inline_xattr(inode, page);
314 } else if (f2fs_has_xattr_block(ofs_of_node(page))) {
315 recover_xattr_data(inode, page, blkaddr);
1e1bb4ba 316 goto out;
1c35a90e 317 }
1e1bb4ba 318
1c35a90e
JK
319 /* step 2: recover inline data */
320 if (recover_inline_data(inode, page))
abb2366c
JK
321 goto out;
322
1c35a90e 323 /* step 3: recover data indices */
de93653f 324 start = start_bidx_of_node(ofs_of_node(page), fi);
6403eb1f 325 end = start + ADDRS_PER_PAGE(page, fi);
d624c96f 326
e479556b 327 f2fs_lock_op(sbi);
1e1bb4ba 328
d624c96f 329 set_new_dnode(&dn, inode, NULL, NULL, 0);
39936837 330
6ead1142 331 err = get_dnode_of_data(&dn, start, ALLOC_NODE);
39936837 332 if (err) {
e479556b 333 f2fs_unlock_op(sbi);
1e1bb4ba 334 goto out;
39936837 335 }
d624c96f 336
3cb5ad15 337 f2fs_wait_on_page_writeback(dn.node_page, NODE);
d624c96f
JK
338
339 get_node_info(sbi, dn.nid, &ni);
9850cf4a
JK
340 f2fs_bug_on(sbi, ni.ino != ino_of_node(page));
341 f2fs_bug_on(sbi, ofs_of_node(dn.node_page) != ofs_of_node(page));
d624c96f
JK
342
343 for (; start < end; start++) {
344 block_t src, dest;
345
346 src = datablock_addr(dn.node_page, dn.ofs_in_node);
347 dest = datablock_addr(page, dn.ofs_in_node);
348
349 if (src != dest && dest != NEW_ADDR && dest != NULL_ADDR) {
350 if (src == NULL_ADDR) {
5d56b671 351 err = reserve_new_block(&dn);
d624c96f 352 /* We should not get -ENOSPC */
9850cf4a 353 f2fs_bug_on(sbi, err);
d624c96f
JK
354 }
355
356 /* Check the previous node page having this index */
39cf72cf
JK
357 err = check_index_in_prev_nodes(sbi, dest, &dn);
358 if (err)
359 goto err;
d624c96f
JK
360
361 set_summary(&sum, dn.nid, dn.ofs_in_node, ni.version);
362
363 /* write dummy data page */
364 recover_data_page(sbi, NULL, &sum, src, dest);
365 update_extent_cache(dest, &dn);
f356fe0c 366 recovered++;
d624c96f
JK
367 }
368 dn.ofs_in_node++;
369 }
370
371 /* write node page in place */
372 set_summary(&sum, dn.nid, 0, 0);
373 if (IS_INODE(dn.node_page))
374 sync_inode_page(&dn);
375
376 copy_node_footer(dn.node_page, page);
377 fill_node_footer(dn.node_page, dn.nid, ni.ino,
378 ofs_of_node(page), false);
379 set_page_dirty(dn.node_page);
39cf72cf 380err:
d624c96f 381 f2fs_put_dnode(&dn);
e479556b 382 f2fs_unlock_op(sbi);
1e1bb4ba 383out:
6c311ec6
CF
384 f2fs_msg(sbi->sb, KERN_NOTICE,
385 "recover_data: ino = %lx, recovered = %d blocks, err = %d",
386 inode->i_ino, recovered, err);
39cf72cf 387 return err;
d624c96f
JK
388}
389
6ead1142 390static int recover_data(struct f2fs_sb_info *sbi,
d624c96f
JK
391 struct list_head *head, int type)
392{
d71b5564 393 unsigned long long cp_ver = cur_cp_version(F2FS_CKPT(sbi));
d624c96f 394 struct curseg_info *curseg;
4c521f49 395 struct page *page = NULL;
6ead1142 396 int err = 0;
d624c96f
JK
397 block_t blkaddr;
398
399 /* get node pages in the current segment */
400 curseg = CURSEG_I(sbi, type);
401 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
402
d624c96f
JK
403 while (1) {
404 struct fsync_inode_entry *entry;
405
4c521f49
JK
406 if (blkaddr < SM_I(sbi)->main_blkaddr ||
407 blkaddr >= (SM_I(sbi)->seg0_blkaddr + TOTAL_BLKS(sbi)))
408 break;
d624c96f 409
4c521f49 410 page = get_meta_page_ra(sbi, blkaddr);
393ff91f 411
4c521f49
JK
412 if (cp_ver != cpver_of_node(page)) {
413 f2fs_put_page(page, 1);
45856aff 414 break;
4c521f49 415 }
d624c96f
JK
416
417 entry = get_fsync_inode(head, ino_of_node(page));
418 if (!entry)
419 goto next;
420
6ead1142 421 err = do_recover_data(sbi, entry->inode, page, blkaddr);
4c521f49
JK
422 if (err) {
423 f2fs_put_page(page, 1);
45856aff 424 break;
4c521f49 425 }
d624c96f
JK
426
427 if (entry->blkaddr == blkaddr) {
428 iput(entry->inode);
429 list_del(&entry->list);
430 kmem_cache_free(fsync_entry_slab, entry);
431 }
432next:
433 /* check next segment */
434 blkaddr = next_blkaddr_of_node(page);
4c521f49 435 f2fs_put_page(page, 1);
d624c96f 436 }
6ead1142
JK
437 if (!err)
438 allocate_new_segments(sbi);
439 return err;
d624c96f
JK
440}
441
6ead1142 442int recover_fsync_data(struct f2fs_sb_info *sbi)
d624c96f 443{
cf2271e7 444 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_WARM_NODE);
d624c96f 445 struct list_head inode_list;
cf2271e7 446 block_t blkaddr;
6ead1142 447 int err;
aabe5136 448 bool need_writecp = false;
d624c96f
JK
449
450 fsync_entry_slab = f2fs_kmem_cache_create("f2fs_fsync_inode_entry",
e8512d2e 451 sizeof(struct fsync_inode_entry));
6bacf52f 452 if (!fsync_entry_slab)
6ead1142 453 return -ENOMEM;
d624c96f
JK
454
455 INIT_LIST_HEAD(&inode_list);
456
457 /* step #1: find fsynced inode numbers */
aabe5136 458 sbi->por_doing = true;
cf2271e7 459
14f4e690
JK
460 /* prevent checkpoint */
461 mutex_lock(&sbi->cp_mutex);
462
cf2271e7
JK
463 blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
464
6ead1142
JK
465 err = find_fsync_dnodes(sbi, &inode_list);
466 if (err)
d624c96f
JK
467 goto out;
468
469 if (list_empty(&inode_list))
470 goto out;
471
aabe5136 472 need_writecp = true;
691c6fd2 473
d624c96f 474 /* step #2: recover data */
6ead1142 475 err = recover_data(sbi, &inode_list, CURSEG_WARM_NODE);
b307384e 476 if (!err)
9850cf4a 477 f2fs_bug_on(sbi, !list_empty(&inode_list));
d624c96f 478out:
5ebefc5b 479 destroy_fsync_dnodes(&inode_list);
d624c96f 480 kmem_cache_destroy(fsync_entry_slab);
cf2271e7 481
4c521f49
JK
482 /* truncate meta pages to be used by the recovery */
483 truncate_inode_pages_range(META_MAPPING(sbi),
484 SM_I(sbi)->main_blkaddr << PAGE_CACHE_SHIFT, -1);
485
cf2271e7
JK
486 if (err) {
487 truncate_inode_pages_final(NODE_MAPPING(sbi));
488 truncate_inode_pages_final(META_MAPPING(sbi));
489 }
490
aabe5136 491 sbi->por_doing = false;
cf2271e7
JK
492 if (err) {
493 discard_next_dnode(sbi, blkaddr);
494
495 /* Flush all the NAT/SIT pages */
496 while (get_pages(sbi, F2FS_DIRTY_META))
497 sync_meta_pages(sbi, META, LONG_MAX);
14f4e690
JK
498 set_ckpt_flags(sbi->ckpt, CP_ERROR_FLAG);
499 mutex_unlock(&sbi->cp_mutex);
cf2271e7 500 } else if (need_writecp) {
14f4e690 501 mutex_unlock(&sbi->cp_mutex);
2c2c149f 502 write_checkpoint(sbi, false);
14f4e690
JK
503 } else {
504 mutex_unlock(&sbi->cp_mutex);
cf2271e7 505 }
6ead1142 506 return err;
d624c96f 507}