1 /*- 2 * Copyright (c) 1980, 1988, 1991 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * %sccs.include.redist.c% 6 */ 7 8 #ifndef lint 9 static char sccsid[] = "@(#)traverse.c 5.18 (Berkeley) 06/18/92"; 10 #endif /* not lint */ 11 12 #ifdef sunos 13 #include <stdio.h> 14 #include <ctype.h> 15 #include <sys/param.h> 16 #include <ufs/fs.h> 17 #else 18 #include <sys/param.h> 19 #include <ufs/ffs/fs.h> 20 #endif 21 #include <sys/time.h> 22 #include <sys/stat.h> 23 #include <ufs/ufs/dir.h> 24 #include <ufs/ufs/dinode.h> 25 #include <protocols/dumprestore.h> 26 #ifdef __STDC__ 27 #include <unistd.h> 28 #include <string.h> 29 #endif 30 #include "dump.h" 31 32 void dmpindir(); 33 #define HASDUMPEDFILE 0x1 34 #define HASSUBDIRS 0x2 35 36 /* 37 * This is an estimation of the number of TP_BSIZE blocks in the file. 38 * It estimates the number of blocks in files with holes by assuming 39 * that all of the blocks accounted for by di_blocks are data blocks 40 * (when some of the blocks are usually used for indirect pointers); 41 * hence the estimate may be high. 42 */ 43 long 44 blockest(dp) 45 register struct dinode *dp; 46 { 47 long blkest, sizeest; 48 49 /* 50 * dp->di_size is the size of the file in bytes. 51 * dp->di_blocks stores the number of sectors actually in the file. 52 * If there are more sectors than the size would indicate, this just 53 * means that there are indirect blocks in the file or unused 54 * sectors in the last file block; we can safely ignore these 55 * (blkest = sizeest below). 56 * If the file is bigger than the number of sectors would indicate, 57 * then the file has holes in it. In this case we must use the 58 * block count to estimate the number of data blocks used, but 59 * we use the actual size for estimating the number of indirect 60 * dump blocks (sizeest vs. blkest in the indirect block 61 * calculation). 62 */ 63 blkest = howmany(dbtob(dp->di_blocks), TP_BSIZE); 64 sizeest = howmany(dp->di_size, TP_BSIZE); 65 if (blkest > sizeest) 66 blkest = sizeest; 67 if (dp->di_size > sblock->fs_bsize * NDADDR) { 68 /* calculate the number of indirect blocks on the dump tape */ 69 blkest += 70 howmany(sizeest - NDADDR * sblock->fs_bsize / TP_BSIZE, 71 TP_NINDIR); 72 } 73 return (blkest + 1); 74 } 75 76 /* 77 * Dump pass 1. 78 * 79 * Walk the inode list for a filesystem to find all allocated inodes 80 * that have been modified since the previous dump time. Also, find all 81 * the directories in the filesystem. 82 */ 83 mapfiles(maxino, tapesize) 84 ino_t maxino; 85 long *tapesize; 86 { 87 register int mode; 88 register ino_t ino; 89 register struct dinode *dp; 90 int anydirskipped = 0; 91 92 for (ino = 0; ino < maxino; ino++) { 93 dp = getino(ino); 94 if ((mode = (dp->di_mode & IFMT)) == 0) 95 continue; 96 SETINO(ino, usedinomap); 97 if (mode == IFDIR) 98 SETINO(ino, dumpdirmap); 99 if ((dp->di_mtime.ts_sec >= spcl.c_ddate || 100 dp->di_ctime.ts_sec >= spcl.c_ddate) 101 #ifndef sunos 102 && (dp->di_flags & NODUMP) != NODUMP 103 #endif 104 ) { 105 SETINO(ino, dumpinomap); 106 if (mode != IFREG && mode != IFDIR && mode != IFLNK) { 107 *tapesize += 1; 108 continue; 109 } 110 *tapesize += blockest(dp); 111 continue; 112 } 113 if (mode == IFDIR) 114 anydirskipped = 1; 115 } 116 /* 117 * Restore gets very upset if the root is not dumped, 118 * so ensure that it always is dumped. 119 */ 120 SETINO(ROOTINO, dumpinomap); 121 return (anydirskipped); 122 } 123 124 /* 125 * Dump pass 2. 126 * 127 * Scan each directory on the filesystem to see if it has any modified 128 * files in it. If it does, and has not already been added to the dump 129 * list (because it was itself modified), then add it. If a directory 130 * has not been modified itself, contains no modified files and has no 131 * subdirectories, then it can be deleted from the dump list and from 132 * the list of directories. By deleting it from the list of directories, 133 * its parent may now qualify for the same treatment on this or a later 134 * pass using this algorithm. 135 */ 136 mapdirs(maxino, tapesize) 137 ino_t maxino; 138 long *tapesize; 139 { 140 register struct dinode *dp; 141 register int i, dirty; 142 register char *map; 143 register ino_t ino; 144 long filesize; 145 int ret, change = 0; 146 147 for (map = dumpdirmap, ino = 0; ino < maxino; ) { 148 if ((ino % NBBY) == 0) 149 dirty = *map++; 150 else 151 dirty >>= 1; 152 ino++; 153 if ((dirty & 1) == 0 || TSTINO(ino, dumpinomap)) 154 continue; 155 dp = getino(ino); 156 filesize = dp->di_size; 157 for (ret = 0, i = 0; filesize > 0 && i < NDADDR; i++) { 158 if (dp->di_db[i] != 0) 159 ret |= searchdir(ino, dp->di_db[i], 160 dblksize(sblock, dp, i), filesize); 161 if (ret & HASDUMPEDFILE) 162 filesize = 0; 163 else 164 filesize -= sblock->fs_bsize; 165 } 166 for (i = 0; filesize > 0 && i < NIADDR; i++) { 167 if (dp->di_ib[i] == 0) 168 continue; 169 ret |= dirindir(ino, dp->di_ib[i], i, &filesize); 170 } 171 if (ret & HASDUMPEDFILE) { 172 if (!TSTINO(ino, dumpinomap)) { 173 SETINO(ino, dumpinomap); 174 *tapesize += blockest(dp); 175 } 176 change = 1; 177 continue; 178 } 179 if ((ret & HASSUBDIRS) == 0) { 180 if (!TSTINO(ino, dumpinomap)) { 181 CLRINO(ino, dumpdirmap); 182 change = 1; 183 } 184 } 185 } 186 return (change); 187 } 188 189 /* 190 * Read indirect blocks, and pass the data blocks to be searched 191 * as directories. Quit as soon as any entry is found that will 192 * require the directory to be dumped. 193 */ 194 dirindir(ino, blkno, ind_level, filesize) 195 ino_t ino; 196 daddr_t blkno; 197 int ind_level; 198 long *filesize; 199 { 200 int ret = 0; 201 register int i; 202 daddr_t idblk[MAXNINDIR]; 203 204 bread(fsbtodb(sblock, blkno), (char *)idblk, (int)sblock->fs_bsize); 205 if (ind_level <= 0) { 206 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { 207 blkno = idblk[i]; 208 if (blkno != 0) 209 ret |= searchdir(ino, blkno, sblock->fs_bsize, 210 *filesize); 211 if (ret & HASDUMPEDFILE) 212 *filesize = 0; 213 else 214 *filesize -= sblock->fs_bsize; 215 } 216 return (ret); 217 } 218 ind_level--; 219 for (i = 0; *filesize > 0 && i < NINDIR(sblock); i++) { 220 blkno = idblk[i]; 221 if (blkno != 0) 222 ret |= dirindir(ino, blkno, ind_level, filesize); 223 } 224 return (ret); 225 } 226 227 /* 228 * Scan a disk block containing directory information looking to see if 229 * any of the entries are on the dump list and to see if the directory 230 * contains any subdirectories. 231 */ 232 searchdir(ino, blkno, size, filesize) 233 ino_t ino; 234 daddr_t blkno; 235 register long size; 236 long filesize; 237 { 238 register struct direct *dp; 239 register long loc; 240 char dblk[MAXBSIZE]; 241 242 bread(fsbtodb(sblock, blkno), dblk, (int)size); 243 if (filesize < size) 244 size = filesize; 245 for (loc = 0; loc < size; ) { 246 dp = (struct direct *)(dblk + loc); 247 if (dp->d_reclen == 0) { 248 msg("corrupted directory, inumber %d\n", ino); 249 break; 250 } 251 loc += dp->d_reclen; 252 if (dp->d_ino == 0) 253 continue; 254 if (dp->d_name[0] == '.') { 255 if (dp->d_name[1] == '\0') 256 continue; 257 if (dp->d_name[1] == '.' && dp->d_name[2] == '\0') 258 continue; 259 } 260 if (TSTINO(dp->d_ino, dumpinomap)) 261 return (HASDUMPEDFILE); 262 if (TSTINO(dp->d_ino, dumpdirmap)) 263 return (HASSUBDIRS); 264 } 265 return (0); 266 } 267 268 /* 269 * Dump passes 3 and 4. 270 * 271 * Dump the contents of an inode to tape. 272 */ 273 void 274 dumpino(dp, ino) 275 register struct dinode *dp; 276 ino_t ino; 277 { 278 int mode, ind_level, cnt; 279 long size; 280 281 if (newtape) { 282 newtape = 0; 283 dumpmap(dumpinomap, TS_BITS, ino); 284 } 285 CLRINO(ino, dumpinomap); 286 spcl.c_dinode = *dp; 287 spcl.c_type = TS_INODE; 288 spcl.c_count = 0; 289 /* 290 * Check for freed inode. 291 */ 292 if ((mode = (dp->di_mode & IFMT)) == 0) 293 return; 294 if ((mode != IFDIR && mode != IFREG && mode != IFLNK) || 295 dp->di_size == 0) { 296 writeheader(ino); 297 return; 298 } 299 if (dp->di_size > NDADDR * sblock->fs_bsize) 300 cnt = NDADDR * sblock->fs_frag; 301 else 302 cnt = howmany(dp->di_size, sblock->fs_fsize); 303 blksout(&dp->di_db[0], cnt, ino); 304 if ((size = dp->di_size - NDADDR * sblock->fs_bsize) <= 0) 305 return; 306 for (ind_level = 0; ind_level < NIADDR; ind_level++) { 307 dmpindir(ino, dp->di_ib[ind_level], ind_level, &size); 308 if (size <= 0) 309 return; 310 } 311 } 312 313 /* 314 * Read indirect blocks, and pass the data blocks to be dumped. 315 */ 316 void 317 dmpindir(ino, blk, ind_level, size) 318 ino_t ino; 319 daddr_t blk; 320 int ind_level; 321 long *size; 322 { 323 int i, cnt; 324 daddr_t idblk[MAXNINDIR]; 325 326 if (blk != 0) 327 bread(fsbtodb(sblock, blk), (char *)idblk, (int) sblock->fs_bsize); 328 else 329 bzero((char *)idblk, (int)sblock->fs_bsize); 330 if (ind_level <= 0) { 331 if (*size < NINDIR(sblock) * sblock->fs_bsize) 332 cnt = howmany(*size, sblock->fs_fsize); 333 else 334 cnt = NINDIR(sblock) * sblock->fs_frag; 335 *size -= NINDIR(sblock) * sblock->fs_bsize; 336 blksout(&idblk[0], cnt, ino); 337 return; 338 } 339 ind_level--; 340 for (i = 0; i < NINDIR(sblock); i++) { 341 dmpindir(ino, idblk[i], ind_level, size); 342 if (*size <= 0) 343 return; 344 } 345 } 346 347 /* 348 * Collect up the data into tape record sized buffers and output them. 349 */ 350 void 351 blksout(blkp, frags, ino) 352 daddr_t *blkp; 353 int frags; 354 ino_t ino; 355 { 356 register daddr_t *bp; 357 int i, j, count, blks, tbperdb; 358 359 blks = howmany(frags * sblock->fs_fsize, TP_BSIZE); 360 tbperdb = sblock->fs_bsize >> tp_bshift; 361 for (i = 0; i < blks; i += TP_NINDIR) { 362 if (i + TP_NINDIR > blks) 363 count = blks; 364 else 365 count = i + TP_NINDIR; 366 for (j = i; j < count; j++) 367 if (blkp[j / tbperdb] != 0) 368 spcl.c_addr[j - i] = 1; 369 else 370 spcl.c_addr[j - i] = 0; 371 spcl.c_count = count - i; 372 writeheader(ino); 373 bp = &blkp[i / tbperdb]; 374 for (j = i; j < count; j += tbperdb, bp++) 375 if (*bp != 0) 376 if (j + tbperdb <= count) 377 dumpblock(*bp, (int)sblock->fs_bsize); 378 else 379 dumpblock(*bp, (count - j) * TP_BSIZE); 380 spcl.c_type = TS_ADDR; 381 } 382 } 383 384 /* 385 * Dump a map to the tape. 386 */ 387 void 388 dumpmap(map, type, ino) 389 char *map; 390 int type; 391 ino_t ino; 392 { 393 register int i; 394 char *cp; 395 396 spcl.c_type = type; 397 spcl.c_count = howmany(mapsize * sizeof(char), TP_BSIZE); 398 writeheader(ino); 399 for (i = 0, cp = map; i < spcl.c_count; i++, cp += TP_BSIZE) 400 writerec(cp); 401 } 402 403 /* 404 * Write a header record to the dump tape. 405 */ 406 void 407 writeheader(ino) 408 ino_t ino; 409 { 410 register long sum, cnt, *lp; 411 412 spcl.c_inumber = ino; 413 spcl.c_magic = NFS_MAGIC; 414 spcl.c_checksum = 0; 415 lp = (long *)&spcl; 416 sum = 0; 417 cnt = sizeof(union u_spcl) / (4 * sizeof(long)); 418 while (--cnt >= 0) { 419 sum += *lp++; 420 sum += *lp++; 421 sum += *lp++; 422 sum += *lp++; 423 } 424 spcl.c_checksum = CHECKSUM - sum; 425 writerec((char *)&spcl); 426 } 427 428 struct dinode * 429 getino(inum) 430 ino_t inum; 431 { 432 static daddr_t minino, maxino; 433 static struct dinode inoblock[MAXINOPB]; 434 435 curino = inum; 436 if (inum >= minino && inum < maxino) 437 return (&inoblock[inum - minino]); 438 bread(fsbtodb(sblock, itod(sblock, inum)), (char *)inoblock, 439 (int)sblock->fs_bsize); 440 minino = inum - (inum % INOPB(sblock)); 441 maxino = minino + INOPB(sblock); 442 return (&inoblock[inum - minino]); 443 } 444 445 /* 446 * Read a chunk of data from the disk. 447 * Try to recover from hard errors by reading in sector sized pieces. 448 * Error recovery is attempted at most BREADEMAX times before seeking 449 * consent from the operator to continue. 450 */ 451 int breaderrors = 0; 452 #define BREADEMAX 32 453 454 void 455 bread(blkno, buf, size) 456 daddr_t blkno; 457 char *buf; 458 int size; 459 { 460 int cnt, i; 461 extern int errno; 462 463 loop: 464 if ((int)lseek(diskfd, ((off_t)blkno << dev_bshift), 0) < 0) 465 msg("bread: lseek fails\n"); 466 if ((cnt = read(diskfd, buf, size)) == size) 467 return; 468 if (blkno + (size / dev_bsize) > fsbtodb(sblock, sblock->fs_size)) { 469 /* 470 * Trying to read the final fragment. 471 * 472 * NB - dump only works in TP_BSIZE blocks, hence 473 * rounds `dev_bsize' fragments up to TP_BSIZE pieces. 474 * It should be smarter about not actually trying to 475 * read more than it can get, but for the time being 476 * we punt and scale back the read only when it gets 477 * us into trouble. (mkm 9/25/83) 478 */ 479 size -= dev_bsize; 480 goto loop; 481 } 482 if (cnt == -1) 483 msg("read error from %s: %s: [block %d]: count=%d\n", 484 disk, strerror(errno), blkno, size); 485 else 486 msg("short read error from %s: [block %d]: count=%d, got=%d\n", 487 disk, blkno, size, cnt); 488 if (++breaderrors > BREADEMAX) { 489 msg("More than %d block read errors from %d\n", 490 BREADEMAX, disk); 491 broadcast("DUMP IS AILING!\n"); 492 msg("This is an unrecoverable error.\n"); 493 if (!query("Do you want to attempt to continue?")){ 494 dumpabort(); 495 /*NOTREACHED*/ 496 } else 497 breaderrors = 0; 498 } 499 /* 500 * Zero buffer, then try to read each sector of buffer separately. 501 */ 502 bzero(buf, size); 503 for (i = 0; i < size; i += dev_bsize, buf += dev_bsize, blkno++) { 504 if ((int)lseek(diskfd, ((off_t)blkno << dev_bshift), 0) < 0) 505 msg("bread: lseek2 fails!\n"); 506 if ((cnt = read(diskfd, buf, (int)dev_bsize)) == dev_bsize) 507 continue; 508 if (cnt == -1) { 509 msg("read error from %s: %s: [sector %d]: count=%d\n", 510 disk, strerror(errno), blkno, dev_bsize); 511 continue; 512 } 513 msg("short read error from %s: [sector %d]: count=%d, got=%d\n", 514 disk, blkno, dev_bsize, cnt); 515 } 516 } 517