fsck.c revision fffeed796a79fa6621d01b0e4c5fa18d9d89cdd7
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 269int fsck_chk_node_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 270 u32 nid, enum FILE_TYPE ftype, enum NODE_TYPE ntype, 271 u32 *blk_cnt) 272{ 273 struct node_info ni; 274 struct f2fs_node *node_blk = NULL; 275 276 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 277 ASSERT(node_blk != NULL); 278 279 if (sanity_check_nid(sbi, nid, node_blk, ftype, ntype, &ni)) 280 goto err; 281 282 if (ntype == TYPE_INODE) { 283 fsck_chk_inode_blk(sbi, nid, ftype, node_blk, blk_cnt, &ni); 284 } else { 285 f2fs_set_main_bitmap(sbi, ni.blk_addr); 286 287 switch (ntype) { 288 case TYPE_DIRECT_NODE: 289 fsck_chk_dnode_blk(sbi, inode, nid, ftype, node_blk, 290 blk_cnt, &ni); 291 break; 292 case TYPE_INDIRECT_NODE: 293 fsck_chk_idnode_blk(sbi, inode, ftype, node_blk, 294 blk_cnt); 295 break; 296 case TYPE_DOUBLE_INDIRECT_NODE: 297 fsck_chk_didnode_blk(sbi, inode, ftype, node_blk, 298 blk_cnt); 299 break; 300 default: 301 ASSERT(0); 302 } 303 } 304 free(node_blk); 305 return 0; 306err: 307 free(node_blk); 308 return -EINVAL; 309} 310 311/* start with valid nid and blkaddr */ 312void fsck_chk_inode_blk(struct f2fs_sb_info *sbi, u32 nid, 313 enum FILE_TYPE ftype, struct f2fs_node *node_blk, 314 u32 *blk_cnt, struct node_info *ni) 315{ 316 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 317 u32 child_cnt = 0, child_files = 0; 318 enum NODE_TYPE ntype; 319 u32 i_links = le32_to_cpu(node_blk->i.i_links); 320 u64 i_blocks = le64_to_cpu(node_blk->i.i_blocks); 321 unsigned int idx = 0; 322 int ret; 323 324 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) 325 fsck->chk.valid_inode_cnt++; 326 327 if (ftype == F2FS_FT_DIR) { 328 f2fs_set_main_bitmap(sbi, ni->blk_addr); 329 } else { 330 if (f2fs_test_main_bitmap(sbi, ni->blk_addr) == 0) { 331 f2fs_set_main_bitmap(sbi, ni->blk_addr); 332 if (i_links > 1) { 333 /* First time. Create new hard link node */ 334 add_into_hard_link_list(sbi, nid, i_links); 335 fsck->chk.multi_hard_link_files++; 336 } 337 } else { 338 DBG(3, "[0x%x] has hard links [0x%x]\n", nid, i_links); 339 if (find_and_dec_hard_link_list(sbi, nid)) { 340 ASSERT_MSG("[0x%x] needs more i_links=0x%x", 341 nid, i_links); 342 if (config.fix_cnt) 343 printf("TODO: i_links++\n"); 344 } 345 /* No need to go deep into the node */ 346 return; 347 } 348 } 349 350 fsck_chk_xattr_blk(sbi, nid, 351 le32_to_cpu(node_blk->i.i_xattr_nid), blk_cnt); 352 353 if (ftype == F2FS_FT_CHRDEV || ftype == F2FS_FT_BLKDEV || 354 ftype == F2FS_FT_FIFO || ftype == F2FS_FT_SOCK) 355 goto check; 356 if((node_blk->i.i_inline & F2FS_INLINE_DATA)){ 357 DBG(3, "ino[0x%x] has inline data!\n", nid); 358 goto check; 359 } 360 361 /* check data blocks in inode */ 362 for (idx = 0; idx < ADDRS_PER_INODE(&node_blk->i); idx++) { 363 if (le32_to_cpu(node_blk->i.i_addr[idx]) != 0) { 364 ret = fsck_chk_data_blk(sbi, 365 le32_to_cpu(node_blk->i.i_addr[idx]), 366 &child_cnt, &child_files, 367 (i_blocks == *blk_cnt), 368 ftype, nid, idx, ni->version); 369 if (!ret) 370 *blk_cnt = *blk_cnt + 1; 371 } 372 } 373 374 /* check node blocks in inode */ 375 for (idx = 0; idx < 5; idx++) { 376 if (idx == 0 || idx == 1) 377 ntype = TYPE_DIRECT_NODE; 378 else if (idx == 2 || idx == 3) 379 ntype = TYPE_INDIRECT_NODE; 380 else if (idx == 4) 381 ntype = TYPE_DOUBLE_INDIRECT_NODE; 382 else 383 ASSERT(0); 384 385 if (le32_to_cpu(node_blk->i.i_nid[idx]) != 0) { 386 ret = fsck_chk_node_blk(sbi, &node_blk->i, 387 le32_to_cpu(node_blk->i.i_nid[idx]), 388 ftype, ntype, blk_cnt); 389 if (!ret) 390 *blk_cnt = *blk_cnt + 1; 391 else if (config.fix_cnt) 392 printf("TODO delete i_nid[idx] = 0;\n"); 393 } 394 } 395check: 396 if (ftype == F2FS_FT_DIR) 397 DBG(1, "Directory Inode: 0x%x [%s] depth: %d has %d files\n\n", 398 le32_to_cpu(node_blk->footer.ino), 399 node_blk->i.i_name, 400 le32_to_cpu(node_blk->i.i_current_depth), 401 child_files); 402 if (ftype == F2FS_FT_ORPHAN) 403 DBG(1, "Orphan Inode: 0x%x [%s] i_blocks: %u\n\n", 404 le32_to_cpu(node_blk->footer.ino), 405 node_blk->i.i_name, 406 (u32)i_blocks); 407 if ((ftype == F2FS_FT_DIR && i_links != child_cnt) || 408 (i_blocks != *blk_cnt)) { 409 if (!config.fix_cnt) 410 print_node_info(node_blk); 411 412 /* node_blk, ni.blkaddr, child_cnt, *blk_cnt */ 413 if (config.fix_cnt) 414 printf("TODO fix_inode_block\n"); 415 else 416 print_node_info(node_blk); 417 DBG(1, "blk cnt [0x%x]\n", *blk_cnt); 418 DBG(1, "child cnt [0x%x]\n", child_cnt); 419 } 420 if (i_blocks != *blk_cnt) 421 ASSERT_MSG("ino: 0x%x has i_blocks: %lu, but has %u blocks", 422 nid, i_blocks, *blk_cnt); 423 if (ftype == F2FS_FT_DIR && i_links != child_cnt) 424 ASSERT_MSG("ino: 0x%x has i_links: %u but real links: %u", 425 nid, i_links, child_cnt); 426 if (ftype == F2FS_FT_ORPHAN && i_links) 427 ASSERT_MSG("ino: 0x%x is orphan inode, but has i_links: %u", 428 nid, i_links); 429} 430 431int fsck_chk_dnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 432 u32 nid, enum FILE_TYPE ftype, struct f2fs_node *node_blk, 433 u32 *blk_cnt, struct node_info *ni) 434{ 435 int idx, ret; 436 u32 child_cnt = 0, child_files = 0; 437 438 for (idx = 0; idx < ADDRS_PER_BLOCK; idx++) { 439 if (le32_to_cpu(node_blk->dn.addr[idx]) == 0x0) 440 continue; 441 ret = fsck_chk_data_blk(sbi, 442 le32_to_cpu(node_blk->dn.addr[idx]), 443 &child_cnt, &child_files, 444 le64_to_cpu(inode->i_blocks) == *blk_cnt, ftype, 445 nid, idx, ni->version); 446 if (!ret) 447 *blk_cnt = *blk_cnt + 1; 448 } 449 return 0; 450} 451 452int fsck_chk_idnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 453 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 454{ 455 int ret; 456 int i = 0; 457 458 for (i = 0 ; i < NIDS_PER_BLOCK; i++) { 459 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 460 continue; 461 ret = fsck_chk_node_blk(sbi, inode, 462 le32_to_cpu(node_blk->in.nid[i]), 463 ftype, TYPE_DIRECT_NODE, blk_cnt); 464 if (!ret) 465 *blk_cnt = *blk_cnt + 1; 466 else if (ret == -EINVAL) 467 printf("delete in.nid[i] = 0;\n"); 468 } 469 return 0; 470} 471 472int fsck_chk_didnode_blk(struct f2fs_sb_info *sbi, struct f2fs_inode *inode, 473 enum FILE_TYPE ftype, struct f2fs_node *node_blk, u32 *blk_cnt) 474{ 475 int i = 0; 476 int ret = 0; 477 478 for (i = 0; i < NIDS_PER_BLOCK; i++) { 479 if (le32_to_cpu(node_blk->in.nid[i]) == 0x0) 480 continue; 481 ret = fsck_chk_node_blk(sbi, inode, 482 le32_to_cpu(node_blk->in.nid[i]), 483 ftype, TYPE_INDIRECT_NODE, blk_cnt); 484 if (!ret) 485 *blk_cnt = *blk_cnt + 1; 486 else if (ret == -EINVAL) 487 printf("delete in.nid[i] = 0;\n"); 488 } 489 return 0; 490} 491 492static void print_dentry(__u32 depth, __u8 *name, 493 struct f2fs_dentry_block *de_blk, int idx, int last_blk) 494{ 495 int last_de = 0; 496 int next_idx = 0; 497 int name_len; 498 unsigned int i; 499 int bit_offset; 500 501 if (config.dbg_lv != -1) 502 return; 503 504 name_len = le16_to_cpu(de_blk->dentry[idx].name_len); 505 next_idx = idx + (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 506 507 bit_offset = find_next_bit((unsigned long *)de_blk->dentry_bitmap, 508 NR_DENTRY_IN_BLOCK, next_idx); 509 if (bit_offset >= NR_DENTRY_IN_BLOCK && last_blk) 510 last_de = 1; 511 512 if (tree_mark_size <= depth) { 513 tree_mark_size *= 2; 514 tree_mark = realloc(tree_mark, tree_mark_size); 515 } 516 517 if (last_de) 518 tree_mark[depth] = '`'; 519 else 520 tree_mark[depth] = '|'; 521 522 if (tree_mark[depth - 1] == '`') 523 tree_mark[depth - 1] = ' '; 524 525 526 for (i = 1; i < depth; i++) 527 printf("%c ", tree_mark[i]); 528 printf("%c-- %s 0x%x\n", last_de ? '`' : '|', 529 name, le32_to_cpu(de_blk->dentry[idx].ino)); 530} 531 532int fsck_chk_dentry_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 533 u32 *child_cnt, u32 *child_files, int last_blk) 534{ 535 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 536 int i; 537 int ret = 0; 538 int dentries = 0; 539 u8 *name; 540 u32 hash_code; 541 u32 blk_cnt; 542 u16 name_len;; 543 544 enum FILE_TYPE ftype; 545 struct f2fs_dentry_block *de_blk; 546 547 de_blk = (struct f2fs_dentry_block *)calloc(BLOCK_SZ, 1); 548 ASSERT(de_blk != NULL); 549 550 ret = dev_read_block(de_blk, blk_addr); 551 ASSERT(ret >= 0); 552 553 fsck->dentry_depth++; 554 555 for (i = 0; i < NR_DENTRY_IN_BLOCK;) { 556 if (test_bit(i, (unsigned long *)de_blk->dentry_bitmap) == 0) { 557 i++; 558 continue; 559 } 560 561 name_len = le16_to_cpu(de_blk->dentry[i].name_len); 562 name = calloc(name_len + 1, 1); 563 memcpy(name, de_blk->filename[i], name_len); 564 hash_code = f2fs_dentry_hash((const unsigned char *)name, 565 name_len); 566 567 ASSERT(le32_to_cpu(de_blk->dentry[i].hash_code) == hash_code); 568 569 ftype = de_blk->dentry[i].file_type; 570 571 /* Becareful. 'dentry.file_type' is not imode. */ 572 if (ftype == F2FS_FT_DIR) { 573 *child_cnt = *child_cnt + 1; 574 if ((name[0] == '.' && name_len == 1) || 575 (name[0] == '.' && name[1] == '.' && 576 name_len == 2)) { 577 i++; 578 free(name); 579 continue; 580 } 581 } 582 583 DBG(1, "[%3u]-[0x%x] name[%s] len[0x%x] ino[0x%x] type[0x%x]\n", 584 fsck->dentry_depth, i, name, name_len, 585 le32_to_cpu(de_blk->dentry[i].ino), 586 de_blk->dentry[i].file_type); 587 588 print_dentry(fsck->dentry_depth, name, de_blk, i, last_blk); 589 590 blk_cnt = 1; 591 ret = fsck_chk_node_blk(sbi, 592 NULL, 593 le32_to_cpu(de_blk->dentry[i].ino), 594 ftype, 595 TYPE_INODE, 596 &blk_cnt); 597 598 if (ret) 599 printf("TODO: delete dentry\n"); 600 601 i += (name_len + F2FS_SLOT_LEN - 1) / F2FS_SLOT_LEN; 602 dentries++; 603 *child_files = *child_files + 1; 604 free(name); 605 } 606 607 DBG(1, "[%3d] Dentry Block [0x%x] Done : " 608 "dentries:%d in %d slots (len:%d)\n\n", 609 fsck->dentry_depth, blk_addr, dentries, 610 NR_DENTRY_IN_BLOCK, F2FS_NAME_LEN); 611 fsck->dentry_depth--; 612 613 free(de_blk); 614 return 0; 615} 616 617int fsck_chk_data_blk(struct f2fs_sb_info *sbi, u32 blk_addr, 618 u32 *child_cnt, u32 *child_files, int last_blk, 619 enum FILE_TYPE ftype, u32 parent_nid, u16 idx_in_node, u8 ver) 620{ 621 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 622 623 /* Is it reserved block? */ 624 if (blk_addr == NEW_ADDR) { 625 fsck->chk.valid_blk_cnt++; 626 return 0; 627 } 628 629 if (!IS_VALID_BLK_ADDR(sbi, blk_addr)) { 630 ASSERT_MSG("blkaddres is not valid. [0x%x]", blk_addr); 631 return 0; 632 } 633 634 is_valid_ssa_data_blk(sbi, blk_addr, parent_nid, idx_in_node, ver); 635 636 if (f2fs_test_sit_bitmap(sbi, blk_addr) == 0) 637 ASSERT_MSG("SIT bitmap is 0x0. blk_addr[0x%x]", blk_addr); 638 639 if (f2fs_test_main_bitmap(sbi, blk_addr) != 0) 640 ASSERT_MSG("Duplicated data [0x%x]. pnid[0x%x] idx[0x%x]", 641 blk_addr, parent_nid, idx_in_node); 642 643 f2fs_set_main_bitmap(sbi, blk_addr); 644 645 fsck->chk.valid_blk_cnt++; 646 647 if (ftype == F2FS_FT_DIR) 648 return fsck_chk_dentry_blk(sbi, blk_addr, child_cnt, 649 child_files, last_blk); 650 return 0; 651} 652 653void fsck_chk_orphan_node(struct f2fs_sb_info *sbi) 654{ 655 u32 blk_cnt = 0; 656 block_t start_blk, orphan_blkaddr, i, j; 657 struct f2fs_orphan_block *orphan_blk; 658 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 659 660 if (!is_set_ckpt_flags(ckpt, CP_ORPHAN_PRESENT_FLAG)) 661 return; 662 663 if (config.fix_cnt) 664 return; 665 666 start_blk = __start_cp_addr(sbi) + 1 + 667 le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload); 668 orphan_blkaddr = __start_sum_addr(sbi) - 1; 669 orphan_blk = calloc(BLOCK_SZ, 1); 670 671 for (i = 0; i < orphan_blkaddr; i++) { 672 int ret = dev_read_block(orphan_blk, start_blk + i); 673 674 ASSERT(ret >= 0); 675 676 for (j = 0; j < le32_to_cpu(orphan_blk->entry_count); j++) { 677 nid_t ino = le32_to_cpu(orphan_blk->ino[j]); 678 DBG(1, "[%3d] ino [0x%x]\n", i, ino); 679 blk_cnt = 1; 680 ret = fsck_chk_node_blk(sbi, NULL, ino, 681 F2FS_FT_ORPHAN, TYPE_INODE, &blk_cnt); 682 if (ret == -EINVAL) 683 printf("TODO: nothing?\n"); 684 } 685 memset(orphan_blk, 0, BLOCK_SZ); 686 } 687 free(orphan_blk); 688} 689 690void fsck_chk_xattr_blk(struct f2fs_sb_info *sbi, u32 ino, 691 u32 x_nid, u32 *blk_cnt) 692{ 693 struct f2fs_node *node_blk = NULL; 694 struct node_info ni; 695 696 if (x_nid == 0x0) 697 return; 698 699 node_blk = (struct f2fs_node *)calloc(BLOCK_SZ, 1); 700 ASSERT(node_blk != NULL); 701 702 /* Sanity check */ 703 if (sanity_check_nid(sbi, x_nid, node_blk, 704 F2FS_FT_XATTR, TYPE_XATTR, &ni)) { 705 /* TODO: drop xattr node */ 706 printf("drop xattr node\n"); 707 goto out; 708 } 709 710 *blk_cnt = *blk_cnt + 1; 711 f2fs_set_main_bitmap(sbi, ni.blk_addr); 712 DBG(2, "ino[0x%x] x_nid[0x%x]\n", ino, x_nid); 713out: 714 free(node_blk); 715} 716 717void fsck_init(struct f2fs_sb_info *sbi) 718{ 719 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 720 struct f2fs_sm_info *sm_i = SM_I(sbi); 721 722 /* 723 * We build three bitmap for main/sit/nat so that may check consistency 724 * of filesystem. 725 * 1. main_area_bitmap will be used to check whether all blocks of main 726 * area is used or not. 727 * 2. nat_area_bitmap has bitmap information of used nid in NAT. 728 * 3. sit_area_bitmap has bitmap information of used main block. 729 * At Last sequence, we compare main_area_bitmap with sit_area_bitmap. 730 */ 731 fsck->nr_main_blks = sm_i->main_segments << sbi->log_blocks_per_seg; 732 fsck->main_area_bitmap_sz = (fsck->nr_main_blks + 7) / 8; 733 fsck->main_area_bitmap = calloc(fsck->main_area_bitmap_sz, 1); 734 ASSERT(fsck->main_area_bitmap != NULL); 735 736 build_nat_area_bitmap(sbi); 737 738 build_sit_area_bitmap(sbi); 739 740 tree_mark = calloc(tree_mark_size, 1); 741 ASSERT(tree_mark != NULL); 742} 743 744int fsck_verify(struct f2fs_sb_info *sbi) 745{ 746 unsigned int i = 0; 747 int ret = 0; 748 u32 nr_unref_nid = 0; 749 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 750 struct hard_link_node *node = NULL; 751 752 printf("\n"); 753 754 for (i = 0; i < fsck->nr_nat_entries; i++) { 755 if (f2fs_test_bit(i, fsck->nat_area_bitmap) != 0) { 756 printf("NID[0x%x] is unreachable\n", i); 757 nr_unref_nid++; 758 } 759 } 760 761 if (fsck->hard_link_list_head != NULL) { 762 node = fsck->hard_link_list_head; 763 while (node) { 764 printf("NID[0x%x] has [0x%x] more unreachable links\n", 765 node->nid, node->links); 766 node = node->next; 767 } 768 config.bug_on = 1; 769 } 770 771 printf("[FSCK] Unreachable nat entries "); 772 if (nr_unref_nid == 0x0) { 773 printf(" [Ok..] [0x%x]\n", nr_unref_nid); 774 } else { 775 printf(" [Fail] [0x%x]\n", nr_unref_nid); 776 ret = EXIT_ERR_CODE; 777 config.bug_on = 1; 778 } 779 780 printf("[FSCK] SIT valid block bitmap checking "); 781 if (memcmp(fsck->sit_area_bitmap, fsck->main_area_bitmap, 782 fsck->sit_area_bitmap_sz) == 0x0) { 783 printf("[Ok..]\n"); 784 } else { 785 printf("[Fail]\n"); 786 ret = EXIT_ERR_CODE; 787 config.bug_on = 1; 788 } 789 790 printf("[FSCK] Hard link checking for regular file "); 791 if (fsck->hard_link_list_head == NULL) { 792 printf(" [Ok..] [0x%x]\n", fsck->chk.multi_hard_link_files); 793 } else { 794 printf(" [Fail] [0x%x]\n", fsck->chk.multi_hard_link_files); 795 ret = EXIT_ERR_CODE; 796 config.bug_on = 1; 797 } 798 799 printf("[FSCK] valid_block_count matching with CP "); 800 if (sbi->total_valid_block_count == fsck->chk.valid_blk_cnt) { 801 printf(" [Ok..] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 802 } else { 803 printf(" [Fail] [0x%x]\n", (u32)fsck->chk.valid_blk_cnt); 804 ret = EXIT_ERR_CODE; 805 config.bug_on = 1; 806 } 807 808 printf("[FSCK] valid_node_count matcing with CP (de lookup) "); 809 if (sbi->total_valid_node_count == fsck->chk.valid_node_cnt) { 810 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_node_cnt); 811 } else { 812 printf(" [Fail] [0x%x]\n", fsck->chk.valid_node_cnt); 813 ret = EXIT_ERR_CODE; 814 config.bug_on = 1; 815 } 816 817 printf("[FSCK] valid_node_count matcing with CP (nat lookup) "); 818 if (sbi->total_valid_node_count == fsck->chk.valid_nat_entry_cnt) { 819 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 820 } else { 821 printf(" [Fail] [0x%x]\n", fsck->chk.valid_nat_entry_cnt); 822 ret = EXIT_ERR_CODE; 823 config.bug_on = 1; 824 } 825 826 printf("[FSCK] valid_inode_count matched with CP "); 827 if (sbi->total_valid_inode_count == fsck->chk.valid_inode_cnt) { 828 printf(" [Ok..] [0x%x]\n", fsck->chk.valid_inode_cnt); 829 } else { 830 printf(" [Fail] [0x%x]\n", fsck->chk.valid_inode_cnt); 831 ret = EXIT_ERR_CODE; 832 config.bug_on = 1; 833 } 834 return ret; 835} 836 837void fsck_free(struct f2fs_sb_info *sbi) 838{ 839 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 840 if (fsck->main_area_bitmap) 841 free(fsck->main_area_bitmap); 842 843 if (fsck->nat_area_bitmap) 844 free(fsck->nat_area_bitmap); 845 846 if (fsck->sit_area_bitmap) 847 free(fsck->sit_area_bitmap); 848 849 if (tree_mark) 850 free(tree_mark); 851} 852