preen.c revision 1.1 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1990 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 static char sccsid[] = "@(#)preen.c 5.7 (Berkeley) 3/19/91";
36 1.1 cgd #endif /* not lint */
37 1.1 cgd
38 1.1 cgd #include <sys/param.h>
39 1.1 cgd #include <sys/stat.h>
40 1.1 cgd #include <sys/wait.h>
41 1.1 cgd #include <fstab.h>
42 1.1 cgd #include <string.h>
43 1.1 cgd #include <stdio.h>
44 1.1 cgd #include <stdlib.h>
45 1.1 cgd #include <ctype.h>
46 1.1 cgd
47 1.1 cgd char *rawname(), *unrawname(), *blockcheck();
48 1.1 cgd
49 1.1 cgd struct part {
50 1.1 cgd struct part *next; /* forward link of partitions on disk */
51 1.1 cgd char *name; /* device name */
52 1.1 cgd char *fsname; /* mounted filesystem name */
53 1.1 cgd long auxdata; /* auxillary data for application */
54 1.1 cgd } *badlist, **badnext = &badlist;
55 1.1 cgd
56 1.1 cgd struct disk {
57 1.1 cgd char *name; /* disk base name */
58 1.1 cgd struct disk *next; /* forward link for list of disks */
59 1.1 cgd struct part *part; /* head of list of partitions on disk */
60 1.1 cgd int pid; /* If != 0, pid of proc working on */
61 1.1 cgd } *disks;
62 1.1 cgd
63 1.1 cgd int nrun, ndisks;
64 1.1 cgd char hotroot;
65 1.1 cgd
66 1.1 cgd checkfstab(preen, maxrun, docheck, chkit)
67 1.1 cgd int preen, maxrun;
68 1.1 cgd int (*docheck)(), (*chkit)();
69 1.1 cgd {
70 1.1 cgd register struct fstab *fsp;
71 1.1 cgd register struct disk *dk, *nextdisk;
72 1.1 cgd register struct part *pt;
73 1.1 cgd int ret, pid, retcode, passno, sumstatus, status;
74 1.1 cgd long auxdata;
75 1.1 cgd char *name;
76 1.1 cgd
77 1.1 cgd sumstatus = 0;
78 1.1 cgd for (passno = 1; passno <= 2; passno++) {
79 1.1 cgd if (setfsent() == 0) {
80 1.1 cgd fprintf(stderr, "Can't open checklist file: %s\n",
81 1.1 cgd _PATH_FSTAB);
82 1.1 cgd return (8);
83 1.1 cgd }
84 1.1 cgd while ((fsp = getfsent()) != 0) {
85 1.1 cgd if ((auxdata = (*docheck)(fsp)) == 0)
86 1.1 cgd continue;
87 1.1 cgd if (preen == 0 || passno == 1 && fsp->fs_passno == 1) {
88 1.1 cgd if (name = blockcheck(fsp->fs_spec)) {
89 1.1 cgd if (sumstatus = (*chkit)(name,
90 1.1 cgd fsp->fs_file, auxdata, 0))
91 1.1 cgd return (sumstatus);
92 1.1 cgd } else if (preen)
93 1.1 cgd return (8);
94 1.1 cgd } else if (passno == 2 && fsp->fs_passno > 1) {
95 1.1 cgd if ((name = blockcheck(fsp->fs_spec)) == NULL) {
96 1.1 cgd fprintf(stderr, "BAD DISK NAME %s\n",
97 1.1 cgd fsp->fs_spec);
98 1.1 cgd sumstatus |= 8;
99 1.1 cgd continue;
100 1.1 cgd }
101 1.1 cgd addpart(name, fsp->fs_file, auxdata);
102 1.1 cgd }
103 1.1 cgd }
104 1.1 cgd if (preen == 0)
105 1.1 cgd return (0);
106 1.1 cgd }
107 1.1 cgd if (preen) {
108 1.1 cgd if (maxrun == 0)
109 1.1 cgd maxrun = ndisks;
110 1.1 cgd if (maxrun > ndisks)
111 1.1 cgd maxrun = ndisks;
112 1.1 cgd nextdisk = disks;
113 1.1 cgd for (passno = 0; passno < maxrun; ++passno) {
114 1.1 cgd while (ret = startdisk(nextdisk, chkit) && nrun > 0)
115 1.1 cgd sleep(10);
116 1.1 cgd if (ret)
117 1.1 cgd return (ret);
118 1.1 cgd nextdisk = nextdisk->next;
119 1.1 cgd }
120 1.1 cgd while ((pid = wait(&status)) != -1) {
121 1.1 cgd for (dk = disks; dk; dk = dk->next)
122 1.1 cgd if (dk->pid == pid)
123 1.1 cgd break;
124 1.1 cgd if (dk == 0) {
125 1.1 cgd printf("Unknown pid %d\n", pid);
126 1.1 cgd continue;
127 1.1 cgd }
128 1.1 cgd if (WIFEXITED(status))
129 1.1 cgd retcode = WEXITSTATUS(status);
130 1.1 cgd else
131 1.1 cgd retcode = 0;
132 1.1 cgd if (WIFSIGNALED(status)) {
133 1.1 cgd printf("%s (%s): EXITED WITH SIGNAL %d\n",
134 1.1 cgd dk->part->name, dk->part->fsname,
135 1.1 cgd WTERMSIG(status));
136 1.1 cgd retcode = 8;
137 1.1 cgd }
138 1.1 cgd if (retcode != 0) {
139 1.1 cgd sumstatus |= retcode;
140 1.1 cgd *badnext = dk->part;
141 1.1 cgd badnext = &dk->part->next;
142 1.1 cgd dk->part = dk->part->next;
143 1.1 cgd *badnext = NULL;
144 1.1 cgd } else
145 1.1 cgd dk->part = dk->part->next;
146 1.1 cgd dk->pid = 0;
147 1.1 cgd nrun--;
148 1.1 cgd if (dk->part == NULL)
149 1.1 cgd ndisks--;
150 1.1 cgd
151 1.1 cgd if (nextdisk == NULL) {
152 1.1 cgd if (dk->part) {
153 1.1 cgd while (ret = startdisk(dk, chkit) &&
154 1.1 cgd nrun > 0)
155 1.1 cgd sleep(10);
156 1.1 cgd if (ret)
157 1.1 cgd return (ret);
158 1.1 cgd }
159 1.1 cgd } else if (nrun < maxrun && nrun < ndisks) {
160 1.1 cgd for ( ;; ) {
161 1.1 cgd if ((nextdisk = nextdisk->next) == NULL)
162 1.1 cgd nextdisk = disks;
163 1.1 cgd if (nextdisk->part != NULL &&
164 1.1 cgd nextdisk->pid == 0)
165 1.1 cgd break;
166 1.1 cgd }
167 1.1 cgd while (ret = startdisk(nextdisk, chkit) &&
168 1.1 cgd nrun > 0)
169 1.1 cgd sleep(10);
170 1.1 cgd if (ret)
171 1.1 cgd return (ret);
172 1.1 cgd }
173 1.1 cgd }
174 1.1 cgd }
175 1.1 cgd if (sumstatus) {
176 1.1 cgd if (badlist == 0)
177 1.1 cgd return (sumstatus);
178 1.1 cgd fprintf(stderr, "THE FOLLOWING FILE SYSTEM%s HAD AN %s\n\t",
179 1.1 cgd badlist->next ? "S" : "", "UNEXPECTED INCONSISTENCY:");
180 1.1 cgd for (pt = badlist; pt; pt = pt->next)
181 1.1 cgd fprintf(stderr, "%s (%s)%s", pt->name, pt->fsname,
182 1.1 cgd pt->next ? ", " : "\n");
183 1.1 cgd return (sumstatus);
184 1.1 cgd }
185 1.1 cgd (void)endfsent();
186 1.1 cgd return (0);
187 1.1 cgd }
188 1.1 cgd
189 1.1 cgd struct disk *
190 1.1 cgd finddisk(name)
191 1.1 cgd char *name;
192 1.1 cgd {
193 1.1 cgd register struct disk *dk, **dkp;
194 1.1 cgd register char *p;
195 1.1 cgd size_t len;
196 1.1 cgd
197 1.1 cgd for (p = name + strlen(name) - 1; p >= name; --p)
198 1.1 cgd if (isdigit(*p)) {
199 1.1 cgd len = p - name + 1;
200 1.1 cgd break;
201 1.1 cgd }
202 1.1 cgd if (p < name)
203 1.1 cgd len = strlen(name);
204 1.1 cgd
205 1.1 cgd for (dk = disks, dkp = &disks; dk; dkp = &dk->next, dk = dk->next) {
206 1.1 cgd if (strncmp(dk->name, name, len) == 0 &&
207 1.1 cgd dk->name[len] == 0)
208 1.1 cgd return (dk);
209 1.1 cgd }
210 1.1 cgd if ((*dkp = (struct disk *)malloc(sizeof(struct disk))) == NULL) {
211 1.1 cgd fprintf(stderr, "out of memory");
212 1.1 cgd exit (8);
213 1.1 cgd }
214 1.1 cgd dk = *dkp;
215 1.1 cgd if ((dk->name = malloc(len + 1)) == NULL) {
216 1.1 cgd fprintf(stderr, "out of memory");
217 1.1 cgd exit (8);
218 1.1 cgd }
219 1.1 cgd (void)strncpy(dk->name, name, len);
220 1.1 cgd dk->name[len] = '\0';
221 1.1 cgd dk->part = NULL;
222 1.1 cgd dk->next = NULL;
223 1.1 cgd dk->pid = 0;
224 1.1 cgd ndisks++;
225 1.1 cgd return (dk);
226 1.1 cgd }
227 1.1 cgd
228 1.1 cgd addpart(name, fsname, auxdata)
229 1.1 cgd char *name, *fsname;
230 1.1 cgd long auxdata;
231 1.1 cgd {
232 1.1 cgd struct disk *dk = finddisk(name);
233 1.1 cgd register struct part *pt, **ppt = &dk->part;
234 1.1 cgd
235 1.1 cgd for (pt = dk->part; pt; ppt = &pt->next, pt = pt->next)
236 1.1 cgd if (strcmp(pt->name, name) == 0) {
237 1.1 cgd printf("%s in fstab more than once!\n", name);
238 1.1 cgd return;
239 1.1 cgd }
240 1.1 cgd if ((*ppt = (struct part *)malloc(sizeof(struct part))) == NULL) {
241 1.1 cgd fprintf(stderr, "out of memory");
242 1.1 cgd exit (8);
243 1.1 cgd }
244 1.1 cgd pt = *ppt;
245 1.1 cgd if ((pt->name = malloc(strlen(name) + 1)) == NULL) {
246 1.1 cgd fprintf(stderr, "out of memory");
247 1.1 cgd exit (8);
248 1.1 cgd }
249 1.1 cgd (void)strcpy(pt->name, name);
250 1.1 cgd if ((pt->fsname = malloc(strlen(fsname) + 1)) == NULL) {
251 1.1 cgd fprintf(stderr, "out of memory");
252 1.1 cgd exit (8);
253 1.1 cgd }
254 1.1 cgd (void)strcpy(pt->fsname, fsname);
255 1.1 cgd pt->next = NULL;
256 1.1 cgd pt->auxdata = auxdata;
257 1.1 cgd }
258 1.1 cgd
259 1.1 cgd startdisk(dk, checkit)
260 1.1 cgd register struct disk *dk;
261 1.1 cgd int (*checkit)();
262 1.1 cgd {
263 1.1 cgd register struct part *pt = dk->part;
264 1.1 cgd
265 1.1 cgd dk->pid = fork();
266 1.1 cgd if (dk->pid < 0) {
267 1.1 cgd perror("fork");
268 1.1 cgd return (8);
269 1.1 cgd }
270 1.1 cgd if (dk->pid == 0)
271 1.1 cgd exit((*checkit)(pt->name, pt->fsname, pt->auxdata, 1));
272 1.1 cgd nrun++;
273 1.1 cgd return (0);
274 1.1 cgd }
275 1.1 cgd
276 1.1 cgd char *
277 1.1 cgd blockcheck(name)
278 1.1 cgd char *name;
279 1.1 cgd {
280 1.1 cgd struct stat stslash, stblock, stchar;
281 1.1 cgd char *raw;
282 1.1 cgd int retried = 0;
283 1.1 cgd
284 1.1 cgd hotroot = 0;
285 1.1 cgd if (stat("/", &stslash) < 0) {
286 1.1 cgd perror("/");
287 1.1 cgd printf("Can't stat root\n");
288 1.1 cgd return (0);
289 1.1 cgd }
290 1.1 cgd retry:
291 1.1 cgd if (stat(name, &stblock) < 0) {
292 1.1 cgd perror(name);
293 1.1 cgd printf("Can't stat %s\n", name);
294 1.1 cgd return (0);
295 1.1 cgd }
296 1.1 cgd if ((stblock.st_mode & S_IFMT) == S_IFBLK) {
297 1.1 cgd if (stslash.st_dev == stblock.st_rdev)
298 1.1 cgd hotroot++;
299 1.1 cgd raw = rawname(name);
300 1.1 cgd if (stat(raw, &stchar) < 0) {
301 1.1 cgd perror(raw);
302 1.1 cgd printf("Can't stat %s\n", raw);
303 1.1 cgd return (name);
304 1.1 cgd }
305 1.1 cgd if ((stchar.st_mode & S_IFMT) == S_IFCHR) {
306 1.1 cgd return (raw);
307 1.1 cgd } else {
308 1.1 cgd printf("%s is not a character device\n", raw);
309 1.1 cgd return (name);
310 1.1 cgd }
311 1.1 cgd } else if ((stblock.st_mode & S_IFMT) == S_IFCHR && !retried) {
312 1.1 cgd name = unrawname(name);
313 1.1 cgd retried++;
314 1.1 cgd goto retry;
315 1.1 cgd }
316 1.1 cgd printf("Can't make sense out of name %s\n", name);
317 1.1 cgd return (0);
318 1.1 cgd }
319 1.1 cgd
320 1.1 cgd char *
321 1.1 cgd unrawname(name)
322 1.1 cgd char *name;
323 1.1 cgd {
324 1.1 cgd char *dp;
325 1.1 cgd struct stat stb;
326 1.1 cgd
327 1.1 cgd if ((dp = rindex(name, '/')) == 0)
328 1.1 cgd return (name);
329 1.1 cgd if (stat(name, &stb) < 0)
330 1.1 cgd return (name);
331 1.1 cgd if ((stb.st_mode & S_IFMT) != S_IFCHR)
332 1.1 cgd return (name);
333 1.1 cgd if (dp[1] != 'r')
334 1.1 cgd return (name);
335 1.1 cgd (void)strcpy(&dp[1], &dp[2]);
336 1.1 cgd return (name);
337 1.1 cgd }
338 1.1 cgd
339 1.1 cgd char *
340 1.1 cgd rawname(name)
341 1.1 cgd char *name;
342 1.1 cgd {
343 1.1 cgd static char rawbuf[32];
344 1.1 cgd char *dp;
345 1.1 cgd
346 1.1 cgd if ((dp = rindex(name, '/')) == 0)
347 1.1 cgd return (0);
348 1.1 cgd *dp = 0;
349 1.1 cgd (void)strcpy(rawbuf, name);
350 1.1 cgd *dp = '/';
351 1.1 cgd (void)strcat(rawbuf, "/r");
352 1.1 cgd (void)strcat(rawbuf, &dp[1]);
353 1.1 cgd return (rawbuf);
354 1.1 cgd }
355