1 1.71 riastrad /* $NetBSD: utilities.c,v 1.71 2023/07/05 10:59:08 riastradh Exp $ */ 2 1.15 cgd 3 1.1 cgd /* 4 1.9 mycroft * Copyright (c) 1980, 1986, 1993 5 1.9 mycroft * The Regents of the University of California. All rights reserved. 6 1.1 cgd * 7 1.1 cgd * Redistribution and use in source and binary forms, with or without 8 1.1 cgd * modification, are permitted provided that the following conditions 9 1.1 cgd * are met: 10 1.1 cgd * 1. Redistributions of source code must retain the above copyright 11 1.1 cgd * notice, this list of conditions and the following disclaimer. 12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright 13 1.1 cgd * notice, this list of conditions and the following disclaimer in the 14 1.1 cgd * documentation and/or other materials provided with the distribution. 15 1.41 agc * 3. Neither the name of the University nor the names of its contributors 16 1.1 cgd * may be used to endorse or promote products derived from this software 17 1.1 cgd * without specific prior written permission. 18 1.1 cgd * 19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29 1.1 cgd * SUCH DAMAGE. 30 1.1 cgd */ 31 1.1 cgd 32 1.19 lukem #include <sys/cdefs.h> 33 1.1 cgd #ifndef lint 34 1.13 cgd #if 0 35 1.20 lukem static char sccsid[] = "@(#)utilities.c 8.6 (Berkeley) 5/19/95"; 36 1.13 cgd #else 37 1.71 riastrad __RCSID("$NetBSD: utilities.c,v 1.71 2023/07/05 10:59:08 riastradh Exp $"); 38 1.13 cgd #endif 39 1.1 cgd #endif /* not lint */ 40 1.1 cgd 41 1.1 cgd #include <sys/param.h> 42 1.7 cgd #include <sys/time.h> 43 1.20 lukem 44 1.9 mycroft #include <ufs/ufs/dinode.h> 45 1.9 mycroft #include <ufs/ufs/dir.h> 46 1.9 mycroft #include <ufs/ffs/fs.h> 47 1.23 bouyer #include <ufs/ffs/ffs_extern.h> 48 1.26 fvdl #include <ufs/ufs/ufs_bswap.h> 49 1.59 bouyer #include <ufs/ufs/quota2.h> 50 1.20 lukem 51 1.20 lukem #include <ctype.h> 52 1.20 lukem #include <err.h> 53 1.38 yamt #include <errno.h> 54 1.21 lukem #include <stdio.h> 55 1.21 lukem #include <stdlib.h> 56 1.1 cgd #include <string.h> 57 1.21 lukem #include <unistd.h> 58 1.54 drochner #include <signal.h> 59 1.11 cgd 60 1.18 christos #include "fsutil.h" 61 1.1 cgd #include "fsck.h" 62 1.11 cgd #include "extern.h" 63 1.55 christos #include "exitvalues.h" 64 1.1 cgd 65 1.1 cgd long diskreads, totalreads; /* Disk cache statistics */ 66 1.1 cgd 67 1.50 christos static void rwerror(const char *, daddr_t); 68 1.17 christos 69 1.11 cgd int 70 1.48 xtraeme ftypeok(union dinode *dp) 71 1.1 cgd { 72 1.36 fvdl switch (iswap16(DIP(dp, mode)) & IFMT) { 73 1.1 cgd 74 1.1 cgd case IFDIR: 75 1.1 cgd case IFREG: 76 1.1 cgd case IFBLK: 77 1.1 cgd case IFCHR: 78 1.1 cgd case IFLNK: 79 1.1 cgd case IFSOCK: 80 1.1 cgd case IFIFO: 81 1.1 cgd return (1); 82 1.1 cgd 83 1.1 cgd default: 84 1.1 cgd if (debug) 85 1.36 fvdl printf("bad file type 0%o\n", iswap16(DIP(dp, mode))); 86 1.1 cgd return (0); 87 1.1 cgd } 88 1.1 cgd } 89 1.1 cgd 90 1.11 cgd int 91 1.50 christos reply(const char *question) 92 1.1 cgd { 93 1.1 cgd int persevere; 94 1.1 cgd char c; 95 1.1 cgd 96 1.1 cgd if (preen) 97 1.1 cgd pfatal("INTERNAL ERROR: GOT TO reply()"); 98 1.1 cgd persevere = !strcmp(question, "CONTINUE"); 99 1.1 cgd printf("\n"); 100 1.1 cgd if (!persevere && (nflag || fswritefd < 0)) { 101 1.1 cgd printf("%s? no\n\n", question); 102 1.26 fvdl resolved = 0; 103 1.1 cgd return (0); 104 1.1 cgd } 105 1.1 cgd if (yflag || (persevere && nflag)) { 106 1.1 cgd printf("%s? yes\n\n", question); 107 1.1 cgd return (1); 108 1.1 cgd } 109 1.1 cgd do { 110 1.1 cgd printf("%s? [yn] ", question); 111 1.1 cgd (void) fflush(stdout); 112 1.1 cgd c = getc(stdin); 113 1.26 fvdl while (c != '\n' && getc(stdin) != '\n') { 114 1.26 fvdl if (feof(stdin)) { 115 1.26 fvdl resolved = 0; 116 1.1 cgd return (0); 117 1.26 fvdl } 118 1.26 fvdl } 119 1.1 cgd } while (c != 'y' && c != 'Y' && c != 'n' && c != 'N'); 120 1.1 cgd printf("\n"); 121 1.1 cgd if (c == 'y' || c == 'Y') 122 1.1 cgd return (1); 123 1.26 fvdl resolved = 0; 124 1.1 cgd return (0); 125 1.1 cgd } 126 1.1 cgd 127 1.1 cgd /* 128 1.1 cgd * Malloc buffers and set up cache. 129 1.1 cgd */ 130 1.11 cgd void 131 1.48 xtraeme bufinit(void) 132 1.1 cgd { 133 1.19 lukem struct bufarea *bp; 134 1.1 cgd long bufcnt, i; 135 1.1 cgd char *bufp; 136 1.1 cgd 137 1.1 cgd pbp = pdirbp = (struct bufarea *)0; 138 1.71 riastrad bufp = aligned_alloc(DEV_BSIZE, (unsigned int)sblock->fs_bsize); 139 1.1 cgd if (bufp == 0) 140 1.55 christos errexit("cannot allocate buffer pool"); 141 1.1 cgd cgblk.b_un.b_buf = bufp; 142 1.1 cgd initbarea(&cgblk); 143 1.65 rin #ifndef NO_APPLE_UFS 144 1.66 jdolecek bufp = aligned_alloc(DEV_BSIZE, (unsigned int)APPLEUFS_LABEL_SIZE); 145 1.34 dbj if (bufp == 0) 146 1.55 christos errexit("cannot allocate buffer pool"); 147 1.34 dbj appleufsblk.b_un.b_buf = bufp; 148 1.34 dbj initbarea(&appleufsblk); 149 1.65 rin #endif 150 1.1 cgd bufhead.b_next = bufhead.b_prev = &bufhead; 151 1.23 bouyer bufcnt = MAXBUFSPACE / sblock->fs_bsize; 152 1.1 cgd if (bufcnt < MINBUFS) 153 1.1 cgd bufcnt = MINBUFS; 154 1.1 cgd for (i = 0; i < bufcnt; i++) { 155 1.53 christos bp = malloc(sizeof(struct bufarea)); 156 1.71 riastrad bufp = aligned_alloc(DEV_BSIZE, (unsigned int)sblock->fs_bsize); 157 1.1 cgd if (bp == NULL || bufp == NULL) { 158 1.53 christos if (i >= MINBUFS) { 159 1.53 christos if (bp) 160 1.53 christos free(bp); 161 1.53 christos if (bufp) 162 1.53 christos free(bufp); 163 1.1 cgd break; 164 1.53 christos } 165 1.55 christos errexit("cannot allocate buffer pool"); 166 1.1 cgd } 167 1.1 cgd bp->b_un.b_buf = bufp; 168 1.1 cgd bp->b_prev = &bufhead; 169 1.1 cgd bp->b_next = bufhead.b_next; 170 1.1 cgd bufhead.b_next->b_prev = bp; 171 1.1 cgd bufhead.b_next = bp; 172 1.1 cgd initbarea(bp); 173 1.1 cgd } 174 1.1 cgd bufhead.b_size = i; /* save number of buffers */ 175 1.1 cgd } 176 1.1 cgd 177 1.1 cgd /* 178 1.1 cgd * Manage a cache of directory blocks. 179 1.1 cgd */ 180 1.1 cgd struct bufarea * 181 1.48 xtraeme getdatablk(daddr_t blkno, long size) 182 1.1 cgd { 183 1.19 lukem struct bufarea *bp; 184 1.1 cgd 185 1.1 cgd for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next) 186 1.62 dholland if (bp->b_bno == FFS_FSBTODB(sblock, blkno)) 187 1.1 cgd goto foundit; 188 1.1 cgd for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev) 189 1.1 cgd if ((bp->b_flags & B_INUSE) == 0) 190 1.1 cgd break; 191 1.1 cgd if (bp == &bufhead) 192 1.55 christos errexit("deadlocked buffer pool"); 193 1.1 cgd /* fall through */ 194 1.1 cgd foundit: 195 1.42 dbj getblk(bp, blkno, size); 196 1.1 cgd bp->b_prev->b_next = bp->b_next; 197 1.1 cgd bp->b_next->b_prev = bp->b_prev; 198 1.1 cgd bp->b_prev = &bufhead; 199 1.1 cgd bp->b_next = bufhead.b_next; 200 1.1 cgd bufhead.b_next->b_prev = bp; 201 1.1 cgd bufhead.b_next = bp; 202 1.1 cgd bp->b_flags |= B_INUSE; 203 1.1 cgd return (bp); 204 1.1 cgd } 205 1.1 cgd 206 1.1 cgd void 207 1.48 xtraeme getblk(struct bufarea *bp, daddr_t blk, long size) 208 1.1 cgd { 209 1.35 fvdl daddr_t dblk; 210 1.1 cgd 211 1.62 dholland dblk = FFS_FSBTODB(sblock, blk); 212 1.42 dbj totalreads++; 213 1.1 cgd if (bp->b_bno != dblk) { 214 1.1 cgd flush(fswritefd, bp); 215 1.1 cgd diskreads++; 216 1.1 cgd bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size); 217 1.1 cgd bp->b_bno = dblk; 218 1.1 cgd bp->b_size = size; 219 1.1 cgd } 220 1.1 cgd } 221 1.1 cgd 222 1.11 cgd void 223 1.48 xtraeme flush(int fd, struct bufarea *bp) 224 1.1 cgd { 225 1.19 lukem int i, j; 226 1.32 lukem struct csum *ccsp; 227 1.1 cgd 228 1.1 cgd if (!bp->b_dirty) 229 1.1 cgd return; 230 1.1 cgd if (bp->b_errs != 0) 231 1.35 fvdl pfatal("WRITING %sZERO'ED BLOCK %lld TO DISK\n", 232 1.1 cgd (bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ", 233 1.35 fvdl (long long)bp->b_bno); 234 1.1 cgd bp->b_dirty = 0; 235 1.1 cgd bp->b_errs = 0; 236 1.1 cgd bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size); 237 1.1 cgd if (bp != &sblk) 238 1.1 cgd return; 239 1.23 bouyer for (i = 0, j = 0; i < sblock->fs_cssize; i += sblock->fs_bsize, j++) { 240 1.23 bouyer int size = sblock->fs_cssize - i < sblock->fs_bsize ? 241 1.23 bouyer sblock->fs_cssize - i : sblock->fs_bsize; 242 1.32 lukem ccsp = (struct csum *)((char *)sblock->fs_csp + i); 243 1.32 lukem if (needswap) 244 1.32 lukem ffs_csum_swap(ccsp, ccsp, size); 245 1.32 lukem bwrite(fswritefd, (char *)ccsp, 246 1.62 dholland FFS_FSBTODB(sblock, sblock->fs_csaddr + j * sblock->fs_frag), 247 1.29 mycroft size); 248 1.32 lukem if (needswap) 249 1.32 lukem ffs_csum_swap(ccsp, ccsp, size); 250 1.1 cgd } 251 1.1 cgd } 252 1.1 cgd 253 1.17 christos static void 254 1.50 christos rwerror(const char *mesg, daddr_t blk) 255 1.1 cgd { 256 1.1 cgd 257 1.1 cgd if (preen == 0) 258 1.1 cgd printf("\n"); 259 1.35 fvdl pfatal("CANNOT %s: BLK %lld", mesg, (long long)blk); 260 1.1 cgd if (reply("CONTINUE") == 0) 261 1.55 christos exit(FSCK_EXIT_CHECK_FAILED); 262 1.1 cgd } 263 1.1 cgd 264 1.11 cgd void 265 1.60 christos ckfini(int noint) 266 1.1 cgd { 267 1.19 lukem struct bufarea *bp, *nbp; 268 1.64 christos int cnt = 0; 269 1.1 cgd 270 1.60 christos if (!noint) { 271 1.60 christos if (doinglevel2) 272 1.60 christos return; 273 1.60 christos markclean = 0; 274 1.60 christos } 275 1.60 christos 276 1.9 mycroft if (fswritefd < 0) { 277 1.9 mycroft (void)close(fsreadfd); 278 1.9 mycroft return; 279 1.9 mycroft } 280 1.1 cgd flush(fswritefd, &sblk); 281 1.39 fvdl if (havesb && bflag != 0 && 282 1.44 dbj (preen || reply("UPDATE STANDARD SUPERBLOCK"))) { 283 1.44 dbj if (preen) 284 1.45 dbj pwarn("UPDATING STANDARD SUPERBLOCK\n"); 285 1.39 fvdl if (!is_ufs2 && (sblock->fs_old_flags & FS_FLAGS_UPDATED) == 0) 286 1.39 fvdl sblk.b_bno = SBLOCK_UFS1 / dev_bsize; 287 1.39 fvdl else 288 1.39 fvdl sblk.b_bno = sblock->fs_sblockloc / dev_bsize; 289 1.1 cgd sbdirty(); 290 1.1 cgd flush(fswritefd, &sblk); 291 1.1 cgd } 292 1.65 rin #ifndef NO_APPLE_UFS 293 1.34 dbj flush(fswritefd, &appleufsblk); 294 1.34 dbj free(appleufsblk.b_un.b_buf); 295 1.65 rin #endif 296 1.1 cgd flush(fswritefd, &cgblk); 297 1.1 cgd free(cgblk.b_un.b_buf); 298 1.6 deraadt for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) { 299 1.1 cgd cnt++; 300 1.1 cgd flush(fswritefd, bp); 301 1.1 cgd nbp = bp->b_prev; 302 1.1 cgd free(bp->b_un.b_buf); 303 1.1 cgd free((char *)bp); 304 1.1 cgd } 305 1.1 cgd if (bufhead.b_size != cnt) 306 1.55 christos errexit("Panic: lost %d buffers", bufhead.b_size - cnt); 307 1.1 cgd pbp = pdirbp = (struct bufarea *)0; 308 1.23 bouyer if (markclean && (sblock->fs_clean & FS_ISCLEAN) == 0) { 309 1.14 mycroft /* 310 1.14 mycroft * Mark the file system as clean, and sync the superblock. 311 1.14 mycroft */ 312 1.14 mycroft if (preen) 313 1.14 mycroft pwarn("MARKING FILE SYSTEM CLEAN\n"); 314 1.14 mycroft else if (!reply("MARK FILE SYSTEM CLEAN")) 315 1.14 mycroft markclean = 0; 316 1.14 mycroft if (markclean) { 317 1.23 bouyer sblock->fs_clean = FS_ISCLEAN; 318 1.36 fvdl sblock->fs_pendingblocks = 0; 319 1.36 fvdl sblock->fs_pendinginodes = 0; 320 1.14 mycroft sbdirty(); 321 1.14 mycroft flush(fswritefd, &sblk); 322 1.20 lukem if (!preen) 323 1.20 lukem printf( 324 1.20 lukem "\n***** FILE SYSTEM MARKED CLEAN *****\n"); 325 1.14 mycroft } 326 1.14 mycroft } 327 1.67 chs if (doing2ea) { 328 1.67 chs printf("ENABLING EXTATTR SUPPORT\n"); 329 1.67 chs is_ufs2ea = 1; 330 1.67 chs sbdirty(); 331 1.67 chs flush(fswritefd, &sblk); 332 1.67 chs } 333 1.67 chs if (doing2noea) { 334 1.67 chs printf("DISABLING EXTATTR SUPPORT\n"); 335 1.67 chs is_ufs2ea = 0; 336 1.67 chs sbdirty(); 337 1.67 chs flush(fswritefd, &sblk); 338 1.67 chs } 339 1.1 cgd if (debug) 340 1.1 cgd printf("cache missed %ld of %ld (%d%%)\n", diskreads, 341 1.1 cgd totalreads, (int)(diskreads * 100 / totalreads)); 342 1.56 simonb cleanup_wapbl(); 343 1.1 cgd (void)close(fsreadfd); 344 1.1 cgd (void)close(fswritefd); 345 1.1 cgd } 346 1.1 cgd 347 1.11 cgd int 348 1.48 xtraeme bread(int fd, char *buf, daddr_t blk, long size) 349 1.1 cgd { 350 1.1 cgd char *cp; 351 1.1 cgd int i, errs; 352 1.9 mycroft off_t offset; 353 1.1 cgd 354 1.9 mycroft offset = blk; 355 1.9 mycroft offset *= dev_bsize; 356 1.56 simonb if ((pread(fd, buf, (int)size, offset) == size) && 357 1.56 simonb read_wapbl(buf, size, blk) == 0) 358 1.1 cgd return (0); 359 1.1 cgd rwerror("READ", blk); 360 1.1 cgd errs = 0; 361 1.10 mycroft memset(buf, 0, (size_t)size); 362 1.1 cgd printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:"); 363 1.1 cgd for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) { 364 1.47 mycroft if (pread(fd, cp, (int)secsize, offset + i) != secsize) { 365 1.1 cgd if (secsize != dev_bsize && dev_bsize != 1) 366 1.35 fvdl printf(" %lld (%lld),", 367 1.35 fvdl (long long)((blk*dev_bsize + i) / secsize), 368 1.35 fvdl (long long)(blk + i / dev_bsize)); 369 1.1 cgd else 370 1.35 fvdl printf(" %lld,", 371 1.35 fvdl (long long)(blk + i / dev_bsize)); 372 1.1 cgd errs++; 373 1.1 cgd } 374 1.1 cgd } 375 1.1 cgd printf("\n"); 376 1.1 cgd return (errs); 377 1.1 cgd } 378 1.1 cgd 379 1.11 cgd void 380 1.48 xtraeme bwrite(int fd, char *buf, daddr_t blk, long size) 381 1.1 cgd { 382 1.1 cgd int i; 383 1.1 cgd char *cp; 384 1.9 mycroft off_t offset; 385 1.1 cgd 386 1.1 cgd if (fd < 0) 387 1.1 cgd return; 388 1.9 mycroft offset = blk; 389 1.9 mycroft offset *= dev_bsize; 390 1.47 mycroft if (pwrite(fd, buf, (int)size, offset) == size) { 391 1.1 cgd fsmodified = 1; 392 1.1 cgd return; 393 1.1 cgd } 394 1.1 cgd rwerror("WRITE", blk); 395 1.1 cgd printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:"); 396 1.1 cgd for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize) 397 1.47 mycroft if (pwrite(fd, cp, (int)dev_bsize, offset + i) != dev_bsize) 398 1.35 fvdl printf(" %lld,", (long long)(blk + i / dev_bsize)); 399 1.1 cgd printf("\n"); 400 1.1 cgd return; 401 1.1 cgd } 402 1.1 cgd 403 1.1 cgd /* 404 1.1 cgd * allocate a data block with the specified number of fragments 405 1.1 cgd */ 406 1.35 fvdl daddr_t 407 1.48 xtraeme allocblk(long frags) 408 1.1 cgd { 409 1.26 fvdl int i, j, k, cg, baseblk; 410 1.26 fvdl struct cg *cgp = cgrp; 411 1.1 cgd 412 1.23 bouyer if (frags <= 0 || frags > sblock->fs_frag) 413 1.1 cgd return (0); 414 1.23 bouyer for (i = 0; i < maxfsblock - sblock->fs_frag; i += sblock->fs_frag) { 415 1.23 bouyer for (j = 0; j <= sblock->fs_frag - frags; j++) { 416 1.1 cgd if (testbmap(i + j)) 417 1.1 cgd continue; 418 1.1 cgd for (k = 1; k < frags; k++) 419 1.1 cgd if (testbmap(i + j + k)) 420 1.1 cgd break; 421 1.1 cgd if (k < frags) { 422 1.1 cgd j += k; 423 1.1 cgd continue; 424 1.1 cgd } 425 1.26 fvdl cg = dtog(sblock, i + j); 426 1.26 fvdl getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize); 427 1.26 fvdl memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize); 428 1.26 fvdl if ((doswap && !needswap) || (!doswap && needswap)) 429 1.36 fvdl ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock); 430 1.26 fvdl if (!cg_chkmagic(cgp, 0)) 431 1.26 fvdl pfatal("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n", 432 1.26 fvdl cg); 433 1.26 fvdl baseblk = dtogd(sblock, i + j); 434 1.26 fvdl for (k = 0; k < frags; k++) { 435 1.1 cgd setbmap(i + j + k); 436 1.26 fvdl clrbit(cg_blksfree(cgp, 0), baseblk + k); 437 1.26 fvdl } 438 1.1 cgd n_blks += frags; 439 1.59 bouyer if (frags == sblock->fs_frag) { 440 1.26 fvdl cgp->cg_cs.cs_nbfree--; 441 1.59 bouyer sblock->fs_cstotal.cs_nbfree--; 442 1.59 bouyer sblock->fs_cs(fs, cg).cs_nbfree--; 443 1.59 bouyer ffs_clusteracct(sblock, cgp, 444 1.63 dholland ffs_fragstoblks(sblock, baseblk), -1); 445 1.59 bouyer } else { 446 1.26 fvdl cgp->cg_cs.cs_nffree -= frags; 447 1.59 bouyer sblock->fs_cstotal.cs_nffree -= frags; 448 1.59 bouyer sblock->fs_cs(fs, cg).cs_nffree -= frags; 449 1.59 bouyer } 450 1.59 bouyer sbdirty(); 451 1.26 fvdl cgdirty(); 452 1.1 cgd return (i + j); 453 1.1 cgd } 454 1.1 cgd } 455 1.1 cgd return (0); 456 1.1 cgd } 457 1.1 cgd 458 1.1 cgd /* 459 1.1 cgd * Free a previously allocated block 460 1.1 cgd */ 461 1.11 cgd void 462 1.48 xtraeme freeblk(daddr_t blkno, long frags) 463 1.1 cgd { 464 1.1 cgd struct inodesc idesc; 465 1.1 cgd 466 1.59 bouyer memset(&idesc, 0, sizeof(idesc)); 467 1.1 cgd idesc.id_blkno = blkno; 468 1.1 cgd idesc.id_numfrags = frags; 469 1.1 cgd (void)pass4check(&idesc); 470 1.1 cgd } 471 1.1 cgd 472 1.1 cgd /* 473 1.1 cgd * Find a pathname 474 1.1 cgd */ 475 1.11 cgd void 476 1.48 xtraeme getpathname(char *namebuf, size_t namebuflen, ino_t curdir, ino_t ino) 477 1.1 cgd { 478 1.1 cgd int len; 479 1.19 lukem char *cp; 480 1.1 cgd struct inodesc idesc; 481 1.1 cgd static int busy = 0; 482 1.36 fvdl struct inostat *info; 483 1.1 cgd 484 1.61 dholland if (curdir == ino && ino == UFS_ROOTINO) { 485 1.40 itojun (void)strlcpy(namebuf, "/", namebuflen); 486 1.9 mycroft return; 487 1.9 mycroft } 488 1.36 fvdl info = inoinfo(curdir); 489 1.36 fvdl if (busy || (info->ino_state != DSTATE && info->ino_state != DFOUND)) { 490 1.40 itojun (void)strlcpy(namebuf, "?", namebuflen); 491 1.1 cgd return; 492 1.1 cgd } 493 1.1 cgd busy = 1; 494 1.10 mycroft memset(&idesc, 0, sizeof(struct inodesc)); 495 1.1 cgd idesc.id_type = DATA; 496 1.1 cgd idesc.id_fix = IGNORE; 497 1.1 cgd cp = &namebuf[MAXPATHLEN - 1]; 498 1.1 cgd *cp = '\0'; 499 1.1 cgd if (curdir != ino) { 500 1.1 cgd idesc.id_parent = curdir; 501 1.1 cgd goto namelookup; 502 1.1 cgd } 503 1.61 dholland while (ino != UFS_ROOTINO) { 504 1.1 cgd idesc.id_number = ino; 505 1.1 cgd idesc.id_func = findino; 506 1.1 cgd idesc.id_name = ".."; 507 1.1 cgd if ((ckinode(ginode(ino), &idesc) & FOUND) == 0) 508 1.1 cgd break; 509 1.1 cgd namelookup: 510 1.1 cgd idesc.id_number = idesc.id_parent; 511 1.1 cgd idesc.id_parent = ino; 512 1.1 cgd idesc.id_func = findname; 513 1.1 cgd idesc.id_name = namebuf; 514 1.1 cgd if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0) 515 1.1 cgd break; 516 1.1 cgd len = strlen(namebuf); 517 1.1 cgd cp -= len; 518 1.20 lukem memmove(cp, namebuf, (size_t)len); 519 1.1 cgd *--cp = '/'; 520 1.52 tron if (cp < &namebuf[FFS_MAXNAMLEN]) 521 1.1 cgd break; 522 1.1 cgd ino = idesc.id_number; 523 1.1 cgd } 524 1.1 cgd busy = 0; 525 1.61 dholland if (ino != UFS_ROOTINO) 526 1.1 cgd *--cp = '?'; 527 1.20 lukem memmove(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp)); 528 1.1 cgd } 529 1.1 cgd 530 1.1 cgd /* 531 1.1 cgd * determine whether an inode should be fixed. 532 1.1 cgd */ 533 1.11 cgd int 534 1.50 christos dofix(struct inodesc *idesc, const char *msg) 535 1.1 cgd { 536 1.1 cgd 537 1.1 cgd switch (idesc->id_fix) { 538 1.1 cgd 539 1.1 cgd case DONTKNOW: 540 1.1 cgd if (idesc->id_type == DATA) 541 1.1 cgd direrror(idesc->id_number, msg); 542 1.1 cgd else 543 1.27 is pwarn("%s", msg); 544 1.1 cgd if (preen) { 545 1.1 cgd printf(" (SALVAGED)\n"); 546 1.1 cgd idesc->id_fix = FIX; 547 1.1 cgd return (ALTERED); 548 1.1 cgd } 549 1.1 cgd if (reply("SALVAGE") == 0) { 550 1.1 cgd idesc->id_fix = NOFIX; 551 1.1 cgd return (0); 552 1.1 cgd } 553 1.1 cgd idesc->id_fix = FIX; 554 1.1 cgd return (ALTERED); 555 1.1 cgd 556 1.1 cgd case FIX: 557 1.1 cgd return (ALTERED); 558 1.1 cgd 559 1.1 cgd case NOFIX: 560 1.1 cgd case IGNORE: 561 1.1 cgd return (0); 562 1.1 cgd 563 1.1 cgd default: 564 1.55 christos errexit("UNKNOWN INODESC FIX MODE %d", idesc->id_fix); 565 1.1 cgd } 566 1.1 cgd /* NOTREACHED */ 567 1.20 lukem return (0); 568 1.23 bouyer } 569 1.23 bouyer 570 1.25 mycroft void 571 1.48 xtraeme copyback_cg(struct bufarea *blk) 572 1.23 bouyer { 573 1.25 mycroft 574 1.25 mycroft memcpy(blk->b_un.b_cg, cgrp, sblock->fs_cgsize); 575 1.23 bouyer if (needswap) 576 1.36 fvdl ffs_cg_swap(cgrp, blk->b_un.b_cg, sblock); 577 1.23 bouyer } 578 1.23 bouyer 579 1.23 bouyer void 580 1.36 fvdl infohandler(int sig) 581 1.23 bouyer { 582 1.36 fvdl got_siginfo = 1; 583 1.1 cgd } 584 1.33 lukem 585 1.36 fvdl /* 586 1.36 fvdl * Look up state information for an inode. 587 1.36 fvdl */ 588 1.36 fvdl struct inostat * 589 1.36 fvdl inoinfo(ino_t inum) 590 1.33 lukem { 591 1.36 fvdl static struct inostat unallocated = { USTATE, 0, 0 }; 592 1.36 fvdl struct inostatlist *ilp; 593 1.68 christos size_t iloff; 594 1.36 fvdl 595 1.36 fvdl if (inum > maxino) 596 1.55 christos errexit("inoinfo: inumber %llu out of range", 597 1.51 christos (unsigned long long)inum); 598 1.36 fvdl ilp = &inostathead[inum / sblock->fs_ipg]; 599 1.36 fvdl iloff = inum % sblock->fs_ipg; 600 1.36 fvdl if (iloff >= ilp->il_numalloced) 601 1.36 fvdl return (&unallocated); 602 1.36 fvdl return (&ilp->il_stat[iloff]); 603 1.37 fvdl } 604 1.37 fvdl 605 1.37 fvdl void 606 1.43 dbj sb_oldfscompat_read(struct fs *fs, struct fs **fssave) 607 1.37 fvdl { 608 1.43 dbj if ((fs->fs_magic != FS_UFS1_MAGIC) || 609 1.43 dbj (fs->fs_old_flags & FS_FLAGS_UPDATED)) 610 1.37 fvdl return; 611 1.37 fvdl 612 1.43 dbj /* Save a copy of fields that may be modified for compatibility */ 613 1.43 dbj if (fssave) { 614 1.43 dbj if (!*fssave) 615 1.43 dbj *fssave = malloc(sizeof(struct fs)); 616 1.43 dbj if (!*fssave) 617 1.55 christos errexit("cannot allocate space for compat store"); 618 1.43 dbj memmove(*fssave, fs, sizeof(struct fs)); 619 1.43 dbj 620 1.43 dbj if (debug) 621 1.43 dbj printf("detected ufs1 superblock not yet updated for ufs2 kernels\n"); 622 1.43 dbj 623 1.43 dbj if (doswap) { 624 1.43 dbj uint16_t postbl[256]; 625 1.43 dbj int i, n; 626 1.43 dbj 627 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT) 628 1.43 dbj n = 256; 629 1.43 dbj else 630 1.43 dbj n = 128; 631 1.43 dbj 632 1.43 dbj /* extract the postbl from the unswapped superblock */ 633 1.43 dbj if (!needswap) 634 1.43 dbj ffs_sb_swap(*fssave, *fssave); 635 1.46 dbj memmove(postbl, (&(*fssave)->fs_old_postbl_start), 636 1.46 dbj n * sizeof(postbl[0])); 637 1.43 dbj if (!needswap) 638 1.43 dbj ffs_sb_swap(*fssave, *fssave); 639 1.43 dbj 640 1.43 dbj /* Now swap it */ 641 1.43 dbj for (i=0; i < n; i++) 642 1.43 dbj postbl[i] = bswap16(postbl[i]); 643 1.43 dbj 644 1.43 dbj /* And put it back such that it will get correctly 645 1.43 dbj * unscrambled if it is swapped again on the way out 646 1.43 dbj */ 647 1.43 dbj if (needswap) 648 1.43 dbj ffs_sb_swap(*fssave, *fssave); 649 1.46 dbj memmove((&(*fssave)->fs_old_postbl_start), postbl, 650 1.46 dbj n * sizeof(postbl[0])); 651 1.43 dbj if (needswap) 652 1.43 dbj ffs_sb_swap(*fssave, *fssave); 653 1.43 dbj } 654 1.43 dbj 655 1.43 dbj } 656 1.43 dbj 657 1.43 dbj /* These fields will be overwritten by their 658 1.43 dbj * original values in fs_oldfscompat_write, so it is harmless 659 1.43 dbj * to modify them here. 660 1.43 dbj */ 661 1.43 dbj fs->fs_cstotal.cs_ndir = 662 1.43 dbj fs->fs_old_cstotal.cs_ndir; 663 1.43 dbj fs->fs_cstotal.cs_nbfree = 664 1.43 dbj fs->fs_old_cstotal.cs_nbfree; 665 1.43 dbj fs->fs_cstotal.cs_nifree = 666 1.43 dbj fs->fs_old_cstotal.cs_nifree; 667 1.43 dbj fs->fs_cstotal.cs_nffree = 668 1.43 dbj fs->fs_old_cstotal.cs_nffree; 669 1.70 riastrad 670 1.43 dbj fs->fs_maxbsize = fs->fs_bsize; 671 1.43 dbj fs->fs_time = fs->fs_old_time; 672 1.43 dbj fs->fs_size = fs->fs_old_size; 673 1.43 dbj fs->fs_dsize = fs->fs_old_dsize; 674 1.43 dbj fs->fs_csaddr = fs->fs_old_csaddr; 675 1.43 dbj fs->fs_sblockloc = SBLOCK_UFS1; 676 1.43 dbj 677 1.43 dbj fs->fs_flags = fs->fs_old_flags; 678 1.43 dbj 679 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT) { 680 1.43 dbj fs->fs_old_nrpos = 8; 681 1.43 dbj fs->fs_old_npsect = fs->fs_old_nsect; 682 1.43 dbj fs->fs_old_interleave = 1; 683 1.43 dbj fs->fs_old_trackskew = 0; 684 1.43 dbj } 685 1.43 dbj } 686 1.43 dbj 687 1.43 dbj void 688 1.43 dbj sb_oldfscompat_write(struct fs *fs, struct fs *fssave) 689 1.43 dbj { 690 1.43 dbj if ((fs->fs_magic != FS_UFS1_MAGIC) || 691 1.43 dbj (fs->fs_old_flags & FS_FLAGS_UPDATED)) 692 1.43 dbj return; 693 1.43 dbj 694 1.43 dbj fs->fs_old_flags = fs->fs_flags; 695 1.37 fvdl fs->fs_old_time = fs->fs_time; 696 1.37 fvdl fs->fs_old_cstotal.cs_ndir = fs->fs_cstotal.cs_ndir; 697 1.37 fvdl fs->fs_old_cstotal.cs_nbfree = fs->fs_cstotal.cs_nbfree; 698 1.37 fvdl fs->fs_old_cstotal.cs_nifree = fs->fs_cstotal.cs_nifree; 699 1.37 fvdl fs->fs_old_cstotal.cs_nffree = fs->fs_cstotal.cs_nffree; 700 1.43 dbj 701 1.43 dbj fs->fs_flags = fssave->fs_flags; 702 1.43 dbj 703 1.43 dbj if (fs->fs_old_postblformat == FS_42POSTBLFMT) { 704 1.43 dbj fs->fs_old_nrpos = fssave->fs_old_nrpos; 705 1.43 dbj fs->fs_old_npsect = fssave->fs_old_npsect; 706 1.43 dbj fs->fs_old_interleave = fssave->fs_old_interleave; 707 1.43 dbj fs->fs_old_trackskew = fssave->fs_old_trackskew; 708 1.43 dbj } 709 1.43 dbj 710 1.43 dbj memmove(&fs->fs_old_postbl_start, &fssave->fs_old_postbl_start, 711 1.43 dbj ((fs->fs_old_postblformat == FS_42POSTBLFMT) ? 712 1.43 dbj 512 : 256)); 713 1.33 lukem } 714 1.59 bouyer 715 1.59 bouyer struct uquot * 716 1.59 bouyer find_uquot(struct uquot_hash *uq_hash, uint32_t uid, int alloc) 717 1.59 bouyer { 718 1.59 bouyer struct uquot *uq; 719 1.59 bouyer SLIST_FOREACH(uq, &uq_hash[uid & q2h_hash_mask], uq_entries) { 720 1.59 bouyer if (uq->uq_uid == uid) 721 1.59 bouyer return uq; 722 1.59 bouyer } 723 1.59 bouyer if (!alloc) 724 1.59 bouyer return NULL; 725 1.59 bouyer uq = malloc(sizeof(struct uquot)); 726 1.59 bouyer if (uq == NULL) 727 1.59 bouyer errexit("cannot allocate quota entry"); 728 1.59 bouyer memset(uq, 0, sizeof(struct uquot)); 729 1.59 bouyer uq->uq_uid = uid; 730 1.59 bouyer SLIST_INSERT_HEAD(&uq_hash[uid & q2h_hash_mask], uq, uq_entries); 731 1.59 bouyer return uq; 732 1.59 bouyer } 733 1.59 bouyer 734 1.59 bouyer void 735 1.59 bouyer remove_uquot(struct uquot_hash *uq_hash, struct uquot *uq) 736 1.59 bouyer { 737 1.59 bouyer SLIST_REMOVE(&uq_hash[uq->uq_uid & q2h_hash_mask], 738 1.59 bouyer uq, uquot, uq_entries); 739 1.59 bouyer } 740 1.59 bouyer 741 1.59 bouyer void 742 1.59 bouyer update_uquot(ino_t inum, uid_t uid, gid_t gid, int64_t bchange, int64_t ichange) 743 1.59 bouyer { 744 1.59 bouyer /* simple uquot cache: remember the last used */ 745 1.59 bouyer static struct uquot *uq_u = NULL; 746 1.59 bouyer static struct uquot *uq_g = NULL; 747 1.59 bouyer 748 1.61 dholland if (inum < UFS_ROOTINO) 749 1.59 bouyer return; 750 1.59 bouyer if (is_journal_inode(inum)) 751 1.59 bouyer return; 752 1.59 bouyer if (is_quota_inode(inum)) 753 1.59 bouyer return; 754 1.70 riastrad 755 1.59 bouyer if (uquot_user_hash == NULL) 756 1.59 bouyer return; 757 1.70 riastrad 758 1.59 bouyer if (uq_u == NULL || uq_u->uq_uid != uid) 759 1.59 bouyer uq_u = find_uquot(uquot_user_hash, uid, 1); 760 1.59 bouyer uq_u->uq_b += bchange; 761 1.59 bouyer uq_u->uq_i += ichange; 762 1.59 bouyer if (uq_g == NULL || uq_g->uq_uid != gid) 763 1.59 bouyer uq_g = find_uquot(uquot_group_hash, gid, 1); 764 1.70 riastrad uq_g->uq_b += bchange; 765 1.59 bouyer uq_g->uq_i += ichange; 766 1.59 bouyer } 767 1.59 bouyer 768 1.59 bouyer int 769 1.59 bouyer is_quota_inode(ino_t inum) 770 1.59 bouyer { 771 1.59 bouyer 772 1.59 bouyer if ((sblock->fs_flags & FS_DOQUOTA2) == 0) 773 1.59 bouyer return 0; 774 1.59 bouyer 775 1.59 bouyer if (sblock->fs_quota_magic != Q2_HEAD_MAGIC) 776 1.59 bouyer return 0; 777 1.70 riastrad 778 1.59 bouyer if (sblock->fs_quotafile[USRQUOTA] == inum) 779 1.59 bouyer return 1; 780 1.59 bouyer 781 1.70 riastrad if (sblock->fs_quotafile[GRPQUOTA] == inum) 782 1.59 bouyer return 1; 783 1.59 bouyer 784 1.59 bouyer return 0; 785 1.59 bouyer } 786