1 /*- 2 * Copyright (c) 1980, 1988, 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 #if 0 36 static char sccsid[] = "@(#)traverse.c 8.7 (Berkeley) 6/15/95"; 37 #endif 38 static const char rcsid[] = 39 "$FreeBSD$"; 40 #endif /* not lint */ 41 42 #include <sys/param.h> 43 #include <sys/stat.h> 44 45 #include <ufs/ufs/dir.h> 46 #include <ufs/ufs/dinode.h> 47 #include <ufs/ffs/fs.h> 48 49 #include <protocols/dumprestore.h> 50 51 #include <ctype.h> 52 #include <stdio.h> 53 #ifdef __STDC__ 54 #include <errno.h> 55 #include <string.h> 56 #include <unistd.h> 57 #endif 58 59 #include "dump.h" 60 61 #define HASDUMPEDFILE 0x1 62 #define HASSUBDIRS 0x2 63 64 #ifdef FS_44INODEFMT 65 typedef quad_t fsizeT; 66 #else 67 typedef long fsizeT; 68 #endif 69 70 static int dirindir __P((ino_t ino, daddr_t blkno, int level, long *size, 71 long *tapesize, int nodump)); 72 static void dmpindir __P((ino_t ino, daddr_t blk, int level, fsizeT *size)); 73 static int searchdir __P((ino_t ino, daddr_t blkno, long size, long filesize, 74 long *tapesize, int nodump)); 75 76 /* 77 * This is an estimation of the number of TP_BSIZE blocks in the file. 78 * It estimates the number of blocks in files with holes by assuming 79 * that all of the blocks accounted for by di_blocks are data blocks 80 * (when some of the blocks are usually used for indirect pointers); 81 * hence the estimate may be high. 82 */ 83 long 84 blockest(dp) 85 struct dinode *dp; 86 { 87 long blkest, sizeest; 88 89 /* 90 * dp->di_size is the size of the file in bytes. 91 * dp->di_blocks stores the number of sectors actually in the file. 92 * If there are more sectors than the size would indicate, this just 93 * means that there are indirect blocks in the file or unused 94 * sectors in the last file block; we can safely ignore these 95 * (blkest = sizeest below). 96 * If the file is bigger than the number of sectors would indicate, 97 * then the file has holes in it. In this case we must use the 98 * block count to estimate the number of data blocks used, but 99 * we use the actual size for estimating the number of indirect 100 * dump blocks (sizeest vs. blkest in the indirect block 101 * calculation). 102 */ 103 blkest = howmany(dbtob(dp->di_blocks), TP_BSIZE); 104 sizeest = howmany(dp->di_size, TP_BSIZE); 105 if (blkest > sizeest) 106 blkest = sizeest; 107 if (dp->di_size > sblock->fs_bsize * NDADDR) { 108 /* calculate the number of indirect blocks on the dump tape */ 109 blkest += 110 howmany(sizeest - NDADDR * sblock->fs_bsize / TP_BSIZE, 111 TP_NINDIR); 112 } 113 return (blkest + 1); 114 } 115 116 /* Auxiliary macro to pick up files changed since previous dump. */ 117 #define CHANGEDSINCE(dp, t) \ 118 ((dp)->di_mtime >= (t) || (dp)->di_ctime >= (t)) 119 120 /* The WANTTODUMP macro decides whether a file should be dumped. */ 121 #ifdef UF_NODUMP 122 #define WANTTODUMP(dp) \ 123 (CHANGEDSINCE(dp, spcl.c_ddate) && \ 124 (nonodump || ((dp)->di_flags & UF_NODUMP) != UF_NODUMP)) 125 #else 126 #define WANTTODUMP(dp) CHANGEDSINCE(dp, spcl.c_ddate) 127 #endif 128 129 /* 130 * Dump pass 1. 131 * 132 * Walk the inode list for a filesystem to find all allocated inodes 133 * that have been modified since the previous dump time. Also, find all 134 * the directories in the filesystem. 135 */ 136 int 137 mapfiles(maxino, tapesize) 138 ino_t maxino; 139 long *tapesize; 140 { 141 int mode; 142 ino_t ino; 143 struct dinode *dp; 144 int anydirskipped = 0; 145 146 for (ino = ROOTINO; ino < maxino; ino++) { 147 dp = getino(ino); 148 if ((mode = (dp->di_mode & IFMT)) == 0) 149 continue; 150 /* 151 * Everything must go in usedinomap so that a check 152 * for "in dumpdirmap but not in usedinomap" to detect 153 * dirs with nodump set has a chance of succeeding 154 * (this is used in mapdirs()). 155 */ 156 SETINO(ino, usedinomap); 157 if (mode == IFDIR) 158 SETINO(ino, dumpdirmap); 159 if (WANTTODUMP(dp)) { 160 SETINO(ino, dumpinomap); 161 if (mode != IFREG && mode != IFDIR && mode != IFLNK) 162 *tapesize += 1; 163 else 164 *tapesize += blockest(dp); 165 continue; 166 } 167 if (mode == IFDIR) { 168 if (!nonodump && (dp->di_flags & UF_NODUMP)) 169 CLRINO(ino, usedinomap); 170 anydirskipped = 1; 171 } 172 } 173 /* 174 * Restore gets very upset if the root is not dumped, 175 * so ensure that it always is dumped. 176 */ 177 SETINO(ROOTINO, dumpinomap); 178 return (anydirskipped); 179 } 180 181 /* 182 * Dump pass 2. 183 * 184 * Scan each directory on the filesystem to see if it has any modified 185 * files in it. If it does, and has not already been added to the dump 186 * list (because it was itself modified), then add it. If a directory 187 * has not been modified itself, contains no modified files and has no 188 * subdirectories, then it can be deleted from the dump list and from 189 * the list of directories. By deleting it from the list of directories, 190 * its parent may now qualify for the same treatment on this or a later 191 * pass using this algorithm. 192 */ 193 int 194 mapdirs(maxino, tapesize) 195 ino_t maxino; 196 long *tapesize; 197 { 198 struct dinode *dp; 199 int i, isdir, nodump; 200 char *map; 201 ino_t ino; 202 struct dinode di; 203 long filesize; 204 int ret, change = 0; 205 206 isdir = 0; /* XXX just to get gcc to shut up */ 207 for (map = dumpdirmap, ino = 1; ino < maxino; ino++) { 208 if (((ino - 1) % NBBY) == 0) /* map is offset by 1 */ 209 isdir = *map++; 210 else 211 isdir >>= 1; 212 /* 213 * If a directory has been removed from usedinomap, it 214 * either has the nodump flag set, or has inherited 215 * it. Although a directory can't be in dumpinomap if 216 * it isn't in usedinomap, we have to go through it to 217 * propagate the nodump flag. 218 */ 219 nodump = !nonodump && (TSTINO(ino, usedinomap) == 0); 220 if ((isdir & 1) == 0 || (TSTINO(ino, dumpinomap) && !nodump)) 221 continue; 222 dp = getino(ino); 223 di = *dp; /* inode buf may change in searchdir(). */ 224 filesize = di.di_size; 225 for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) { 226 if (di.di_db[i] != 0) 227 ret |= searchdir(ino, di.di_db[i], 228 (long)dblksize(sblock, dp, i), 229 filesize, tapesize, nodump); 230 if (ret & HASDUMPEDFILE) 231 filesize = 0; 232 else 233 filesize -= sblock->fs_bsize; 234 } 235 for (i = 0; filesize > 0 && i < NIADDR; i++) { 236 if (di.di_ib[i] == 0) 237 continue; 238 ret |= dirindir(ino, di.di_ib[i], i, &filesize, 239 tapesize, nodump); 240 } 241 if (ret & HASDUMPEDFILE) { 242 SETINO(ino, dumpinomap); 243 *tapesize += blockest(dp); 244 change = 1; 245 continue; 246 } 247 if (nodump) { 248 if (ret & HASSUBDIRS) 249 change = 1; /* subdirs inherit nodump */ 250 CLRINO(ino, dumpdirmap); 251 } else if ((ret & HASSUBDIRS) == 0) 252 if (!TSTINO(ino, dumpinomap)) { 253 CLRINO(ino, dumpdirmap); 254 change = 1; 255 } 256 } 257 return (change); 258 } 259 260 /* 261 * Read indirect blocks, and pass the data blocks to be searched 262 * as directories. Quit as soon as any entry is found that will 263 * require the directory to be dumped. 264 */ 265 static int 266 dirindir(ino, blkno, ind_level, filesize, tapesize, nodump) 267 ino_t ino; 268 daddr_t blkno; 269 int ind_level; 270 long *filesize; 271 long *tapesize; 272 int nodump; 273 { 274 int ret = 0; 275 int i; 276 daddr_t idblk[MAXNINDIR]; 277 278 bread(fsbtodb(sblock, blkno), (char *)idblk, (int)sblock->fs_bsize); 279 if (ind_level <= 0) { 280 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { 281 blkno = idblk[i]; 282 if (blkno != 0) 283 ret |= searchdir(ino, blkno, sblock->fs_bsize, 284 *filesize, tapesize, nodump); 285 if (ret & HASDUMPEDFILE) 286 *filesize = 0; 287 else 288 *filesize -= sblock->fs_bsize; 289 } 290 return (ret); 291 } 292 ind_level--; 293 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { 294 blkno = idblk[i]; 295 if (blkno != 0) 296 ret |= dirindir(ino, blkno, ind_level, filesize, 297 tapesize, nodump); 298 } 299 return (ret); 300 } 301 302 /* 303 * Scan a disk block containing directory information looking to see if 304 * any of the entries are on the dump list and to see if the directory 305 * contains any subdirectories. 306 */ 307 static int 308 searchdir(ino, blkno, size, filesize, tapesize, nodump) 309 ino_t ino; 310 daddr_t blkno; 311 long size; 312 long filesize; 313 long *tapesize; 314 int nodump; 315 { 316 struct direct *dp; 317 struct dinode *ip; 318 long loc, ret = 0; 319 char dblk[MAXBSIZE]; 320 321 bread(fsbtodb(sblock, blkno), dblk, (int)size); 322 if (filesize < size) 323 size = filesize; 324 for (loc = 0; loc < size; ) { 325 dp = (struct direct *)(dblk + loc); 326 if (dp->d_reclen == 0) { 327 msg("corrupted directory, inumber %d\n", ino); 328 break; 329 } 330 loc += dp->d_reclen; 331 if (dp->d_ino == 0) 332 continue; 333 if (dp->d_name[0] == '.') { 334 if (dp->d_name[1] == '\0') 335 continue; 336 if (dp->d_name[1] == '.' && dp->d_name[2] == '\0') 337 continue; 338 } 339 if (nodump) { 340 ip = getino(dp->d_ino); 341 if (TSTINO(dp->d_ino, dumpinomap)) { 342 CLRINO(dp->d_ino, dumpinomap); 343 *tapesize -= blockest(ip); 344 } 345 /* 346 * Add back to dumpdirmap and remove from usedinomap 347 * to propagate nodump. 348 */ 349 if ((ip->di_mode & IFMT) == IFDIR) { 350 SETINO(dp->d_ino, dumpdirmap); 351 CLRINO(dp->d_ino, usedinomap); 352 ret |= HASSUBDIRS; 353 } 354 } else { 355 if (TSTINO(dp->d_ino, dumpinomap)) { 356 ret |= HASDUMPEDFILE; 357 if (ret & HASSUBDIRS) 358 break; 359 } 360 if (TSTINO(dp->d_ino, dumpdirmap)) { 361 ret |= HASSUBDIRS; 362 if (ret & HASDUMPEDFILE) 363 break; 364 } 365 } 366 } 367 return (ret); 368 } 369 370 /* 371 * Dump passes 3 and 4. 372 * 373 * Dump the contents of an inode to tape. 374 */ 375 void 376 dumpino(dp, ino) 377 struct dinode *dp; 378 ino_t ino; 379 { 380 int ind_level, cnt; 381 fsizeT size; 382 char buf[TP_BSIZE]; 383 384 if (newtape) { 385 newtape = 0; 386 dumpmap(dumpinomap, TS_BITS, ino); 387 } 388 CLRINO(ino, dumpinomap); 389 spcl.c_dinode = *dp; 390 spcl.c_type = TS_INODE; 391 spcl.c_count = 0; 392 switch (dp->di_mode & S_IFMT) { 393 394 case 0: 395 /* 396 * Freed inode. 397 */ 398 return; 399 400 case S_IFLNK: 401 /* 402 * Check for short symbolic link. 403 */ 404 #ifdef FS_44INODEFMT 405 if (dp->di_size > 0 && 406 dp->di_size < sblock->fs_maxsymlinklen) { 407 spcl.c_addr[0] = 1; 408 spcl.c_count = 1; 409 writeheader(ino); 410 memmove(buf, dp->di_shortlink, (u_long)dp->di_size); 411 buf[dp->di_size] = '\0'; 412 writerec(buf, 0); 413 return; 414 } 415 #endif 416 /* fall through */ 417 418 case S_IFDIR: 419 case S_IFREG: 420 if (dp->di_size > 0) 421 break; 422 /* fall through */ 423 424 case S_IFIFO: 425 case S_IFSOCK: 426 case S_IFCHR: 427 case S_IFBLK: 428 writeheader(ino); 429 return; 430 431 default: 432 msg("Warning: undefined file type 0%o\n", dp->di_mode & IFMT); 433 return; 434 } 435 if (dp->di_size > NDADDR * sblock->fs_bsize) 436 cnt = NDADDR * sblock->fs_frag; 437 else 438 cnt = howmany(dp->di_size, sblock->fs_fsize); 439 blksout(&dp->di_db[0], cnt, ino); 440 if ((size = dp->di_size - NDADDR * sblock->fs_bsize) <= 0) 441 return; 442 for (ind_level = 0; ind_level < NIADDR; ind_level++) { 443 dmpindir(ino, dp->di_ib[ind_level], ind_level, &size); 444 if (size <= 0) 445 return; 446 } 447 } 448 449 /* 450 * Read indirect blocks, and pass the data blocks to be dumped. 451 */ 452 static void 453 dmpindir(ino, blk, ind_level, size) 454 ino_t ino; 455 daddr_t blk; 456 int ind_level; 457 fsizeT *size; 458 { 459 int i, cnt; 460 daddr_t idblk[MAXNINDIR]; 461 462 if (blk != 0) 463 bread(fsbtodb(sblock, blk), (char *)idblk, (int) sblock->fs_bsize); 464 else 465 memset(idblk, 0, (int)sblock->fs_bsize); 466 if (ind_level <= 0) { 467 if (*size < NINDIR(sblock) * sblock->fs_bsize) 468 cnt = howmany(*size, sblock->fs_fsize); 469 else 470 cnt = NINDIR(sblock) * sblock->fs_frag; 471 *size -= NINDIR(sblock) * sblock->fs_bsize; 472 blksout(&idblk[0], cnt, ino); 473 return; 474 } 475 ind_level--; 476 for (i = 0; i < NINDIR(sblock); i++) { 477 dmpindir(ino, idblk[i], ind_level, size); 478 if (*size <= 0) 479 return; 480 } 481 } 482 483 /* 484 * Collect up the data into tape record sized buffers and output them. 485 */ 486 void 487 blksout(blkp, frags, ino) 488 daddr_t *blkp; 489 int frags; 490 ino_t ino; 491 { 492 daddr_t *bp; 493 int i, j, count, blks, tbperdb; 494 495 blks = howmany(frags * sblock->fs_fsize, TP_BSIZE); 496 tbperdb = sblock->fs_bsize >> tp_bshift; 497 for (i = 0; i < blks; i += TP_NINDIR) { 498 if (i + TP_NINDIR > blks) 499 count = blks; 500 else 501 count = i + TP_NINDIR; 502 for (j = i; j < count; j++) 503 if (blkp[j / tbperdb] != 0) 504 spcl.c_addr[j - i] = 1; 505 else 506 spcl.c_addr[j - i] = 0; 507 spcl.c_count = count - i; 508 writeheader(ino); 509 bp = &blkp[i / tbperdb]; 510 for (j = i; j < count; j += tbperdb, bp++) 511 if (*bp != 0) { 512 if (j + tbperdb <= count) 513 dumpblock(*bp, (int)sblock->fs_bsize); 514 else 515 dumpblock(*bp, (count - j) * TP_BSIZE); 516 } 517 spcl.c_type = TS_ADDR; 518 } 519 } 520 521 /* 522 * Dump a map to the tape. 523 */ 524 void 525 dumpmap(map, type, ino) 526 char *map; 527 int type; 528 ino_t ino; 529 { 530 int i; 531 char *cp; 532 533 spcl.c_type = type; 534 spcl.c_count = howmany(mapsize * sizeof(char), TP_BSIZE); 535 writeheader(ino); 536 for (i = 0, cp = map; i < spcl.c_count; i++, cp += TP_BSIZE) 537 writerec(cp, 0); 538 } 539 540 /* 541 * Write a header record to the dump tape. 542 */ 543 void 544 writeheader(ino) 545 ino_t ino; 546 { 547 int32_t sum, cnt, *lp; 548 549 spcl.c_inumber = ino; 550 spcl.c_magic = NFS_MAGIC; 551 spcl.c_checksum = 0; 552 lp = (int32_t *)&spcl; 553 sum = 0; 554 cnt = sizeof(union u_spcl) / (4 * sizeof(int32_t)); 555 while (--cnt >= 0) { 556 sum += *lp++; 557 sum += *lp++; 558 sum += *lp++; 559 sum += *lp++; 560 } 561 spcl.c_checksum = CHECKSUM - sum; 562 writerec((char *)&spcl, 1); 563 } 564 565 struct dinode * 566 getino(inum) 567 ino_t inum; 568 { 569 static daddr_t minino, maxino; 570 static struct dinode inoblock[MAXINOPB]; 571 572 curino = inum; 573 if (inum >= minino && inum < maxino) 574 return (&inoblock[inum - minino]); 575 bread(fsbtodb(sblock, ino_to_fsba(sblock, inum)), (char *)inoblock, 576 (int)sblock->fs_bsize); 577 minino = inum - (inum % INOPB(sblock)); 578 maxino = minino + INOPB(sblock); 579 return (&inoblock[inum - minino]); 580 } 581 582 /* 583 * Read a chunk of data from the disk. 584 * Try to recover from hard errors by reading in sector sized pieces. 585 * Error recovery is attempted at most BREADEMAX times before seeking 586 * consent from the operator to continue. 587 */ 588 int breaderrors = 0; 589 #define BREADEMAX 32 590 591 void 592 bread(blkno, buf, size) 593 daddr_t blkno; 594 char *buf; 595 int size; 596 { 597 int cnt, i; 598 599 loop: 600 if ((cnt = pread(diskfd, buf, size, ((off_t)blkno << dev_bshift))) == 601 size) 602 return; 603 if (blkno + (size / dev_bsize) > fsbtodb(sblock, sblock->fs_size)) { 604 /* 605 * Trying to read the final fragment. 606 * 607 * NB - dump only works in TP_BSIZE blocks, hence 608 * rounds `dev_bsize' fragments up to TP_BSIZE pieces. 609 * It should be smarter about not actually trying to 610 * read more than it can get, but for the time being 611 * we punt and scale back the read only when it gets 612 * us into trouble. (mkm 9/25/83) 613 */ 614 size -= dev_bsize; 615 goto loop; 616 } 617 if (cnt == -1) 618 msg("read error from %s: %s: [block %d]: count=%d\n", 619 disk, strerror(errno), blkno, size); 620 else 621 msg("short read error from %s: [block %d]: count=%d, got=%d\n", 622 disk, blkno, size, cnt); 623 if (++breaderrors > BREADEMAX) { 624 msg("More than %d block read errors from %d\n", 625 BREADEMAX, disk); 626 broadcast("DUMP IS AILING!\n"); 627 msg("This is an unrecoverable error.\n"); 628 if (!query("Do you want to attempt to continue?")){ 629 dumpabort(0); 630 /*NOTREACHED*/ 631 } else 632 breaderrors = 0; 633 } 634 /* 635 * Zero buffer, then try to read each sector of buffer separately. 636 */ 637 memset(buf, 0, size); 638 for (i = 0; i < size; i += dev_bsize, buf += dev_bsize, blkno++) { 639 if ((cnt = pread(diskfd, buf, (int)dev_bsize, 640 ((off_t)blkno << dev_bshift))) == dev_bsize) 641 continue; 642 if (cnt == -1) { 643 msg("read error from %s: %s: [sector %d]: count=%d\n", 644 disk, strerror(errno), blkno, dev_bsize); 645 continue; 646 } 647 msg("short read error from %s: [sector %d]: count=%d, got=%d\n", 648 disk, blkno, dev_bsize, cnt); 649 } 650 } 651