mount.c revision 10d97dd1b386abcceec1b1bf590a3711d93e8c1c
1/** 2 * mount.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 13void print_inode_info(struct f2fs_inode *inode) 14{ 15 unsigned int i = 0; 16 int namelen = le32_to_cpu(inode->i_namelen); 17 18 DISP_u32(inode, i_mode); 19 DISP_u32(inode, i_uid); 20 DISP_u32(inode, i_gid); 21 DISP_u32(inode, i_links); 22 DISP_u64(inode, i_size); 23 DISP_u64(inode, i_blocks); 24 25 DISP_u64(inode, i_atime); 26 DISP_u32(inode, i_atime_nsec); 27 DISP_u64(inode, i_ctime); 28 DISP_u32(inode, i_ctime_nsec); 29 DISP_u64(inode, i_mtime); 30 DISP_u32(inode, i_mtime_nsec); 31 32 DISP_u32(inode, i_generation); 33 DISP_u32(inode, i_current_depth); 34 DISP_u32(inode, i_xattr_nid); 35 DISP_u32(inode, i_flags); 36 DISP_u32(inode, i_pino); 37 38 if (namelen) { 39 DISP_u32(inode, i_namelen); 40 inode->i_name[namelen] = '\0'; 41 DISP_utf(inode, i_name); 42 } 43 44 printf("i_ext: fofs:%x blkaddr:%x len:%x\n", 45 inode->i_ext.fofs, 46 inode->i_ext.blk_addr, 47 inode->i_ext.len); 48 49 DISP_u32(inode, i_addr[0]); /* Pointers to data blocks */ 50 DISP_u32(inode, i_addr[1]); /* Pointers to data blocks */ 51 DISP_u32(inode, i_addr[2]); /* Pointers to data blocks */ 52 DISP_u32(inode, i_addr[3]); /* Pointers to data blocks */ 53 54 for (i = 4; i < ADDRS_PER_INODE(inode); i++) { 55 if (inode->i_addr[i] != 0x0) { 56 printf("i_addr[0x%x] points data block\r\t\t[0x%4x]\n", 57 i, inode->i_addr[i]); 58 break; 59 } 60 } 61 62 DISP_u32(inode, i_nid[0]); /* direct */ 63 DISP_u32(inode, i_nid[1]); /* direct */ 64 DISP_u32(inode, i_nid[2]); /* indirect */ 65 DISP_u32(inode, i_nid[3]); /* indirect */ 66 DISP_u32(inode, i_nid[4]); /* double indirect */ 67 68 printf("\n"); 69} 70 71void print_node_info(struct f2fs_node *node_block) 72{ 73 nid_t ino = le32_to_cpu(node_block->footer.ino); 74 nid_t nid = le32_to_cpu(node_block->footer.nid); 75 /* Is this inode? */ 76 if (ino == nid) { 77 DBG(0, "Node ID [0x%x:%u] is inode\n", nid, nid); 78 print_inode_info(&node_block->i); 79 } else { 80 int i; 81 u32 *dump_blk = (u32 *)node_block; 82 DBG(0, "Node ID [0x%x:%u] is direct node or indirect node.\n", 83 nid, nid); 84 for (i = 0; i <= 10; i++) 85 MSG(0, "[%d]\t\t\t[0x%8x : %d]\n", 86 i, dump_blk[i], dump_blk[i]); 87 } 88} 89 90void print_raw_sb_info(struct f2fs_sb_info *sbi) 91{ 92 struct f2fs_super_block *sb = F2FS_RAW_SUPER(sbi); 93 94 if (!config.dbg_lv) 95 return; 96 97 printf("\n"); 98 printf("+--------------------------------------------------------+\n"); 99 printf("| Super block |\n"); 100 printf("+--------------------------------------------------------+\n"); 101 102 DISP_u32(sb, magic); 103 DISP_u32(sb, major_ver); 104 DISP_u32(sb, minor_ver); 105 DISP_u32(sb, log_sectorsize); 106 DISP_u32(sb, log_sectors_per_block); 107 108 DISP_u32(sb, log_blocksize); 109 DISP_u32(sb, log_blocks_per_seg); 110 DISP_u32(sb, segs_per_sec); 111 DISP_u32(sb, secs_per_zone); 112 DISP_u32(sb, checksum_offset); 113 DISP_u64(sb, block_count); 114 115 DISP_u32(sb, section_count); 116 DISP_u32(sb, segment_count); 117 DISP_u32(sb, segment_count_ckpt); 118 DISP_u32(sb, segment_count_sit); 119 DISP_u32(sb, segment_count_nat); 120 121 DISP_u32(sb, segment_count_ssa); 122 DISP_u32(sb, segment_count_main); 123 DISP_u32(sb, segment0_blkaddr); 124 125 DISP_u32(sb, cp_blkaddr); 126 DISP_u32(sb, sit_blkaddr); 127 DISP_u32(sb, nat_blkaddr); 128 DISP_u32(sb, ssa_blkaddr); 129 DISP_u32(sb, main_blkaddr); 130 131 DISP_u32(sb, root_ino); 132 DISP_u32(sb, node_ino); 133 DISP_u32(sb, meta_ino); 134 DISP_u32(sb, cp_payload); 135 printf("\n"); 136} 137 138void print_ckpt_info(struct f2fs_sb_info *sbi) 139{ 140 struct f2fs_checkpoint *cp = F2FS_CKPT(sbi); 141 142 if (!config.dbg_lv) 143 return; 144 145 printf("\n"); 146 printf("+--------------------------------------------------------+\n"); 147 printf("| Checkpoint |\n"); 148 printf("+--------------------------------------------------------+\n"); 149 150 DISP_u64(cp, checkpoint_ver); 151 DISP_u64(cp, user_block_count); 152 DISP_u64(cp, valid_block_count); 153 DISP_u32(cp, rsvd_segment_count); 154 DISP_u32(cp, overprov_segment_count); 155 DISP_u32(cp, free_segment_count); 156 157 DISP_u32(cp, alloc_type[CURSEG_HOT_NODE]); 158 DISP_u32(cp, alloc_type[CURSEG_WARM_NODE]); 159 DISP_u32(cp, alloc_type[CURSEG_COLD_NODE]); 160 DISP_u32(cp, cur_node_segno[0]); 161 DISP_u32(cp, cur_node_segno[1]); 162 DISP_u32(cp, cur_node_segno[2]); 163 164 DISP_u32(cp, cur_node_blkoff[0]); 165 DISP_u32(cp, cur_node_blkoff[1]); 166 DISP_u32(cp, cur_node_blkoff[2]); 167 168 169 DISP_u32(cp, alloc_type[CURSEG_HOT_DATA]); 170 DISP_u32(cp, alloc_type[CURSEG_WARM_DATA]); 171 DISP_u32(cp, alloc_type[CURSEG_COLD_DATA]); 172 DISP_u32(cp, cur_data_segno[0]); 173 DISP_u32(cp, cur_data_segno[1]); 174 DISP_u32(cp, cur_data_segno[2]); 175 176 DISP_u32(cp, cur_data_blkoff[0]); 177 DISP_u32(cp, cur_data_blkoff[1]); 178 DISP_u32(cp, cur_data_blkoff[2]); 179 180 DISP_u32(cp, ckpt_flags); 181 DISP_u32(cp, cp_pack_total_block_count); 182 DISP_u32(cp, cp_pack_start_sum); 183 DISP_u32(cp, valid_node_count); 184 DISP_u32(cp, valid_inode_count); 185 DISP_u32(cp, next_free_nid); 186 DISP_u32(cp, sit_ver_bitmap_bytesize); 187 DISP_u32(cp, nat_ver_bitmap_bytesize); 188 DISP_u32(cp, checksum_offset); 189 DISP_u64(cp, elapsed_time); 190 191 DISP_u32(cp, sit_nat_version_bitmap[0]); 192 printf("\n\n"); 193} 194 195int sanity_check_raw_super(struct f2fs_super_block *raw_super) 196{ 197 unsigned int blocksize; 198 199 if (F2FS_SUPER_MAGIC != le32_to_cpu(raw_super->magic)) { 200 return -1; 201 } 202 203 if (F2FS_BLKSIZE != PAGE_CACHE_SIZE) { 204 return -1; 205 } 206 207 blocksize = 1 << le32_to_cpu(raw_super->log_blocksize); 208 if (F2FS_BLKSIZE != blocksize) { 209 return -1; 210 } 211 212 if (F2FS_LOG_SECTOR_SIZE != le32_to_cpu(raw_super->log_sectorsize)) { 213 return -1; 214 } 215 216 if (F2FS_LOG_SECTORS_PER_BLOCK != 217 le32_to_cpu(raw_super->log_sectors_per_block)) { 218 return -1; 219 } 220 221 return 0; 222} 223 224int validate_super_block(struct f2fs_sb_info *sbi, int block) 225{ 226 u64 offset = (block + 1) * F2FS_SUPER_OFFSET; 227 sbi->raw_super = malloc(sizeof(struct f2fs_super_block)); 228 229 if (dev_read(sbi->raw_super, offset, sizeof(struct f2fs_super_block))) 230 return -1; 231 232 if (!sanity_check_raw_super(sbi->raw_super)) 233 return 0; 234 235 free(sbi->raw_super); 236 MSG(0, "\tCan't find a valid F2FS superblock at 0x%x\n", block); 237 238 return -EINVAL; 239} 240 241int init_sb_info(struct f2fs_sb_info *sbi) 242{ 243 struct f2fs_super_block *raw_super = sbi->raw_super; 244 245 sbi->log_sectors_per_block = 246 le32_to_cpu(raw_super->log_sectors_per_block); 247 sbi->log_blocksize = le32_to_cpu(raw_super->log_blocksize); 248 sbi->blocksize = 1 << sbi->log_blocksize; 249 sbi->log_blocks_per_seg = le32_to_cpu(raw_super->log_blocks_per_seg); 250 sbi->blocks_per_seg = 1 << sbi->log_blocks_per_seg; 251 sbi->segs_per_sec = le32_to_cpu(raw_super->segs_per_sec); 252 sbi->secs_per_zone = le32_to_cpu(raw_super->secs_per_zone); 253 sbi->total_sections = le32_to_cpu(raw_super->section_count); 254 sbi->total_node_count = 255 (le32_to_cpu(raw_super->segment_count_nat) / 2) 256 * sbi->blocks_per_seg * NAT_ENTRY_PER_BLOCK; 257 sbi->root_ino_num = le32_to_cpu(raw_super->root_ino); 258 sbi->node_ino_num = le32_to_cpu(raw_super->node_ino); 259 sbi->meta_ino_num = le32_to_cpu(raw_super->meta_ino); 260 sbi->cur_victim_sec = NULL_SEGNO; 261 return 0; 262} 263 264void *validate_checkpoint(struct f2fs_sb_info *sbi, block_t cp_addr, 265 unsigned long long *version) 266{ 267 void *cp_page_1, *cp_page_2; 268 struct f2fs_checkpoint *cp_block; 269 unsigned long blk_size = sbi->blocksize; 270 unsigned long long cur_version = 0, pre_version = 0; 271 unsigned int crc = 0; 272 size_t crc_offset; 273 274 /* Read the 1st cp block in this CP pack */ 275 cp_page_1 = malloc(PAGE_SIZE); 276 if (dev_read_block(cp_page_1, cp_addr) < 0) 277 return NULL; 278 279 cp_block = (struct f2fs_checkpoint *)cp_page_1; 280 crc_offset = le32_to_cpu(cp_block->checksum_offset); 281 if (crc_offset >= blk_size) 282 goto invalid_cp1; 283 284 crc = *(unsigned int *)((unsigned char *)cp_block + crc_offset); 285 if (f2fs_crc_valid(crc, cp_block, crc_offset)) 286 goto invalid_cp1; 287 288 pre_version = le64_to_cpu(cp_block->checkpoint_ver); 289 290 /* Read the 2nd cp block in this CP pack */ 291 cp_page_2 = malloc(PAGE_SIZE); 292 cp_addr += le32_to_cpu(cp_block->cp_pack_total_block_count) - 1; 293 294 if (dev_read_block(cp_page_2, cp_addr) < 0) 295 goto invalid_cp2; 296 297 cp_block = (struct f2fs_checkpoint *)cp_page_2; 298 crc_offset = le32_to_cpu(cp_block->checksum_offset); 299 if (crc_offset >= blk_size) 300 goto invalid_cp2; 301 302 crc = *(unsigned int *)((unsigned char *)cp_block + crc_offset); 303 if (f2fs_crc_valid(crc, cp_block, crc_offset)) 304 goto invalid_cp2; 305 306 cur_version = le64_to_cpu(cp_block->checkpoint_ver); 307 308 if (cur_version == pre_version) { 309 *version = cur_version; 310 free(cp_page_2); 311 return cp_page_1; 312 } 313 314invalid_cp2: 315 free(cp_page_2); 316invalid_cp1: 317 free(cp_page_1); 318 return NULL; 319} 320 321int get_valid_checkpoint(struct f2fs_sb_info *sbi) 322{ 323 struct f2fs_super_block *raw_sb = sbi->raw_super; 324 void *cp1, *cp2, *cur_page; 325 unsigned long blk_size = sbi->blocksize; 326 unsigned long long cp1_version = 0, cp2_version = 0; 327 unsigned long long cp_start_blk_no; 328 unsigned int cp_blks = 1 + le32_to_cpu(F2FS_RAW_SUPER(sbi)->cp_payload); 329 int ret; 330 331 sbi->ckpt = malloc(cp_blks * blk_size); 332 if (!sbi->ckpt) 333 return -ENOMEM; 334 /* 335 * Finding out valid cp block involves read both 336 * sets( cp pack1 and cp pack 2) 337 */ 338 cp_start_blk_no = le32_to_cpu(raw_sb->cp_blkaddr); 339 cp1 = validate_checkpoint(sbi, cp_start_blk_no, &cp1_version); 340 341 /* The second checkpoint pack should start at the next segment */ 342 cp_start_blk_no += 1 << le32_to_cpu(raw_sb->log_blocks_per_seg); 343 cp2 = validate_checkpoint(sbi, cp_start_blk_no, &cp2_version); 344 345 if (cp1 && cp2) { 346 if (ver_after(cp2_version, cp1_version)) { 347 cur_page = cp2; 348 sbi->cur_cp = 2; 349 } else { 350 cur_page = cp1; 351 sbi->cur_cp = 1; 352 } 353 } else if (cp1) { 354 cur_page = cp1; 355 sbi->cur_cp = 1; 356 } else if (cp2) { 357 cur_page = cp2; 358 sbi->cur_cp = 2; 359 } else { 360 free(cp1); 361 free(cp2); 362 goto fail_no_cp; 363 } 364 365 memcpy(sbi->ckpt, cur_page, blk_size); 366 367 if (cp_blks > 1) { 368 unsigned int i; 369 unsigned long long cp_blk_no; 370 371 cp_blk_no = le32_to_cpu(raw_sb->cp_blkaddr); 372 if (cur_page == cp2) 373 cp_blk_no += 1 << 374 le32_to_cpu(raw_sb->log_blocks_per_seg); 375 /* copy sit bitmap */ 376 for (i = 1; i < cp_blks; i++) { 377 unsigned char *ckpt = (unsigned char *)sbi->ckpt; 378 ret = dev_read_block(cur_page, cp_blk_no + i); 379 ASSERT(ret >= 0); 380 memcpy(ckpt + i * blk_size, cur_page, blk_size); 381 } 382 } 383 free(cp1); 384 free(cp2); 385 return 0; 386 387fail_no_cp: 388 free(sbi->ckpt); 389 return -EINVAL; 390} 391 392int sanity_check_ckpt(struct f2fs_sb_info *sbi) 393{ 394 unsigned int total, fsmeta; 395 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi); 396 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 397 398 total = le32_to_cpu(raw_super->segment_count); 399 fsmeta = le32_to_cpu(raw_super->segment_count_ckpt); 400 fsmeta += le32_to_cpu(raw_super->segment_count_sit); 401 fsmeta += le32_to_cpu(raw_super->segment_count_nat); 402 fsmeta += le32_to_cpu(ckpt->rsvd_segment_count); 403 fsmeta += le32_to_cpu(raw_super->segment_count_ssa); 404 405 if (fsmeta >= total) 406 return 1; 407 408 return 0; 409} 410 411int init_node_manager(struct f2fs_sb_info *sbi) 412{ 413 struct f2fs_super_block *sb_raw = F2FS_RAW_SUPER(sbi); 414 struct f2fs_nm_info *nm_i = NM_I(sbi); 415 unsigned char *version_bitmap; 416 unsigned int nat_segs, nat_blocks; 417 418 nm_i->nat_blkaddr = le32_to_cpu(sb_raw->nat_blkaddr); 419 420 /* segment_count_nat includes pair segment so divide to 2. */ 421 nat_segs = le32_to_cpu(sb_raw->segment_count_nat) >> 1; 422 nat_blocks = nat_segs << le32_to_cpu(sb_raw->log_blocks_per_seg); 423 nm_i->max_nid = NAT_ENTRY_PER_BLOCK * nat_blocks; 424 nm_i->fcnt = 0; 425 nm_i->nat_cnt = 0; 426 nm_i->init_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); 427 nm_i->next_scan_nid = le32_to_cpu(sbi->ckpt->next_free_nid); 428 429 nm_i->bitmap_size = __bitmap_size(sbi, NAT_BITMAP); 430 431 nm_i->nat_bitmap = malloc(nm_i->bitmap_size); 432 if (!nm_i->nat_bitmap) 433 return -ENOMEM; 434 version_bitmap = __bitmap_ptr(sbi, NAT_BITMAP); 435 if (!version_bitmap) 436 return -EFAULT; 437 438 /* copy version bitmap */ 439 memcpy(nm_i->nat_bitmap, version_bitmap, nm_i->bitmap_size); 440 return 0; 441} 442 443int build_node_manager(struct f2fs_sb_info *sbi) 444{ 445 int err; 446 sbi->nm_info = malloc(sizeof(struct f2fs_nm_info)); 447 if (!sbi->nm_info) 448 return -ENOMEM; 449 450 err = init_node_manager(sbi); 451 if (err) 452 return err; 453 454 return 0; 455} 456 457int build_sit_info(struct f2fs_sb_info *sbi) 458{ 459 struct f2fs_super_block *raw_sb = F2FS_RAW_SUPER(sbi); 460 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 461 struct sit_info *sit_i; 462 unsigned int sit_segs, start; 463 char *src_bitmap, *dst_bitmap; 464 unsigned int bitmap_size; 465 466 sit_i = malloc(sizeof(struct sit_info)); 467 if (!sit_i) 468 return -ENOMEM; 469 470 SM_I(sbi)->sit_info = sit_i; 471 472 sit_i->sentries = calloc(TOTAL_SEGS(sbi) * sizeof(struct seg_entry), 1); 473 474 for (start = 0; start < TOTAL_SEGS(sbi); start++) { 475 sit_i->sentries[start].cur_valid_map 476 = calloc(SIT_VBLOCK_MAP_SIZE, 1); 477 sit_i->sentries[start].ckpt_valid_map 478 = calloc(SIT_VBLOCK_MAP_SIZE, 1); 479 if (!sit_i->sentries[start].cur_valid_map 480 || !sit_i->sentries[start].ckpt_valid_map) 481 return -ENOMEM; 482 } 483 484 sit_segs = le32_to_cpu(raw_sb->segment_count_sit) >> 1; 485 bitmap_size = __bitmap_size(sbi, SIT_BITMAP); 486 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP); 487 488 dst_bitmap = malloc(bitmap_size); 489 memcpy(dst_bitmap, src_bitmap, bitmap_size); 490 491 sit_i->sit_base_addr = le32_to_cpu(raw_sb->sit_blkaddr); 492 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg; 493 sit_i->written_valid_blocks = le64_to_cpu(ckpt->valid_block_count); 494 sit_i->sit_bitmap = dst_bitmap; 495 sit_i->bitmap_size = bitmap_size; 496 sit_i->dirty_sentries = 0; 497 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK; 498 sit_i->elapsed_time = le64_to_cpu(ckpt->elapsed_time); 499 return 0; 500} 501 502void reset_curseg(struct f2fs_sb_info *sbi, int type) 503{ 504 struct curseg_info *curseg = CURSEG_I(sbi, type); 505 struct summary_footer *sum_footer; 506 struct seg_entry *se; 507 508 sum_footer = &(curseg->sum_blk->footer); 509 memset(sum_footer, 0, sizeof(struct summary_footer)); 510 if (IS_DATASEG(type)) 511 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA); 512 if (IS_NODESEG(type)) 513 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE); 514 se = get_seg_entry(sbi, curseg->segno); 515 se->type = type; 516} 517 518static void read_compacted_summaries(struct f2fs_sb_info *sbi) 519{ 520 struct curseg_info *curseg; 521 unsigned int i, j, offset; 522 block_t start; 523 char *kaddr; 524 int ret; 525 526 start = start_sum_block(sbi); 527 528 kaddr = (char *)malloc(PAGE_SIZE); 529 ret = dev_read_block(kaddr, start++); 530 ASSERT(ret >= 0); 531 532 curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 533 memcpy(&curseg->sum_blk->n_nats, kaddr, SUM_JOURNAL_SIZE); 534 535 curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); 536 memcpy(&curseg->sum_blk->n_sits, kaddr + SUM_JOURNAL_SIZE, 537 SUM_JOURNAL_SIZE); 538 539 offset = 2 * SUM_JOURNAL_SIZE; 540 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) { 541 unsigned short blk_off; 542 struct curseg_info *curseg = CURSEG_I(sbi, i); 543 544 reset_curseg(sbi, i); 545 546 if (curseg->alloc_type == SSR) 547 blk_off = sbi->blocks_per_seg; 548 else 549 blk_off = curseg->next_blkoff; 550 551 for (j = 0; j < blk_off; j++) { 552 struct f2fs_summary *s; 553 s = (struct f2fs_summary *)(kaddr + offset); 554 curseg->sum_blk->entries[j] = *s; 555 offset += SUMMARY_SIZE; 556 if (offset + SUMMARY_SIZE <= 557 PAGE_CACHE_SIZE - SUM_FOOTER_SIZE) 558 continue; 559 memset(kaddr, 0, PAGE_SIZE); 560 ret = dev_read_block(kaddr, start++); 561 ASSERT(ret >= 0); 562 offset = 0; 563 } 564 } 565 free(kaddr); 566} 567 568static void restore_node_summary(struct f2fs_sb_info *sbi, 569 unsigned int segno, struct f2fs_summary_block *sum_blk) 570{ 571 struct f2fs_node *node_blk; 572 struct f2fs_summary *sum_entry; 573 block_t addr; 574 unsigned int i; 575 int ret; 576 577 node_blk = malloc(F2FS_BLKSIZE); 578 ASSERT(node_blk); 579 580 /* scan the node segment */ 581 addr = START_BLOCK(sbi, segno); 582 sum_entry = &sum_blk->entries[0]; 583 584 for (i = 0; i < sbi->blocks_per_seg; i++, sum_entry++) { 585 ret = dev_read_block(node_blk, addr); 586 ASSERT(ret >= 0); 587 sum_entry->nid = node_blk->footer.nid; 588 addr++; 589 } 590 free(node_blk); 591} 592 593static void read_normal_summaries(struct f2fs_sb_info *sbi, int type) 594{ 595 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 596 struct f2fs_summary_block *sum_blk; 597 struct curseg_info *curseg; 598 unsigned int segno = 0; 599 block_t blk_addr = 0; 600 int ret; 601 602 if (IS_DATASEG(type)) { 603 segno = le32_to_cpu(ckpt->cur_data_segno[type]); 604 if (is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG)) 605 blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type); 606 else 607 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type); 608 } else { 609 segno = le32_to_cpu(ckpt->cur_node_segno[type - 610 CURSEG_HOT_NODE]); 611 if (is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG)) 612 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE, 613 type - CURSEG_HOT_NODE); 614 else 615 blk_addr = GET_SUM_BLKADDR(sbi, segno); 616 } 617 618 sum_blk = (struct f2fs_summary_block *)malloc(PAGE_SIZE); 619 ret = dev_read_block(sum_blk, blk_addr); 620 ASSERT(ret >= 0); 621 622 if (IS_NODESEG(type) && !is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG)) 623 restore_node_summary(sbi, segno, sum_blk); 624 625 curseg = CURSEG_I(sbi, type); 626 memcpy(curseg->sum_blk, sum_blk, PAGE_CACHE_SIZE); 627 reset_curseg(sbi, type); 628 free(sum_blk); 629} 630 631static void restore_curseg_summaries(struct f2fs_sb_info *sbi) 632{ 633 int type = CURSEG_HOT_DATA; 634 635 if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_COMPACT_SUM_FLAG)) { 636 read_compacted_summaries(sbi); 637 type = CURSEG_HOT_NODE; 638 } 639 640 for (; type <= CURSEG_COLD_NODE; type++) 641 read_normal_summaries(sbi, type); 642} 643 644static void build_curseg(struct f2fs_sb_info *sbi) 645{ 646 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 647 struct curseg_info *array; 648 unsigned short blk_off; 649 unsigned int segno; 650 int i; 651 652 array = malloc(sizeof(*array) * NR_CURSEG_TYPE); 653 ASSERT(array); 654 655 SM_I(sbi)->curseg_array = array; 656 657 for (i = 0; i < NR_CURSEG_TYPE; i++) { 658 array[i].sum_blk = malloc(PAGE_CACHE_SIZE); 659 ASSERT(array[i].sum_blk); 660 if (i <= CURSEG_COLD_DATA) { 661 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]); 662 segno = le32_to_cpu(ckpt->cur_data_segno[i]); 663 } 664 if (i > CURSEG_COLD_DATA) { 665 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[i - 666 CURSEG_HOT_NODE]); 667 segno = le32_to_cpu(ckpt->cur_node_segno[i - 668 CURSEG_HOT_NODE]); 669 } 670 array[i].segno = segno; 671 array[i].zone = GET_ZONENO_FROM_SEGNO(sbi, segno); 672 array[i].next_segno = NULL_SEGNO; 673 array[i].next_blkoff = blk_off; 674 array[i].alloc_type = ckpt->alloc_type[i]; 675 } 676 restore_curseg_summaries(sbi); 677} 678 679inline void check_seg_range(struct f2fs_sb_info *sbi, unsigned int segno) 680{ 681 unsigned int end_segno = SM_I(sbi)->segment_count - 1; 682 ASSERT(segno <= end_segno); 683} 684 685static struct f2fs_sit_block *get_current_sit_page(struct f2fs_sb_info *sbi, 686 unsigned int segno) 687{ 688 struct sit_info *sit_i = SIT_I(sbi); 689 unsigned int offset = SIT_BLOCK_OFFSET(sit_i, segno); 690 block_t blk_addr = sit_i->sit_base_addr + offset; 691 struct f2fs_sit_block *sit_blk = calloc(BLOCK_SZ, 1); 692 int ret; 693 694 check_seg_range(sbi, segno); 695 696 /* calculate sit block address */ 697 if (f2fs_test_bit(offset, sit_i->sit_bitmap)) 698 blk_addr += sit_i->sit_blocks; 699 700 ret = dev_read_block(sit_blk, blk_addr); 701 ASSERT(ret >= 0); 702 703 return sit_blk; 704} 705 706void rewrite_current_sit_page(struct f2fs_sb_info *sbi, 707 unsigned int segno, struct f2fs_sit_block *sit_blk) 708{ 709 struct sit_info *sit_i = SIT_I(sbi); 710 unsigned int offset = SIT_BLOCK_OFFSET(sit_i, segno); 711 block_t blk_addr = sit_i->sit_base_addr + offset; 712 int ret; 713 714 /* calculate sit block address */ 715 if (f2fs_test_bit(offset, sit_i->sit_bitmap)) 716 blk_addr += sit_i->sit_blocks; 717 718 ret = dev_write_block(sit_blk, blk_addr); 719 ASSERT(ret >= 0); 720} 721 722void check_block_count(struct f2fs_sb_info *sbi, 723 unsigned int segno, struct f2fs_sit_entry *raw_sit) 724{ 725 struct f2fs_sm_info *sm_info = SM_I(sbi); 726 unsigned int end_segno = sm_info->segment_count - 1; 727 int valid_blocks = 0; 728 unsigned int i; 729 730 /* check segment usage */ 731 if (GET_SIT_VBLOCKS(raw_sit) > sbi->blocks_per_seg) 732 ASSERT_MSG("Invalid SIT vblocks: segno=0x%x, %u", 733 segno, GET_SIT_VBLOCKS(raw_sit)); 734 735 /* check boundary of a given segment number */ 736 if (segno > end_segno) 737 ASSERT_MSG("Invalid SEGNO: 0x%x", segno); 738 739 /* check bitmap with valid block count */ 740 for (i = 0; i < SIT_VBLOCK_MAP_SIZE; i++) 741 valid_blocks += get_bits_in_byte(raw_sit->valid_map[i]); 742 743 if (GET_SIT_VBLOCKS(raw_sit) != valid_blocks) 744 ASSERT_MSG("Wrong SIT valid blocks: segno=0x%x, %u vs. %u", 745 segno, GET_SIT_VBLOCKS(raw_sit), valid_blocks); 746 747 if (GET_SIT_TYPE(raw_sit) >= NO_CHECK_TYPE) 748 ASSERT_MSG("Wrong SIT type: segno=0x%x, %u", 749 segno, GET_SIT_TYPE(raw_sit)); 750} 751 752void seg_info_from_raw_sit(struct seg_entry *se, 753 struct f2fs_sit_entry *raw_sit) 754{ 755 se->valid_blocks = GET_SIT_VBLOCKS(raw_sit); 756 se->ckpt_valid_blocks = GET_SIT_VBLOCKS(raw_sit); 757 memcpy(se->cur_valid_map, raw_sit->valid_map, SIT_VBLOCK_MAP_SIZE); 758 memcpy(se->ckpt_valid_map, raw_sit->valid_map, SIT_VBLOCK_MAP_SIZE); 759 se->type = GET_SIT_TYPE(raw_sit); 760 se->mtime = le64_to_cpu(raw_sit->mtime); 761} 762 763struct seg_entry *get_seg_entry(struct f2fs_sb_info *sbi, 764 unsigned int segno) 765{ 766 struct sit_info *sit_i = SIT_I(sbi); 767 return &sit_i->sentries[segno]; 768} 769 770int get_sum_block(struct f2fs_sb_info *sbi, unsigned int segno, 771 struct f2fs_summary_block *sum_blk) 772{ 773 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 774 struct curseg_info *curseg; 775 int type, ret; 776 u64 ssa_blk; 777 778 ssa_blk = GET_SUM_BLKADDR(sbi, segno); 779 for (type = 0; type < NR_CURSEG_NODE_TYPE; type++) { 780 if (segno == ckpt->cur_node_segno[type]) { 781 curseg = CURSEG_I(sbi, CURSEG_HOT_NODE + type); 782 if (!IS_SUM_NODE_SEG(curseg->sum_blk->footer)) { 783 ASSERT_MSG("segno [0x%x] indicates a data " 784 "segment, but should be node", 785 segno); 786 return -EINVAL; 787 } 788 memcpy(sum_blk, curseg->sum_blk, BLOCK_SZ); 789 return SEG_TYPE_CUR_NODE; 790 } 791 } 792 793 for (type = 0; type < NR_CURSEG_DATA_TYPE; type++) { 794 if (segno == ckpt->cur_data_segno[type]) { 795 curseg = CURSEG_I(sbi, type); 796 if (IS_SUM_NODE_SEG(curseg->sum_blk->footer)) { 797 ASSERT_MSG("segno [0x%x] indicates a node " 798 "segment, but should be data", 799 segno); 800 return -EINVAL; 801 } 802 DBG(2, "segno [0x%x] is current data seg[0x%x]\n", 803 segno, type); 804 memcpy(sum_blk, curseg->sum_blk, BLOCK_SZ); 805 return SEG_TYPE_CUR_DATA; 806 } 807 } 808 809 ret = dev_read_block(sum_blk, ssa_blk); 810 ASSERT(ret >= 0); 811 812 if (IS_SUM_NODE_SEG(sum_blk->footer)) 813 return SEG_TYPE_NODE; 814 else 815 return SEG_TYPE_DATA; 816 817} 818 819int get_sum_entry(struct f2fs_sb_info *sbi, u32 blk_addr, 820 struct f2fs_summary *sum_entry) 821{ 822 struct f2fs_summary_block *sum_blk; 823 u32 segno, offset; 824 int ret; 825 826 segno = GET_SEGNO(sbi, blk_addr); 827 offset = OFFSET_IN_SEG(sbi, blk_addr); 828 829 sum_blk = calloc(BLOCK_SZ, 1); 830 831 ret = get_sum_block(sbi, segno, sum_blk); 832 memcpy(sum_entry, &(sum_blk->entries[offset]), 833 sizeof(struct f2fs_summary)); 834 free(sum_blk); 835 return ret; 836} 837 838static void get_nat_entry(struct f2fs_sb_info *sbi, nid_t nid, 839 struct f2fs_nat_entry *raw_nat) 840{ 841 struct f2fs_nm_info *nm_i = NM_I(sbi); 842 struct f2fs_nat_block *nat_block; 843 pgoff_t block_off; 844 pgoff_t block_addr; 845 int seg_off, entry_off; 846 int ret; 847 848 if (lookup_nat_in_journal(sbi, nid, raw_nat) >= 0) 849 return; 850 851 nat_block = (struct f2fs_nat_block *)calloc(BLOCK_SZ, 1); 852 853 block_off = nid / NAT_ENTRY_PER_BLOCK; 854 entry_off = nid % NAT_ENTRY_PER_BLOCK; 855 856 seg_off = block_off >> sbi->log_blocks_per_seg; 857 block_addr = (pgoff_t)(nm_i->nat_blkaddr + 858 (seg_off << sbi->log_blocks_per_seg << 1) + 859 (block_off & ((1 << sbi->log_blocks_per_seg) - 1))); 860 861 if (f2fs_test_bit(block_off, nm_i->nat_bitmap)) 862 block_addr += sbi->blocks_per_seg; 863 864 ret = dev_read_block(nat_block, block_addr); 865 ASSERT(ret >= 0); 866 867 memcpy(raw_nat, &nat_block->entries[entry_off], 868 sizeof(struct f2fs_nat_entry)); 869 free(nat_block); 870} 871 872void get_node_info(struct f2fs_sb_info *sbi, nid_t nid, struct node_info *ni) 873{ 874 struct f2fs_nat_entry raw_nat; 875 get_nat_entry(sbi, nid, &raw_nat); 876 ni->nid = nid; 877 node_info_from_raw_nat(ni, &raw_nat); 878} 879 880void build_sit_entries(struct f2fs_sb_info *sbi) 881{ 882 struct sit_info *sit_i = SIT_I(sbi); 883 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); 884 struct f2fs_summary_block *sum = curseg->sum_blk; 885 unsigned int segno; 886 887 for (segno = 0; segno < TOTAL_SEGS(sbi); segno++) { 888 struct seg_entry *se = &sit_i->sentries[segno]; 889 struct f2fs_sit_block *sit_blk; 890 struct f2fs_sit_entry sit; 891 int i; 892 893 for (i = 0; i < sits_in_cursum(sum); i++) { 894 if (le32_to_cpu(segno_in_journal(sum, i)) == segno) { 895 sit = sit_in_journal(sum, i); 896 goto got_it; 897 } 898 } 899 sit_blk = get_current_sit_page(sbi, segno); 900 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, segno)]; 901 free(sit_blk); 902got_it: 903 check_block_count(sbi, segno, &sit); 904 seg_info_from_raw_sit(se, &sit); 905 } 906 907} 908 909int build_segment_manager(struct f2fs_sb_info *sbi) 910{ 911 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi); 912 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); 913 struct f2fs_sm_info *sm_info; 914 915 sm_info = malloc(sizeof(struct f2fs_sm_info)); 916 if (!sm_info) 917 return -ENOMEM; 918 919 /* init sm info */ 920 sbi->sm_info = sm_info; 921 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr); 922 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr); 923 sm_info->segment_count = le32_to_cpu(raw_super->segment_count); 924 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count); 925 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count); 926 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main); 927 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr); 928 929 build_sit_info(sbi); 930 931 build_curseg(sbi); 932 933 build_sit_entries(sbi); 934 935 return 0; 936} 937 938void build_sit_area_bitmap(struct f2fs_sb_info *sbi) 939{ 940 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 941 struct f2fs_sm_info *sm_i = SM_I(sbi); 942 unsigned int segno = 0; 943 char *ptr = NULL; 944 u32 sum_vblocks = 0; 945 u32 free_segs = 0; 946 struct seg_entry *se; 947 948 fsck->sit_area_bitmap_sz = sm_i->main_segments * SIT_VBLOCK_MAP_SIZE; 949 fsck->sit_area_bitmap = calloc(1, fsck->sit_area_bitmap_sz); 950 ptr = fsck->sit_area_bitmap; 951 952 ASSERT(fsck->sit_area_bitmap_sz == fsck->main_area_bitmap_sz); 953 954 for (segno = 0; segno < TOTAL_SEGS(sbi); segno++) { 955 se = get_seg_entry(sbi, segno); 956 957 memcpy(ptr, se->cur_valid_map, SIT_VBLOCK_MAP_SIZE); 958 ptr += SIT_VBLOCK_MAP_SIZE; 959 960 if (se->valid_blocks == 0x0) { 961 if (sbi->ckpt->cur_node_segno[0] == segno || 962 sbi->ckpt->cur_data_segno[0] == segno || 963 sbi->ckpt->cur_node_segno[1] == segno || 964 sbi->ckpt->cur_data_segno[1] == segno || 965 sbi->ckpt->cur_node_segno[2] == segno || 966 sbi->ckpt->cur_data_segno[2] == segno) { 967 continue; 968 } else { 969 free_segs++; 970 } 971 } else { 972 sum_vblocks += se->valid_blocks; 973 } 974 } 975 fsck->chk.sit_valid_blocks = sum_vblocks; 976 fsck->chk.sit_free_segs = free_segs; 977 978 DBG(1, "Blocks [0x%x : %d] Free Segs [0x%x : %d]\n\n", 979 sum_vblocks, sum_vblocks, 980 free_segs, free_segs); 981} 982 983void rewrite_sit_area_bitmap(struct f2fs_sb_info *sbi) 984{ 985 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 986 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); 987 struct sit_info *sit_i = SIT_I(sbi); 988 unsigned int segno = 0; 989 struct f2fs_summary_block *sum = curseg->sum_blk; 990 char *ptr = NULL; 991 992 /* remove sit journal */ 993 sum->n_sits = 0; 994 995 fsck->chk.free_segs = 0; 996 997 ptr = fsck->main_area_bitmap; 998 999 for (segno = 0; segno < TOTAL_SEGS(sbi); segno++) { 1000 struct f2fs_sit_block *sit_blk; 1001 struct f2fs_sit_entry *sit; 1002 struct seg_entry *se; 1003 u16 valid_blocks = 0; 1004 u16 type; 1005 int i; 1006 1007 sit_blk = get_current_sit_page(sbi, segno); 1008 sit = &sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, segno)]; 1009 memcpy(sit->valid_map, ptr, SIT_VBLOCK_MAP_SIZE); 1010 1011 /* update valid block count */ 1012 for (i = 0; i < SIT_VBLOCK_MAP_SIZE; i++) 1013 valid_blocks += get_bits_in_byte(sit->valid_map[i]); 1014 1015 se = get_seg_entry(sbi, segno); 1016 type = se->type; 1017 if (type >= NO_CHECK_TYPE) { 1018 ASSERT(valid_blocks); 1019 type = 0; 1020 } 1021 sit->vblocks = cpu_to_le16((type << SIT_VBLOCKS_SHIFT) | 1022 valid_blocks); 1023 rewrite_current_sit_page(sbi, segno, sit_blk); 1024 free(sit_blk); 1025 1026 if (valid_blocks == 0 && 1027 sbi->ckpt->cur_node_segno[0] != segno && 1028 sbi->ckpt->cur_data_segno[0] != segno && 1029 sbi->ckpt->cur_node_segno[1] != segno && 1030 sbi->ckpt->cur_data_segno[1] != segno && 1031 sbi->ckpt->cur_node_segno[2] != segno && 1032 sbi->ckpt->cur_data_segno[2] != segno) 1033 fsck->chk.free_segs++; 1034 1035 ptr += SIT_VBLOCK_MAP_SIZE; 1036 } 1037} 1038 1039int lookup_nat_in_journal(struct f2fs_sb_info *sbi, u32 nid, 1040 struct f2fs_nat_entry *raw_nat) 1041{ 1042 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1043 struct f2fs_summary_block *sum = curseg->sum_blk; 1044 int i = 0; 1045 1046 for (i = 0; i < nats_in_cursum(sum); i++) { 1047 if (le32_to_cpu(nid_in_journal(sum, i)) == nid) { 1048 memcpy(raw_nat, &nat_in_journal(sum, i), 1049 sizeof(struct f2fs_nat_entry)); 1050 DBG(3, "==> Found nid [0x%x] in nat cache\n", nid); 1051 return i; 1052 } 1053 } 1054 return -1; 1055} 1056 1057void nullify_nat_entry(struct f2fs_sb_info *sbi, u32 nid) 1058{ 1059 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_HOT_DATA); 1060 struct f2fs_summary_block *sum = curseg->sum_blk; 1061 struct f2fs_nm_info *nm_i = NM_I(sbi); 1062 struct f2fs_nat_block *nat_block; 1063 pgoff_t block_off; 1064 pgoff_t block_addr; 1065 int seg_off, entry_off; 1066 int ret; 1067 int i = 0; 1068 1069 /* check in journal */ 1070 for (i = 0; i < nats_in_cursum(sum); i++) { 1071 if (le32_to_cpu(nid_in_journal(sum, i)) == nid) { 1072 memset(&nat_in_journal(sum, i), 0, 1073 sizeof(struct f2fs_nat_entry)); 1074 FIX_MSG("Remove nid [0x%x] in nat journal\n", nid); 1075 return; 1076 } 1077 } 1078 nat_block = (struct f2fs_nat_block *)calloc(BLOCK_SZ, 1); 1079 1080 block_off = nid / NAT_ENTRY_PER_BLOCK; 1081 entry_off = nid % NAT_ENTRY_PER_BLOCK; 1082 1083 seg_off = block_off >> sbi->log_blocks_per_seg; 1084 block_addr = (pgoff_t)(nm_i->nat_blkaddr + 1085 (seg_off << sbi->log_blocks_per_seg << 1) + 1086 (block_off & ((1 << sbi->log_blocks_per_seg) - 1))); 1087 1088 if (f2fs_test_bit(block_off, nm_i->nat_bitmap)) 1089 block_addr += sbi->blocks_per_seg; 1090 1091 ret = dev_read_block(nat_block, block_addr); 1092 ASSERT(ret >= 0); 1093 1094 memset(&nat_block->entries[entry_off], 0, 1095 sizeof(struct f2fs_nat_entry)); 1096 1097 ret = dev_write_block(nat_block, block_addr); 1098 ASSERT(ret >= 0); 1099 free(nat_block); 1100} 1101 1102void build_nat_area_bitmap(struct f2fs_sb_info *sbi) 1103{ 1104 struct f2fs_fsck *fsck = F2FS_FSCK(sbi); 1105 struct f2fs_super_block *raw_sb = F2FS_RAW_SUPER(sbi); 1106 struct f2fs_nm_info *nm_i = NM_I(sbi); 1107 struct f2fs_nat_block *nat_block; 1108 u32 nid, nr_nat_blks; 1109 pgoff_t block_off; 1110 pgoff_t block_addr; 1111 int seg_off; 1112 int ret; 1113 unsigned int i; 1114 1115 nat_block = (struct f2fs_nat_block *)calloc(BLOCK_SZ, 1); 1116 ASSERT(nat_block); 1117 1118 /* Alloc & build nat entry bitmap */ 1119 nr_nat_blks = (le32_to_cpu(raw_sb->segment_count_nat) / 2) << 1120 sbi->log_blocks_per_seg; 1121 1122 fsck->nr_nat_entries = nr_nat_blks * NAT_ENTRY_PER_BLOCK; 1123 fsck->nat_area_bitmap_sz = (fsck->nr_nat_entries + 7) / 8; 1124 fsck->nat_area_bitmap = calloc(fsck->nat_area_bitmap_sz, 1); 1125 ASSERT(fsck->nat_area_bitmap != NULL); 1126 1127 for (block_off = 0; block_off < nr_nat_blks; block_off++) { 1128 1129 seg_off = block_off >> sbi->log_blocks_per_seg; 1130 block_addr = (pgoff_t)(nm_i->nat_blkaddr + 1131 (seg_off << sbi->log_blocks_per_seg << 1) + 1132 (block_off & ((1 << sbi->log_blocks_per_seg) - 1))); 1133 1134 if (f2fs_test_bit(block_off, nm_i->nat_bitmap)) 1135 block_addr += sbi->blocks_per_seg; 1136 1137 ret = dev_read_block(nat_block, block_addr); 1138 ASSERT(ret >= 0); 1139 1140 nid = block_off * NAT_ENTRY_PER_BLOCK; 1141 for (i = 0; i < NAT_ENTRY_PER_BLOCK; i++) { 1142 struct f2fs_nat_entry raw_nat; 1143 struct node_info ni; 1144 ni.nid = nid + i; 1145 1146 if ((nid + i) == F2FS_NODE_INO(sbi) || 1147 (nid + i) == F2FS_META_INO(sbi)) { 1148 ASSERT(nat_block->entries[i].block_addr != 0x0); 1149 continue; 1150 } 1151 1152 if (lookup_nat_in_journal(sbi, nid + i, 1153 &raw_nat) >= 0) { 1154 node_info_from_raw_nat(&ni, &raw_nat); 1155 if (ni.blk_addr != 0x0) { 1156 f2fs_set_bit(nid + i, 1157 fsck->nat_area_bitmap); 1158 fsck->chk.valid_nat_entry_cnt++; 1159 DBG(3, "nid[0x%x] in nat cache\n", 1160 nid + i); 1161 } 1162 } else { 1163 node_info_from_raw_nat(&ni, 1164 &nat_block->entries[i]); 1165 if (ni.blk_addr == 0) 1166 continue; 1167 ASSERT(nid + i != 0x0); 1168 1169 DBG(3, "nid[0x%8x] addr[0x%16x] ino[0x%8x]\n", 1170 nid + i, ni.blk_addr, ni.ino); 1171 f2fs_set_bit(nid + i, fsck->nat_area_bitmap); 1172 fsck->chk.valid_nat_entry_cnt++; 1173 } 1174 } 1175 } 1176 free(nat_block); 1177 1178 DBG(1, "valid nat entries (block_addr != 0x0) [0x%8x : %u]\n", 1179 fsck->chk.valid_nat_entry_cnt, 1180 fsck->chk.valid_nat_entry_cnt); 1181} 1182 1183int f2fs_do_mount(struct f2fs_sb_info *sbi) 1184{ 1185 int ret; 1186 sbi->active_logs = NR_CURSEG_TYPE; 1187 ret = validate_super_block(sbi, 0); 1188 if (ret) { 1189 ret = validate_super_block(sbi, 1); 1190 if (ret) 1191 return -1; 1192 } 1193 1194 print_raw_sb_info(sbi); 1195 1196 init_sb_info(sbi); 1197 1198 ret = get_valid_checkpoint(sbi); 1199 if (ret) { 1200 ERR_MSG("Can't find valid checkpoint\n"); 1201 return -1; 1202 } 1203 1204 if (sanity_check_ckpt(sbi)) { 1205 ERR_MSG("Checkpoint is polluted\n"); 1206 return -1; 1207 } 1208 1209 print_ckpt_info(sbi); 1210 1211 sbi->total_valid_node_count = le32_to_cpu(sbi->ckpt->valid_node_count); 1212 sbi->total_valid_inode_count = 1213 le32_to_cpu(sbi->ckpt->valid_inode_count); 1214 sbi->user_block_count = le64_to_cpu(sbi->ckpt->user_block_count); 1215 sbi->total_valid_block_count = 1216 le64_to_cpu(sbi->ckpt->valid_block_count); 1217 sbi->last_valid_block_count = sbi->total_valid_block_count; 1218 sbi->alloc_valid_block_count = 0; 1219 1220 if (build_segment_manager(sbi)) { 1221 ERR_MSG("build_segment_manager failed\n"); 1222 return -1; 1223 } 1224 1225 if (build_node_manager(sbi)) { 1226 ERR_MSG("build_segment_manager failed\n"); 1227 return -1; 1228 } 1229 1230 return ret; 1231} 1232 1233void f2fs_do_umount(struct f2fs_sb_info *sbi) 1234{ 1235 struct sit_info *sit_i = SIT_I(sbi); 1236 struct f2fs_sm_info *sm_i = SM_I(sbi); 1237 struct f2fs_nm_info *nm_i = NM_I(sbi); 1238 unsigned int i; 1239 1240 /* free nm_info */ 1241 free(nm_i->nat_bitmap); 1242 free(sbi->nm_info); 1243 1244 /* free sit_info */ 1245 for (i = 0; i < TOTAL_SEGS(sbi); i++) { 1246 free(sit_i->sentries[i].cur_valid_map); 1247 free(sit_i->sentries[i].ckpt_valid_map); 1248 } 1249 free(sit_i->sit_bitmap); 1250 free(sm_i->sit_info); 1251 1252 /* free sm_info */ 1253 for (i = 0; i < NR_CURSEG_TYPE; i++) 1254 free(sm_i->curseg_array[i].sum_blk); 1255 1256 free(sm_i->curseg_array); 1257 free(sbi->sm_info); 1258 1259 free(sbi->ckpt); 1260 free(sbi->raw_super); 1261} 1262