tunefs.c revision 1.13 1 1.13 bouyer /* $NetBSD: tunefs.c,v 1.13 1998/03/18 17:19:14 bouyer 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.12 lukem static char sccsid[] = "@(#)tunefs.c 8.3 (Berkeley) 5/3/95";
45 1.10 cgd #else
46 1.13 bouyer __RCSID("$NetBSD: tunefs.c,v 1.13 1998/03/18 17:19:14 bouyer 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.12 lukem #include <ufs/ufs/dinode.h>
57 1.8 mycroft #include <ufs/ffs/fs.h>
58 1.13 bouyer #include <ufs/ffs/ffs_extern.h>
59 1.8 mycroft
60 1.8 mycroft #include <errno.h>
61 1.6 cgd #include <err.h>
62 1.6 cgd #include <fcntl.h>
63 1.1 cgd #include <fstab.h>
64 1.1 cgd #include <stdio.h>
65 1.1 cgd #include <paths.h>
66 1.6 cgd #include <stdlib.h>
67 1.6 cgd #include <unistd.h>
68 1.6 cgd
69 1.6 cgd /* the optimization warning string template */
70 1.8 mycroft #define OPTWARN "should optimize for %s with minfree %s %d%%"
71 1.1 cgd
72 1.1 cgd union {
73 1.1 cgd struct fs sb;
74 1.1 cgd char pad[MAXBSIZE];
75 1.1 cgd } sbun;
76 1.1 cgd #define sblock sbun.sb
77 1.13 bouyer char buf[MAXBSIZE];
78 1.1 cgd
79 1.1 cgd int fi;
80 1.1 cgd long dev_bsize = 1;
81 1.13 bouyer int needswap = 0;
82 1.1 cgd
83 1.11 lukem void bwrite __P((daddr_t, char *, int));
84 1.11 lukem int bread __P((daddr_t, char *, int));
85 1.11 lukem void getsb __P((struct fs *, char *));
86 1.11 lukem int main __P((int, char *[]));
87 1.6 cgd void usage __P((void));
88 1.6 cgd
89 1.6 cgd int
90 1.1 cgd main(argc, argv)
91 1.1 cgd int argc;
92 1.1 cgd char *argv[];
93 1.1 cgd {
94 1.1 cgd char *cp, *special, *name;
95 1.1 cgd struct stat st;
96 1.1 cgd int i;
97 1.12 lukem int Aflag = 0, Nflag = 0;
98 1.1 cgd struct fstab *fs;
99 1.1 cgd char *chg[2], device[MAXPATHLEN];
100 1.1 cgd
101 1.1 cgd argc--, argv++;
102 1.1 cgd if (argc < 2)
103 1.6 cgd usage();
104 1.1 cgd special = argv[argc - 1];
105 1.1 cgd fs = getfsfile(special);
106 1.1 cgd if (fs)
107 1.1 cgd special = fs->fs_spec;
108 1.1 cgd again:
109 1.1 cgd if (stat(special, &st) < 0) {
110 1.1 cgd if (*special != '/') {
111 1.1 cgd if (*special == 'r')
112 1.1 cgd special++;
113 1.1 cgd (void)sprintf(device, "%s/%s", _PATH_DEV, special);
114 1.1 cgd special = device;
115 1.1 cgd goto again;
116 1.1 cgd }
117 1.6 cgd err(1, "%s", special);
118 1.1 cgd }
119 1.9 mycroft if (!S_ISBLK(st.st_mode) && !S_ISCHR(st.st_mode))
120 1.8 mycroft errx(10, "%s: not a block or character device", special);
121 1.1 cgd getsb(&sblock, special);
122 1.12 lukem chg[FS_OPTSPACE] = "space";
123 1.12 lukem chg[FS_OPTTIME] = "time";
124 1.1 cgd for (; argc > 0 && argv[0][0] == '-'; argc--, argv++) {
125 1.1 cgd for (cp = &argv[0][1]; *cp; cp++)
126 1.1 cgd switch (*cp) {
127 1.1 cgd
128 1.1 cgd case 'A':
129 1.1 cgd Aflag++;
130 1.1 cgd continue;
131 1.1 cgd
132 1.12 lukem case 'N':
133 1.12 lukem Nflag++;
134 1.12 lukem continue;
135 1.12 lukem
136 1.1 cgd case 'a':
137 1.1 cgd name = "maximum contiguous block count";
138 1.1 cgd if (argc < 1)
139 1.8 mycroft errx(10, "-a: missing %s", name);
140 1.1 cgd argc--, argv++;
141 1.1 cgd i = atoi(*argv);
142 1.1 cgd if (i < 1)
143 1.8 mycroft errx(10, "%s must be >= 1 (was %s)",
144 1.6 cgd name, *argv);
145 1.6 cgd warnx("%s changes from %d to %d",
146 1.6 cgd name, sblock.fs_maxcontig, i);
147 1.1 cgd sblock.fs_maxcontig = i;
148 1.1 cgd continue;
149 1.1 cgd
150 1.1 cgd case 'd':
151 1.1 cgd name =
152 1.1 cgd "rotational delay between contiguous blocks";
153 1.1 cgd if (argc < 1)
154 1.8 mycroft errx(10, "-d: missing %s", name);
155 1.1 cgd argc--, argv++;
156 1.1 cgd i = atoi(*argv);
157 1.6 cgd warnx("%s changes from %dms to %dms",
158 1.6 cgd name, sblock.fs_rotdelay, i);
159 1.1 cgd sblock.fs_rotdelay = i;
160 1.1 cgd continue;
161 1.1 cgd
162 1.1 cgd case 'e':
163 1.1 cgd name =
164 1.1 cgd "maximum blocks per file in a cylinder group";
165 1.1 cgd if (argc < 1)
166 1.8 mycroft errx(10, "-e: missing %s", name);
167 1.1 cgd argc--, argv++;
168 1.1 cgd i = atoi(*argv);
169 1.1 cgd if (i < 1)
170 1.8 mycroft errx(10, "%s must be >= 1 (was %s)",
171 1.6 cgd name, *argv);
172 1.6 cgd warnx("%s changes from %d to %d",
173 1.6 cgd name, sblock.fs_maxbpg, i);
174 1.1 cgd sblock.fs_maxbpg = i;
175 1.1 cgd continue;
176 1.1 cgd
177 1.1 cgd case 'm':
178 1.1 cgd name = "minimum percentage of free space";
179 1.1 cgd if (argc < 1)
180 1.8 mycroft errx(10, "-m: missing %s", name);
181 1.1 cgd argc--, argv++;
182 1.1 cgd i = atoi(*argv);
183 1.1 cgd if (i < 0 || i > 99)
184 1.8 mycroft errx(10, "bad %s (%s)", name, *argv);
185 1.6 cgd warnx("%s changes from %d%% to %d%%",
186 1.6 cgd name, sblock.fs_minfree, i);
187 1.1 cgd sblock.fs_minfree = i;
188 1.6 cgd if (i >= MINFREE &&
189 1.6 cgd sblock.fs_optim == FS_OPTSPACE)
190 1.6 cgd warnx(OPTWARN, "time", ">=", MINFREE);
191 1.6 cgd if (i < MINFREE &&
192 1.6 cgd sblock.fs_optim == FS_OPTTIME)
193 1.6 cgd warnx(OPTWARN, "space", "<", MINFREE);
194 1.1 cgd continue;
195 1.1 cgd
196 1.1 cgd case 'o':
197 1.1 cgd name = "optimization preference";
198 1.1 cgd if (argc < 1)
199 1.8 mycroft errx(10, "-o: missing %s", name);
200 1.1 cgd argc--, argv++;
201 1.1 cgd if (strcmp(*argv, chg[FS_OPTSPACE]) == 0)
202 1.1 cgd i = FS_OPTSPACE;
203 1.1 cgd else if (strcmp(*argv, chg[FS_OPTTIME]) == 0)
204 1.1 cgd i = FS_OPTTIME;
205 1.1 cgd else
206 1.8 mycroft errx(10, "bad %s (options are `space' or `time')",
207 1.6 cgd name);
208 1.1 cgd if (sblock.fs_optim == i) {
209 1.6 cgd warnx("%s remains unchanged as %s",
210 1.6 cgd name, chg[i]);
211 1.1 cgd continue;
212 1.1 cgd }
213 1.6 cgd warnx("%s changes from %s to %s",
214 1.6 cgd name, chg[sblock.fs_optim], chg[i]);
215 1.1 cgd sblock.fs_optim = i;
216 1.6 cgd if (sblock.fs_minfree >= MINFREE &&
217 1.6 cgd i == FS_OPTSPACE)
218 1.6 cgd warnx(OPTWARN, "time", ">=", MINFREE);
219 1.6 cgd if (sblock.fs_minfree < MINFREE &&
220 1.6 cgd i == FS_OPTTIME)
221 1.6 cgd warnx(OPTWARN, "space", "<", MINFREE);
222 1.1 cgd continue;
223 1.1 cgd
224 1.12 lukem case 't':
225 1.12 lukem name = "track skew in sectors";
226 1.12 lukem if (argc < 1)
227 1.12 lukem errx(10, "-t: missing %s", name);
228 1.12 lukem argc--, argv++;
229 1.12 lukem i = atoi(*argv);
230 1.12 lukem if (i < 0)
231 1.12 lukem errx(10, "%s: %s must be >= 0",
232 1.12 lukem *argv, name);
233 1.12 lukem warnx("%s changes from %d to %d",
234 1.12 lukem name, sblock.fs_trackskew, i);
235 1.12 lukem sblock.fs_trackskew = i;
236 1.12 lukem continue;
237 1.12 lukem
238 1.1 cgd default:
239 1.6 cgd usage();
240 1.1 cgd }
241 1.1 cgd }
242 1.1 cgd if (argc != 1)
243 1.6 cgd usage();
244 1.12 lukem if (Nflag) {
245 1.12 lukem fprintf(stdout, "tunefs: current settings\n");
246 1.12 lukem fprintf(stdout, "\tmaximum contiguous block count %d\n",
247 1.12 lukem sblock.fs_maxcontig);
248 1.12 lukem fprintf(stdout,
249 1.12 lukem "\trotational delay between contiguous blocks %dms\n",
250 1.12 lukem sblock.fs_rotdelay);
251 1.12 lukem fprintf(stdout,
252 1.12 lukem "\tmaximum blocks per file in a cylinder group %d\n",
253 1.12 lukem sblock.fs_maxbpg);
254 1.12 lukem fprintf(stdout, "\tminimum percentage of free space %d%%\n",
255 1.12 lukem sblock.fs_minfree);
256 1.12 lukem fprintf(stdout, "\toptimization preference: %s\n",
257 1.12 lukem chg[sblock.fs_optim]);
258 1.12 lukem fprintf(stdout, "\ttrack skew %d sectors\n",
259 1.12 lukem sblock.fs_trackskew);
260 1.12 lukem fprintf(stdout, "tunefs: no changes made\n");
261 1.12 lukem exit(0);
262 1.12 lukem }
263 1.12 lukem fi = open(special, 1);
264 1.12 lukem if (fi < 0)
265 1.12 lukem err(3, "cannot open %s for writing", special);
266 1.13 bouyer memcpy(buf, (char *)&sblock, SBSIZE);
267 1.13 bouyer if (needswap)
268 1.13 bouyer ffs_sb_swap((struct fs*)buf, (struct fs*)buf, 1);
269 1.13 bouyer bwrite((daddr_t)SBOFF / dev_bsize, buf, SBSIZE);
270 1.1 cgd if (Aflag)
271 1.1 cgd for (i = 0; i < sblock.fs_ncg; i++)
272 1.1 cgd bwrite(fsbtodb(&sblock, cgsblock(&sblock, i)),
273 1.13 bouyer buf, SBSIZE);
274 1.1 cgd close(fi);
275 1.1 cgd exit(0);
276 1.6 cgd }
277 1.6 cgd
278 1.6 cgd void
279 1.6 cgd usage()
280 1.6 cgd {
281 1.8 mycroft
282 1.12 lukem fprintf(stderr, "Usage: tunefs [-AN] tuneup-options special-device\n");
283 1.1 cgd fprintf(stderr, "where tuneup-options are:\n");
284 1.12 lukem fprintf(stderr, "\t-d rotational delay between contiguous blocks\n");
285 1.1 cgd fprintf(stderr, "\t-a maximum contiguous blocks\n");
286 1.1 cgd fprintf(stderr, "\t-e maximum blocks per file in a cylinder group\n");
287 1.1 cgd fprintf(stderr, "\t-m minimum percentage of free space\n");
288 1.1 cgd fprintf(stderr, "\t-o optimization preference (`space' or `time')\n");
289 1.12 lukem fprintf(stderr, "\t-t track skew in sectors\n");
290 1.8 mycroft exit(2);
291 1.1 cgd }
292 1.1 cgd
293 1.6 cgd void
294 1.1 cgd getsb(fs, file)
295 1.11 lukem struct fs *fs;
296 1.1 cgd char *file;
297 1.1 cgd {
298 1.1 cgd
299 1.12 lukem fi = open(file, 0);
300 1.6 cgd if (fi < 0)
301 1.12 lukem err(3, "cannot open %s for reading", file);
302 1.6 cgd if (bread((daddr_t)SBOFF, (char *)fs, SBSIZE))
303 1.8 mycroft err(4, "%s: bad super block", file);
304 1.6 cgd if (fs->fs_magic != FS_MAGIC)
305 1.13 bouyer if (fs->fs_magic == bswap32(FS_MAGIC)) {
306 1.13 bouyer needswap = 1;
307 1.13 bouyer ffs_sb_swap(fs, fs, 0);
308 1.13 bouyer } else
309 1.13 bouyer err(5, "%s: bad magic number", file);
310 1.1 cgd dev_bsize = fs->fs_fsize / fsbtodb(fs, 1);
311 1.12 lukem close(fi);
312 1.1 cgd }
313 1.1 cgd
314 1.6 cgd void
315 1.8 mycroft bwrite(blk, buf, size)
316 1.8 mycroft daddr_t blk;
317 1.1 cgd char *buf;
318 1.6 cgd int size;
319 1.1 cgd {
320 1.8 mycroft
321 1.8 mycroft if (lseek(fi, (off_t)blk * dev_bsize, SEEK_SET) < 0)
322 1.8 mycroft err(6, "FS SEEK");
323 1.6 cgd if (write(fi, buf, size) != size)
324 1.8 mycroft err(7, "FS WRITE");
325 1.1 cgd }
326 1.1 cgd
327 1.6 cgd int
328 1.1 cgd bread(bno, buf, cnt)
329 1.1 cgd daddr_t bno;
330 1.1 cgd char *buf;
331 1.6 cgd int cnt;
332 1.1 cgd {
333 1.8 mycroft int i;
334 1.1 cgd
335 1.8 mycroft if (lseek(fi, (off_t)bno * dev_bsize, SEEK_SET) < 0)
336 1.1 cgd return(1);
337 1.1 cgd if ((i = read(fi, buf, cnt)) != cnt) {
338 1.1 cgd for(i=0; i<sblock.fs_bsize; i++)
339 1.1 cgd buf[i] = 0;
340 1.1 cgd return (1);
341 1.1 cgd }
342 1.1 cgd return (0);
343 1.1 cgd }
344