fsck.c revision 1118af29cae53275851c3b1f7ef266e67cc7e2a7
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 ASSERT(ret >= 0); 118 119 if (ret == SEG_TYPE_DATA || ret == SEG_TYPE_CUR_DATA) { 120 ASSERT_MSG("Summary footer is not for node segment\n"); 121 } else if (ret == SEG_TYPE_NODE) { 122 if (le32_to_cpu(sum_entry.nid) != nid) { 123 DBG(0, "nid [0x%x]\n", nid); 124 DBG(0, "target blk_addr [0x%x]\n", blk_addr); 125 DBG(0, "summary blk_addr [0x%x]\n", 126 GET_SUM_BLKADDR(sbi, 127 GET_SEGNO(sbi, blk_addr))); 128 DBG(0, "seg no / offset [0x%x / 0x%x]\n", 129 GET_SEGNO(sbi, blk_addr), 130 OFFSET_IN_SEG(sbi, blk_addr)); 131 DBG(0, "summary_entry.nid [0x%x]\n", 132 le32_to_cpu(sum_entry.nid)); 133 DBG(0, "--> node block's nid [0x%x]\n", nid); 134 ASSERT_MSG("Invalid node seg summary\n"); 135 return -EINVAL; 136 } 137 return 0; 138 } else if (ret == SEG_TYPE_CUR_NODE) { 139 /* current node segment has no ssa */ 140 return 0; 141 } else { 142 ASSERT_MSG("Invalid return value of 'get_sum_entry'"); 143 } 144 return -EINVAL; 145} 146 147static int is_valid_ssa_data_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 148 u32 parent_nid, u16 idx_in_node, u8 version) 149{ 150 int ret = 0; 151 struct f2fs_summary sum_entry; 152 153 ret = get_sum_entry(sbi, blk_addr, &sum_entry); 154 ASSERT(ret == SEG_TYPE_DATA || ret == SEG_TYPE_CUR_DATA); 155 156 if (le32_to_cpu(sum_entry.nid) != parent_nid || 157 sum_entry.version != version || 158 le16_to_cpu(sum_entry.ofs_in_node) != idx_in_node) { 159 160 DBG(0, "summary_entry.nid [0x%x]\n", 161 le32_to_cpu(sum_entry.nid)); 162 DBG(0, "summary_entry.version [0x%x]\n", 163 sum_entry.version); 164 DBG(0, "summary_entry.ofs_in_node [0x%x]\n", 165 le16_to_cpu(sum_entry.ofs_in_node)); 166 DBG(0, "parent nid [0x%x]\n", parent_nid); 167 DBG(0, "version from nat [0x%x]\n", version); 168 DBG(0, "idx in parent node [0x%x]\n", idx_in_node); 169 170 DBG(0, "Target data block addr [0x%x]\n", blk_addr); 171 ASSERT_MSG("Invalid data seg summary\n"); 172 } 173 return 1; 174} 175 176static int sanity_check_nid(struct f2fs_sb_info *sbi, u32 nid, 177 struct f2fs_node *node_blk, 178 enum FILE_TYPE ftype, enum NODE_TYPE ntype, 179 struct node_info *ni) 180{ 181 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 182 int ret; 183 184 if (!IS_VALID_NID(sbi, nid)) { 185 ASSERT_MSG("nid is not valid. [0x%x]", nid); 186 return -EINVAL; 187 } 188 189 get_node_info(sbi, nid, ni); 190 if (ni->blk_addr == NEW_ADDR) { 191 ASSERT_MSG("nid is NEW_ADDR. [0x%x]", nid); 192 return -EINVAL; 193 } 194 195 if (!IS_VALID_BLK_ADDR(sbi, ni->blk_addr)) { 196 ASSERT_MSG("blkaddres is not valid. [0x%x]", ni->blk_addr); 197 return -EINVAL; 198 } 199 200 if (is_valid_ssa_node_blk(sbi, nid, ni->blk_addr)) { 201 ASSERT_MSG("summary node block is not valid. [0x%x]", nid); 202 return -EINVAL; 203 } 204 205 ret = dev_read_block(node_blk, ni->blk_addr); 206 ASSERT(ret >= 0); 207 208 if (ntype == TYPE_INODE && 209 node_blk->footer.nid != node_blk->footer.ino) { 210 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]", 211 nid, le32_to_cpu(node_blk->footer.nid), 212 le32_to_cpu(node_blk->footer.ino)); 213 return -EINVAL; 214 } 215 if (ntype != TYPE_INODE && 216 node_blk->footer.nid == node_blk->footer.ino) { 217 ASSERT_MSG("nid[0x%x] footer.nid[0x%x] footer.ino[0x%x]", 218 nid, le32_to_cpu(node_blk->footer.nid), 219 le32_to_cpu(node_blk->footer.ino)); 220 return -EINVAL; 221 } 222 223 if (le32_to_cpu(node_blk->footer.nid) != nid) { 224 ASSERT_MSG("nid[0x%x] blk_addr[0x%x] footer.nid[0x%x]", 225 nid, ni->blk_addr, 226 le32_to_cpu(node_blk->footer.nid)); 227 return -EINVAL; 228 } 229 230 if (ntype == TYPE_XATTR) { 231 u32 flag = le32_to_cpu(node_blk->footer.flag); 232 233 if ((flag >> OFFSET_BIT_SHIFT) != XATTR_NODE_OFFSET) { 234 ASSERT_MSG("xnid[0x%x] has wrong ofs:[0x%x]", 235 nid, flag); 236 return -EINVAL; 237 } 238 } 239 240 if ((ntype == TYPE_INODE && ftype == F2FS_FT_DIR) || 241 (ntype == TYPE_XATTR && ftype == F2FS_FT_XATTR)) { 242 /* not included '.' & '..' */ 243 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) != 0) { 244 ASSERT_MSG("Duplicated node blk. nid[0x%x][0x%x]\n", 245 nid, ni->blk_addr); 246 return -EINVAL; 247 } 248 } 249 250 /* workaround to fix later */ 251 if (ftype != F2FS_FT_ORPHAN || 252 f2fs_test_bit(nid, fsck->nat_area_bitmap) != 0) 253 f2fs_clear_bit(nid, fsck->nat_area_bitmap); 254 else 255 ASSERT_MSG("orphan or xattr nid is duplicated [0x%x]\n", 256 nid); 257 258 if (f2fs_test_sit_bitmap(sbi, ni->blk_addr) == 0) 259 ASSERT_MSG("SIT bitmap is 0x0. blk_addr[0x%x]", 260 ni->blk_addr); 261 262 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) { 263 fsck->chk.valid_blk_cnt++; 264 fsck->chk.valid_node_cnt++; 265 } 266 return 0; 267} 268 269static int fsck_chk_xattr_blk(struct f2fs_sb_info *sbi, u32 ino, 270 u32 x_nid, u32 *blk_cnt) 271{ 272 struct f2fs_node *node_blk = NULL; 273 struct node_info ni; 274 int ret = 0; 275 276 if (x_nid == 0x0) 277 return 0; 278 279 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 280 ASSERT(node_blk != NULL); 281 282 /* Sanity check */ 283 if (sanity_check_nid(sbi, x_nid, node_blk, 284 F2FS_FT_XATTR, TYPE_XATTR, &ni)) { 285 ret = -EINVAL; 286 goto out; 287 } 288 289 *blk_cnt = *blk_cnt + 1; 290 f2fs_set_main_bitmap(sbi, ni.blk_addr); 291 DBG(2, "ino[0x%x] x_nid[0x%x]\n", ino, x_nid); 292out: 293 free(node_blk); 294 return ret; 295} 296 297int fsck_chk_node_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 298 u32 nid, enum FILE_TYPE ftype, enum NODE_TYPE ntype, 299 u32 *blk_cnt) 300{ 301 struct node_info ni; 302 struct f2fs_node *node_blk = NULL; 303 304 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 305 ASSERT(node_blk != NULL); 306 307 if (sanity_check_nid(sbi, nid, node_blk, ftype, ntype, &ni)) 308 goto err; 309 310 if (ntype == TYPE_INODE) { 311 fsck_chk_inode_blk(sbi, nid, ftype, node_blk, blk_cnt, &ni); 312 } else { 313 f2fs_set_main_bitmap(sbi, ni.blk_addr); 314 315 switch (ntype) { 316 case TYPE_DIRECT_NODE: 317 fsck_chk_dnode_blk(sbi, inode, nid, ftype, node_blk, 318 blk_cnt, &ni); 319 break; 320 case TYPE_INDIRECT_NODE: 321 fsck_chk_idnode_blk(sbi, inode, ftype, node_blk, 322 blk_cnt); 323 break; 324 case TYPE_DOUBLE_INDIRECT_NODE: 325 fsck_chk_didnode_blk(sbi, inode, ftype, node_blk, 326 blk_cnt); 327 break; 328 default: 329 ASSERT(0); 330 } 331 } 332 free(node_blk); 333 return 0; 334err: 335 free(node_blk); 336 return -EINVAL; 337} 338 339/* start with valid nid and blkaddr */ 340void fsck_chk_inode_blk(struct f2fs_sb_info *sbi, u32 nid, 341 enum FILE_TYPE ftype, struct f2fs_node *node_blk, 342 u32 *blk_cnt, struct node_info *ni) 343{ 344 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 345 u32 child_cnt = 0, child_files = 0; 346 enum NODE_TYPE ntype; 347 u32 i_links = le32_to_cpu(node_blk->i.i_links); 348 u64 i_blocks = le64_to_cpu(node_blk->i.i_blocks); 349 unsigned int idx = 0; 350 int need_fix = 0; 351 int ret; 352 353 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) 354 fsck->chk.valid_inode_cnt++; 355 356 if (ftype == F2FS_FT_DIR) { 357 f2fs_set_main_bitmap(sbi, ni->blk_addr); 358 } else { 359 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) { 360 f2fs_set_main_bitmap(sbi, ni->blk_addr); 361 if (i_links > 1) { 362 /* First time. Create new hard link node */ 363 add_into_hard_link_list(sbi, nid, i_links); 364 fsck->chk.multi_hard_link_files++; 365 } 366 } else { 367 DBG(3, "[0x%x] has hard links [0x%x]\n", nid, i_links); 368 if (find_and_dec_hard_link_list(sbi, nid)) { 369 ASSERT_MSG("[0x%x] needs more i_links=0x%x", 370 nid, i_links); 371 if (config.fix_cnt) { 372 node_blk->i.i_links = 373 cpu_to_le32(i_links + 1); 374 need_fix = 1; 375 FIX_MSG("File: 0x%x " 376 "i_links= 0x%x -> 0x%x", 377 nid, i_links, i_links + 1); 378 } 379 } 380 /* No need to go deep into the node */ 381 return; 382 } 383 } 384 385 if (fsck_chk_xattr_blk(sbi, nid, 386 le32_to_cpu(node_blk->i.i_xattr_nid), blk_cnt) && 387 config.fix_cnt) { 388 node_blk->i.i_xattr_nid = 0; 389 need_fix = 1; 390 FIX_MSG("Remove xattr block: 0x%x, x_nid = 0x%x", 391 nid, le32_to_cpu(node_blk->i.i_xattr_nid)); 392 } 393 394 if (ftype == F2FS_FT_CHRDEV || ftype == F2FS_FT_BLKDEV || 395 ftype == F2FS_FT_FIFO || ftype == F2FS_FT_SOCK) 396 goto check; 397 if((node_blk->i.i_inline & F2FS_INLINE_DATA)){ 398 DBG(3, "ino[0x%x] has inline data!\n", nid); 399 goto check; 400 } 401 402 /* check data blocks in inode */ 403 for (idx = 0; idx < ADDRS_PER_INODE(&node_blk->i); idx++) { 404 if (le32_to_cpu(node_blk->i.i_addr[idx]) != 0) { 405 ret = fsck_chk_data_blk(sbi, 406 le32_to_cpu(node_blk->i.i_addr[idx]), 407 &child_cnt, &child_files, 408 (i_blocks == *blk_cnt), 409 ftype, nid, idx, ni->version); 410 if (!ret) { 411 *blk_cnt = *blk_cnt + 1; 412 } else if (config.fix_cnt) { 413 node_blk->i.i_addr[idx] = 0; 414 need_fix = 1; 415 FIX_MSG("[0x%x] i_addr[%d] = 0", nid, idx); 416 } 417 } 418 } 419 420 /* check node blocks in inode */ 421 for (idx = 0; idx < 5; idx++) { 422 if (idx == 0 || idx == 1) 423 ntype = TYPE_DIRECT_NODE; 424 else if (idx == 2 || idx == 3) 425 ntype = TYPE_INDIRECT_NODE; 426 else if (idx == 4) 427 ntype = TYPE_DOUBLE_INDIRECT_NODE; 428 else 429 ASSERT(0); 430 431 if (le32_to_cpu(node_blk->i.i_nid[idx]) != 0) { 432 ret = fsck_chk_node_blk(sbi, &node_blk->i, 433 le32_to_cpu(node_blk->i.i_nid[idx]), 434 ftype, ntype, blk_cnt); 435 if (!ret) { 436 *blk_cnt = *blk_cnt + 1; 437 } else if (config.fix_cnt) { 438 node_blk->i.i_nid[idx] = 0; 439 need_fix = 1; 440 FIX_MSG("[0x%x] i_nid[%d] = 0", nid, idx); 441 } 442 } 443 } 444check: 445 if (ftype == F2FS_FT_DIR) 446 DBG(1, "Directory Inode: 0x%x [%s] depth: %d has %d files\n\n", 447 le32_to_cpu(node_blk->footer.ino), 448 node_blk->i.i_name, 449 le32_to_cpu(node_blk->i.i_current_depth), 450 child_files); 451 if (ftype == F2FS_FT_ORPHAN) 452 DBG(1, "Orphan Inode: 0x%x [%s] i_blocks: %u\n\n", 453 le32_to_cpu(node_blk->footer.ino), 454 node_blk->i.i_name, 455 (u32)i_blocks); 456 457 if (i_blocks != *blk_cnt) { 458 ASSERT_MSG("ino: 0x%x has i_blocks: %lu, but has %u blocks", 459 nid, i_blocks, *blk_cnt); 460 if (config.fix_cnt) { 461 node_blk->i.i_blocks = cpu_to_le64(*blk_cnt); 462 need_fix = 1; 463 FIX_MSG("[0x%x] i_blocks=0x%lx -> 0x%x", 464 nid, i_blocks, *blk_cnt); 465 } 466 } 467 if (ftype == F2FS_FT_DIR && i_links != child_cnt) { 468 ASSERT_MSG("ino: 0x%x has i_links: %u but real links: %u", 469 nid, i_links, child_cnt); 470 if (config.fix_cnt) { 471 node_blk->i.i_links = cpu_to_le32(child_cnt); 472 need_fix = 1; 473 FIX_MSG("Dir: 0x%x i_links= 0x%x -> 0x%x", 474 nid, i_links, child_cnt); 475 } 476 } 477 478 if (ftype == F2FS_FT_ORPHAN && i_links) 479 ASSERT_MSG("ino: 0x%x is orphan inode, but has i_links: %u", 480 nid, i_links); 481 if (need_fix) { 482 ret = dev_write_block(node_blk, ni->blk_addr); 483 ASSERT(ret >= 0); 484 } 485} 486 487int fsck_chk_dnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 488 u32 nid, enum FILE_TYPE ftype, struct f2fs_node *node_blk, 489 u32 *blk_cnt, struct node_info *ni) 490{ 491 int idx, ret; 492 u32 child_cnt = 0, child_files = 0; 493 494 for (idx = 0; idx < ADDRS_PER_BLOCK; idx++) { 495 if (le32_to_cpu(node_blk->dn.addr[idx]) == 0x0) 496 continue; 497 ret = fsck_chk_data_blk(sbi, 498 le32_to_cpu(node_blk->dn.addr[idx]), 499 &child_cnt, &child_files, 500 le64_to_cpu(inode->i_blocks) == *blk_cnt, ftype, 501 nid, idx, ni->version); 502 if (!ret) 503 *blk_cnt = *blk_cnt + 1; 504 } 505 return 0; 506} 507 508int fsck_chk_idnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 509 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 510{ 511 int ret; 512 int i = 0; 513 514 for (i = 0 ; i < NIDS_PER_BLOCK; i++) { 515 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 516 continue; 517 ret = fsck_chk_node_blk(sbi, inode, 518 le32_to_cpu(node_blk->in.nid[i]), 519 ftype, TYPE_DIRECT_NODE, blk_cnt); 520 if (!ret) 521 *blk_cnt = *blk_cnt + 1; 522 else if (ret == -EINVAL) 523 printf("delete in.nid[i] = 0;\n"); 524 } 525 return 0; 526} 527 528int fsck_chk_didnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 529 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 530{ 531 int i = 0; 532 int ret = 0; 533 534 for (i = 0; i < NIDS_PER_BLOCK; i++) { 535 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 536 continue; 537 ret = fsck_chk_node_blk(sbi, inode, 538 le32_to_cpu(node_blk->in.nid[i]), 539 ftype, TYPE_INDIRECT_NODE, blk_cnt); 540 if (!ret) 541 *blk_cnt = *blk_cnt + 1; 542 else if (ret == -EINVAL) 543 printf("delete in.nid[i] = 0;\n"); 544 } 545 return 0; 546} 547 548static void print_dentry(__u32 depth, __u8 *name, 549 struct f2fs_dentry_block *de_blk, int idx, int last_blk) 550{ 551 int last_de = 0; 552 int next_idx = 0; 553 int name_len; 554 unsigned int i; 555 int bit_offset; 556 557 if (config.dbg_lv != -1) 558 return; 559 560 name_len = le16_to_cpu(de_blk->dentry[idx].name_len); 561 next_idx = idx + (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 562 563 bit_offset = find_next_bit((unsigned long *)de_blk->dentry_bitmap, 564 NR_DENTRY_IN_BLOCK, next_idx); 565 if (bit_offset >= NR_DENTRY_IN_BLOCK && last_blk) 566 last_de = 1; 567 568 if (tree_mark_size <= depth) { 569 tree_mark_size *= 2; 570 tree_mark = realloc(tree_mark, tree_mark_size); 571 } 572 573 if (last_de) 574 tree_mark[depth] = '`'; 575 else 576 tree_mark[depth] = '|'; 577 578 if (tree_mark[depth - 1] == '`') 579 tree_mark[depth - 1] = ' '; 580 581 582 for (i = 1; i < depth; i++) 583 printf("%c ", tree_mark[i]); 584 printf("%c-- %s 0x%x\n", last_de ? '`' : '|', 585 name, le32_to_cpu(de_blk->dentry[idx].ino)); 586} 587 588int fsck_chk_dentry_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 589 u32 *child_cnt, u32 *child_files, int last_blk) 590{ 591 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 592 int i; 593 int ret = 0; 594 int dentries = 0; 595 u8 *name; 596 u32 hash_code; 597 u32 blk_cnt; 598 u16 name_len;; 599 600 enum FILE_TYPE ftype; 601 struct f2fs_dentry_block *de_blk; 602 603 de_blk = (struct f2fs_dentry_block *)calloc(BLOCK_SZ, 1); 604 ASSERT(de_blk != NULL); 605 606 ret = dev_read_block(de_blk, blk_addr); 607 ASSERT(ret >= 0); 608 609 fsck->dentry_depth++; 610 611 for (i = 0; i < NR_DENTRY_IN_BLOCK;) { 612 if (test_bit(i, (unsigned long *)de_blk->dentry_bitmap) == 0) { 613 i++; 614 continue; 615 } 616 617 name_len = le16_to_cpu(de_blk->dentry[i].name_len); 618 name = calloc(name_len + 1, 1); 619 memcpy(name, de_blk->filename[i], name_len); 620 hash_code = f2fs_dentry_hash((const unsigned char *)name, 621 name_len); 622 623 ASSERT(le32_to_cpu(de_blk->dentry[i].hash_code) == hash_code); 624 625 ftype = de_blk->dentry[i].file_type; 626 627 /* Becareful. 'dentry.file_type' is not imode. */ 628 if (ftype == F2FS_FT_DIR) { 629 *child_cnt = *child_cnt + 1; 630 if ((name[0] == '.' && name_len == 1) || 631 (name[0] == '.' && name[1] == '.' && 632 name_len == 2)) { 633 i++; 634 free(name); 635 continue; 636 } 637 } 638 639 DBG(1, "[%3u]-[0x%x] name[%s] len[0x%x] ino[0x%x] type[0x%x]\n", 640 fsck->dentry_depth, i, name, name_len, 641 le32_to_cpu(de_blk->dentry[i].ino), 642 de_blk->dentry[i].file_type); 643 644 print_dentry(fsck->dentry_depth, name, de_blk, i, last_blk); 645 646 blk_cnt = 1; 647 ret = fsck_chk_node_blk(sbi, 648 NULL, 649 le32_to_cpu(de_blk->dentry[i].ino), 650 ftype, 651 TYPE_INODE, 652 &blk_cnt); 653 654 if (ret && config.fix_cnt) { 655 int j; 656 int slots = (name_len + F2FS_SLOT_LEN - 1) / 657 F2FS_SLOT_LEN; 658 for (j = 0; j < slots; j++) 659 clear_bit(i + j, 660 (unsigned long *)de_blk->dentry_bitmap); 661 FIX_MSG("Unlink [0x%x] - %s len[0x%x], type[0x%x]", 662 le32_to_cpu(de_blk->dentry[i].ino), 663 name, name_len, 664 de_blk->dentry[i].file_type); 665 i += slots; 666 free(name); 667 continue; 668 } 669 670 i += (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 671 dentries++; 672 *child_files = *child_files + 1; 673 free(name); 674 } 675 676 DBG(1, "[%3d] Dentry Block [0x%x] Done : " 677 "dentries:%d in %d slots (len:%d)\n\n", 678 fsck->dentry_depth, blk_addr, dentries, 679 NR_DENTRY_IN_BLOCK, F2FS_NAME_LEN); 680 fsck->dentry_depth--; 681 682 free(de_blk); 683 return 0; 684} 685 686int fsck_chk_data_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 687 u32 *child_cnt, u32 *child_files, int last_blk, 688 enum FILE_TYPE ftype, u32 parent_nid, u16 idx_in_node, u8 ver) 689{ 690 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 691 692 /* Is it reserved block? */ 693 if (blk_addr == NEW_ADDR) { 694 fsck->chk.valid_blk_cnt++; 695 return 0; 696 } 697 698 if (!IS_VALID_BLK_ADDR(sbi, blk_addr)) { 699 ASSERT_MSG("blkaddres is not valid. [0x%x]", blk_addr); 700 return 0; 701 } 702 703 is_valid_ssa_data_blk(sbi, blk_addr, parent_nid, idx_in_node, ver); 704 705 if (f2fs_test_sit_bitmap(sbi, blk_addr) == 0) 706 ASSERT_MSG("SIT bitmap is 0x0. blk_addr[0x%x]", blk_addr); 707 708 if (f2fs_test_main_bitmap(sbi, blk_addr) != 0) 709 ASSERT_MSG("Duplicated data [0x%x]. pnid[0x%x] idx[0x%x]", 710 blk_addr, parent_nid, idx_in_node); 711 712 f2fs_set_main_bitmap(sbi, blk_addr); 713 714 fsck->chk.valid_blk_cnt++; 715 716 if (ftype == F2FS_FT_DIR) 717 return fsck_chk_dentry_blk(sbi, blk_addr, child_cnt, 718 child_files, last_blk); 719 return 0; 720} 721 722void fsck_chk_orphan_node(struct f2fs_sb_info *sbi) 723{ 724 u32 blk_cnt = 0; 725 block_t start_blk, orphan_blkaddr, i, j; 726 struct f2fs_orphan_block *orphan_blk; 727 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 728 729 if (!is_set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG)) 730 return; 731 732 if (config.fix_cnt) 733 return; 734 735 start_blk = __start_cp_addr(sbi) + 1 + 736 le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload); 737 orphan_blkaddr = __start_sum_addr(sbi) - 1; 738 orphan_blk = calloc(BLOCK_SZ, 1); 739 740 for (i = 0; i < orphan_blkaddr; i++) { 741 int ret = dev_read_block(orphan_blk, start_blk + i); 742 743 ASSERT(ret >= 0); 744 745 for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) { 746 nid_t ino = le32_to_cpu(orphan_blk->ino[j]); 747 DBG(1, "[%3d] ino [0x%x]\n", i, ino); 748 blk_cnt = 1; 749 fsck_chk_node_blk(sbi, NULL, ino, 750 F2FS_FT_ORPHAN, TYPE_INODE, &blk_cnt); 751 } 752 memset(orphan_blk, 0, BLOCK_SZ); 753 } 754 free(orphan_blk); 755} 756 757void fsck_init(struct f2fs_sb_info *sbi) 758{ 759 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 760 struct f2fs_sm_info *sm_i = SM_I(sbi); 761 762 /* 763 * We build three bitmap for main/sit/nat so that may check consistency 764 * of filesystem. 765 * 1. main_area_bitmap will be used to check whether all blocks of main 766 * area is used or not. 767 * 2. nat_area_bitmap has bitmap information of used nid in NAT. 768 * 3. sit_area_bitmap has bitmap information of used main block. 769 * At Last sequence, we compare main_area_bitmap with sit_area_bitmap. 770 */ 771 fsck->nr_main_blks = sm_i->main_segments << sbi->log_blocks_per_seg; 772 fsck->main_area_bitmap_sz = (fsck->nr_main_blks + 7) / 8; 773 fsck->main_area_bitmap = calloc(fsck->main_area_bitmap_sz, 1); 774 ASSERT(fsck->main_area_bitmap != NULL); 775 776 build_nat_area_bitmap(sbi); 777 778 build_sit_area_bitmap(sbi); 779 780 tree_mark = calloc(tree_mark_size, 1); 781 ASSERT(tree_mark != NULL); 782} 783 784int fsck_verify(struct f2fs_sb_info *sbi) 785{ 786 unsigned int i = 0; 787 int ret = 0; 788 u32 nr_unref_nid = 0; 789 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 790 struct hard_link_node *node = NULL; 791 792 printf("\n"); 793 794 for (i = 0; i < fsck->nr_nat_entries; i++) { 795 if (f2fs_test_bit(i, fsck->nat_area_bitmap) != 0) { 796 printf("NID[0x%x] is unreachable\n", i); 797 nr_unref_nid++; 798 } 799 } 800 801 if (fsck->hard_link_list_head != NULL) { 802 node = fsck->hard_link_list_head; 803 while (node) { 804 printf("NID[0x%x] has [0x%x] more unreachable links\n", 805 node->nid, node->links); 806 node = node->next; 807 } 808 config.bug_on = 1; 809 } 810 811 printf("[FSCK] Unreachable nat entries "); 812 if (nr_unref_nid == 0x0) { 813 printf(" [Ok..] [0x%x]\n", nr_unref_nid); 814 } else { 815 printf(" [Fail] [0x%x]\n", nr_unref_nid); 816 ret = EXIT_ERR_CODE; 817 config.bug_on = 1; 818 } 819 820 printf("[FSCK] SIT valid block bitmap checking "); 821 if (memcmp(fsck->sit_area_bitmap, fsck->main_area_bitmap, 822 fsck->sit_area_bitmap_sz) == 0x0) { 823 printf("[Ok..]\n"); 824 } else { 825 printf("[Fail]\n"); 826 ret = EXIT_ERR_CODE; 827 config.bug_on = 1; 828 } 829 830 printf("[FSCK] Hard link checking for regular file "); 831 if (fsck->hard_link_list_head == NULL) { 832 printf(" [Ok..] [0x%x]\n", fsck->chk.multi_hard_link_files); 833 } else { 834 printf(" [Fail] [0x%x]\n", fsck->chk.multi_hard_link_files); 835 ret = EXIT_ERR_CODE; 836 config.bug_on = 1; 837 } 838 839 printf("[FSCK] valid_block_count matching with CP "); 840 if (sbi->total_valid_block_count == fsck->chk.valid_blk_cnt) { 841 printf(" [Ok..] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 842 } else { 843 printf(" [Fail] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 844 ret = EXIT_ERR_CODE; 845 config.bug_on = 1; 846 } 847 848 printf("[FSCK] valid_node_count matcing with CP (de lookup) "); 849 if (sbi->total_valid_node_count == fsck->chk.valid_node_cnt) { 850 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_node_cnt); 851 } else { 852 printf(" [Fail] [0x%x]\n", fsck->chk.valid_node_cnt); 853 ret = EXIT_ERR_CODE; 854 config.bug_on = 1; 855 } 856 857 printf("[FSCK] valid_node_count matcing with CP (nat lookup) "); 858 if (sbi->total_valid_node_count == fsck->chk.valid_nat_entry_cnt) { 859 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 860 } else { 861 printf(" [Fail] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 862 ret = EXIT_ERR_CODE; 863 config.bug_on = 1; 864 } 865 866 printf("[FSCK] valid_inode_count matched with CP "); 867 if (sbi->total_valid_inode_count == fsck->chk.valid_inode_cnt) { 868 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_inode_cnt); 869 } else { 870 printf(" [Fail] [0x%x]\n", fsck->chk.valid_inode_cnt); 871 ret = EXIT_ERR_CODE; 872 config.bug_on = 1; 873 } 874 return ret; 875} 876 877void fsck_free(struct f2fs_sb_info *sbi) 878{ 879 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 880 if (fsck->main_area_bitmap) 881 free(fsck->main_area_bitmap); 882 883 if (fsck->nat_area_bitmap) 884 free(fsck->nat_area_bitmap); 885 886 if (fsck->sit_area_bitmap) 887 free(fsck->sit_area_bitmap); 888 889 if (tree_mark) 890 free(tree_mark); 891} 892