/* * Copyright (c) 1983 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #ifndef lint char copyright[] = "@(#) Copyright (c) 1983 The Regents of the University of California.\n\ All rights reserved.\n"; #endif /* not lint */ #ifndef lint /*static char sccsid[] = "from: @(#)tunefs.c 5.11 (Berkeley) 6/1/90";*/ static char rcsid[] = "$Id: tunefs.c,v 1.7 1994/04/20 03:57:08 cgd Exp $"; #endif /* not lint */ /* * tunefs: change layout parameters to an existing file system. */ #include #include #include #include #include #include #include #include #include #include /* * MINFREE gives the minimum acceptable percentage of file system * blocks which may be free. If the freelist drops below this level * only the superuser may continue to allocate blocks. This may * be set to 0 if no reserve of free blocks is deemed necessary, * however throughput drops by fifty percent if the file system * is run at between 90% and 100% full; thus the default value of * fs_minfree is 10%. With 10% free space, fragmentation is not a * problem, so we choose to optimize for time. * * XXX should be in some header common with newfs; snarfed from there. */ #define MINFREE 10 /* the optimization warning string template */ #define OPTWARN "should optimize for %s with minfree %s %d%%" union { struct fs sb; char pad[MAXBSIZE]; } sbun; #define sblock sbun.sb int fi; long dev_bsize = 1; void bwrite(daddr_t, char *, int); int bread(daddr_t, char *, int); void getsb(struct fs *, char *); void usage __P((void)); int main(argc, argv) int argc; char *argv[]; { char *cp, *special, *name; struct stat st; int i; int Aflag = 0; struct fstab *fs; char *chg[2], device[MAXPATHLEN]; argc--, argv++; if (argc < 2) usage(); special = argv[argc - 1]; fs = getfsfile(special); if (fs) special = fs->fs_spec; again: if (stat(special, &st) < 0) { if (*special != '/') { if (*special == 'r') special++; (void)sprintf(device, "%s/%s", _PATH_DEV, special); special = device; goto again; } err(1, "%s", special); } if ((st.st_mode & S_IFMT) != S_IFBLK && (st.st_mode & S_IFMT) != S_IFCHR) errx(1, "%s: not a block or character device", special); getsb(&sblock, special); for (; argc > 0 && argv[0][0] == '-'; argc--, argv++) { for (cp = &argv[0][1]; *cp; cp++) switch (*cp) { case 'A': Aflag++; continue; case 'a': name = "maximum contiguous block count"; if (argc < 1) errx(1, "-a: missing %s", name); argc--, argv++; i = atoi(*argv); if (i < 1) errx(1, "%s must be >= 1 (was %s)", name, *argv); warnx("%s changes from %d to %d", name, sblock.fs_maxcontig, i); sblock.fs_maxcontig = i; continue; case 'd': name = "rotational delay between contiguous blocks"; if (argc < 1) errx(1, "-d: missing %s", name); argc--, argv++; i = atoi(*argv); warnx("%s changes from %dms to %dms", name, sblock.fs_rotdelay, i); sblock.fs_rotdelay = i; continue; case 'e': name = "maximum blocks per file in a cylinder group"; if (argc < 1) errx(1, "-e: missing %s", name); argc--, argv++; i = atoi(*argv); if (i < 1) errx(1, "%s must be >= 1 (was %s)", name, *argv); warnx("%s changes from %d to %d", name, sblock.fs_maxbpg, i); sblock.fs_maxbpg = i; continue; case 'm': name = "minimum percentage of free space"; if (argc < 1) errx(1, "-m: missing %s", name); argc--, argv++; i = atoi(*argv); if (i < 0 || i > 99) errx(1, "bad %s (%s)", name, *argv); warnx("%s changes from %d%% to %d%%", name, sblock.fs_minfree, i); sblock.fs_minfree = i; if (i >= MINFREE && sblock.fs_optim == FS_OPTSPACE) warnx(OPTWARN, "time", ">=", MINFREE); if (i < MINFREE && sblock.fs_optim == FS_OPTTIME) warnx(OPTWARN, "space", "<", MINFREE); continue; case 'o': name = "optimization preference"; if (argc < 1) errx(1, "-o: missing %s", name); argc--, argv++; chg[FS_OPTSPACE] = "space"; chg[FS_OPTTIME] = "time"; if (strcmp(*argv, chg[FS_OPTSPACE]) == 0) i = FS_OPTSPACE; else if (strcmp(*argv, chg[FS_OPTTIME]) == 0) i = FS_OPTTIME; else errx(1, "bad %s (options are `space' or `time')", name); if (sblock.fs_optim == i) { warnx("%s remains unchanged as %s", name, chg[i]); continue; } warnx("%s changes from %s to %s", name, chg[sblock.fs_optim], chg[i]); sblock.fs_optim = i; if (sblock.fs_minfree >= MINFREE && i == FS_OPTSPACE) warnx(OPTWARN, "time", ">=", MINFREE); if (sblock.fs_minfree < MINFREE && i == FS_OPTTIME) warnx(OPTWARN, "space", "<", MINFREE); continue; default: usage(); } } if (argc != 1) usage(); bwrite((daddr_t)SBOFF / dev_bsize, (char *)&sblock, SBSIZE); if (Aflag) for (i = 0; i < sblock.fs_ncg; i++) bwrite(fsbtodb(&sblock, cgsblock(&sblock, i)), (char *)&sblock, SBSIZE); close(fi); exit(0); } void usage() { fprintf(stderr, "usage: tunefs tuneup-options special-device\n"); fprintf(stderr, "where tuneup-options are:\n"); fprintf(stderr, "\t-a maximum contiguous blocks\n"); fprintf(stderr, "\t-d rotational delay between contiguous blocks\n"); fprintf(stderr, "\t-e maximum blocks per file in a cylinder group\n"); fprintf(stderr, "\t-m minimum percentage of free space\n"); fprintf(stderr, "\t-o optimization preference (`space' or `time')\n"); exit(1); } void getsb(fs, file) register struct fs *fs; char *file; { fi = open(file, 2); if (fi < 0) err(1, "cannot open %s", file); if (bread((daddr_t)SBOFF, (char *)fs, SBSIZE)) err(1, "%s: bad super block", file); if (fs->fs_magic != FS_MAGIC) err(1, "%s: bad magic number", file); dev_bsize = fs->fs_fsize / fsbtodb(fs, 1); } void bwrite(bno, buf, size) daddr_t bno; char *buf; int size; { if (lseek(fi, bno * dev_bsize, 0) < 0) err(1, "FS SEEK"); if (write(fi, buf, size) != size) err(1, "FS WRITE"); } int bread(bno, buf, cnt) daddr_t bno; char *buf; int cnt; { register i; if (lseek(fi, bno * dev_bsize, 0) < 0) return(1); if ((i = read(fi, buf, cnt)) != cnt) { for(i=0; i