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