1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1980, 1986, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions and the following disclaimer. 12 * 2. Redistributions in binary form must reproduce the above copyright 13 * notice, this list of conditions and the following disclaimer in the 14 * documentation and/or other materials provided with the distribution. 15 * 3. Neither the name of the University nor the names of its contributors 16 * may be used to endorse or promote products derived from this software 17 * without specific prior written permission. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 * SUCH DAMAGE. 30 */ 31 32 #if 0 33 #ifndef lint 34 static const char sccsid[] = "@(#)pass1.c 8.6 (Berkeley) 4/28/95"; 35 #endif /* not lint */ 36 #endif 37 #include <sys/cdefs.h> 38 __FBSDID("$FreeBSD$"); 39 40 #include <sys/param.h> 41 #include <sys/stat.h> 42 #include <sys/sysctl.h> 43 44 #include <ufs/ufs/dinode.h> 45 #include <ufs/ufs/dir.h> 46 #include <ufs/ffs/fs.h> 47 48 #include <err.h> 49 #include <limits.h> 50 #include <stdint.h> 51 #include <string.h> 52 53 #include "fsck.h" 54 55 static ufs2_daddr_t badblk; 56 static ufs2_daddr_t dupblk; 57 static ino_t lastino; /* last inode in use */ 58 59 static int checkinode(ino_t inumber, struct inodesc *, int rebuildcg); 60 61 void 62 pass1(void) 63 { 64 struct inostat *info; 65 struct inodesc idesc; 66 struct bufarea *cgbp; 67 struct cg *cgp; 68 ino_t inumber, inosused, mininos; 69 ufs2_daddr_t i, cgd; 70 u_int8_t *cp; 71 int c, rebuildcg; 72 73 badblk = dupblk = lastino = 0; 74 75 /* 76 * Set file system reserved blocks in used block map. 77 */ 78 for (c = 0; c < sblock.fs_ncg; c++) { 79 cgd = cgdmin(&sblock, c); 80 if (c == 0) { 81 i = cgbase(&sblock, c); 82 } else 83 i = cgsblock(&sblock, c); 84 for (; i < cgd; i++) 85 setbmap(i); 86 } 87 i = sblock.fs_csaddr; 88 cgd = i + howmany(sblock.fs_cssize, sblock.fs_fsize); 89 for (; i < cgd; i++) 90 setbmap(i); 91 92 /* 93 * Find all allocated blocks. 94 */ 95 memset(&idesc, 0, sizeof(struct inodesc)); 96 idesc.id_func = pass1check; 97 n_files = n_blks = 0; 98 for (c = 0; c < sblock.fs_ncg; c++) { 99 inumber = c * sblock.fs_ipg; 100 cgbp = cglookup(c); 101 cgp = cgbp->b_un.b_cg; 102 rebuildcg = 0; 103 if (!check_cgmagic(c, cgbp, 1)) 104 rebuildcg = 1; 105 if (!rebuildcg && sblock.fs_magic == FS_UFS2_MAGIC) { 106 inosused = cgp->cg_initediblk; 107 if (inosused > sblock.fs_ipg) { 108 pfatal("Too many initialized inodes (%ju > %d) " 109 "in cylinder group %d\nReset to %d\n", 110 (uintmax_t)inosused, sblock.fs_ipg, c, 111 sblock.fs_ipg); 112 inosused = sblock.fs_ipg; 113 } 114 } else { 115 inosused = sblock.fs_ipg; 116 } 117 if (got_siginfo) { 118 printf("%s: phase 1: cyl group %d of %d (%d%%)\n", 119 cdevname, c, sblock.fs_ncg, 120 c * 100 / sblock.fs_ncg); 121 got_siginfo = 0; 122 } 123 if (got_sigalarm) { 124 setproctitle("%s p1 %d%%", cdevname, 125 c * 100 / sblock.fs_ncg); 126 got_sigalarm = 0; 127 } 128 /* 129 * If we are using soft updates, then we can trust the 130 * cylinder group inode allocation maps to tell us which 131 * inodes are allocated. We will scan the used inode map 132 * to find the inodes that are really in use, and then 133 * read only those inodes in from disk. 134 */ 135 if ((preen || inoopt) && usedsoftdep && !rebuildcg) { 136 cp = &cg_inosused(cgp)[(inosused - 1) / CHAR_BIT]; 137 for ( ; inosused != 0; cp--) { 138 if (*cp == 0) { 139 if (inosused > CHAR_BIT) 140 inosused -= CHAR_BIT; 141 else 142 inosused = 0; 143 continue; 144 } 145 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) { 146 if (*cp & i) 147 break; 148 inosused--; 149 } 150 break; 151 } 152 } 153 /* 154 * Allocate inoinfo structures for the allocated inodes. 155 */ 156 inostathead[c].il_numalloced = inosused; 157 if (inosused == 0) { 158 inostathead[c].il_stat = NULL; 159 continue; 160 } 161 info = Calloc((unsigned)inosused, sizeof(struct inostat)); 162 if (info == NULL) 163 errx(EEXIT, "cannot alloc %u bytes for inoinfo", 164 (unsigned)(sizeof(struct inostat) * inosused)); 165 inostathead[c].il_stat = info; 166 /* 167 * Scan the allocated inodes. 168 */ 169 setinodebuf(c, inosused); 170 for (i = 0; i < inosused; i++, inumber++) { 171 if (inumber < UFS_ROOTINO) { 172 (void)getnextinode(inumber, rebuildcg); 173 continue; 174 } 175 /* 176 * NULL return indicates probable end of allocated 177 * inodes during cylinder group rebuild attempt. 178 * We always keep trying until we get to the minimum 179 * valid number for this cylinder group. 180 */ 181 if (checkinode(inumber, &idesc, rebuildcg) == 0 && 182 i > cgp->cg_initediblk) 183 break; 184 } 185 /* 186 * This optimization speeds up future runs of fsck 187 * by trimming down the number of inodes in cylinder 188 * groups that formerly had many inodes but now have 189 * fewer in use. 190 */ 191 mininos = roundup(inosused + INOPB(&sblock), INOPB(&sblock)); 192 if (inoopt && !preen && !rebuildcg && 193 sblock.fs_magic == FS_UFS2_MAGIC && 194 cgp->cg_initediblk > 2 * INOPB(&sblock) && 195 mininos < cgp->cg_initediblk) { 196 i = cgp->cg_initediblk; 197 if (mininos < 2 * INOPB(&sblock)) 198 cgp->cg_initediblk = 2 * INOPB(&sblock); 199 else 200 cgp->cg_initediblk = mininos; 201 pwarn("CYLINDER GROUP %d: RESET FROM %ju TO %d %s\n", 202 c, i, cgp->cg_initediblk, "VALID INODES"); 203 cgdirty(cgbp); 204 } 205 if (inosused < sblock.fs_ipg) 206 continue; 207 lastino += 1; 208 if (lastino < (c * sblock.fs_ipg)) 209 inosused = 0; 210 else 211 inosused = lastino - (c * sblock.fs_ipg); 212 if (rebuildcg && inosused > cgp->cg_initediblk && 213 sblock.fs_magic == FS_UFS2_MAGIC) { 214 cgp->cg_initediblk = roundup(inosused, INOPB(&sblock)); 215 pwarn("CYLINDER GROUP %d: FOUND %d VALID INODES\n", c, 216 cgp->cg_initediblk); 217 } 218 /* 219 * If we were not able to determine in advance which inodes 220 * were in use, then reduce the size of the inoinfo structure 221 * to the size necessary to describe the inodes that we 222 * really found. Always leave map space in the first cylinder 223 * group in case we need to a root or lost+found directory. 224 */ 225 if (inumber == lastino || c == 0) 226 continue; 227 inostathead[c].il_numalloced = inosused; 228 if (inosused == 0) { 229 free(inostathead[c].il_stat); 230 inostathead[c].il_stat = NULL; 231 continue; 232 } 233 info = Calloc((unsigned)inosused, sizeof(struct inostat)); 234 if (info == NULL) 235 errx(EEXIT, "cannot alloc %u bytes for inoinfo", 236 (unsigned)(sizeof(struct inostat) * inosused)); 237 memmove(info, inostathead[c].il_stat, inosused * sizeof(*info)); 238 free(inostathead[c].il_stat); 239 inostathead[c].il_stat = info; 240 } 241 freeinodebuf(); 242 } 243 244 static int 245 checkinode(ino_t inumber, struct inodesc *idesc, int rebuildcg) 246 { 247 struct inode ip; 248 union dinode *dp; 249 off_t kernmaxfilesize; 250 ufs2_daddr_t ndb; 251 mode_t mode; 252 intmax_t size, fixsize; 253 int j, ret, offset; 254 255 if ((dp = getnextinode(inumber, rebuildcg)) == NULL) { 256 pfatal("INVALID INODE"); 257 goto unknown; 258 } 259 mode = DIP(dp, di_mode) & IFMT; 260 if (mode == 0) { 261 if ((sblock.fs_magic == FS_UFS1_MAGIC && 262 (memcmp(dp->dp1.di_db, zino.dp1.di_db, 263 UFS_NDADDR * sizeof(ufs1_daddr_t)) || 264 memcmp(dp->dp1.di_ib, zino.dp1.di_ib, 265 UFS_NIADDR * sizeof(ufs1_daddr_t)) || 266 dp->dp1.di_mode || dp->dp1.di_size)) || 267 (sblock.fs_magic == FS_UFS2_MAGIC && 268 (memcmp(dp->dp2.di_db, zino.dp2.di_db, 269 UFS_NDADDR * sizeof(ufs2_daddr_t)) || 270 memcmp(dp->dp2.di_ib, zino.dp2.di_ib, 271 UFS_NIADDR * sizeof(ufs2_daddr_t)) || 272 dp->dp2.di_mode || dp->dp2.di_size))) { 273 pfatal("PARTIALLY ALLOCATED INODE I=%lu", 274 (u_long)inumber); 275 if (reply("CLEAR") == 1) { 276 ginode(inumber, &ip); 277 clearinode(ip.i_dp); 278 inodirty(&ip); 279 irelse(&ip); 280 } 281 } 282 inoinfo(inumber)->ino_state = USTATE; 283 return (1); 284 } 285 lastino = inumber; 286 /* This should match the file size limit in ffs_mountfs(). */ 287 if (sblock.fs_magic == FS_UFS1_MAGIC) 288 kernmaxfilesize = (off_t)0x40000000 * sblock.fs_bsize - 1; 289 else 290 kernmaxfilesize = sblock.fs_maxfilesize; 291 if (DIP(dp, di_size) > kernmaxfilesize || 292 DIP(dp, di_size) > sblock.fs_maxfilesize || 293 (mode == IFDIR && DIP(dp, di_size) > MAXDIRSIZE)) { 294 if (debug) 295 printf("bad size %ju:", (uintmax_t)DIP(dp, di_size)); 296 pfatal("BAD FILE SIZE"); 297 goto unknown; 298 } 299 if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) { 300 ginode(inumber, &ip); 301 dp = ip.i_dp; 302 DIP_SET(dp, di_size, sblock.fs_fsize); 303 DIP_SET(dp, di_mode, IFREG|0600); 304 inodirty(&ip); 305 irelse(&ip); 306 } 307 if ((mode == IFBLK || mode == IFCHR || mode == IFIFO || 308 mode == IFSOCK) && DIP(dp, di_size) != 0) { 309 if (debug) 310 printf("bad special-file size %ju:", 311 (uintmax_t)DIP(dp, di_size)); 312 pfatal("BAD SPECIAL-FILE SIZE"); 313 goto unknown; 314 } 315 if ((mode == IFBLK || mode == IFCHR) && 316 (dev_t)DIP(dp, di_rdev) == NODEV) { 317 if (debug) 318 printf("bad special-file rdev NODEV:"); 319 pfatal("BAD SPECIAL-FILE RDEV"); 320 goto unknown; 321 } 322 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize); 323 if (ndb < 0) { 324 if (debug) 325 printf("negative size %ju ndb %ju:", 326 (uintmax_t)DIP(dp, di_size), (uintmax_t)ndb); 327 pfatal("NEGATIVE FILE SIZE"); 328 goto unknown; 329 } 330 if (mode == IFBLK || mode == IFCHR) 331 ndb++; 332 if (mode == IFLNK) { 333 /* 334 * Fake ndb value so direct/indirect block checks below 335 * will detect any garbage after symlink string. 336 */ 337 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) { 338 if (sblock.fs_magic == FS_UFS1_MAGIC) 339 ndb = howmany(DIP(dp, di_size), 340 sizeof(ufs1_daddr_t)); 341 else 342 ndb = howmany(DIP(dp, di_size), 343 sizeof(ufs2_daddr_t)); 344 if (ndb > UFS_NDADDR) { 345 j = ndb - UFS_NDADDR; 346 for (ndb = 1; j > 1; j--) 347 ndb *= NINDIR(&sblock); 348 ndb += UFS_NDADDR; 349 } 350 } 351 } 352 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++) { 353 if (DIP(dp, di_db[j]) == 0) 354 continue; 355 if (debug) 356 printf("invalid direct addr[%d]: %ju\n", j, 357 (uintmax_t)DIP(dp, di_db[j])); 358 pfatal("INVALID DIRECT BLOCK"); 359 ginode(inumber, &ip); 360 prtinode(&ip); 361 if (reply("CLEAR") == 1) { 362 DIP_SET(ip.i_dp, di_db[j], 0); 363 inodirty(&ip); 364 } 365 irelse(&ip); 366 } 367 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++) 368 ndb /= NINDIR(&sblock); 369 for (; j < UFS_NIADDR; j++) { 370 if (DIP(dp, di_ib[j]) == 0) 371 continue; 372 if (debug) 373 printf("invalid indirect addr: %ju\n", 374 (uintmax_t)DIP(dp, di_ib[j])); 375 pfatal("INVALID INDIRECT BLOCK"); 376 ginode(inumber, &ip); 377 prtinode(&ip); 378 if (reply("CLEAR") == 1) { 379 DIP_SET(ip.i_dp, di_ib[j], 0); 380 inodirty(&ip); 381 } 382 irelse(&ip); 383 } 384 if (ftypeok(dp) == 0) { 385 pfatal("UNKNOWN FILE TYPE"); 386 goto unknown; 387 } 388 n_files++; 389 inoinfo(inumber)->ino_linkcnt = DIP(dp, di_nlink); 390 if (mode == IFDIR) { 391 if (DIP(dp, di_size) == 0) { 392 inoinfo(inumber)->ino_state = DCLEAR; 393 } else if (DIP(dp, di_nlink) <= 0) { 394 inoinfo(inumber)->ino_state = DZLINK; 395 } else { 396 inoinfo(inumber)->ino_state = DSTATE; 397 cacheino(dp, inumber); 398 countdirs++; 399 } 400 } else if (DIP(dp, di_nlink) <= 0) 401 inoinfo(inumber)->ino_state = FZLINK; 402 else 403 inoinfo(inumber)->ino_state = FSTATE; 404 inoinfo(inumber)->ino_type = IFTODT(mode); 405 badblk = dupblk = 0; 406 idesc->id_number = inumber; 407 if (DIP(dp, di_flags) & SF_SNAPSHOT) 408 inoinfo(inumber)->ino_idtype = SNAP; 409 else 410 inoinfo(inumber)->ino_idtype = ADDR; 411 idesc->id_type = inoinfo(inumber)->ino_idtype; 412 (void)ckinode(dp, idesc); 413 if (sblock.fs_magic == FS_UFS2_MAGIC && dp->dp2.di_extsize > 0) { 414 ndb = howmany(dp->dp2.di_extsize, sblock.fs_bsize); 415 for (j = 0; j < UFS_NXADDR; j++) { 416 if (--ndb == 0 && 417 (offset = blkoff(&sblock, dp->dp2.di_extsize)) != 0) 418 idesc->id_numfrags = numfrags(&sblock, 419 fragroundup(&sblock, offset)); 420 else 421 idesc->id_numfrags = sblock.fs_frag; 422 if (dp->dp2.di_extb[j] == 0) 423 continue; 424 idesc->id_blkno = dp->dp2.di_extb[j]; 425 ret = (*idesc->id_func)(idesc); 426 if (ret & STOP) 427 break; 428 } 429 } 430 if (sblock.fs_magic == FS_UFS2_MAGIC) 431 eascan(idesc, &dp->dp2); 432 idesc->id_entryno *= btodb(sblock.fs_fsize); 433 if (DIP(dp, di_blocks) != idesc->id_entryno) { 434 pwarn("INCORRECT BLOCK COUNT I=%lu (%ju should be %ju)", 435 (u_long)inumber, (uintmax_t)DIP(dp, di_blocks), 436 (uintmax_t)idesc->id_entryno); 437 if (preen) 438 printf(" (CORRECTED)\n"); 439 else if (reply("CORRECT") == 0) 440 return (1); 441 if (bkgrdflag == 0) { 442 ginode(inumber, &ip); 443 DIP_SET(ip.i_dp, di_blocks, idesc->id_entryno); 444 inodirty(&ip); 445 irelse(&ip); 446 } else { 447 cmd.value = idesc->id_number; 448 cmd.size = idesc->id_entryno - DIP(dp, di_blocks); 449 if (debug) 450 printf("adjblkcnt ino %ju amount %lld\n", 451 (uintmax_t)cmd.value, (long long)cmd.size); 452 if (sysctl(adjblkcnt, MIBSIZE, 0, 0, 453 &cmd, sizeof cmd) == -1) 454 rwerror("ADJUST INODE BLOCK COUNT", cmd.value); 455 } 456 } 457 /* 458 * UFS does not allow files to end with a hole; it requires that 459 * the last block of a file be allocated. The last allocated block 460 * in a file is tracked in id_lballoc. Here, we check for a size 461 * past the last allocated block of the file and if that is found, 462 * shorten the file to reference the last allocated block to avoid 463 * having it reference a hole at its end. 464 * 465 * Soft updates will always ensure that the file size is correct 466 * for files that contain only direct block pointers. However 467 * soft updates does not roll back sizes for files with indirect 468 * blocks that it has set to unallocated because their contents 469 * have not yet been written to disk. Hence, the file can appear 470 * to have a hole at its end because the block pointer has been 471 * rolled back to zero. Thus finding a hole at the end of a file 472 * that is located in an indirect block receives only a warning 473 * while finding a hole at the end of a file in a direct block 474 * receives a fatal error message. 475 */ 476 size = DIP(dp, di_size); 477 if (idesc->id_lballoc < lblkno(&sblock, size - 1) && 478 /* exclude embedded symbolic links */ 479 ((mode != IFLNK) || size >= sblock.fs_maxsymlinklen)) { 480 fixsize = lblktosize(&sblock, idesc->id_lballoc + 1); 481 if (size > UFS_NDADDR * sblock.fs_bsize) 482 pwarn("INODE %lu: FILE SIZE %ju BEYOND END OF " 483 "ALLOCATED FILE, SIZE SHOULD BE %ju", 484 (u_long)inumber, size, fixsize); 485 else 486 pfatal("INODE %lu: FILE SIZE %ju BEYOND END OF " 487 "ALLOCATED FILE, SIZE SHOULD BE %ju", 488 (u_long)inumber, size, fixsize); 489 if (preen) 490 printf(" (ADJUSTED)\n"); 491 else if (reply("ADJUST") == 0) 492 return (1); 493 if (bkgrdflag == 0) { 494 ginode(inumber, &ip); 495 DIP_SET(ip.i_dp, di_size, fixsize); 496 inodirty(&ip); 497 irelse(&ip); 498 } else { 499 cmd.value = idesc->id_number; 500 cmd.size = fixsize; 501 if (debug) 502 printf("setsize ino %ju size set to %ju\n", 503 (uintmax_t)cmd.value, (uintmax_t)cmd.size); 504 if (sysctl(setsize, MIBSIZE, 0, 0, 505 &cmd, sizeof cmd) == -1) 506 rwerror("SET INODE SIZE", cmd.value); 507 } 508 509 } 510 return (1); 511 unknown: 512 ginode(inumber, &ip); 513 prtinode(&ip); 514 inoinfo(inumber)->ino_state = USTATE; 515 if (reply("CLEAR") == 1) { 516 clearinode(ip.i_dp); 517 inodirty(&ip); 518 } 519 irelse(&ip); 520 return (1); 521 } 522 523 int 524 pass1check(struct inodesc *idesc) 525 { 526 int res = KEEPON; 527 int anyout, nfrags; 528 ufs2_daddr_t blkno = idesc->id_blkno; 529 struct dups *dlp; 530 struct dups *new; 531 532 if (idesc->id_type == SNAP) { 533 if (blkno == BLK_NOCOPY) 534 return (KEEPON); 535 if (idesc->id_number == cursnapshot) { 536 if (blkno == blkstofrags(&sblock, idesc->id_lbn)) 537 return (KEEPON); 538 if (blkno == BLK_SNAP) { 539 blkno = blkstofrags(&sblock, idesc->id_lbn); 540 idesc->id_entryno -= idesc->id_numfrags; 541 } 542 } else { 543 if (blkno == BLK_SNAP) 544 return (KEEPON); 545 } 546 } 547 if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) { 548 blkerror(idesc->id_number, "BAD", blkno); 549 if (badblk++ >= MAXBAD) { 550 pwarn("EXCESSIVE BAD BLKS I=%lu", 551 (u_long)idesc->id_number); 552 if (preen) 553 printf(" (SKIPPING)\n"); 554 else if (reply("CONTINUE") == 0) { 555 ckfini(0); 556 exit(EEXIT); 557 } 558 rerun = 1; 559 return (STOP); 560 } 561 } 562 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { 563 if (anyout && chkrange(blkno, 1)) { 564 res = SKIP; 565 } else if (!testbmap(blkno)) { 566 n_blks++; 567 setbmap(blkno); 568 } else { 569 blkerror(idesc->id_number, "DUP", blkno); 570 if (dupblk++ >= MAXDUP) { 571 pwarn("EXCESSIVE DUP BLKS I=%lu", 572 (u_long)idesc->id_number); 573 if (preen) 574 printf(" (SKIPPING)\n"); 575 else if (reply("CONTINUE") == 0) { 576 ckfini(0); 577 exit(EEXIT); 578 } 579 rerun = 1; 580 return (STOP); 581 } 582 new = (struct dups *)Malloc(sizeof(struct dups)); 583 if (new == NULL) { 584 pfatal("DUP TABLE OVERFLOW."); 585 if (reply("CONTINUE") == 0) { 586 ckfini(0); 587 exit(EEXIT); 588 } 589 rerun = 1; 590 return (STOP); 591 } 592 new->dup = blkno; 593 if (muldup == NULL) { 594 duplist = muldup = new; 595 new->next = NULL; 596 } else { 597 new->next = muldup->next; 598 muldup->next = new; 599 } 600 for (dlp = duplist; dlp != muldup; dlp = dlp->next) 601 if (dlp->dup == blkno) 602 break; 603 if (dlp == muldup && dlp->dup != blkno) 604 muldup = new; 605 } 606 /* 607 * count the number of blocks found in id_entryno 608 */ 609 idesc->id_entryno++; 610 } 611 if (idesc->id_level == 0 && idesc->id_lballoc < idesc->id_lbn) 612 idesc->id_lballoc = idesc->id_lbn; 613 return (res); 614 } 615