1 /* $NetBSD: bfs.c,v 1.13 2010/07/26 13:43:26 njoly Exp $ */ 2 3 /*- 4 * Copyright (c) 2004 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by UCHIYAMA Yasushi. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 * POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 #include <sys/cdefs.h> 33 34 __KERNEL_RCSID(0, "$NetBSD: bfs.c,v 1.13 2010/07/26 13:43:26 njoly Exp $"); 35 #define BFS_DEBUG 36 37 #include <sys/param.h> 38 #include <sys/kernel.h> 39 #include <sys/types.h> 40 #include <sys/systm.h> 41 #include <sys/errno.h> 42 #include <sys/malloc.h> 43 #include <sys/time.h> 44 45 #ifdef _KERNEL 46 MALLOC_JUSTDEFINE(M_BFS, "sysvbfs core", "sysvbfs internal structures"); 47 #define __MALLOC(s, t, f) malloc(s, t, f) 48 #define __FREE(a, s, t) free(a, t) 49 #elif defined _STANDALONE 50 #include <lib/libsa/stand.h> 51 #include <lib/libkern/libkern.h> 52 #define __MALLOC(s, t, f) alloc(s) 53 #define __FREE(a, s, t) dealloc(a, s) 54 #else 55 #include "local.h" 56 #define __MALLOC(s, t, f) malloc(s) 57 #define __FREE(a, s, t) free(a) 58 #endif 59 #include <fs/sysvbfs/bfs.h> 60 61 #ifdef BFS_DEBUG 62 #define DPRINTF(on, fmt, args...) if (on) printf(fmt, ##args) 63 #else 64 #define DPRINTF(arg...) ((void)0) 65 #endif 66 67 #define ROUND_SECTOR(x) (((x) + 511) & ~511) 68 #define TRUNC_SECTOR(x) ((x) & ~511) 69 70 #define STATIC 71 72 STATIC int bfs_init_superblock(struct bfs *, int, size_t *); 73 STATIC int bfs_init_inode(struct bfs *, uint8_t *, size_t *); 74 STATIC int bfs_init_dirent(struct bfs *, uint8_t *); 75 76 /* super block ops. */ 77 STATIC bool bfs_superblock_valid(const struct bfs_super_block *); 78 STATIC bool bfs_writeback_dirent(const struct bfs *, struct bfs_dirent *, 79 bool); 80 STATIC bool bfs_writeback_inode(const struct bfs *, struct bfs_inode *); 81 82 int 83 bfs_init2(struct bfs **bfsp, int bfs_sector, struct sector_io_ops *io, 84 bool debug) 85 { 86 struct bfs *bfs; 87 size_t memsize; 88 uint8_t *p; 89 int err; 90 91 /* 1. */ 92 DPRINTF(debug, "bfs sector = %d\n", bfs_sector); 93 if ((bfs = (void *)__MALLOC(sizeof(struct bfs), M_BFS, M_NOWAIT)) == 0) 94 return ENOMEM; 95 memset(bfs, 0, sizeof *bfs); 96 bfs->io = io; 97 bfs->debug = debug; 98 99 /* 2. */ 100 if ((err = bfs_init_superblock(bfs, bfs_sector, &memsize)) != 0) { 101 bfs_fini(bfs); 102 return err; 103 } 104 DPRINTF(debug, "bfs super block + inode area = %zd\n", memsize); 105 bfs->super_block_size = memsize; 106 if ((p = (void *)__MALLOC(memsize, M_BFS, M_NOWAIT)) == 0) { 107 bfs_fini(bfs); 108 return ENOMEM; 109 } 110 /* 3. */ 111 if ((err = bfs_init_inode(bfs, p, &memsize)) != 0) { 112 bfs_fini(bfs); 113 return err; 114 } 115 DPRINTF(debug, "bfs dirent area = %zd\n", memsize); 116 bfs->dirent_size = memsize; 117 if ((p = (void *)__MALLOC(memsize, M_BFS, M_NOWAIT)) == 0) { 118 bfs_fini(bfs); 119 return ENOMEM; 120 } 121 /* 4. */ 122 if ((err = bfs_init_dirent(bfs, p)) != 0) { 123 bfs_fini(bfs); 124 return err; 125 } 126 127 #ifdef BFS_DEBUG 128 bfs_dump(bfs); 129 #endif 130 *bfsp = bfs; 131 132 return 0; 133 } 134 135 void 136 bfs_fini(struct bfs *bfs) 137 { 138 139 if (bfs == 0) 140 return; 141 if (bfs->super_block) 142 __FREE(bfs->super_block, bfs->super_block_size, M_BFS); 143 if (bfs->dirent) 144 __FREE(bfs->dirent, bfs->dirent_size, M_BFS); 145 __FREE(bfs, sizeof(struct bfs), M_BFS); 146 } 147 148 STATIC int 149 bfs_init_superblock(struct bfs *bfs, int bfs_sector, size_t *required_memory) 150 { 151 struct bfs_super_block super; 152 153 bfs->start_sector = bfs_sector; 154 155 /* Read super block */ 156 if (!bfs->io->read(bfs->io, (uint8_t *)&super, bfs_sector)) 157 return EIO; 158 159 if (!bfs_superblock_valid(&super)) 160 return EINVAL; 161 162 /* i-node table size */ 163 bfs->data_start = super.header.data_start_byte; 164 bfs->data_end = super.header.data_end_byte; 165 166 bfs->max_inode = (bfs->data_start - sizeof(struct bfs_super_block)) / 167 sizeof(struct bfs_inode); 168 169 *required_memory = ROUND_SECTOR(bfs->data_start); 170 171 return 0; 172 } 173 174 STATIC int 175 bfs_init_inode(struct bfs *bfs, uint8_t *p, size_t *required_memory) 176 { 177 struct bfs_inode *inode, *root_inode; 178 int i; 179 180 if (!bfs->io->read_n(bfs->io, p, bfs->start_sector, 181 bfs->data_start >> DEV_BSHIFT)) 182 return EIO; 183 184 bfs->super_block = (struct bfs_super_block *)p; 185 bfs->inode = (struct bfs_inode *)(p + sizeof(struct bfs_super_block)); 186 p += bfs->data_start; 187 188 bfs->n_inode = 0; 189 inode = bfs->inode; 190 root_inode = 0; 191 for (i = 0; i < bfs->max_inode; i++, inode++) { 192 if (inode->number != 0) { 193 bfs->n_inode++; 194 if (inode->number == BFS_ROOT_INODE) 195 root_inode = inode; 196 } 197 } 198 DPRINTF(bfs->debug, "inode: %d/%d\n", bfs->n_inode, bfs->max_inode); 199 200 if (root_inode == 0) { 201 DPRINTF(bfs->debug, "no root directory.\n"); 202 return ENOTDIR; 203 } 204 /* dirent table size */ 205 DPRINTF(bfs->debug, "root inode: %d-%d\n", root_inode->start_sector, 206 root_inode->end_sector); 207 bfs->root_inode = root_inode; 208 209 *required_memory = (root_inode->end_sector - 210 root_inode->start_sector + 1) << DEV_BSHIFT; 211 212 return 0; 213 } 214 215 STATIC int 216 bfs_init_dirent(struct bfs *bfs, uint8_t *p) 217 { 218 struct bfs_dirent *file; 219 struct bfs_inode *inode = bfs->root_inode; 220 int i, n; 221 222 n = inode->end_sector - inode->start_sector + 1; 223 224 if (!bfs->io->read_n(bfs->io, p, 225 bfs->start_sector + inode->start_sector, n)) 226 return EIO; 227 228 bfs->dirent = (struct bfs_dirent *)p; 229 bfs->max_dirent = (n << DEV_BSHIFT) / sizeof(struct bfs_dirent); 230 231 file = bfs->dirent; 232 bfs->n_dirent = 0; 233 for (i = 0; i < bfs->max_dirent; i++, file++) 234 if (file->inode != 0) 235 bfs->n_dirent++; 236 237 DPRINTF(bfs->debug, "dirent: %d/%d\n", bfs->n_dirent, bfs->max_dirent); 238 239 return 0; 240 } 241 242 int 243 bfs_file_read(const struct bfs *bfs, const char *fname, void *buf, size_t bufsz, 244 size_t *read_size) 245 { 246 int start, end, n; 247 size_t sz; 248 uint8_t tmpbuf[DEV_BSIZE]; 249 uint8_t *p; 250 251 if (!bfs_file_lookup(bfs, fname, &start, &end, &sz)) 252 return ENOENT; 253 254 if (sz > bufsz) 255 return ENOMEM; 256 257 p = buf; 258 n = end - start; 259 if (!bfs->io->read_n(bfs->io, p, start, n)) 260 return EIO; 261 /* last sector */ 262 n *= DEV_BSIZE; 263 if (!bfs->io->read(bfs->io, tmpbuf, end)) 264 return EIO; 265 memcpy(p + n, tmpbuf, sz - n); 266 267 if (read_size) 268 *read_size = sz; 269 270 return 0; 271 } 272 273 int 274 bfs_file_write(struct bfs *bfs, const char *fname, void *buf, 275 size_t bufsz) 276 { 277 struct bfs_fileattr attr; 278 struct bfs_dirent *dirent; 279 char name[BFS_FILENAME_MAXLEN]; 280 int err; 281 282 strncpy(name, fname, BFS_FILENAME_MAXLEN); 283 284 if (bfs_dirent_lookup_by_name(bfs, name, &dirent)) { 285 struct bfs_inode *inode; 286 if (!bfs_inode_lookup(bfs, dirent->inode, &inode)) { 287 DPRINTF(bfs->debug, "%s: dirent found, but inode " 288 "not found. inconsistent filesystem.\n", 289 __func__); 290 return ENOENT; 291 } 292 attr = inode->attr; /* copy old attribute */ 293 bfs_file_delete(bfs, name); 294 if ((err = bfs_file_create(bfs, name, buf, bufsz, &attr)) != 0) 295 return err; 296 } else { 297 memset(&attr, 0xff, sizeof attr); /* Set VNOVAL all */ 298 #ifdef _KERNEL 299 attr.atime = time_second; 300 attr.ctime = time_second; 301 attr.mtime = time_second; 302 #endif 303 if ((err = bfs_file_create(bfs, name, buf, bufsz, &attr)) != 0) 304 return err; 305 } 306 307 return 0; 308 } 309 310 int 311 bfs_file_delete(struct bfs *bfs, const char *fname) 312 { 313 struct bfs_inode *inode; 314 struct bfs_dirent *dirent; 315 316 if (!bfs_dirent_lookup_by_name(bfs, fname, &dirent)) 317 return ENOENT; 318 319 if (!bfs_inode_lookup(bfs, dirent->inode, &inode)) 320 return ENOENT; 321 322 memset(dirent, 0, sizeof *dirent); 323 memset(inode, 0, sizeof *inode); 324 bfs->n_inode--; 325 bfs->n_dirent--; 326 327 bfs_writeback_dirent(bfs, dirent, false); 328 bfs_writeback_inode(bfs, inode); 329 DPRINTF(bfs->debug, "%s: \"%s\" deleted.\n", __func__, fname); 330 331 return 0; 332 } 333 334 int 335 bfs_file_rename(struct bfs *bfs, const char *from_name, const char *to_name) 336 { 337 struct bfs_dirent *dirent; 338 int err = 0; 339 340 if (!bfs_dirent_lookup_by_name(bfs, from_name, &dirent)) { 341 err = ENOENT; 342 goto out; 343 } 344 345 bfs_file_delete(bfs, to_name); 346 strncpy(dirent->name, to_name, BFS_FILENAME_MAXLEN); 347 bfs_writeback_dirent(bfs, dirent, false); 348 349 out: 350 DPRINTF(bfs->debug, "%s: \"%s\" -> \"%s\" error=%d.\n", __func__, 351 from_name, to_name, err); 352 353 return err; 354 } 355 356 int 357 bfs_file_create(struct bfs *bfs, const char *fname, void *buf, size_t bufsz, 358 const struct bfs_fileattr *attr) 359 { 360 struct bfs_inode *inode; 361 struct bfs_dirent *file; 362 int i, j, n, start; 363 uint8_t *p, tmpbuf[DEV_BSIZE]; 364 int err; 365 366 /* Find free i-node and data block */ 367 if ((err = bfs_inode_alloc(bfs, &inode, &j, &start)) != 0) 368 return err; 369 370 /* File size (unit block) */ 371 n = (ROUND_SECTOR(bufsz) >> DEV_BSHIFT) - 1; 372 if (n < 0) /* bufsz == 0 */ 373 n = 0; 374 375 if ((start + n) * DEV_BSIZE >= bfs->data_end) { 376 DPRINTF(bfs->debug, "disk full.\n"); 377 return ENOSPC; 378 } 379 380 /* Find free dirent */ 381 for (file = bfs->dirent, i = 0; i < bfs->max_dirent; i++, file++) 382 if (file->inode == 0) 383 break; 384 if (i == bfs->max_dirent) { 385 DPRINTF(bfs->debug, "dirent full.\n"); 386 return ENOSPC; 387 } 388 389 /* i-node */ 390 memset(inode, 0, sizeof *inode); 391 inode->number = j; 392 inode->start_sector = start; 393 inode->end_sector = start + n; 394 inode->eof_offset_byte = start * DEV_BSIZE + bufsz - 1; 395 /* i-node attribute */ 396 inode->attr.type = 1; 397 inode->attr.mode = 0; 398 inode->attr.nlink = 1; 399 bfs_inode_set_attr(bfs, inode, attr); 400 401 /* Dirent */ 402 memset(file, 0, sizeof *file); 403 file->inode = inode->number; 404 strncpy(file->name, fname, BFS_FILENAME_MAXLEN); 405 406 DPRINTF(bfs->debug, "%s: start %d end %d\n", __func__, 407 inode->start_sector, inode->end_sector); 408 409 if (buf != 0) { 410 p = (uint8_t *)buf; 411 /* Data block */ 412 n = 0; 413 for (i = inode->start_sector; i < inode->end_sector; i++) { 414 if (!bfs->io->write(bfs->io, p, bfs->start_sector + i)) 415 return EIO; 416 p += DEV_BSIZE; 417 n += DEV_BSIZE; 418 } 419 /* last sector */ 420 memset(tmpbuf, 0, DEV_BSIZE); 421 memcpy(tmpbuf, p, bufsz - n); 422 if (!bfs->io->write(bfs->io, tmpbuf, bfs->start_sector + i)) 423 return EIO; 424 } 425 /* Update */ 426 bfs->n_inode++; 427 bfs->n_dirent++; 428 bfs_writeback_dirent(bfs, file, true); 429 bfs_writeback_inode(bfs, inode); 430 431 return 0; 432 } 433 434 STATIC bool 435 bfs_writeback_dirent(const struct bfs *bfs, struct bfs_dirent *dir, 436 bool create) 437 { 438 struct bfs_dirent *dir_base = bfs->dirent; 439 struct bfs_inode *root_inode = bfs->root_inode; 440 uintptr_t eof; 441 int i; 442 443 i = ((dir - dir_base) * sizeof *dir) >> DEV_BSHIFT; 444 445 eof = (uintptr_t)(dir + 1) - 1; 446 eof = eof - (uintptr_t)dir_base + 447 (root_inode->start_sector << DEV_BSHIFT); 448 449 /* update root directory inode */ 450 #if 0 451 printf("eof new=%d old=%d\n", eof, root_inode->eof_offset_byte); 452 #endif 453 if (create) { 454 if (eof > root_inode->eof_offset_byte) { 455 root_inode->eof_offset_byte = eof; 456 } 457 } else { 458 /* delete the last entry */ 459 if (eof == root_inode->eof_offset_byte) { 460 root_inode->eof_offset_byte = eof - sizeof *dir; 461 } 462 } 463 bfs_writeback_inode(bfs, root_inode); 464 465 /* update dirent */ 466 return bfs->io->write(bfs->io, (uint8_t *)dir_base + (i << DEV_BSHIFT), 467 bfs->start_sector + bfs->root_inode->start_sector + i); 468 } 469 470 STATIC bool 471 bfs_writeback_inode(const struct bfs *bfs, struct bfs_inode *inode) 472 { 473 struct bfs_inode *inode_base = bfs->inode; 474 int i; 475 476 i = ((inode - inode_base) * sizeof *inode) >> DEV_BSHIFT; 477 478 return bfs->io->write(bfs->io, 479 (uint8_t *)inode_base + (i << DEV_BSHIFT), 480 bfs->start_sector + 1/*super block*/ + i); 481 } 482 483 bool 484 bfs_file_lookup(const struct bfs *bfs, const char *fname, int *start, int *end, 485 size_t *size) 486 { 487 struct bfs_inode *inode; 488 struct bfs_dirent *dirent; 489 490 if (!bfs_dirent_lookup_by_name(bfs, fname, &dirent)) 491 return false; 492 if (!bfs_inode_lookup(bfs, dirent->inode, &inode)) 493 return false; 494 495 if (start) 496 *start = inode->start_sector + bfs->start_sector; 497 if (end) 498 *end = inode->end_sector + bfs->start_sector; 499 if (size) 500 *size = bfs_file_size(inode); 501 502 DPRINTF(bfs->debug, "%s: %d + %d -> %d (%zd)\n", 503 fname, bfs->start_sector, inode->start_sector, 504 inode->end_sector, *size); 505 506 return true; 507 } 508 509 bool 510 bfs_dirent_lookup_by_inode(const struct bfs *bfs, int inode, 511 struct bfs_dirent **dirent) 512 { 513 struct bfs_dirent *file; 514 int i; 515 516 for (file = bfs->dirent, i = 0; i < bfs->max_dirent; i++, file++) 517 if (file->inode == inode) 518 break; 519 520 if (i == bfs->max_dirent) 521 return false; 522 523 *dirent = file; 524 525 return true; 526 } 527 528 bool 529 bfs_dirent_lookup_by_name(const struct bfs *bfs, const char *fname, 530 struct bfs_dirent **dirent) 531 { 532 struct bfs_dirent *file; 533 int i; 534 535 for (file = bfs->dirent, i = 0; i < bfs->max_dirent; i++, file++) 536 if ((file->inode != 0) && 537 (strncmp(file->name, fname, BFS_FILENAME_MAXLEN) ==0)) 538 break; 539 540 if (i == bfs->max_dirent) 541 return false; 542 543 *dirent = file; 544 545 return true; 546 } 547 548 bool 549 bfs_inode_lookup(const struct bfs *bfs, ino_t n, struct bfs_inode **iinode) 550 { 551 struct bfs_inode *inode; 552 int i; 553 554 for (inode = bfs->inode, i = 0; i < bfs->max_inode; i++, inode++) 555 if (inode->number == n) 556 break; 557 558 if (i == bfs->max_inode) 559 return false; 560 561 *iinode = inode; 562 563 return true; 564 } 565 566 size_t 567 bfs_file_size(const struct bfs_inode *inode) 568 { 569 570 return inode->eof_offset_byte - inode->start_sector * DEV_BSIZE + 1; 571 } 572 573 STATIC int 574 bfs_inode_alloc(const struct bfs *bfs, struct bfs_inode **free_inode, 575 int *free_inode_number, int *free_block) 576 { 577 struct bfs_inode *jnode, *inode; 578 int i, j, start; 579 580 j = start = 0; 581 inode = bfs->inode; 582 jnode = 0; 583 584 for (i = BFS_ROOT_INODE; i < bfs->max_inode; i++, inode++) { 585 /* Steal i-node # */ 586 if (j == 0) 587 j = i; 588 589 /* Get free i-node */ 590 if (jnode == 0 && (inode->number == 0)) 591 jnode = inode; 592 593 /* Get free i-node # and data block */ 594 if (inode->number != 0) { 595 if (inode->end_sector > start) 596 start = inode->end_sector; 597 if (inode->number == j) 598 j = 0; /* conflict */ 599 } 600 } 601 start++; 602 603 if (jnode == 0) { 604 DPRINTF(bfs->debug, "i-node full.\n"); 605 return ENOSPC; 606 } 607 608 if (start * DEV_BSIZE >= bfs->data_end) { 609 DPRINTF(bfs->debug, "data block full.\n"); 610 /* compaction here ? */ 611 return ENOSPC; 612 } 613 if (free_inode) 614 *free_inode = jnode; 615 if (free_inode_number) 616 *free_inode_number = j; 617 if (free_block) 618 *free_block = start; 619 620 return 0; 621 } 622 623 void 624 bfs_inode_set_attr(const struct bfs *bfs, struct bfs_inode *inode, 625 const struct bfs_fileattr *from) 626 { 627 struct bfs_fileattr *to = &inode->attr; 628 629 if (from != NULL) { 630 if (from->uid != (uid_t)-1) 631 to->uid = from->uid; 632 if (from->gid != (uid_t)-1) 633 to->gid = from->gid; 634 if (from->mode != (mode_t)-1) 635 to->mode = from->mode; 636 if (from->atime != -1) 637 to->atime = from->atime; 638 if (from->ctime != -1) 639 to->ctime = from->ctime; 640 if (from->mtime != -1) 641 to->mtime = from->mtime; 642 } 643 bfs_writeback_inode(bfs, inode); 644 } 645 646 STATIC bool 647 bfs_superblock_valid(const struct bfs_super_block *super) 648 { 649 650 return super->header.magic == BFS_MAGIC; 651 } 652 653 bool 654 bfs_dump(const struct bfs *bfs) 655 { 656 const struct bfs_super_block_header *h; 657 const struct bfs_compaction *compaction; 658 const struct bfs_inode *inode; 659 struct bfs_dirent *file; 660 int i, j, s, e; 661 size_t bytes; 662 663 if (!bfs_superblock_valid(bfs->super_block)) { 664 DPRINTF(bfs->debug, "invalid bfs super block.\n"); 665 return false; 666 } 667 h = &bfs->super_block->header; 668 compaction = &bfs->super_block->compaction; 669 670 DPRINTF(bfs->debug, "super block %zdbyte, inode %zdbyte, dirent %zdbyte\n", 671 sizeof *bfs->super_block, sizeof *inode, sizeof *file); 672 673 DPRINTF(bfs->debug, "magic=%x\n", h->magic); 674 DPRINTF(bfs->debug, "data_start_byte=0x%x\n", h->data_start_byte); 675 DPRINTF(bfs->debug, "data_end_byte=0x%x\n", h->data_end_byte); 676 DPRINTF(bfs->debug, "from=%#x\n", compaction->from); 677 DPRINTF(bfs->debug, "to=%#x\n", compaction->to); 678 DPRINTF(bfs->debug, "from_backup=%#x\n", compaction->from_backup); 679 DPRINTF(bfs->debug, "to_backup=%#x\n", compaction->to_backup); 680 DPRINTF(bfs->debug, "fsname=%s\n", bfs->super_block->fsname); 681 DPRINTF(bfs->debug, "volume=%s\n", bfs->super_block->volume); 682 683 /* inode list */ 684 DPRINTF(bfs->debug, "[inode index list]\n"); 685 for (inode = bfs->inode, i = j = 0; i < bfs->max_inode; inode++, i++) { 686 if (inode->number != 0) { 687 const struct bfs_fileattr *attr = &inode->attr; 688 DPRINTF(bfs->debug, "%3d %8d %8d %8d (%d) ", 689 inode->number, 690 inode->eof_offset_byte - 691 (inode->start_sector * DEV_BSIZE) + 1,/* file size*/ 692 inode->start_sector, 693 inode->end_sector, i); 694 695 DPRINTF(bfs->debug, "%d %d %d %d %d %08x %08x %08x\n", 696 attr->type, attr->mode, attr->uid, attr->gid, 697 attr->nlink, attr->atime, attr->mtime, attr->ctime); 698 j++; 699 } 700 } 701 if (j != bfs->n_inode) { 702 DPRINTF(bfs->debug, "inconsistent cached data. (i-node)\n"); 703 return false; 704 } 705 DPRINTF(bfs->debug, "total %d i-node.\n", j); 706 707 /* file list */ 708 DPRINTF(bfs->debug, "[dirent index list]\n"); 709 DPRINTF(bfs->debug, "%d file entries.\n", bfs->max_dirent); 710 file = bfs->dirent; 711 for (i = j = 0; i < bfs->max_dirent; i++, file++) { 712 if (file->inode != 0) { 713 if (bfs_file_lookup(bfs, file->name, &s, &e, &bytes)) 714 DPRINTF(bfs->debug, "%3d %14s %8d %8d %8zd\n", 715 file->inode, file->name, s, e, bytes); 716 j++; 717 } 718 } 719 if (j != bfs->n_dirent) { 720 DPRINTF(bfs->debug, "inconsistent cached data. (dirent)\n"); 721 return false; 722 } 723 DPRINTF(bfs->debug, "%d files.\n", j); 724 725 return true; 726 } 727