Home | History | Annotate | Line # | Download | only in tunefs
tunefs.c revision 1.4
      1  1.1      cgd /*
      2  1.1      cgd  * Copyright (c) 1983 The Regents of the University of California.
      3  1.1      cgd  * All rights reserved.
      4  1.1      cgd  *
      5  1.1      cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1      cgd  * modification, are permitted provided that the following conditions
      7  1.1      cgd  * are met:
      8  1.1      cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1      cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1      cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1      cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1      cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1      cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1      cgd  *    must display the following acknowledgement:
     15  1.1      cgd  *	This product includes software developed by the University of
     16  1.1      cgd  *	California, Berkeley and its contributors.
     17  1.1      cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1      cgd  *    may be used to endorse or promote products derived from this software
     19  1.1      cgd  *    without specific prior written permission.
     20  1.1      cgd  *
     21  1.1      cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1      cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1      cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1      cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1      cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1      cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1      cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1      cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1      cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1      cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1      cgd  * SUCH DAMAGE.
     32  1.1      cgd  */
     33  1.1      cgd 
     34  1.1      cgd #ifndef lint
     35  1.1      cgd char copyright[] =
     36  1.1      cgd "@(#) Copyright (c) 1983 The Regents of the University of California.\n\
     37  1.1      cgd  All rights reserved.\n";
     38  1.1      cgd #endif /* not lint */
     39  1.1      cgd 
     40  1.1      cgd #ifndef lint
     41  1.4  mycroft /*static char sccsid[] = "from: @(#)tunefs.c	5.11 (Berkeley) 6/1/90";*/
     42  1.4  mycroft static char rcsid[] = "$Id: tunefs.c,v 1.4 1993/08/01 18:23:49 mycroft Exp $";
     43  1.1      cgd #endif /* not lint */
     44  1.1      cgd 
     45  1.1      cgd /*
     46  1.1      cgd  * tunefs: change layout parameters to an existing file system.
     47  1.1      cgd  */
     48  1.1      cgd #include <sys/param.h>
     49  1.1      cgd #include <sys/stat.h>
     50  1.1      cgd #include <ufs/fs.h>
     51  1.1      cgd #include <fstab.h>
     52  1.1      cgd #include <stdio.h>
     53  1.1      cgd #include <paths.h>
     54  1.1      cgd 
     55  1.1      cgd union {
     56  1.1      cgd 	struct	fs sb;
     57  1.1      cgd 	char pad[MAXBSIZE];
     58  1.1      cgd } sbun;
     59  1.1      cgd #define	sblock sbun.sb
     60  1.1      cgd 
     61  1.1      cgd int fi;
     62  1.1      cgd long dev_bsize = 1;
     63  1.1      cgd 
     64  1.1      cgd main(argc, argv)
     65  1.1      cgd 	int argc;
     66  1.1      cgd 	char *argv[];
     67  1.1      cgd {
     68  1.1      cgd 	char *cp, *special, *name;
     69  1.1      cgd 	struct stat st;
     70  1.1      cgd 	int i;
     71  1.1      cgd 	int Aflag = 0;
     72  1.1      cgd 	struct fstab *fs;
     73  1.1      cgd 	char *chg[2], device[MAXPATHLEN];
     74  1.1      cgd 
     75  1.1      cgd 	argc--, argv++;
     76  1.1      cgd 	if (argc < 2)
     77  1.1      cgd 		goto usage;
     78  1.1      cgd 	special = argv[argc - 1];
     79  1.1      cgd 	fs = getfsfile(special);
     80  1.1      cgd 	if (fs)
     81  1.1      cgd 		special = fs->fs_spec;
     82  1.1      cgd again:
     83  1.1      cgd 	if (stat(special, &st) < 0) {
     84  1.1      cgd 		if (*special != '/') {
     85  1.1      cgd 			if (*special == 'r')
     86  1.1      cgd 				special++;
     87  1.1      cgd 			(void)sprintf(device, "%s/%s", _PATH_DEV, special);
     88  1.1      cgd 			special = device;
     89  1.1      cgd 			goto again;
     90  1.1      cgd 		}
     91  1.1      cgd 		fprintf(stderr, "tunefs: "); perror(special);
     92  1.1      cgd 		exit(1);
     93  1.1      cgd 	}
     94  1.1      cgd 	if ((st.st_mode & S_IFMT) != S_IFBLK &&
     95  1.1      cgd 	    (st.st_mode & S_IFMT) != S_IFCHR)
     96  1.1      cgd 		fatal("%s: not a block or character device", special);
     97  1.1      cgd 	getsb(&sblock, special);
     98  1.1      cgd 	for (; argc > 0 && argv[0][0] == '-'; argc--, argv++) {
     99  1.1      cgd 		for (cp = &argv[0][1]; *cp; cp++)
    100  1.1      cgd 			switch (*cp) {
    101  1.1      cgd 
    102  1.1      cgd 			case 'A':
    103  1.1      cgd 				Aflag++;
    104  1.1      cgd 				continue;
    105  1.1      cgd 
    106  1.1      cgd 			case 'a':
    107  1.1      cgd 				name = "maximum contiguous block count";
    108  1.1      cgd 				if (argc < 1)
    109  1.1      cgd 					fatal("-a: missing %s", name);
    110  1.1      cgd 				argc--, argv++;
    111  1.1      cgd 				i = atoi(*argv);
    112  1.1      cgd 				if (i < 1)
    113  1.1      cgd 					fatal("%s: %s must be >= 1",
    114  1.1      cgd 						*argv, name);
    115  1.1      cgd 				fprintf(stdout, "%s changes from %d to %d\n",
    116  1.1      cgd 					name, sblock.fs_maxcontig, i);
    117  1.1      cgd 				sblock.fs_maxcontig = i;
    118  1.1      cgd 				continue;
    119  1.1      cgd 
    120  1.1      cgd 			case 'd':
    121  1.1      cgd 				name =
    122  1.1      cgd 				   "rotational delay between contiguous blocks";
    123  1.1      cgd 				if (argc < 1)
    124  1.1      cgd 					fatal("-d: missing %s", name);
    125  1.1      cgd 				argc--, argv++;
    126  1.1      cgd 				i = atoi(*argv);
    127  1.1      cgd 				fprintf(stdout,
    128  1.1      cgd 					"%s changes from %dms to %dms\n",
    129  1.1      cgd 					name, sblock.fs_rotdelay, i);
    130  1.1      cgd 				sblock.fs_rotdelay = i;
    131  1.1      cgd 				continue;
    132  1.1      cgd 
    133  1.1      cgd 			case 'e':
    134  1.1      cgd 				name =
    135  1.1      cgd 				  "maximum blocks per file in a cylinder group";
    136  1.1      cgd 				if (argc < 1)
    137  1.1      cgd 					fatal("-e: missing %s", name);
    138  1.1      cgd 				argc--, argv++;
    139  1.1      cgd 				i = atoi(*argv);
    140  1.1      cgd 				if (i < 1)
    141  1.1      cgd 					fatal("%s: %s must be >= 1",
    142  1.1      cgd 						*argv, name);
    143  1.1      cgd 				fprintf(stdout, "%s changes from %d to %d\n",
    144  1.1      cgd 					name, sblock.fs_maxbpg, i);
    145  1.1      cgd 				sblock.fs_maxbpg = i;
    146  1.1      cgd 				continue;
    147  1.1      cgd 
    148  1.1      cgd 			case 'm':
    149  1.1      cgd 				name = "minimum percentage of free space";
    150  1.1      cgd 				if (argc < 1)
    151  1.1      cgd 					fatal("-m: missing %s", name);
    152  1.1      cgd 				argc--, argv++;
    153  1.1      cgd 				i = atoi(*argv);
    154  1.1      cgd 				if (i < 0 || i > 99)
    155  1.1      cgd 					fatal("%s: bad %s", *argv, name);
    156  1.1      cgd 				fprintf(stdout,
    157  1.1      cgd 					"%s changes from %d%% to %d%%\n",
    158  1.1      cgd 					name, sblock.fs_minfree, i);
    159  1.1      cgd 				sblock.fs_minfree = i;
    160  1.1      cgd 				if (i >= 10 && sblock.fs_optim == FS_OPTSPACE)
    161  1.1      cgd 					fprintf(stdout, "should optimize %s",
    162  1.1      cgd 					    "for time with minfree >= 10%\n");
    163  1.1      cgd 				if (i < 10 && sblock.fs_optim == FS_OPTTIME)
    164  1.1      cgd 					fprintf(stdout, "should optimize %s",
    165  1.1      cgd 					    "for space with minfree < 10%\n");
    166  1.1      cgd 				continue;
    167  1.1      cgd 
    168  1.1      cgd 			case 'o':
    169  1.1      cgd 				name = "optimization preference";
    170  1.1      cgd 				if (argc < 1)
    171  1.1      cgd 					fatal("-o: missing %s", name);
    172  1.1      cgd 				argc--, argv++;
    173  1.1      cgd 				chg[FS_OPTSPACE] = "space";
    174  1.1      cgd 				chg[FS_OPTTIME] = "time";
    175  1.1      cgd 				if (strcmp(*argv, chg[FS_OPTSPACE]) == 0)
    176  1.1      cgd 					i = FS_OPTSPACE;
    177  1.1      cgd 				else if (strcmp(*argv, chg[FS_OPTTIME]) == 0)
    178  1.1      cgd 					i = FS_OPTTIME;
    179  1.1      cgd 				else
    180  1.1      cgd 					fatal("%s: bad %s (options are `space' or `time')",
    181  1.1      cgd 						*argv, name);
    182  1.1      cgd 				if (sblock.fs_optim == i) {
    183  1.1      cgd 					fprintf(stdout,
    184  1.1      cgd 						"%s remains unchanged as %s\n",
    185  1.1      cgd 						name, chg[i]);
    186  1.1      cgd 					continue;
    187  1.1      cgd 				}
    188  1.1      cgd 				fprintf(stdout,
    189  1.1      cgd 					"%s changes from %s to %s\n",
    190  1.1      cgd 					name, chg[sblock.fs_optim], chg[i]);
    191  1.1      cgd 				sblock.fs_optim = i;
    192  1.1      cgd 				if (sblock.fs_minfree >= 10 && i == FS_OPTSPACE)
    193  1.1      cgd 					fprintf(stdout, "should optimize %s",
    194  1.1      cgd 					    "for time with minfree >= 10%\n");
    195  1.1      cgd 				if (sblock.fs_minfree < 10 && i == FS_OPTTIME)
    196  1.1      cgd 					fprintf(stdout, "should optimize %s",
    197  1.1      cgd 					    "for space with minfree < 10%\n");
    198  1.1      cgd 				continue;
    199  1.1      cgd 
    200  1.1      cgd 			default:
    201  1.1      cgd 				fatal("-%c: unknown flag", *cp);
    202  1.1      cgd 			}
    203  1.1      cgd 	}
    204  1.1      cgd 	if (argc != 1)
    205  1.1      cgd 		goto usage;
    206  1.1      cgd 	bwrite(SBOFF / dev_bsize, (char *)&sblock, SBSIZE);
    207  1.1      cgd 	if (Aflag)
    208  1.1      cgd 		for (i = 0; i < sblock.fs_ncg; i++)
    209  1.1      cgd 			bwrite(fsbtodb(&sblock, cgsblock(&sblock, i)),
    210  1.1      cgd 			    (char *)&sblock, SBSIZE);
    211  1.1      cgd 	close(fi);
    212  1.1      cgd 	exit(0);
    213  1.1      cgd usage:
    214  1.1      cgd 	fprintf(stderr, "Usage: tunefs tuneup-options special-device\n");
    215  1.1      cgd 	fprintf(stderr, "where tuneup-options are:\n");
    216  1.1      cgd 	fprintf(stderr, "\t-a maximum contiguous blocks\n");
    217  1.1      cgd 	fprintf(stderr, "\t-d rotational delay between contiguous blocks\n");
    218  1.1      cgd 	fprintf(stderr, "\t-e maximum blocks per file in a cylinder group\n");
    219  1.1      cgd 	fprintf(stderr, "\t-m minimum percentage of free space\n");
    220  1.1      cgd 	fprintf(stderr, "\t-o optimization preference (`space' or `time')\n");
    221  1.1      cgd 	exit(2);
    222  1.1      cgd }
    223  1.1      cgd 
    224  1.1      cgd getsb(fs, file)
    225  1.1      cgd 	register struct fs *fs;
    226  1.1      cgd 	char *file;
    227  1.1      cgd {
    228  1.1      cgd 
    229  1.1      cgd 	fi = open(file, 2);
    230  1.1      cgd 	if (fi < 0) {
    231  1.1      cgd 		fprintf(stderr, "cannot open");
    232  1.1      cgd 		perror(file);
    233  1.1      cgd 		exit(3);
    234  1.1      cgd 	}
    235  1.1      cgd 	if (bread(SBOFF, (char *)fs, SBSIZE)) {
    236  1.1      cgd 		fprintf(stderr, "bad super block");
    237  1.1      cgd 		perror(file);
    238  1.1      cgd 		exit(4);
    239  1.1      cgd 	}
    240  1.1      cgd 	if (fs->fs_magic != FS_MAGIC) {
    241  1.1      cgd 		fprintf(stderr, "%s: bad magic number\n", file);
    242  1.1      cgd 		exit(5);
    243  1.1      cgd 	}
    244  1.1      cgd 	dev_bsize = fs->fs_fsize / fsbtodb(fs, 1);
    245  1.1      cgd }
    246  1.1      cgd 
    247  1.1      cgd bwrite(blk, buf, size)
    248  1.1      cgd 	char *buf;
    249  1.1      cgd 	daddr_t blk;
    250  1.1      cgd 	register size;
    251  1.1      cgd {
    252  1.1      cgd 	if (lseek(fi, blk * dev_bsize, 0) < 0) {
    253  1.1      cgd 		perror("FS SEEK");
    254  1.1      cgd 		exit(6);
    255  1.1      cgd 	}
    256  1.1      cgd 	if (write(fi, buf, size) != size) {
    257  1.1      cgd 		perror("FS WRITE");
    258  1.1      cgd 		exit(7);
    259  1.1      cgd 	}
    260  1.1      cgd }
    261  1.1      cgd 
    262  1.1      cgd bread(bno, buf, cnt)
    263  1.1      cgd 	daddr_t bno;
    264  1.1      cgd 	char *buf;
    265  1.1      cgd {
    266  1.1      cgd 	register i;
    267  1.1      cgd 
    268  1.1      cgd 	if (lseek(fi, bno * dev_bsize, 0) < 0)
    269  1.1      cgd 		return(1);
    270  1.1      cgd 	if ((i = read(fi, buf, cnt)) != cnt) {
    271  1.1      cgd 		for(i=0; i<sblock.fs_bsize; i++)
    272  1.1      cgd 			buf[i] = 0;
    273  1.1      cgd 		return (1);
    274  1.1      cgd 	}
    275  1.1      cgd 	return (0);
    276  1.1      cgd }
    277  1.1      cgd 
    278  1.1      cgd /* VARARGS1 */
    279  1.1      cgd fatal(fmt, arg1, arg2)
    280  1.1      cgd 	char *fmt, *arg1, *arg2;
    281  1.1      cgd {
    282  1.1      cgd 
    283  1.1      cgd 	fprintf(stderr, "tunefs: ");
    284  1.1      cgd 	fprintf(stderr, fmt, arg1, arg2);
    285  1.1      cgd 	putc('\n', stderr);
    286  1.1      cgd 	exit(10);
    287  1.1      cgd }
    288