fsck.c revision 3a8c9a69525f75a6c59bee0eb3d882ddc341b3f1
1/** 2 * fsck.c 3 * 4 * Copyright (c) 2013 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 "fsck.h" 12 13char *tree_mark; 14uint32_t tree_mark_size = 256; 15 16static inline int f2fs_set_main_bitmap(struct f2fs_sb_info *sbi, u32 blk) 17{ 18 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 19 20 return f2fs_set_bit(BLKOFF_FROM_MAIN(sbi, blk), fsck->main_area_bitmap); 21} 22 23static inline int f2fs_test_main_bitmap(struct f2fs_sb_info *sbi, u32 blk) 24{ 25 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 26 27 return f2fs_test_bit(BLKOFF_FROM_MAIN(sbi, blk), 28 fsck->main_area_bitmap); 29} 30 31static inline int f2fs_test_sit_bitmap(struct f2fs_sb_info *sbi, u32 blk) 32{ 33 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 34 35 return f2fs_test_bit(BLKOFF_FROM_MAIN(sbi, blk), fsck->sit_area_bitmap); 36} 37 38static int add_into_hard_link_list(struct f2fs_sb_info *sbi, 39 u32 nid, u32 link_cnt) 40{ 41 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 42 struct hard_link_node *node = NULL, *tmp = NULL, *prev = NULL; 43 44 node = calloc(sizeof(struct hard_link_node), 1); 45 ASSERT(node != NULL); 46 47 node->nid = nid; 48 node->links = link_cnt; 49 node->next = NULL; 50 51 if (fsck->hard_link_list_head == NULL) { 52 fsck->hard_link_list_head = node; 53 goto out; 54 } 55 56 tmp = fsck->hard_link_list_head; 57 58 /* Find insertion position */ 59 while (tmp && (nid < tmp->nid)) { 60 ASSERT(tmp->nid != nid); 61 prev = tmp; 62 tmp = tmp->next; 63 } 64 65 if (tmp == fsck->hard_link_list_head) { 66 node->next = tmp; 67 fsck->hard_link_list_head = node; 68 } else { 69 prev->next = node; 70 node->next = tmp; 71 } 72 73out: 74 DBG(2, "ino[0x%x] has hard links [0x%x]\n", nid, link_cnt); 75 return 0; 76} 77 78static int find_and_dec_hard_link_list(struct f2fs_sb_info *sbi, u32 nid) 79{ 80 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 81 struct hard_link_node *node = NULL, *prev = NULL; 82 83 if (fsck->hard_link_list_head == NULL) 84 return -EINVAL; 85 86 node = fsck->hard_link_list_head; 87 88 while (node && (nid < node->nid)) { 89 prev = node; 90 node = node->next; 91 } 92 93 if (node == NULL || (nid != node->nid)) 94 return -EINVAL; 95 96 /* Decrease link count */ 97 node->links = node->links - 1; 98 99 /* if link count becomes one, remove the node */ 100 if (node->links == 1) { 101 if (fsck->hard_link_list_head == node) 102 fsck->hard_link_list_head = node->next; 103 else 104 prev->next = node->next; 105 free(node); 106 } 107 return 0; 108} 109 110static int is_valid_ssa_node_blk(struct f2fs_sb_info *sbi, u32 nid, 111 u32 blk_addr) 112{ 113 int ret = 0; 114 struct f2fs_summary sum_entry; 115 116 ret = get_sum_entry(sbi, blk_addr, &sum_entry); 117 118 if (ret != SEG_TYPE_NODE && ret != SEG_TYPE_CUR_NODE) { 119 ASSERT_MSG("Summary footer is not for node segment"); 120 return -EINVAL; 121 } 122 123 if (le32_to_cpu(sum_entry.nid) != nid) { 124 DBG(0, "nid [0x%x]\n", nid); 125 DBG(0, "target blk_addr [0x%x]\n", blk_addr); 126 DBG(0, "summary blk_addr [0x%x]\n", 127 GET_SUM_BLKADDR(sbi, 128 GET_SEGNO(sbi, blk_addr))); 129 DBG(0, "seg no / offset [0x%x / 0x%x]\n", 130 GET_SEGNO(sbi, blk_addr), 131 OFFSET_IN_SEG(sbi, blk_addr)); 132 DBG(0, "summary_entry.nid [0x%x]\n", 133 le32_to_cpu(sum_entry.nid)); 134 DBG(0, "--> node block's nid [0x%x]\n", nid); 135 ASSERT_MSG("Invalid node seg summary\n"); 136 return -EINVAL; 137 } 138 return 0; 139} 140 141static int is_valid_ssa_data_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 142 u32 parent_nid, u16 idx_in_node, u8 version) 143{ 144 int ret = 0; 145 struct f2fs_summary sum_entry; 146 147 ret = get_sum_entry(sbi, blk_addr, &sum_entry); 148 149 if (ret != SEG_TYPE_DATA && ret != SEG_TYPE_CUR_DATA) { 150 ASSERT_MSG("Summary footer is not for data segment"); 151 return -EINVAL; 152 } 153 154 if (le32_to_cpu(sum_entry.nid) != parent_nid || 155 sum_entry.version != version || 156 le16_to_cpu(sum_entry.ofs_in_node) != idx_in_node) { 157 158 DBG(0, "summary_entry.nid [0x%x]\n", 159 le32_to_cpu(sum_entry.nid)); 160 DBG(0, "summary_entry.version [0x%x]\n", 161 sum_entry.version); 162 DBG(0, "summary_entry.ofs_in_node [0x%x]\n", 163 le16_to_cpu(sum_entry.ofs_in_node)); 164 DBG(0, "parent nid [0x%x]\n", parent_nid); 165 DBG(0, "version from nat [0x%x]\n", version); 166 DBG(0, "idx in parent node [0x%x]\n", idx_in_node); 167 168 DBG(0, "Target data block addr [0x%x]\n", blk_addr); 169 ASSERT_MSG("Invalid data seg summary\n"); 170 return -EINVAL; 171 } 172 return 0; 173} 174 175static int sanity_check_nid(struct f2fs_sb_info *sbi, u32 nid, 176 struct f2fs_node *node_blk, 177 enum FILE_TYPE ftype, enum NODE_TYPE ntype, 178 struct node_info *ni) 179{ 180 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 181 int ret; 182 183 if (!IS_VALID_NID(sbi, nid)) { 184 ASSERT_MSG("nid is not valid. [0x%x]", nid); 185 return -EINVAL; 186 } 187 188 get_node_info(sbi, nid, ni); 189 if (ni->blk_addr == NEW_ADDR) { 190 ASSERT_MSG("nid is NEW_ADDR. [0x%x]", nid); 191 return -EINVAL; 192 } 193 194 if (!IS_VALID_BLK_ADDR(sbi, ni->blk_addr)) { 195 ASSERT_MSG("blkaddres is not valid. [0x%x]", ni->blk_addr); 196 return -EINVAL; 197 } 198 199 if (is_valid_ssa_node_blk(sbi, nid, ni->blk_addr)) { 200 ASSERT_MSG("summary node block is not valid. [0x%x]", nid); 201 return -EINVAL; 202 } 203 204 ret = dev_read_block(node_blk, ni->blk_addr); 205 ASSERT(ret >= 0); 206 207 if (ntype == TYPE_INODE && 208 node_blk->footer.nid != node_blk->footer.ino) { 209 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]", 210 nid, le32_to_cpu(node_blk->footer.nid), 211 le32_to_cpu(node_blk->footer.ino)); 212 return -EINVAL; 213 } 214 if (ntype != TYPE_INODE && 215 node_blk->footer.nid == node_blk->footer.ino) { 216 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]", 217 nid, le32_to_cpu(node_blk->footer.nid), 218 le32_to_cpu(node_blk->footer.ino)); 219 return -EINVAL; 220 } 221 222 if (le32_to_cpu(node_blk->footer.nid) != nid) { 223 ASSERT_MSG("nid[0x%x] blk_addr[0x%x] footer.nid[0x%x]", 224 nid, ni->blk_addr, 225 le32_to_cpu(node_blk->footer.nid)); 226 return -EINVAL; 227 } 228 229 if (ntype == TYPE_XATTR) { 230 u32 flag = le32_to_cpu(node_blk->footer.flag); 231 232 if ((flag >> OFFSET_BIT_SHIFT) != XATTR_NODE_OFFSET) { 233 ASSERT_MSG("xnid[0x%x] has wrong ofs:[0x%x]", 234 nid, flag); 235 return -EINVAL; 236 } 237 } 238 239 if ((ntype == TYPE_INODE && ftype == F2FS_FT_DIR) || 240 (ntype == TYPE_XATTR && ftype == F2FS_FT_XATTR)) { 241 /* not included '.' & '..' */ 242 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) != 0) { 243 ASSERT_MSG("Duplicated node blk. nid[0x%x][0x%x]\n", 244 nid, ni->blk_addr); 245 return -EINVAL; 246 } 247 } 248 249 /* workaround to fix later */ 250 if (ftype != F2FS_FT_ORPHAN || 251 f2fs_test_bit(nid, fsck->nat_area_bitmap) != 0) 252 f2fs_clear_bit(nid, fsck->nat_area_bitmap); 253 else 254 ASSERT_MSG("orphan or xattr nid is duplicated [0x%x]\n", 255 nid); 256 257 if (f2fs_test_sit_bitmap(sbi, ni->blk_addr) == 0) 258 ASSERT_MSG("SIT bitmap is 0x0. blk_addr[0x%x]", 259 ni->blk_addr); 260 261 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) { 262 fsck->chk.valid_blk_cnt++; 263 fsck->chk.valid_node_cnt++; 264 } 265 return 0; 266} 267 268static int fsck_chk_xattr_blk(struct f2fs_sb_info *sbi, u32 ino, 269 u32 x_nid, u32 *blk_cnt) 270{ 271 struct f2fs_node *node_blk = NULL; 272 struct node_info ni; 273 int ret = 0; 274 275 if (x_nid == 0x0) 276 return 0; 277 278 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 279 ASSERT(node_blk != NULL); 280 281 /* Sanity check */ 282 if (sanity_check_nid(sbi, x_nid, node_blk, 283 F2FS_FT_XATTR, TYPE_XATTR, &ni)) { 284 ret = -EINVAL; 285 goto out; 286 } 287 288 *blk_cnt = *blk_cnt + 1; 289 f2fs_set_main_bitmap(sbi, ni.blk_addr); 290 DBG(2, "ino[0x%x] x_nid[0x%x]\n", ino, x_nid); 291out: 292 free(node_blk); 293 return ret; 294} 295 296int fsck_chk_node_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 297 u32 nid, enum FILE_TYPE ftype, enum NODE_TYPE ntype, 298 u32 *blk_cnt) 299{ 300 struct node_info ni; 301 struct f2fs_node *node_blk = NULL; 302 303 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 304 ASSERT(node_blk != NULL); 305 306 if (sanity_check_nid(sbi, nid, node_blk, ftype, ntype, &ni)) 307 goto err; 308 309 if (ntype == TYPE_INODE) { 310 fsck_chk_inode_blk(sbi, nid, ftype, node_blk, blk_cnt, &ni); 311 } else { 312 f2fs_set_main_bitmap(sbi, ni.blk_addr); 313 314 switch (ntype) { 315 case TYPE_DIRECT_NODE: 316 fsck_chk_dnode_blk(sbi, inode, nid, ftype, node_blk, 317 blk_cnt, &ni); 318 break; 319 case TYPE_INDIRECT_NODE: 320 fsck_chk_idnode_blk(sbi, inode, ftype, node_blk, 321 blk_cnt); 322 break; 323 case TYPE_DOUBLE_INDIRECT_NODE: 324 fsck_chk_didnode_blk(sbi, inode, ftype, node_blk, 325 blk_cnt); 326 break; 327 default: 328 ASSERT(0); 329 } 330 } 331 free(node_blk); 332 return 0; 333err: 334 free(node_blk); 335 return -EINVAL; 336} 337 338/* start with valid nid and blkaddr */ 339void fsck_chk_inode_blk(struct f2fs_sb_info *sbi, u32 nid, 340 enum FILE_TYPE ftype, struct f2fs_node *node_blk, 341 u32 *blk_cnt, struct node_info *ni) 342{ 343 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 344 u32 child_cnt = 0, child_files = 0; 345 enum NODE_TYPE ntype; 346 u32 i_links = le32_to_cpu(node_blk->i.i_links); 347 u64 i_blocks = le64_to_cpu(node_blk->i.i_blocks); 348 unsigned int idx = 0; 349 int need_fix = 0; 350 int ret; 351 352 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) 353 fsck->chk.valid_inode_cnt++; 354 355 if (ftype == F2FS_FT_DIR) { 356 f2fs_set_main_bitmap(sbi, ni->blk_addr); 357 } else { 358 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) { 359 f2fs_set_main_bitmap(sbi, ni->blk_addr); 360 if (i_links > 1) { 361 /* First time. Create new hard link node */ 362 add_into_hard_link_list(sbi, nid, i_links); 363 fsck->chk.multi_hard_link_files++; 364 } 365 } else { 366 DBG(3, "[0x%x] has hard links [0x%x]\n", nid, i_links); 367 if (find_and_dec_hard_link_list(sbi, nid)) { 368 ASSERT_MSG("[0x%x] needs more i_links=0x%x", 369 nid, i_links); 370 if (config.fix_on) { 371 node_blk->i.i_links = 372 cpu_to_le32(i_links + 1); 373 need_fix = 1; 374 FIX_MSG("File: 0x%x " 375 "i_links= 0x%x -> 0x%x", 376 nid, i_links, i_links + 1); 377 } 378 } 379 /* No need to go deep into the node */ 380 return; 381 } 382 } 383 384 if (fsck_chk_xattr_blk(sbi, nid, 385 le32_to_cpu(node_blk->i.i_xattr_nid), blk_cnt) && 386 config.fix_on) { 387 node_blk->i.i_xattr_nid = 0; 388 need_fix = 1; 389 FIX_MSG("Remove xattr block: 0x%x, x_nid = 0x%x", 390 nid, le32_to_cpu(node_blk->i.i_xattr_nid)); 391 } 392 393 if (ftype == F2FS_FT_CHRDEV || ftype == F2FS_FT_BLKDEV || 394 ftype == F2FS_FT_FIFO || ftype == F2FS_FT_SOCK) 395 goto check; 396 if((node_blk->i.i_inline & F2FS_INLINE_DATA)){ 397 DBG(3, "ino[0x%x] has inline data!\n", nid); 398 goto check; 399 } 400 if((node_blk->i.i_inline & F2FS_INLINE_DENTRY)){ 401 DBG(3, "ino[0x%x] has inline dentry!\n", nid); 402 ret = fsck_chk_inline_dentries(sbi, node_blk, 403 &child_cnt, &child_files); 404 goto check; 405 } 406 407 /* check data blocks in inode */ 408 for (idx = 0; idx < ADDRS_PER_INODE(&node_blk->i); idx++) { 409 if (le32_to_cpu(node_blk->i.i_addr[idx]) != 0) { 410 ret = fsck_chk_data_blk(sbi, 411 le32_to_cpu(node_blk->i.i_addr[idx]), 412 &child_cnt, &child_files, 413 (i_blocks == *blk_cnt), 414 ftype, nid, idx, ni->version); 415 if (!ret) { 416 *blk_cnt = *blk_cnt + 1; 417 } else if (config.fix_on) { 418 node_blk->i.i_addr[idx] = 0; 419 need_fix = 1; 420 FIX_MSG("[0x%x] i_addr[%d] = 0", nid, idx); 421 } 422 } 423 } 424 425 /* check node blocks in inode */ 426 for (idx = 0; idx < 5; idx++) { 427 if (idx == 0 || idx == 1) 428 ntype = TYPE_DIRECT_NODE; 429 else if (idx == 2 || idx == 3) 430 ntype = TYPE_INDIRECT_NODE; 431 else if (idx == 4) 432 ntype = TYPE_DOUBLE_INDIRECT_NODE; 433 else 434 ASSERT(0); 435 436 if (le32_to_cpu(node_blk->i.i_nid[idx]) != 0) { 437 ret = fsck_chk_node_blk(sbi, &node_blk->i, 438 le32_to_cpu(node_blk->i.i_nid[idx]), 439 ftype, ntype, blk_cnt); 440 if (!ret) { 441 *blk_cnt = *blk_cnt + 1; 442 } else if (config.fix_on) { 443 node_blk->i.i_nid[idx] = 0; 444 need_fix = 1; 445 FIX_MSG("[0x%x] i_nid[%d] = 0", nid, idx); 446 } 447 } 448 } 449check: 450 if (ftype == F2FS_FT_DIR) 451 DBG(1, "Directory Inode: 0x%x [%s] depth: %d has %d files\n\n", 452 le32_to_cpu(node_blk->footer.ino), 453 node_blk->i.i_name, 454 le32_to_cpu(node_blk->i.i_current_depth), 455 child_files); 456 if (ftype == F2FS_FT_ORPHAN) 457 DBG(1, "Orphan Inode: 0x%x [%s] i_blocks: %u\n\n", 458 le32_to_cpu(node_blk->footer.ino), 459 node_blk->i.i_name, 460 (u32)i_blocks); 461 462 if (i_blocks != *blk_cnt) { 463 ASSERT_MSG("ino: 0x%x has i_blocks: %08"PRIx64", " 464 "but has %u blocks", 465 nid, i_blocks, *blk_cnt); 466 if (config.fix_on) { 467 node_blk->i.i_blocks = cpu_to_le64(*blk_cnt); 468 need_fix = 1; 469 FIX_MSG("[0x%x] i_blocks=0x%08"PRIx64" -> 0x%x", 470 nid, i_blocks, *blk_cnt); 471 } 472 } 473 if (ftype == F2FS_FT_DIR && i_links != child_cnt) { 474 ASSERT_MSG("ino: 0x%x has i_links: %u but real links: %u", 475 nid, i_links, child_cnt); 476 if (config.fix_on) { 477 node_blk->i.i_links = cpu_to_le32(child_cnt); 478 need_fix = 1; 479 FIX_MSG("Dir: 0x%x i_links= 0x%x -> 0x%x", 480 nid, i_links, child_cnt); 481 } 482 } 483 484 if (ftype == F2FS_FT_ORPHAN && i_links) 485 ASSERT_MSG("ino: 0x%x is orphan inode, but has i_links: %u", 486 nid, i_links); 487 if (need_fix) { 488 ret = dev_write_block(node_blk, ni->blk_addr); 489 ASSERT(ret >= 0); 490 } 491} 492 493int fsck_chk_dnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 494 u32 nid, enum FILE_TYPE ftype, struct f2fs_node *node_blk, 495 u32 *blk_cnt, struct node_info *ni) 496{ 497 int idx, ret; 498 u32 child_cnt = 0, child_files = 0; 499 500 for (idx = 0; idx < ADDRS_PER_BLOCK; idx++) { 501 if (le32_to_cpu(node_blk->dn.addr[idx]) == 0x0) 502 continue; 503 ret = fsck_chk_data_blk(sbi, 504 le32_to_cpu(node_blk->dn.addr[idx]), 505 &child_cnt, &child_files, 506 le64_to_cpu(inode->i_blocks) == *blk_cnt, ftype, 507 nid, idx, ni->version); 508 if (!ret) 509 *blk_cnt = *blk_cnt + 1; 510 } 511 return 0; 512} 513 514int fsck_chk_idnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 515 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 516{ 517 int ret; 518 int i = 0; 519 520 for (i = 0 ; i < NIDS_PER_BLOCK; i++) { 521 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 522 continue; 523 ret = fsck_chk_node_blk(sbi, inode, 524 le32_to_cpu(node_blk->in.nid[i]), 525 ftype, TYPE_DIRECT_NODE, blk_cnt); 526 if (!ret) 527 *blk_cnt = *blk_cnt + 1; 528 else if (ret == -EINVAL) 529 printf("delete in.nid[i] = 0;\n"); 530 } 531 return 0; 532} 533 534int fsck_chk_didnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 535 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 536{ 537 int i = 0; 538 int ret = 0; 539 540 for (i = 0; i < NIDS_PER_BLOCK; i++) { 541 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 542 continue; 543 ret = fsck_chk_node_blk(sbi, inode, 544 le32_to_cpu(node_blk->in.nid[i]), 545 ftype, TYPE_INDIRECT_NODE, blk_cnt); 546 if (!ret) 547 *blk_cnt = *blk_cnt + 1; 548 else if (ret == -EINVAL) 549 printf("delete in.nid[i] = 0;\n"); 550 } 551 return 0; 552} 553 554static void print_dentry(__u32 depth, __u8 *name, 555 unsigned long *bitmap, 556 struct f2fs_dir_entry *dentry, 557 int max, int idx, int last_blk) 558{ 559 int last_de = 0; 560 int next_idx = 0; 561 int name_len; 562 unsigned int i; 563 int bit_offset; 564 565 if (config.dbg_lv != -1) 566 return; 567 568 name_len = le16_to_cpu(dentry[idx].name_len); 569 next_idx = idx + (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 570 571 bit_offset = find_next_bit(bitmap, max, next_idx); 572 if (bit_offset >= max && last_blk) 573 last_de = 1; 574 575 if (tree_mark_size <= depth) { 576 tree_mark_size *= 2; 577 tree_mark = realloc(tree_mark, tree_mark_size); 578 } 579 580 if (last_de) 581 tree_mark[depth] = '`'; 582 else 583 tree_mark[depth] = '|'; 584 585 if (tree_mark[depth - 1] == '`') 586 tree_mark[depth - 1] = ' '; 587 588 589 for (i = 1; i < depth; i++) 590 printf("%c ", tree_mark[i]); 591 printf("%c-- %s 0x%x\n", last_de ? '`' : '|', 592 name, le32_to_cpu(dentry[idx].ino)); 593} 594 595static int __chk_dentries(struct f2fs_sb_info *sbi, u32 *child_cnt, 596 u32* child_files, 597 unsigned long *bitmap, 598 struct f2fs_dir_entry *dentry, 599 __u8 (*filenames)[F2FS_SLOT_LEN], 600 int max, int last_blk) 601{ 602 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 603 enum FILE_TYPE ftype; 604 int dentries = 0; 605 u32 blk_cnt; 606 u8 *name; 607 u32 hash_code; 608 u16 name_len;; 609 int ret = 0; 610 int i; 611 612 for (i = 0; i < max;) { 613 if (test_bit(i, bitmap) == 0) { 614 i++; 615 continue; 616 } 617 618 name_len = le16_to_cpu(dentry[i].name_len); 619 name = calloc(name_len + 1, 1); 620 memcpy(name, filenames[i], name_len); 621 hash_code = f2fs_dentry_hash((const unsigned char *)name, 622 name_len); 623 624 ASSERT(le32_to_cpu(dentry[i].hash_code) == hash_code); 625 626 ftype = dentry[i].file_type; 627 628 /* Becareful. 'dentry.file_type' is not imode. */ 629 if (ftype == F2FS_FT_DIR) { 630 *child_cnt = *child_cnt + 1; 631 if ((name[0] == '.' && name_len == 1) || 632 (name[0] == '.' && name[1] == '.' && 633 name_len == 2)) { 634 i++; 635 free(name); 636 continue; 637 } 638 } 639 640 DBG(1, "[%3u]-[0x%x] name[%s] len[0x%x] ino[0x%x] type[0x%x]\n", 641 fsck->dentry_depth, i, name, name_len, 642 le32_to_cpu(dentry[i].ino), 643 dentry[i].file_type); 644 645 print_dentry(fsck->dentry_depth, name, bitmap, 646 dentry, max, i, 1); 647 648 blk_cnt = 1; 649 ret = fsck_chk_node_blk(sbi, 650 NULL, le32_to_cpu(dentry[i].ino), 651 ftype, TYPE_INODE, &blk_cnt); 652 653 if (ret && config.fix_on) { 654 int j; 655 int slots = (name_len + F2FS_SLOT_LEN - 1) / 656 F2FS_SLOT_LEN; 657 for (j = 0; j < slots; j++) 658 clear_bit(i + j, bitmap); 659 FIX_MSG("Unlink [0x%x] - %s len[0x%x], type[0x%x]", 660 le32_to_cpu(dentry[i].ino), 661 name, name_len, 662 dentry[i].file_type); 663 i += slots; 664 free(name); 665 continue; 666 } 667 668 i += (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 669 dentries++; 670 *child_files = *child_files + 1; 671 free(name); 672 } 673 return dentries; 674} 675 676int fsck_chk_inline_dentries(struct f2fs_sb_info *sbi, 677 struct f2fs_node *node_blk, u32 *child_cnt, u32 *child_files) 678{ 679 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 680 struct f2fs_inline_dentry *de_blk; 681 int dentries; 682 683 de_blk = inline_data_addr(node_blk); 684 ASSERT(de_blk != NULL); 685 686 fsck->dentry_depth++; 687 dentries = __chk_dentries(sbi, child_cnt, child_files, 688 (unsigned long *)de_blk->dentry_bitmap, 689 de_blk->dentry, de_blk->filename, 690 NR_INLINE_DENTRY, 1); 691 DBG(1, "[%3d] Inline Dentry Block Done : " 692 "dentries:%d in %d slots (len:%d)\n\n", 693 fsck->dentry_depth, dentries, 694 (int)NR_INLINE_DENTRY, F2FS_NAME_LEN); 695 fsck->dentry_depth--; 696 return 0; 697} 698 699int fsck_chk_dentry_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 700 u32 *child_cnt, u32 *child_files, int last_blk) 701{ 702 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 703 struct f2fs_dentry_block *de_blk; 704 int dentries, ret; 705 706 de_blk = (struct f2fs_dentry_block *)calloc(BLOCK_SZ, 1); 707 ASSERT(de_blk != NULL); 708 709 ret = dev_read_block(de_blk, blk_addr); 710 ASSERT(ret >= 0); 711 712 fsck->dentry_depth++; 713 dentries = __chk_dentries(sbi, child_cnt, child_files, 714 (unsigned long *)de_blk->dentry_bitmap, 715 de_blk->dentry, de_blk->filename, 716 NR_DENTRY_IN_BLOCK, last_blk); 717 718 DBG(1, "[%3d] Dentry Block [0x%x] Done : " 719 "dentries:%d in %d slots (len:%d)\n\n", 720 fsck->dentry_depth, blk_addr, dentries, 721 NR_DENTRY_IN_BLOCK, F2FS_NAME_LEN); 722 fsck->dentry_depth--; 723 free(de_blk); 724 return 0; 725} 726 727int fsck_chk_data_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 728 u32 *child_cnt, u32 *child_files, int last_blk, 729 enum FILE_TYPE ftype, u32 parent_nid, u16 idx_in_node, u8 ver) 730{ 731 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 732 733 /* Is it reserved block? */ 734 if (blk_addr == NEW_ADDR) { 735 fsck->chk.valid_blk_cnt++; 736 return 0; 737 } 738 739 if (!IS_VALID_BLK_ADDR(sbi, blk_addr)) { 740 ASSERT_MSG("blkaddres is not valid. [0x%x]", blk_addr); 741 return -EINVAL; 742 } 743 744 if (is_valid_ssa_data_blk(sbi, blk_addr, parent_nid, 745 idx_in_node, ver)) { 746 ASSERT_MSG("summary data block is not valid. [0x%x]", 747 parent_nid); 748 return -EINVAL; 749 } 750 751 if (f2fs_test_sit_bitmap(sbi, blk_addr) == 0) 752 ASSERT_MSG("SIT bitmap is 0x0. blk_addr[0x%x]", blk_addr); 753 754 if (f2fs_test_main_bitmap(sbi, blk_addr) != 0) 755 ASSERT_MSG("Duplicated data [0x%x]. pnid[0x%x] idx[0x%x]", 756 blk_addr, parent_nid, idx_in_node); 757 758 f2fs_set_main_bitmap(sbi, blk_addr); 759 760 fsck->chk.valid_blk_cnt++; 761 762 if (ftype == F2FS_FT_DIR) 763 return fsck_chk_dentry_blk(sbi, blk_addr, child_cnt, 764 child_files, last_blk); 765 return 0; 766} 767 768void fsck_chk_orphan_node(struct f2fs_sb_info *sbi) 769{ 770 u32 blk_cnt = 0; 771 block_t start_blk, orphan_blkaddr, i, j; 772 struct f2fs_orphan_block *orphan_blk; 773 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 774 775 if (!is_set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG)) 776 return; 777 778 if (config.fix_on) 779 return; 780 781 start_blk = __start_cp_addr(sbi) + 1 + 782 le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload); 783 orphan_blkaddr = __start_sum_addr(sbi) - 1; 784 orphan_blk = calloc(BLOCK_SZ, 1); 785 786 for (i = 0; i < orphan_blkaddr; i++) { 787 int ret = dev_read_block(orphan_blk, start_blk + i); 788 789 ASSERT(ret >= 0); 790 791 for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) { 792 nid_t ino = le32_to_cpu(orphan_blk->ino[j]); 793 DBG(1, "[%3d] ino [0x%x]\n", i, ino); 794 blk_cnt = 1; 795 fsck_chk_node_blk(sbi, NULL, ino, 796 F2FS_FT_ORPHAN, TYPE_INODE, &blk_cnt); 797 } 798 memset(orphan_blk, 0, BLOCK_SZ); 799 } 800 free(orphan_blk); 801} 802 803void fsck_init(struct f2fs_sb_info *sbi) 804{ 805 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 806 struct f2fs_sm_info *sm_i = SM_I(sbi); 807 808 /* 809 * We build three bitmap for main/sit/nat so that may check consistency 810 * of filesystem. 811 * 1. main_area_bitmap will be used to check whether all blocks of main 812 * area is used or not. 813 * 2. nat_area_bitmap has bitmap information of used nid in NAT. 814 * 3. sit_area_bitmap has bitmap information of used main block. 815 * At Last sequence, we compare main_area_bitmap with sit_area_bitmap. 816 */ 817 fsck->nr_main_blks = sm_i->main_segments << sbi->log_blocks_per_seg; 818 fsck->main_area_bitmap_sz = (fsck->nr_main_blks + 7) / 8; 819 fsck->main_area_bitmap = calloc(fsck->main_area_bitmap_sz, 1); 820 ASSERT(fsck->main_area_bitmap != NULL); 821 822 build_nat_area_bitmap(sbi); 823 824 build_sit_area_bitmap(sbi); 825 826 tree_mark = calloc(tree_mark_size, 1); 827 ASSERT(tree_mark != NULL); 828} 829 830static void fix_nat_entries(struct f2fs_sb_info *sbi) 831{ 832 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 833 u32 i; 834 835 for (i = 0; i < fsck->nr_nat_entries; i++) 836 if (f2fs_test_bit(i, fsck->nat_area_bitmap) != 0) 837 nullify_nat_entry(sbi, i); 838} 839 840static void fix_checkpoint(struct f2fs_sb_info *sbi) 841{ 842 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 843 struct f2fs_super_block *raw_sb = sbi->raw_super; 844 struct f2fs_checkpoint *ckp = F2FS_CKPT(sbi); 845 unsigned long long cp_blk_no; 846 u32 i; 847 int ret; 848 u_int32_t crc = 0; 849 850 ckp->ckpt_flags = cpu_to_le32(CP_UMOUNT_FLAG); 851 ckp->cp_pack_total_block_count = 852 cpu_to_le32(8 + le32_to_cpu(raw_sb->cp_payload)); 853 ckp->cp_pack_start_sum = cpu_to_le32(1 + 854 le32_to_cpu(raw_sb->cp_payload)); 855 856 ckp->free_segment_count = cpu_to_le32(fsck->chk.free_segs); 857 ckp->valid_block_count = cpu_to_le32(fsck->chk.valid_blk_cnt); 858 ckp->valid_node_count = cpu_to_le32(fsck->chk.valid_node_cnt); 859 ckp->valid_inode_count = cpu_to_le32(fsck->chk.valid_inode_cnt); 860 861 crc = f2fs_cal_crc32(F2FS_SUPER_MAGIC, ckp, CHECKSUM_OFFSET); 862 *((__le32 *)((unsigned char *)ckp + CHECKSUM_OFFSET)) = 863 cpu_to_le32(crc); 864 865 cp_blk_no = le32_to_cpu(raw_sb->cp_blkaddr); 866 if (sbi->cur_cp == 2) 867 cp_blk_no += 1 << le32_to_cpu(raw_sb->log_blocks_per_seg); 868 869 ret = dev_write_block(ckp, cp_blk_no++); 870 ASSERT(ret >= 0); 871 872 for (i = 0; i < le32_to_cpu(raw_sb->cp_payload); i++) { 873 ret = dev_write_block(((unsigned char *)ckp) + i * F2FS_BLKSIZE, 874 cp_blk_no++); 875 ASSERT(ret >= 0); 876 } 877 878 for (i = 0; i < NO_CHECK_TYPE; i++) { 879 struct curseg_info *curseg = CURSEG_I(sbi, i); 880 881 ret = dev_write_block(curseg->sum_blk, cp_blk_no++); 882 ASSERT(ret >= 0); 883 } 884 885 ret = dev_write_block(ckp, cp_blk_no++); 886 ASSERT(ret >= 0); 887} 888 889int check_curseg_offset(struct f2fs_sb_info *sbi) 890{ 891 int i; 892 893 for (i = 0; i < NO_CHECK_TYPE; i++) { 894 struct curseg_info *curseg = CURSEG_I(sbi, i); 895 struct seg_entry *se; 896 897 se = get_seg_entry(sbi, curseg->segno); 898 if (f2fs_test_bit(curseg->next_blkoff, 899 (const char *)se->cur_valid_map) == 1) { 900 ASSERT_MSG("Next block offset is not free, type:%d", i); 901 return -EINVAL; 902 } 903 } 904 return 0; 905} 906 907int fsck_verify(struct f2fs_sb_info *sbi) 908{ 909 unsigned int i = 0; 910 int ret = 0; 911 u32 nr_unref_nid = 0; 912 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 913 struct hard_link_node *node = NULL; 914 915 printf("\n"); 916 917 for (i = 0; i < fsck->nr_nat_entries; i++) { 918 if (f2fs_test_bit(i, fsck->nat_area_bitmap) != 0) { 919 printf("NID[0x%x] is unreachable\n", i); 920 nr_unref_nid++; 921 } 922 } 923 924 if (fsck->hard_link_list_head != NULL) { 925 node = fsck->hard_link_list_head; 926 while (node) { 927 printf("NID[0x%x] has [0x%x] more unreachable links\n", 928 node->nid, node->links); 929 node = node->next; 930 } 931 config.bug_on = 1; 932 } 933 934 printf("[FSCK] Unreachable nat entries "); 935 if (nr_unref_nid == 0x0) { 936 printf(" [Ok..] [0x%x]\n", nr_unref_nid); 937 } else { 938 printf(" [Fail] [0x%x]\n", nr_unref_nid); 939 ret = EXIT_ERR_CODE; 940 config.bug_on = 1; 941 } 942 943 printf("[FSCK] SIT valid block bitmap checking "); 944 if (memcmp(fsck->sit_area_bitmap, fsck->main_area_bitmap, 945 fsck->sit_area_bitmap_sz) == 0x0) { 946 printf("[Ok..]\n"); 947 } else { 948 printf("[Fail]\n"); 949 ret = EXIT_ERR_CODE; 950 config.bug_on = 1; 951 } 952 953 printf("[FSCK] Hard link checking for regular file "); 954 if (fsck->hard_link_list_head == NULL) { 955 printf(" [Ok..] [0x%x]\n", fsck->chk.multi_hard_link_files); 956 } else { 957 printf(" [Fail] [0x%x]\n", fsck->chk.multi_hard_link_files); 958 ret = EXIT_ERR_CODE; 959 config.bug_on = 1; 960 } 961 962 printf("[FSCK] valid_block_count matching with CP "); 963 if (sbi->total_valid_block_count == fsck->chk.valid_blk_cnt) { 964 printf(" [Ok..] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 965 } else { 966 printf(" [Fail] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 967 ret = EXIT_ERR_CODE; 968 config.bug_on = 1; 969 } 970 971 printf("[FSCK] valid_node_count matcing with CP (de lookup) "); 972 if (sbi->total_valid_node_count == fsck->chk.valid_node_cnt) { 973 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_node_cnt); 974 } else { 975 printf(" [Fail] [0x%x]\n", fsck->chk.valid_node_cnt); 976 ret = EXIT_ERR_CODE; 977 config.bug_on = 1; 978 } 979 980 printf("[FSCK] valid_node_count matcing with CP (nat lookup) "); 981 if (sbi->total_valid_node_count == fsck->chk.valid_nat_entry_cnt) { 982 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 983 } else { 984 printf(" [Fail] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 985 ret = EXIT_ERR_CODE; 986 config.bug_on = 1; 987 } 988 989 printf("[FSCK] valid_inode_count matched with CP "); 990 if (sbi->total_valid_inode_count == fsck->chk.valid_inode_cnt) { 991 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_inode_cnt); 992 } else { 993 printf(" [Fail] [0x%x]\n", fsck->chk.valid_inode_cnt); 994 ret = EXIT_ERR_CODE; 995 config.bug_on = 1; 996 } 997 998 printf("[FSCK] free segment_count matched with CP "); 999 if (le32_to_cpu(F2FS_CKPT(sbi)->free_segment_count) == 1000 fsck->chk.sit_free_segs) { 1001 printf(" [Ok..] [0x%x]\n", fsck->chk.sit_free_segs); 1002 } else { 1003 printf(" [Fail] [0x%x]\n", fsck->chk.sit_free_segs); 1004 ret = EXIT_ERR_CODE; 1005 config.bug_on = 1; 1006 } 1007 1008 printf("[FSCK] next block offset is free "); 1009 if (check_curseg_offset(sbi) == 0) { 1010 printf(" [Ok..]\n"); 1011 } else { 1012 printf(" [Fail]\n"); 1013 ret = EXIT_ERR_CODE; 1014 config.bug_on = 1; 1015 } 1016 1017 printf("[FSCK] other corrupted bugs "); 1018 if (config.bug_on == 0) { 1019 printf(" [Ok..]\n"); 1020 } else { 1021 printf(" [Fail]\n"); 1022 ret = EXIT_ERR_CODE; 1023 config.bug_on = 1; 1024 } 1025 1026 /* fix global metadata */ 1027 if (config.bug_on && config.fix_on) { 1028 fix_nat_entries(sbi); 1029 rewrite_sit_area_bitmap(sbi); 1030 fix_checkpoint(sbi); 1031 } 1032 return ret; 1033} 1034 1035void fsck_free(struct f2fs_sb_info *sbi) 1036{ 1037 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 1038 if (fsck->main_area_bitmap) 1039 free(fsck->main_area_bitmap); 1040 1041 if (fsck->nat_area_bitmap) 1042 free(fsck->nat_area_bitmap); 1043 1044 if (fsck->sit_area_bitmap) 1045 free(fsck->sit_area_bitmap); 1046 1047 if (tree_mark) 1048 free(tree_mark); 1049} 1050