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