Home | History | Annotate | Line # | Download | only in fsck_ffs
utilities.c revision 1.62
      1  1.62  dholland /*	$NetBSD: utilities.c,v 1.62 2013/06/23 02:06:04 dholland 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.62  dholland __RCSID("$NetBSD: utilities.c,v 1.62 2013/06/23 02:06:04 dholland 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.23    bouyer 	bufp = malloc((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.34       dbj 	bufp = malloc((unsigned int)APPLEUFS_LABEL_SIZE);
    144  1.34       dbj 	if (bufp == 0)
    145  1.55  christos 		errexit("cannot allocate buffer pool");
    146  1.34       dbj 	appleufsblk.b_un.b_buf = bufp;
    147  1.34       dbj 	initbarea(&appleufsblk);
    148   1.1       cgd 	bufhead.b_next = bufhead.b_prev = &bufhead;
    149  1.23    bouyer 	bufcnt = MAXBUFSPACE / sblock->fs_bsize;
    150   1.1       cgd 	if (bufcnt < MINBUFS)
    151   1.1       cgd 		bufcnt = MINBUFS;
    152   1.1       cgd 	for (i = 0; i < bufcnt; i++) {
    153  1.53  christos 		bp = malloc(sizeof(struct bufarea));
    154  1.23    bouyer 		bufp = malloc((unsigned int)sblock->fs_bsize);
    155   1.1       cgd 		if (bp == NULL || bufp == NULL) {
    156  1.53  christos 			if (i >= MINBUFS) {
    157  1.53  christos 				if (bp)
    158  1.53  christos 					free(bp);
    159  1.53  christos 				if (bufp)
    160  1.53  christos 					free(bufp);
    161   1.1       cgd 				break;
    162  1.53  christos 			}
    163  1.55  christos 			errexit("cannot allocate buffer pool");
    164   1.1       cgd 		}
    165   1.1       cgd 		bp->b_un.b_buf = bufp;
    166   1.1       cgd 		bp->b_prev = &bufhead;
    167   1.1       cgd 		bp->b_next = bufhead.b_next;
    168   1.1       cgd 		bufhead.b_next->b_prev = bp;
    169   1.1       cgd 		bufhead.b_next = bp;
    170   1.1       cgd 		initbarea(bp);
    171   1.1       cgd 	}
    172   1.1       cgd 	bufhead.b_size = i;	/* save number of buffers */
    173   1.1       cgd }
    174   1.1       cgd 
    175   1.1       cgd /*
    176   1.1       cgd  * Manage a cache of directory blocks.
    177   1.1       cgd  */
    178   1.1       cgd struct bufarea *
    179  1.48   xtraeme getdatablk(daddr_t blkno, long size)
    180   1.1       cgd {
    181  1.19     lukem 	struct bufarea *bp;
    182   1.1       cgd 
    183   1.1       cgd 	for (bp = bufhead.b_next; bp != &bufhead; bp = bp->b_next)
    184  1.62  dholland 		if (bp->b_bno == FFS_FSBTODB(sblock, blkno))
    185   1.1       cgd 			goto foundit;
    186   1.1       cgd 	for (bp = bufhead.b_prev; bp != &bufhead; bp = bp->b_prev)
    187   1.1       cgd 		if ((bp->b_flags & B_INUSE) == 0)
    188   1.1       cgd 			break;
    189   1.1       cgd 	if (bp == &bufhead)
    190  1.55  christos 		errexit("deadlocked buffer pool");
    191   1.1       cgd 	/* fall through */
    192   1.1       cgd foundit:
    193  1.42       dbj 	getblk(bp, blkno, size);
    194   1.1       cgd 	bp->b_prev->b_next = bp->b_next;
    195   1.1       cgd 	bp->b_next->b_prev = bp->b_prev;
    196   1.1       cgd 	bp->b_prev = &bufhead;
    197   1.1       cgd 	bp->b_next = bufhead.b_next;
    198   1.1       cgd 	bufhead.b_next->b_prev = bp;
    199   1.1       cgd 	bufhead.b_next = bp;
    200   1.1       cgd 	bp->b_flags |= B_INUSE;
    201   1.1       cgd 	return (bp);
    202   1.1       cgd }
    203   1.1       cgd 
    204   1.1       cgd void
    205  1.48   xtraeme getblk(struct bufarea *bp, daddr_t blk, long size)
    206   1.1       cgd {
    207  1.35      fvdl 	daddr_t dblk;
    208   1.1       cgd 
    209  1.62  dholland 	dblk = FFS_FSBTODB(sblock, blk);
    210  1.42       dbj 	totalreads++;
    211   1.1       cgd 	if (bp->b_bno != dblk) {
    212   1.1       cgd 		flush(fswritefd, bp);
    213   1.1       cgd 		diskreads++;
    214   1.1       cgd 		bp->b_errs = bread(fsreadfd, bp->b_un.b_buf, dblk, size);
    215   1.1       cgd 		bp->b_bno = dblk;
    216   1.1       cgd 		bp->b_size = size;
    217   1.1       cgd 	}
    218   1.1       cgd }
    219   1.1       cgd 
    220  1.11       cgd void
    221  1.48   xtraeme flush(int fd, struct bufarea *bp)
    222   1.1       cgd {
    223  1.19     lukem 	int i, j;
    224  1.32     lukem 	struct csum *ccsp;
    225   1.1       cgd 
    226   1.1       cgd 	if (!bp->b_dirty)
    227   1.1       cgd 		return;
    228   1.1       cgd 	if (bp->b_errs != 0)
    229  1.35      fvdl 		pfatal("WRITING %sZERO'ED BLOCK %lld TO DISK\n",
    230   1.1       cgd 		    (bp->b_errs == bp->b_size / dev_bsize) ? "" : "PARTIALLY ",
    231  1.35      fvdl 		    (long long)bp->b_bno);
    232   1.1       cgd 	bp->b_dirty = 0;
    233   1.1       cgd 	bp->b_errs = 0;
    234   1.1       cgd 	bwrite(fd, bp->b_un.b_buf, bp->b_bno, (long)bp->b_size);
    235   1.1       cgd 	if (bp != &sblk)
    236   1.1       cgd 		return;
    237  1.23    bouyer 	for (i = 0, j = 0; i < sblock->fs_cssize; i += sblock->fs_bsize, j++) {
    238  1.23    bouyer 		int size = sblock->fs_cssize - i < sblock->fs_bsize ?
    239  1.23    bouyer 			sblock->fs_cssize - i : sblock->fs_bsize;
    240  1.32     lukem 		ccsp = (struct csum *)((char *)sblock->fs_csp + i);
    241  1.32     lukem 		if (needswap)
    242  1.32     lukem 			ffs_csum_swap(ccsp, ccsp, size);
    243  1.32     lukem 		bwrite(fswritefd, (char *)ccsp,
    244  1.62  dholland 		    FFS_FSBTODB(sblock, sblock->fs_csaddr + j * sblock->fs_frag),
    245  1.29   mycroft 		    size);
    246  1.32     lukem 		if (needswap)
    247  1.32     lukem 			ffs_csum_swap(ccsp, ccsp, size);
    248   1.1       cgd 	}
    249   1.1       cgd }
    250   1.1       cgd 
    251  1.17  christos static void
    252  1.50  christos rwerror(const char *mesg, daddr_t blk)
    253   1.1       cgd {
    254   1.1       cgd 
    255   1.1       cgd 	if (preen == 0)
    256   1.1       cgd 		printf("\n");
    257  1.35      fvdl 	pfatal("CANNOT %s: BLK %lld", mesg, (long long)blk);
    258   1.1       cgd 	if (reply("CONTINUE") == 0)
    259  1.55  christos 		exit(FSCK_EXIT_CHECK_FAILED);
    260   1.1       cgd }
    261   1.1       cgd 
    262  1.11       cgd void
    263  1.60  christos ckfini(int noint)
    264   1.1       cgd {
    265  1.19     lukem 	struct bufarea *bp, *nbp;
    266  1.20     lukem 	int ofsmodified, cnt = 0;
    267   1.1       cgd 
    268  1.60  christos 	if (!noint) {
    269  1.60  christos 		if (doinglevel2)
    270  1.60  christos 			return;
    271  1.60  christos 		markclean = 0;
    272  1.60  christos 	}
    273  1.60  christos 
    274   1.9   mycroft 	if (fswritefd < 0) {
    275   1.9   mycroft 		(void)close(fsreadfd);
    276   1.9   mycroft 		return;
    277   1.9   mycroft 	}
    278   1.1       cgd 	flush(fswritefd, &sblk);
    279  1.39      fvdl 	if (havesb && bflag != 0 &&
    280  1.44       dbj 	    (preen || reply("UPDATE STANDARD SUPERBLOCK"))) {
    281  1.44       dbj 		if (preen)
    282  1.45       dbj 			pwarn("UPDATING STANDARD SUPERBLOCK\n");
    283  1.39      fvdl 		if (!is_ufs2 && (sblock->fs_old_flags & FS_FLAGS_UPDATED) == 0)
    284  1.39      fvdl 			sblk.b_bno = SBLOCK_UFS1 / dev_bsize;
    285  1.39      fvdl 		else
    286  1.39      fvdl 			sblk.b_bno = sblock->fs_sblockloc / dev_bsize;
    287   1.1       cgd 		sbdirty();
    288   1.1       cgd 		flush(fswritefd, &sblk);
    289   1.1       cgd 	}
    290  1.34       dbj 	flush(fswritefd, &appleufsblk);
    291  1.34       dbj 	free(appleufsblk.b_un.b_buf);
    292   1.1       cgd 	flush(fswritefd, &cgblk);
    293   1.1       cgd 	free(cgblk.b_un.b_buf);
    294   1.6   deraadt 	for (bp = bufhead.b_prev; bp && bp != &bufhead; bp = nbp) {
    295   1.1       cgd 		cnt++;
    296   1.1       cgd 		flush(fswritefd, bp);
    297   1.1       cgd 		nbp = bp->b_prev;
    298   1.1       cgd 		free(bp->b_un.b_buf);
    299   1.1       cgd 		free((char *)bp);
    300   1.1       cgd 	}
    301   1.1       cgd 	if (bufhead.b_size != cnt)
    302  1.55  christos 		errexit("Panic: lost %d buffers", bufhead.b_size - cnt);
    303   1.1       cgd 	pbp = pdirbp = (struct bufarea *)0;
    304  1.23    bouyer 	if (markclean && (sblock->fs_clean & FS_ISCLEAN) == 0) {
    305  1.14   mycroft 		/*
    306  1.14   mycroft 		 * Mark the file system as clean, and sync the superblock.
    307  1.14   mycroft 		 */
    308  1.14   mycroft 		if (preen)
    309  1.14   mycroft 			pwarn("MARKING FILE SYSTEM CLEAN\n");
    310  1.14   mycroft 		else if (!reply("MARK FILE SYSTEM CLEAN"))
    311  1.14   mycroft 			markclean = 0;
    312  1.14   mycroft 		if (markclean) {
    313  1.23    bouyer 			sblock->fs_clean = FS_ISCLEAN;
    314  1.36      fvdl 			sblock->fs_pendingblocks = 0;
    315  1.36      fvdl 			sblock->fs_pendinginodes = 0;
    316  1.14   mycroft 			sbdirty();
    317  1.20     lukem 			ofsmodified = fsmodified;
    318  1.14   mycroft 			flush(fswritefd, &sblk);
    319  1.22     lukem #if LITE2BORKEN
    320  1.20     lukem 			fsmodified = ofsmodified;
    321  1.22     lukem #endif
    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.1       cgd 	if (debug)
    328   1.1       cgd 		printf("cache missed %ld of %ld (%d%%)\n", diskreads,
    329   1.1       cgd 		    totalreads, (int)(diskreads * 100 / totalreads));
    330  1.56    simonb 	cleanup_wapbl();
    331   1.1       cgd 	(void)close(fsreadfd);
    332   1.1       cgd 	(void)close(fswritefd);
    333   1.1       cgd }
    334   1.1       cgd 
    335  1.11       cgd int
    336  1.48   xtraeme bread(int fd, char *buf, daddr_t blk, long size)
    337   1.1       cgd {
    338   1.1       cgd 	char *cp;
    339   1.1       cgd 	int i, errs;
    340   1.9   mycroft 	off_t offset;
    341   1.1       cgd 
    342   1.9   mycroft 	offset = blk;
    343   1.9   mycroft 	offset *= dev_bsize;
    344  1.56    simonb 	if ((pread(fd, buf, (int)size, offset) == size) &&
    345  1.56    simonb 	    read_wapbl(buf, size, blk) == 0)
    346   1.1       cgd 		return (0);
    347   1.1       cgd 	rwerror("READ", blk);
    348   1.1       cgd 	errs = 0;
    349  1.10   mycroft 	memset(buf, 0, (size_t)size);
    350   1.1       cgd 	printf("THE FOLLOWING DISK SECTORS COULD NOT BE READ:");
    351   1.1       cgd 	for (cp = buf, i = 0; i < size; i += secsize, cp += secsize) {
    352  1.47   mycroft 		if (pread(fd, cp, (int)secsize, offset + i) != secsize) {
    353   1.1       cgd 			if (secsize != dev_bsize && dev_bsize != 1)
    354  1.35      fvdl 				printf(" %lld (%lld),",
    355  1.35      fvdl 				    (long long)((blk*dev_bsize + i) / secsize),
    356  1.35      fvdl 				    (long long)(blk + i / dev_bsize));
    357   1.1       cgd 			else
    358  1.35      fvdl 				printf(" %lld,",
    359  1.35      fvdl 				    (long long)(blk + i / dev_bsize));
    360   1.1       cgd 			errs++;
    361   1.1       cgd 		}
    362   1.1       cgd 	}
    363   1.1       cgd 	printf("\n");
    364   1.1       cgd 	return (errs);
    365   1.1       cgd }
    366   1.1       cgd 
    367  1.11       cgd void
    368  1.48   xtraeme bwrite(int fd, char *buf, daddr_t blk, long size)
    369   1.1       cgd {
    370   1.1       cgd 	int i;
    371   1.1       cgd 	char *cp;
    372   1.9   mycroft 	off_t offset;
    373   1.1       cgd 
    374   1.1       cgd 	if (fd < 0)
    375   1.1       cgd 		return;
    376   1.9   mycroft 	offset = blk;
    377   1.9   mycroft 	offset *= dev_bsize;
    378  1.47   mycroft 	if (pwrite(fd, buf, (int)size, offset) == size) {
    379   1.1       cgd 		fsmodified = 1;
    380   1.1       cgd 		return;
    381   1.1       cgd 	}
    382   1.1       cgd 	rwerror("WRITE", blk);
    383   1.1       cgd 	printf("THE FOLLOWING SECTORS COULD NOT BE WRITTEN:");
    384   1.1       cgd 	for (cp = buf, i = 0; i < size; i += dev_bsize, cp += dev_bsize)
    385  1.47   mycroft 		if (pwrite(fd, cp, (int)dev_bsize, offset + i) != dev_bsize)
    386  1.35      fvdl 			printf(" %lld,", (long long)(blk + i / dev_bsize));
    387   1.1       cgd 	printf("\n");
    388   1.1       cgd 	return;
    389   1.1       cgd }
    390   1.1       cgd 
    391   1.1       cgd /*
    392   1.1       cgd  * allocate a data block with the specified number of fragments
    393   1.1       cgd  */
    394  1.35      fvdl daddr_t
    395  1.48   xtraeme allocblk(long frags)
    396   1.1       cgd {
    397  1.26      fvdl 	int i, j, k, cg, baseblk;
    398  1.26      fvdl 	struct cg *cgp = cgrp;
    399   1.1       cgd 
    400  1.23    bouyer 	if (frags <= 0 || frags > sblock->fs_frag)
    401   1.1       cgd 		return (0);
    402  1.23    bouyer 	for (i = 0; i < maxfsblock - sblock->fs_frag; i += sblock->fs_frag) {
    403  1.23    bouyer 		for (j = 0; j <= sblock->fs_frag - frags; j++) {
    404   1.1       cgd 			if (testbmap(i + j))
    405   1.1       cgd 				continue;
    406   1.1       cgd 			for (k = 1; k < frags; k++)
    407   1.1       cgd 				if (testbmap(i + j + k))
    408   1.1       cgd 					break;
    409   1.1       cgd 			if (k < frags) {
    410   1.1       cgd 				j += k;
    411   1.1       cgd 				continue;
    412   1.1       cgd 			}
    413  1.26      fvdl 			cg = dtog(sblock, i + j);
    414  1.26      fvdl 			getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
    415  1.26      fvdl 			memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
    416  1.26      fvdl 			if ((doswap && !needswap) || (!doswap && needswap))
    417  1.36      fvdl 				ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
    418  1.26      fvdl 			if (!cg_chkmagic(cgp, 0))
    419  1.26      fvdl 				pfatal("CG %d: ALLOCBLK: BAD MAGIC NUMBER\n",
    420  1.26      fvdl 				    cg);
    421  1.26      fvdl 			baseblk = dtogd(sblock, i + j);
    422  1.26      fvdl 			for (k = 0; k < frags; k++) {
    423   1.1       cgd 				setbmap(i + j + k);
    424  1.26      fvdl 				clrbit(cg_blksfree(cgp, 0), baseblk + k);
    425  1.26      fvdl 			}
    426   1.1       cgd 			n_blks += frags;
    427  1.59    bouyer 			if (frags == sblock->fs_frag) {
    428  1.26      fvdl 				cgp->cg_cs.cs_nbfree--;
    429  1.59    bouyer 				sblock->fs_cstotal.cs_nbfree--;
    430  1.59    bouyer 				sblock->fs_cs(fs, cg).cs_nbfree--;
    431  1.59    bouyer 				ffs_clusteracct(sblock, cgp,
    432  1.59    bouyer 				    fragstoblks(sblock, baseblk), -1);
    433  1.59    bouyer 			} else {
    434  1.26      fvdl 				cgp->cg_cs.cs_nffree -= frags;
    435  1.59    bouyer 				sblock->fs_cstotal.cs_nffree -= frags;
    436  1.59    bouyer 				sblock->fs_cs(fs, cg).cs_nffree -= frags;
    437  1.59    bouyer 			}
    438  1.59    bouyer 			sbdirty();
    439  1.26      fvdl 			cgdirty();
    440   1.1       cgd 			return (i + j);
    441   1.1       cgd 		}
    442   1.1       cgd 	}
    443   1.1       cgd 	return (0);
    444   1.1       cgd }
    445   1.1       cgd 
    446   1.1       cgd /*
    447   1.1       cgd  * Free a previously allocated block
    448   1.1       cgd  */
    449  1.11       cgd void
    450  1.48   xtraeme freeblk(daddr_t blkno, long frags)
    451   1.1       cgd {
    452   1.1       cgd 	struct inodesc idesc;
    453   1.1       cgd 
    454  1.59    bouyer 	memset(&idesc, 0, sizeof(idesc));
    455   1.1       cgd 	idesc.id_blkno = blkno;
    456   1.1       cgd 	idesc.id_numfrags = frags;
    457   1.1       cgd 	(void)pass4check(&idesc);
    458   1.1       cgd }
    459   1.1       cgd 
    460   1.1       cgd /*
    461   1.1       cgd  * Find a pathname
    462   1.1       cgd  */
    463  1.11       cgd void
    464  1.48   xtraeme getpathname(char *namebuf, size_t namebuflen, ino_t curdir, ino_t ino)
    465   1.1       cgd {
    466   1.1       cgd 	int len;
    467  1.19     lukem 	char *cp;
    468   1.1       cgd 	struct inodesc idesc;
    469   1.1       cgd 	static int busy = 0;
    470  1.36      fvdl 	struct inostat *info;
    471   1.1       cgd 
    472  1.61  dholland 	if (curdir == ino && ino == UFS_ROOTINO) {
    473  1.40    itojun 		(void)strlcpy(namebuf, "/", namebuflen);
    474   1.9   mycroft 		return;
    475   1.9   mycroft 	}
    476  1.36      fvdl 	info = inoinfo(curdir);
    477  1.36      fvdl 	if (busy || (info->ino_state != DSTATE && info->ino_state != DFOUND)) {
    478  1.40    itojun 		(void)strlcpy(namebuf, "?", namebuflen);
    479   1.1       cgd 		return;
    480   1.1       cgd 	}
    481   1.1       cgd 	busy = 1;
    482  1.10   mycroft 	memset(&idesc, 0, sizeof(struct inodesc));
    483   1.1       cgd 	idesc.id_type = DATA;
    484   1.1       cgd 	idesc.id_fix = IGNORE;
    485   1.1       cgd 	cp = &namebuf[MAXPATHLEN - 1];
    486   1.1       cgd 	*cp = '\0';
    487   1.1       cgd 	if (curdir != ino) {
    488   1.1       cgd 		idesc.id_parent = curdir;
    489   1.1       cgd 		goto namelookup;
    490   1.1       cgd 	}
    491  1.61  dholland 	while (ino != UFS_ROOTINO) {
    492   1.1       cgd 		idesc.id_number = ino;
    493   1.1       cgd 		idesc.id_func = findino;
    494   1.1       cgd 		idesc.id_name = "..";
    495   1.1       cgd 		if ((ckinode(ginode(ino), &idesc) & FOUND) == 0)
    496   1.1       cgd 			break;
    497   1.1       cgd 	namelookup:
    498   1.1       cgd 		idesc.id_number = idesc.id_parent;
    499   1.1       cgd 		idesc.id_parent = ino;
    500   1.1       cgd 		idesc.id_func = findname;
    501   1.1       cgd 		idesc.id_name = namebuf;
    502   1.1       cgd 		if ((ckinode(ginode(idesc.id_number), &idesc)&FOUND) == 0)
    503   1.1       cgd 			break;
    504   1.1       cgd 		len = strlen(namebuf);
    505   1.1       cgd 		cp -= len;
    506  1.20     lukem 		memmove(cp, namebuf, (size_t)len);
    507   1.1       cgd 		*--cp = '/';
    508  1.52      tron 		if (cp < &namebuf[FFS_MAXNAMLEN])
    509   1.1       cgd 			break;
    510   1.1       cgd 		ino = idesc.id_number;
    511   1.1       cgd 	}
    512   1.1       cgd 	busy = 0;
    513  1.61  dholland 	if (ino != UFS_ROOTINO)
    514   1.1       cgd 		*--cp = '?';
    515  1.20     lukem 	memmove(namebuf, cp, (size_t)(&namebuf[MAXPATHLEN] - cp));
    516   1.1       cgd }
    517   1.1       cgd 
    518   1.1       cgd /*
    519   1.1       cgd  * determine whether an inode should be fixed.
    520   1.1       cgd  */
    521  1.11       cgd int
    522  1.50  christos dofix(struct inodesc *idesc, const char *msg)
    523   1.1       cgd {
    524   1.1       cgd 
    525   1.1       cgd 	switch (idesc->id_fix) {
    526   1.1       cgd 
    527   1.1       cgd 	case DONTKNOW:
    528   1.1       cgd 		if (idesc->id_type == DATA)
    529   1.1       cgd 			direrror(idesc->id_number, msg);
    530   1.1       cgd 		else
    531  1.27        is 			pwarn("%s", msg);
    532   1.1       cgd 		if (preen) {
    533   1.1       cgd 			printf(" (SALVAGED)\n");
    534   1.1       cgd 			idesc->id_fix = FIX;
    535   1.1       cgd 			return (ALTERED);
    536   1.1       cgd 		}
    537   1.1       cgd 		if (reply("SALVAGE") == 0) {
    538   1.1       cgd 			idesc->id_fix = NOFIX;
    539   1.1       cgd 			return (0);
    540   1.1       cgd 		}
    541   1.1       cgd 		idesc->id_fix = FIX;
    542   1.1       cgd 		return (ALTERED);
    543   1.1       cgd 
    544   1.1       cgd 	case FIX:
    545   1.1       cgd 		return (ALTERED);
    546   1.1       cgd 
    547   1.1       cgd 	case NOFIX:
    548   1.1       cgd 	case IGNORE:
    549   1.1       cgd 		return (0);
    550   1.1       cgd 
    551   1.1       cgd 	default:
    552  1.55  christos 		errexit("UNKNOWN INODESC FIX MODE %d", idesc->id_fix);
    553   1.1       cgd 	}
    554   1.1       cgd 	/* NOTREACHED */
    555  1.20     lukem 	return (0);
    556  1.23    bouyer }
    557  1.23    bouyer 
    558  1.25   mycroft void
    559  1.48   xtraeme copyback_cg(struct bufarea *blk)
    560  1.23    bouyer {
    561  1.25   mycroft 
    562  1.25   mycroft 	memcpy(blk->b_un.b_cg, cgrp, sblock->fs_cgsize);
    563  1.23    bouyer 	if (needswap)
    564  1.36      fvdl 		ffs_cg_swap(cgrp, blk->b_un.b_cg, sblock);
    565  1.23    bouyer }
    566  1.23    bouyer 
    567  1.23    bouyer void
    568  1.36      fvdl infohandler(int sig)
    569  1.23    bouyer {
    570  1.36      fvdl 	got_siginfo = 1;
    571   1.1       cgd }
    572  1.33     lukem 
    573  1.36      fvdl /*
    574  1.36      fvdl  * Look up state information for an inode.
    575  1.36      fvdl  */
    576  1.36      fvdl struct inostat *
    577  1.36      fvdl inoinfo(ino_t inum)
    578  1.33     lukem {
    579  1.36      fvdl 	static struct inostat unallocated = { USTATE, 0, 0 };
    580  1.36      fvdl 	struct inostatlist *ilp;
    581  1.36      fvdl 	int iloff;
    582  1.36      fvdl 
    583  1.36      fvdl 	if (inum > maxino)
    584  1.55  christos 		errexit("inoinfo: inumber %llu out of range",
    585  1.51  christos 		    (unsigned long long)inum);
    586  1.36      fvdl 	ilp = &inostathead[inum / sblock->fs_ipg];
    587  1.36      fvdl 	iloff = inum % sblock->fs_ipg;
    588  1.36      fvdl 	if (iloff >= ilp->il_numalloced)
    589  1.36      fvdl 		return (&unallocated);
    590  1.36      fvdl 	return (&ilp->il_stat[iloff]);
    591  1.37      fvdl }
    592  1.37      fvdl 
    593  1.37      fvdl void
    594  1.43       dbj sb_oldfscompat_read(struct fs *fs, struct fs **fssave)
    595  1.37      fvdl {
    596  1.43       dbj 	if ((fs->fs_magic != FS_UFS1_MAGIC) ||
    597  1.43       dbj 	    (fs->fs_old_flags & FS_FLAGS_UPDATED))
    598  1.37      fvdl 		return;
    599  1.37      fvdl 
    600  1.43       dbj 	/* Save a copy of fields that may be modified for compatibility */
    601  1.43       dbj 	if (fssave) {
    602  1.43       dbj 		if (!*fssave)
    603  1.43       dbj 			*fssave = malloc(sizeof(struct fs));
    604  1.43       dbj 		if (!*fssave)
    605  1.55  christos 			errexit("cannot allocate space for compat store");
    606  1.43       dbj 		memmove(*fssave, fs, sizeof(struct fs));
    607  1.43       dbj 
    608  1.43       dbj 		if (debug)
    609  1.43       dbj 			printf("detected ufs1 superblock not yet updated for ufs2 kernels\n");
    610  1.43       dbj 
    611  1.43       dbj 		if (doswap) {
    612  1.43       dbj 			uint16_t postbl[256];
    613  1.43       dbj 			int i, n;
    614  1.43       dbj 
    615  1.43       dbj 			if (fs->fs_old_postblformat == FS_42POSTBLFMT)
    616  1.43       dbj 				n = 256;
    617  1.43       dbj 			else
    618  1.43       dbj 				n = 128;
    619  1.43       dbj 
    620  1.43       dbj 			/* extract the postbl from the unswapped superblock */
    621  1.43       dbj 			if (!needswap)
    622  1.43       dbj 				ffs_sb_swap(*fssave, *fssave);
    623  1.46       dbj 			memmove(postbl, (&(*fssave)->fs_old_postbl_start),
    624  1.46       dbj 			    n * sizeof(postbl[0]));
    625  1.43       dbj 			if (!needswap)
    626  1.43       dbj 				ffs_sb_swap(*fssave, *fssave);
    627  1.43       dbj 
    628  1.43       dbj 			/* Now swap it */
    629  1.43       dbj 			for (i=0; i < n; i++)
    630  1.43       dbj 				postbl[i] = bswap16(postbl[i]);
    631  1.43       dbj 
    632  1.43       dbj 			/* And put it back such that it will get correctly
    633  1.43       dbj 			 * unscrambled if it is swapped again on the way out
    634  1.43       dbj 			 */
    635  1.43       dbj 			if (needswap)
    636  1.43       dbj 				ffs_sb_swap(*fssave, *fssave);
    637  1.46       dbj 			memmove((&(*fssave)->fs_old_postbl_start), postbl,
    638  1.46       dbj 			    n * sizeof(postbl[0]));
    639  1.43       dbj 			if (needswap)
    640  1.43       dbj 				ffs_sb_swap(*fssave, *fssave);
    641  1.43       dbj 		}
    642  1.43       dbj 
    643  1.43       dbj 	}
    644  1.43       dbj 
    645  1.43       dbj 	/* These fields will be overwritten by their
    646  1.43       dbj 	 * original values in fs_oldfscompat_write, so it is harmless
    647  1.43       dbj 	 * to modify them here.
    648  1.43       dbj 	 */
    649  1.43       dbj 	fs->fs_cstotal.cs_ndir =
    650  1.43       dbj 	    fs->fs_old_cstotal.cs_ndir;
    651  1.43       dbj 	fs->fs_cstotal.cs_nbfree =
    652  1.43       dbj 	    fs->fs_old_cstotal.cs_nbfree;
    653  1.43       dbj 	fs->fs_cstotal.cs_nifree =
    654  1.43       dbj 	    fs->fs_old_cstotal.cs_nifree;
    655  1.43       dbj 	fs->fs_cstotal.cs_nffree =
    656  1.43       dbj 	    fs->fs_old_cstotal.cs_nffree;
    657  1.43       dbj 
    658  1.43       dbj 	fs->fs_maxbsize = fs->fs_bsize;
    659  1.43       dbj 	fs->fs_time = fs->fs_old_time;
    660  1.43       dbj 	fs->fs_size = fs->fs_old_size;
    661  1.43       dbj 	fs->fs_dsize = fs->fs_old_dsize;
    662  1.43       dbj 	fs->fs_csaddr = fs->fs_old_csaddr;
    663  1.43       dbj 	fs->fs_sblockloc = SBLOCK_UFS1;
    664  1.43       dbj 
    665  1.43       dbj 	fs->fs_flags = fs->fs_old_flags;
    666  1.43       dbj 
    667  1.43       dbj 	if (fs->fs_old_postblformat == FS_42POSTBLFMT) {
    668  1.43       dbj 		fs->fs_old_nrpos = 8;
    669  1.43       dbj 		fs->fs_old_npsect = fs->fs_old_nsect;
    670  1.43       dbj 		fs->fs_old_interleave = 1;
    671  1.43       dbj 		fs->fs_old_trackskew = 0;
    672  1.43       dbj 	}
    673  1.43       dbj }
    674  1.43       dbj 
    675  1.43       dbj void
    676  1.43       dbj sb_oldfscompat_write(struct fs *fs, struct fs *fssave)
    677  1.43       dbj {
    678  1.43       dbj 	if ((fs->fs_magic != FS_UFS1_MAGIC) ||
    679  1.43       dbj 	    (fs->fs_old_flags & FS_FLAGS_UPDATED))
    680  1.43       dbj 		return;
    681  1.43       dbj 
    682  1.43       dbj 	fs->fs_old_flags = fs->fs_flags;
    683  1.37      fvdl 	fs->fs_old_time = fs->fs_time;
    684  1.37      fvdl 	fs->fs_old_cstotal.cs_ndir = fs->fs_cstotal.cs_ndir;
    685  1.37      fvdl 	fs->fs_old_cstotal.cs_nbfree = fs->fs_cstotal.cs_nbfree;
    686  1.37      fvdl 	fs->fs_old_cstotal.cs_nifree = fs->fs_cstotal.cs_nifree;
    687  1.37      fvdl 	fs->fs_old_cstotal.cs_nffree = fs->fs_cstotal.cs_nffree;
    688  1.43       dbj 
    689  1.43       dbj 	fs->fs_flags = fssave->fs_flags;
    690  1.43       dbj 
    691  1.43       dbj 	if (fs->fs_old_postblformat == FS_42POSTBLFMT) {
    692  1.43       dbj 		fs->fs_old_nrpos = fssave->fs_old_nrpos;
    693  1.43       dbj 		fs->fs_old_npsect = fssave->fs_old_npsect;
    694  1.43       dbj 		fs->fs_old_interleave = fssave->fs_old_interleave;
    695  1.43       dbj 		fs->fs_old_trackskew = fssave->fs_old_trackskew;
    696  1.43       dbj 	}
    697  1.43       dbj 
    698  1.43       dbj 	memmove(&fs->fs_old_postbl_start, &fssave->fs_old_postbl_start,
    699  1.43       dbj 	    ((fs->fs_old_postblformat == FS_42POSTBLFMT) ?
    700  1.43       dbj 	    512 : 256));
    701  1.33     lukem }
    702  1.59    bouyer 
    703  1.59    bouyer struct uquot *
    704  1.59    bouyer find_uquot(struct uquot_hash *uq_hash, uint32_t uid, int alloc)
    705  1.59    bouyer {
    706  1.59    bouyer 	struct uquot *uq;
    707  1.59    bouyer 	SLIST_FOREACH(uq, &uq_hash[uid & q2h_hash_mask], uq_entries) {
    708  1.59    bouyer 		if (uq->uq_uid == uid)
    709  1.59    bouyer 			return uq;
    710  1.59    bouyer 	}
    711  1.59    bouyer 	if (!alloc)
    712  1.59    bouyer 		return NULL;
    713  1.59    bouyer 	uq = malloc(sizeof(struct uquot));
    714  1.59    bouyer 	if (uq == NULL)
    715  1.59    bouyer 		errexit("cannot allocate quota entry");
    716  1.59    bouyer 	memset(uq, 0, sizeof(struct uquot));
    717  1.59    bouyer 	uq->uq_uid = uid;
    718  1.59    bouyer 	SLIST_INSERT_HEAD(&uq_hash[uid & q2h_hash_mask], uq, uq_entries);
    719  1.59    bouyer 	return uq;
    720  1.59    bouyer }
    721  1.59    bouyer 
    722  1.59    bouyer void
    723  1.59    bouyer remove_uquot(struct uquot_hash *uq_hash, struct uquot *uq)
    724  1.59    bouyer {
    725  1.59    bouyer 	SLIST_REMOVE(&uq_hash[uq->uq_uid & q2h_hash_mask],
    726  1.59    bouyer 	    uq, uquot, uq_entries);
    727  1.59    bouyer }
    728  1.59    bouyer 
    729  1.59    bouyer void
    730  1.59    bouyer update_uquot(ino_t inum, uid_t uid, gid_t gid, int64_t bchange, int64_t ichange)
    731  1.59    bouyer {
    732  1.59    bouyer 	/* simple uquot cache: remember the last used */
    733  1.59    bouyer 	static struct uquot *uq_u = NULL;
    734  1.59    bouyer 	static struct uquot *uq_g = NULL;
    735  1.59    bouyer 
    736  1.61  dholland 	if (inum < UFS_ROOTINO)
    737  1.59    bouyer 		return;
    738  1.59    bouyer 	if (is_journal_inode(inum))
    739  1.59    bouyer 		return;
    740  1.59    bouyer 	if (is_quota_inode(inum))
    741  1.59    bouyer 		return;
    742  1.59    bouyer 
    743  1.59    bouyer 	if (uquot_user_hash == NULL)
    744  1.59    bouyer 		return;
    745  1.59    bouyer 
    746  1.59    bouyer 	if (uq_u == NULL || uq_u->uq_uid != uid)
    747  1.59    bouyer 		uq_u = find_uquot(uquot_user_hash, uid, 1);
    748  1.59    bouyer 	uq_u->uq_b += bchange;
    749  1.59    bouyer 	uq_u->uq_i += ichange;
    750  1.59    bouyer 	if (uq_g == NULL || uq_g->uq_uid != gid)
    751  1.59    bouyer 		uq_g = find_uquot(uquot_group_hash, gid, 1);
    752  1.59    bouyer 	uq_g->uq_b += bchange;
    753  1.59    bouyer 	uq_g->uq_i += ichange;
    754  1.59    bouyer }
    755  1.59    bouyer 
    756  1.59    bouyer int
    757  1.59    bouyer is_quota_inode(ino_t inum)
    758  1.59    bouyer {
    759  1.59    bouyer 
    760  1.59    bouyer 	if ((sblock->fs_flags & FS_DOQUOTA2) == 0)
    761  1.59    bouyer 		return 0;
    762  1.59    bouyer 
    763  1.59    bouyer 	if (sblock->fs_quota_magic != Q2_HEAD_MAGIC)
    764  1.59    bouyer 		return 0;
    765  1.59    bouyer 
    766  1.59    bouyer 	if (sblock->fs_quotafile[USRQUOTA] == inum)
    767  1.59    bouyer 		return 1;
    768  1.59    bouyer 
    769  1.59    bouyer 	if (sblock->fs_quotafile[GRPQUOTA] == inum)
    770  1.59    bouyer 		return 1;
    771  1.59    bouyer 
    772  1.59    bouyer 	return 0;
    773  1.59    bouyer }
    774