setup.c revision 23799
1/*
2 * Copyright (c) 1980, 1986, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 *    must display the following acknowledgement:
15 *	This product includes software developed by the University of
16 *	California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 *    may be used to endorse or promote products derived from this software
19 *    without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#ifndef lint
35static const char sccsid[] = "@(#)setup.c	8.10 (Berkeley) 5/9/95";
36#endif /* not lint */
37
38#define DKTYPENAMES
39#include <sys/param.h>
40#include <sys/time.h>
41#include <sys/stat.h>
42#include <sys/ioctl.h>
43#include <sys/disklabel.h>
44#include <sys/file.h>
45
46#include <ufs/ufs/dinode.h>
47#include <ufs/ffs/fs.h>
48
49#include <ctype.h>
50#include <err.h>
51#include <errno.h>
52#include <string.h>
53
54#include "fsck.h"
55
56struct bufarea asblk;
57#define altsblock (*asblk.b_un.b_fs)
58#define POWEROF2(num)	(((num) & ((num) - 1)) == 0)
59
60static void badsb __P((int listerr, char *s));
61static int calcsb __P((char *dev, int devfd, struct fs *fs));
62static struct disklabel *getdisklabel __P((char *s, int fd));
63static int readsb __P((int listerr));
64
65/*
66 * Read in a superblock finding an alternate if necessary.
67 * Return 1 if successful, 0 if unsuccessful, -1 if filesystem
68 * is already clean (preen mode only).
69 */
70int
71setup(dev)
72	char *dev;
73{
74	long cg, size, asked, i, j;
75	long skipclean, bmapsize;
76	struct disklabel *lp;
77	off_t sizepb;
78	struct stat statb;
79	struct fs proto;
80
81	havesb = 0;
82	fswritefd = -1;
83	skipclean = preen;
84	if (stat(dev, &statb) < 0) {
85		printf("Can't stat %s: %s\n", dev, strerror(errno));
86		return (0);
87	}
88	if ((statb.st_mode & S_IFMT) != S_IFCHR) {
89		pfatal("%s is not a character device", dev);
90		if (reply("CONTINUE") == 0)
91			return (0);
92	}
93	if ((fsreadfd = open(dev, O_RDONLY)) < 0) {
94		printf("Can't open %s: %s\n", dev, strerror(errno));
95		return (0);
96	}
97	if (preen == 0)
98		printf("** %s", dev);
99	if (nflag || (fswritefd = open(dev, O_WRONLY)) < 0) {
100		fswritefd = -1;
101		if (preen)
102			pfatal("NO WRITE ACCESS");
103		printf(" (NO WRITE)");
104	}
105	if (preen == 0)
106		printf("\n");
107	fsmodified = 0;
108	lfdir = 0;
109	initbarea(&sblk);
110	initbarea(&asblk);
111	sblk.b_un.b_buf = malloc(SBSIZE);
112	asblk.b_un.b_buf = malloc(SBSIZE);
113	if (sblk.b_un.b_buf == NULL || asblk.b_un.b_buf == NULL)
114		errx(EEXIT, "cannot allocate space for superblock");
115	lp = getdisklabel((char *)NULL, fsreadfd);
116	if (lp)
117		dev_bsize = secsize = lp->d_secsize;
118	else
119		dev_bsize = secsize = DEV_BSIZE;
120	/*
121	 * Read in the superblock, looking for alternates if necessary
122	 */
123	if (readsb(1) == 0) {
124		skipclean = 0;
125		if (bflag || preen || calcsb(dev, fsreadfd, &proto) == 0)
126			return(0);
127		if (reply("LOOK FOR ALTERNATE SUPERBLOCKS") == 0)
128			return (0);
129		for (cg = 0; cg < proto.fs_ncg; cg++) {
130			bflag = fsbtodb(&proto, cgsblock(&proto, cg));
131			if (readsb(0) != 0)
132				break;
133		}
134		if (cg >= proto.fs_ncg) {
135			printf("%s %s\n%s %s\n%s %s\n",
136				"SEARCH FOR ALTERNATE SUPER-BLOCK",
137				"FAILED. YOU MUST USE THE",
138				"-b OPTION TO FSCK TO SPECIFY THE",
139				"LOCATION OF AN ALTERNATE",
140				"SUPER-BLOCK TO SUPPLY NEEDED",
141				"INFORMATION; SEE fsck(8).");
142			bflag = 0;
143			return(0);
144		}
145		pwarn("USING ALTERNATE SUPERBLOCK AT %d\n", bflag);
146		bflag = 0;
147	}
148	if (skipclean && sblock.fs_clean) {
149		pwarn("FILESYSTEM CLEAN; SKIPPING CHECKS\n");
150		return (-1);
151	}
152	maxfsblock = sblock.fs_size;
153	maxino = sblock.fs_ncg * sblock.fs_ipg;
154	/*
155	 * Check and potentially fix certain fields in the super block.
156	 */
157	if (sblock.fs_optim != FS_OPTTIME && sblock.fs_optim != FS_OPTSPACE) {
158		pfatal("UNDEFINED OPTIMIZATION IN SUPERBLOCK");
159		if (reply("SET TO DEFAULT") == 1) {
160			sblock.fs_optim = FS_OPTTIME;
161			sbdirty();
162		}
163	}
164	if ((sblock.fs_minfree < 0 || sblock.fs_minfree > 99)) {
165		pfatal("IMPOSSIBLE MINFREE=%d IN SUPERBLOCK",
166			sblock.fs_minfree);
167		if (reply("SET TO DEFAULT") == 1) {
168			sblock.fs_minfree = 10;
169			sbdirty();
170		}
171	}
172	if (sblock.fs_interleave < 1 ||
173	    sblock.fs_interleave > sblock.fs_nsect) {
174		pwarn("IMPOSSIBLE INTERLEAVE=%d IN SUPERBLOCK",
175			sblock.fs_interleave);
176		sblock.fs_interleave = 1;
177		if (preen)
178			printf(" (FIXED)\n");
179		if (preen || reply("SET TO DEFAULT") == 1) {
180			sbdirty();
181			dirty(&asblk);
182		}
183	}
184	if (sblock.fs_npsect < sblock.fs_nsect ||
185	    sblock.fs_npsect > sblock.fs_nsect*2) {
186		pwarn("IMPOSSIBLE NPSECT=%d IN SUPERBLOCK",
187			sblock.fs_npsect);
188		sblock.fs_npsect = sblock.fs_nsect;
189		if (preen)
190			printf(" (FIXED)\n");
191		if (preen || reply("SET TO DEFAULT") == 1) {
192			sbdirty();
193			dirty(&asblk);
194		}
195	}
196	if (sblock.fs_inodefmt >= FS_44INODEFMT) {
197		newinofmt = 1;
198	} else {
199		sblock.fs_qbmask = ~sblock.fs_bmask;
200		sblock.fs_qfmask = ~sblock.fs_fmask;
201		newinofmt = 0;
202	}
203	/*
204	 * Convert to new inode format.
205	 */
206	if (cvtlevel >= 2 && sblock.fs_inodefmt < FS_44INODEFMT) {
207		if (preen)
208			pwarn("CONVERTING TO NEW INODE FORMAT\n");
209		else if (!reply("CONVERT TO NEW INODE FORMAT"))
210			return(0);
211		doinglevel2++;
212		sblock.fs_inodefmt = FS_44INODEFMT;
213		sizepb = sblock.fs_bsize;
214		sblock.fs_maxfilesize = sblock.fs_bsize * NDADDR - 1;
215		for (i = 0; i < NIADDR; i++) {
216			sizepb *= NINDIR(&sblock);
217			sblock.fs_maxfilesize += sizepb;
218		}
219		sblock.fs_maxsymlinklen = MAXSYMLINKLEN;
220		sblock.fs_qbmask = ~sblock.fs_bmask;
221		sblock.fs_qfmask = ~sblock.fs_fmask;
222		sbdirty();
223		dirty(&asblk);
224	}
225	/*
226	 * Convert to new cylinder group format.
227	 */
228	if (cvtlevel >= 1 && sblock.fs_postblformat == FS_42POSTBLFMT) {
229		if (preen)
230			pwarn("CONVERTING TO NEW CYLINDER GROUP FORMAT\n");
231		else if (!reply("CONVERT TO NEW CYLINDER GROUP FORMAT"))
232			return(0);
233		doinglevel1++;
234		sblock.fs_postblformat = FS_DYNAMICPOSTBLFMT;
235		sblock.fs_nrpos = 8;
236		sblock.fs_postbloff =
237		    (char *)(&sblock.fs_opostbl[0][0]) -
238		    (char *)(&sblock.fs_firstfield);
239		sblock.fs_rotbloff = &sblock.fs_space[0] -
240		    (u_char *)(&sblock.fs_firstfield);
241		sblock.fs_cgsize =
242			fragroundup(&sblock, CGSIZE(&sblock));
243		sbdirty();
244		dirty(&asblk);
245	}
246	if (asblk.b_dirty && !bflag) {
247		memmove(&altsblock, &sblock, (size_t)sblock.fs_sbsize);
248		flush(fswritefd, &asblk);
249	}
250	/*
251	 * read in the summary info.
252	 */
253	asked = 0;
254	for (i = 0, j = 0; i < sblock.fs_cssize; i += sblock.fs_bsize, j++) {
255		size = sblock.fs_cssize - i < sblock.fs_bsize ?
256		    sblock.fs_cssize - i : sblock.fs_bsize;
257		sblock.fs_csp[j] = (struct csum *)calloc(1, (unsigned)size);
258		if (bread(fsreadfd, (char *)sblock.fs_csp[j],
259		    fsbtodb(&sblock, sblock.fs_csaddr + j * sblock.fs_frag),
260		    size) != 0 && !asked) {
261			pfatal("BAD SUMMARY INFORMATION");
262			if (reply("CONTINUE") == 0)
263				exit(EEXIT);
264			asked++;
265		}
266	}
267	/*
268	 * allocate and initialize the necessary maps
269	 */
270	bmapsize = roundup(howmany(maxfsblock, NBBY), sizeof(short));
271	blockmap = calloc((unsigned)bmapsize, sizeof (char));
272	if (blockmap == NULL) {
273		printf("cannot alloc %u bytes for blockmap\n",
274		    (unsigned)bmapsize);
275		goto badsb;
276	}
277	statemap = calloc((unsigned)(maxino + 1), sizeof(char));
278	if (statemap == NULL) {
279		printf("cannot alloc %u bytes for statemap\n",
280		    (unsigned)(maxino + 1));
281		goto badsb;
282	}
283	typemap = calloc((unsigned)(maxino + 1), sizeof(char));
284	if (typemap == NULL) {
285		printf("cannot alloc %u bytes for typemap\n",
286		    (unsigned)(maxino + 1));
287		goto badsb;
288	}
289	lncntp = (short *)calloc((unsigned)(maxino + 1), sizeof(short));
290	if (lncntp == NULL) {
291		printf("cannot alloc %u bytes for lncntp\n",
292		    (unsigned)(maxino + 1) * sizeof(short));
293		goto badsb;
294	}
295	numdirs = sblock.fs_cstotal.cs_ndir;
296	inplast = 0;
297	listmax = numdirs + 10;
298	inpsort = (struct inoinfo **)calloc((unsigned)listmax,
299	    sizeof(struct inoinfo *));
300	inphead = (struct inoinfo **)calloc((unsigned)numdirs,
301	    sizeof(struct inoinfo *));
302	if (inpsort == NULL || inphead == NULL) {
303		printf("cannot alloc %u bytes for inphead\n",
304		    (unsigned)numdirs * sizeof(struct inoinfo *));
305		goto badsb;
306	}
307	bufinit();
308	return (1);
309
310badsb:
311	ckfini(0);
312	return (0);
313}
314
315/*
316 * Read in the super block and its summary info.
317 */
318static int
319readsb(listerr)
320	int listerr;
321{
322	ufs_daddr_t super = bflag ? bflag : SBOFF / dev_bsize;
323
324	if (bread(fsreadfd, (char *)&sblock, super, (long)SBSIZE) != 0)
325		return (0);
326	sblk.b_bno = super;
327	sblk.b_size = SBSIZE;
328	/*
329	 * run a few consistency checks of the super block
330	 */
331	if (sblock.fs_magic != FS_MAGIC)
332		{ badsb(listerr, "MAGIC NUMBER WRONG"); return (0); }
333	if (sblock.fs_ncg < 1)
334		{ badsb(listerr, "NCG OUT OF RANGE"); return (0); }
335	if (sblock.fs_cpg < 1)
336		{ badsb(listerr, "CPG OUT OF RANGE"); return (0); }
337	if (sblock.fs_ncg * sblock.fs_cpg < sblock.fs_ncyl ||
338	    (sblock.fs_ncg - 1) * sblock.fs_cpg >= sblock.fs_ncyl)
339		{ badsb(listerr, "NCYL LESS THAN NCG*CPG"); return (0); }
340	if (sblock.fs_sbsize > SBSIZE)
341		{ badsb(listerr, "SIZE PREPOSTEROUSLY LARGE"); return (0); }
342	/*
343	 * Compute block size that the filesystem is based on,
344	 * according to fsbtodb, and adjust superblock block number
345	 * so we can tell if this is an alternate later.
346	 */
347	super *= dev_bsize;
348	dev_bsize = sblock.fs_fsize / fsbtodb(&sblock, 1);
349	sblk.b_bno = super / dev_bsize;
350	if (bflag) {
351		havesb = 1;
352		return (1);
353	}
354	/*
355	 * Set all possible fields that could differ, then do check
356	 * of whole super block against an alternate super block.
357	 * When an alternate super-block is specified this check is skipped.
358	 */
359	getblk(&asblk, cgsblock(&sblock, sblock.fs_ncg - 1), sblock.fs_sbsize);
360	if (asblk.b_errs)
361		return (0);
362	altsblock.fs_firstfield = sblock.fs_firstfield;
363	altsblock.fs_unused_1 = sblock.fs_unused_1;
364	altsblock.fs_time = sblock.fs_time;
365	altsblock.fs_cstotal = sblock.fs_cstotal;
366	altsblock.fs_cgrotor = sblock.fs_cgrotor;
367	altsblock.fs_fmod = sblock.fs_fmod;
368	altsblock.fs_clean = sblock.fs_clean;
369	altsblock.fs_ronly = sblock.fs_ronly;
370	altsblock.fs_flags = sblock.fs_flags;
371	altsblock.fs_maxcontig = sblock.fs_maxcontig;
372	altsblock.fs_minfree = sblock.fs_minfree;
373	altsblock.fs_optim = sblock.fs_optim;
374	altsblock.fs_rotdelay = sblock.fs_rotdelay;
375	altsblock.fs_maxbpg = sblock.fs_maxbpg;
376	memmove(altsblock.fs_csp, sblock.fs_csp, sizeof sblock.fs_csp);
377	altsblock.fs_maxcluster = sblock.fs_maxcluster;
378	memmove(altsblock.fs_fsmnt, sblock.fs_fsmnt, sizeof sblock.fs_fsmnt);
379	memmove(altsblock.fs_sparecon,
380		sblock.fs_sparecon, sizeof sblock.fs_sparecon);
381	/*
382	 * The following should not have to be copied.
383	 */
384	altsblock.fs_fsbtodb = sblock.fs_fsbtodb;
385	altsblock.fs_interleave = sblock.fs_interleave;
386	altsblock.fs_npsect = sblock.fs_npsect;
387	altsblock.fs_nrpos = sblock.fs_nrpos;
388	altsblock.fs_state = sblock.fs_state;
389	altsblock.fs_qbmask = sblock.fs_qbmask;
390	altsblock.fs_qfmask = sblock.fs_qfmask;
391	altsblock.fs_state = sblock.fs_state;
392	altsblock.fs_maxfilesize = sblock.fs_maxfilesize;
393	if (memcmp(&sblock, &altsblock, (int)sblock.fs_sbsize)) {
394		if (debug) {
395			long *nlp, *olp, *endlp;
396
397			printf("superblock mismatches\n");
398			nlp = (long *)&altsblock;
399			olp = (long *)&sblock;
400			endlp = olp + (sblock.fs_sbsize / sizeof *olp);
401			for ( ; olp < endlp; olp++, nlp++) {
402				if (*olp == *nlp)
403					continue;
404				printf("offset %d, original %d, alternate %d\n",
405				    olp - (long *)&sblock, *olp, *nlp);
406			}
407		}
408		badsb(listerr,
409		"VALUES IN SUPER BLOCK DISAGREE WITH THOSE IN FIRST ALTERNATE");
410		return (0);
411	}
412	havesb = 1;
413	return (1);
414}
415
416static void
417badsb(listerr, s)
418	int listerr;
419	char *s;
420{
421
422	if (!listerr)
423		return;
424	if (preen)
425		printf("%s: ", cdevname);
426	pfatal("BAD SUPER BLOCK: %s\n", s);
427}
428
429/*
430 * Calculate a prototype superblock based on information in the disk label.
431 * When done the cgsblock macro can be calculated and the fs_ncg field
432 * can be used. Do NOT attempt to use other macros without verifying that
433 * their needed information is available!
434 */
435static int
436calcsb(dev, devfd, fs)
437	char *dev;
438	int devfd;
439	register struct fs *fs;
440{
441	register struct disklabel *lp;
442	register struct partition *pp;
443	register char *cp;
444	int i;
445
446	cp = strchr(dev, '\0') - 1;
447	if (cp == (char *)-1 || ((*cp < 'a' || *cp > 'h') && !isdigit(*cp))) {
448		pfatal("%s: CANNOT FIGURE OUT FILE SYSTEM PARTITION\n", dev);
449		return (0);
450	}
451	lp = getdisklabel(dev, devfd);
452	if (isdigit(*cp))
453		pp = &lp->d_partitions[0];
454	else
455		pp = &lp->d_partitions[*cp - 'a'];
456	if (pp->p_fstype != FS_BSDFFS) {
457		pfatal("%s: NOT LABELED AS A BSD FILE SYSTEM (%s)\n",
458			dev, pp->p_fstype < FSMAXTYPES ?
459			fstypenames[pp->p_fstype] : "unknown");
460		return (0);
461	}
462	memset(fs, 0, sizeof(struct fs));
463	fs->fs_fsize = pp->p_fsize;
464	fs->fs_frag = pp->p_frag;
465	fs->fs_cpg = pp->p_cpg;
466	fs->fs_size = pp->p_size;
467	fs->fs_ntrak = lp->d_ntracks;
468	fs->fs_nsect = lp->d_nsectors;
469	fs->fs_spc = lp->d_secpercyl;
470	fs->fs_nspf = fs->fs_fsize / lp->d_secsize;
471	fs->fs_sblkno = roundup(
472		howmany(lp->d_bbsize + lp->d_sbsize, fs->fs_fsize),
473		fs->fs_frag);
474	fs->fs_cgmask = 0xffffffff;
475	for (i = fs->fs_ntrak; i > 1; i >>= 1)
476		fs->fs_cgmask <<= 1;
477	if (!POWEROF2(fs->fs_ntrak))
478		fs->fs_cgmask <<= 1;
479	fs->fs_cgoffset = roundup(
480		howmany(fs->fs_nsect, NSPF(fs)), fs->fs_frag);
481	fs->fs_fpg = (fs->fs_cpg * fs->fs_spc) / NSPF(fs);
482	fs->fs_ncg = howmany(fs->fs_size / fs->fs_spc, fs->fs_cpg);
483	for (fs->fs_fsbtodb = 0, i = NSPF(fs); i > 1; i >>= 1)
484		fs->fs_fsbtodb++;
485	dev_bsize = lp->d_secsize;
486	return (1);
487}
488
489static struct disklabel *
490getdisklabel(s, fd)
491	char *s;
492	int	fd;
493{
494	static struct disklabel lab;
495
496	if (ioctl(fd, DIOCGDINFO, (char *)&lab) < 0) {
497		if (s == NULL)
498			return ((struct disklabel *)NULL);
499		pwarn("ioctl (GCINFO): %s\n", strerror(errno));
500		errx(EEXIT, "%s: can't read disk label", s);
501	}
502	return (&lab);
503}
504