pass1.c revision 72525 
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
35#if 0
36static const char sccsid[] = "@(#)pass1.c	8.6 (Berkeley) 4/28/95";
37#endif
38static const char rcsid[] =
39  "$FreeBSD: head/sbin/fsck_ffs/pass1.c 72525 2001-02-15 22:26:21Z tegge $";
40#endif /* not lint */
41
42#include <sys/param.h>
43#include <sys/stat.h>
44
45#include <ufs/ufs/dinode.h>
46#include <ufs/ufs/dir.h>
47#include <ufs/ffs/fs.h>
48
49#include <err.h>
50#include <string.h>
51
52#include "fsck.h"
53
54static ufs_daddr_t badblk;
55static ufs_daddr_t dupblk;
56static ino_t lastino;		/* last inode in use */
57
58static void checkinode __P((ino_t inumber, struct inodesc *));
59
60void
61pass1()
62{
63	u_int8_t *cp;
64	ino_t inumber;
65	int c, i, cgd, inosused;
66	struct inostat *info;
67	struct inodesc idesc;
68
69	/*
70	 * Set file system reserved blocks in used block map.
71	 */
72	for (c = 0; c < sblock.fs_ncg; c++) {
73		cgd = cgdmin(&sblock, c);
74		if (c == 0) {
75			i = cgbase(&sblock, c);
76		} else
77			i = cgsblock(&sblock, c);
78		for (; i < cgd; i++)
79			setbmap(i);
80	}
81	i = sblock.fs_csaddr;
82	cgd = i + howmany(sblock.fs_cssize, sblock.fs_fsize);
83	for (; i < cgd; i++)
84		setbmap(i);
85
86	/*
87	 * Find all allocated blocks.
88	 */
89	memset(&idesc, 0, sizeof(struct inodesc));
90	idesc.id_func = pass1check;
91	n_files = n_blks = 0;
92	for (c = 0; c < sblock.fs_ncg; c++) {
93		inumber = c * sblock.fs_ipg;
94		setinodebuf(inumber);
95		inosused = sblock.fs_ipg;
96		if (got_siginfo) {
97			printf("%s: phase 1: cyl group %d of %d (%d%%)\n",
98			    cdevname, c, sblock.fs_ncg,
99			    c * 100 / sblock.fs_ncg);
100			got_siginfo = 0;
101		}
102		/*
103		 * If we are using soft updates, then we can trust the
104		 * cylinder group inode allocation maps to tell us which
105		 * inodes are allocated. We will scan the used inode map
106		 * to find the inodes that are really in use, and then
107		 * read only those inodes in from disk.
108		 */
109		if (preen && usedsoftdep) {
110			getblk(&cgblk, cgtod(&sblock, c), sblock.fs_cgsize);
111			if (!cg_chkmagic(&cgrp))
112				pfatal("CG %d: BAD MAGIC NUMBER\n", c);
113			cp = &cg_inosused(&cgrp)[(sblock.fs_ipg - 1) / NBBY];
114			for ( ; inosused > 0; inosused -= NBBY, cp--) {
115				if (*cp == 0)
116					continue;
117				for (i = 1 << (NBBY - 1); i > 0; i >>= 1) {
118					if (*cp & i)
119						break;
120					inosused--;
121				}
122				break;
123			}
124			if (inosused < 0)
125				inosused = 0;
126		}
127		/*
128		 * Allocate inoinfo structures for the allocated inodes.
129		 */
130		inostathead[c].il_numalloced = inosused;
131		if (inosused == 0) {
132			inostathead[c].il_stat = 0;
133			continue;
134		}
135		info = calloc((unsigned)inosused, sizeof(struct inostat));
136		if (info == NULL)
137			pfatal("cannot alloc %u bytes for inoinfo\n",
138			    (unsigned)(sizeof(struct inostat) * inosused));
139		inostathead[c].il_stat = info;
140		/*
141		 * Scan the allocated inodes.
142		 */
143		for (i = 0; i < inosused; i++, inumber++) {
144			if (inumber < ROOTINO) {
145				(void)getnextinode(inumber);
146				continue;
147			}
148			checkinode(inumber, &idesc);
149		}
150		lastino += 1;
151		if (inosused < sblock.fs_ipg || inumber == lastino)
152			continue;
153		/*
154		 * If we were not able to determine in advance which inodes
155		 * were in use, then reduce the size of the inoinfo structure
156		 * to the size necessary to describe the inodes that we
157		 * really found.
158		 */
159		inosused = lastino - (c * sblock.fs_ipg);
160		if (inosused < 0)
161			inosused = 0;
162		inostathead[c].il_numalloced = inosused;
163		if (inosused == 0) {
164			free(inostathead[c].il_stat);
165			inostathead[c].il_stat = 0;
166			continue;
167		}
168		info = calloc((unsigned)inosused, sizeof(struct inostat));
169		if (info == NULL)
170			pfatal("cannot alloc %u bytes for inoinfo\n",
171			    (unsigned)(sizeof(struct inostat) * inosused));
172		memmove(info, inostathead[c].il_stat, inosused * sizeof(*info));
173		free(inostathead[c].il_stat);
174		inostathead[c].il_stat = info;
175	}
176	freeinodebuf();
177}
178
179static void
180checkinode(inumber, idesc)
181	ino_t inumber;
182	register struct inodesc *idesc;
183{
184	register struct dinode *dp;
185	struct zlncnt *zlnp;
186	u_int64_t kernmaxfilesize;
187	ufs_daddr_t ndb, j;
188	mode_t mode;
189	char *symbuf;
190
191	dp = getnextinode(inumber);
192	mode = dp->di_mode & IFMT;
193	if (mode == 0) {
194		if (memcmp(dp->di_db, zino.di_db,
195			NDADDR * sizeof(ufs_daddr_t)) ||
196		    memcmp(dp->di_ib, zino.di_ib,
197			NIADDR * sizeof(ufs_daddr_t)) ||
198		    dp->di_mode || dp->di_size) {
199			pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber);
200			if (reply("CLEAR") == 1) {
201				dp = ginode(inumber);
202				clearinode(dp);
203				inodirty();
204			}
205		}
206		inoinfo(inumber)->ino_state = USTATE;
207		return;
208	}
209	lastino = inumber;
210	/* This should match the file size limit in ffs_mountfs(). */
211	kernmaxfilesize = (u_int64_t)0x40000000 * sblock.fs_bsize - 1;
212	if (dp->di_size > kernmaxfilesize ||
213	    dp->di_size > sblock.fs_maxfilesize ||
214	    (mode == IFDIR && dp->di_size > MAXDIRSIZE)) {
215		if (debug)
216			printf("bad size %qu:", dp->di_size);
217		goto unknown;
218	}
219	if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
220		dp = ginode(inumber);
221		dp->di_size = sblock.fs_fsize;
222		dp->di_mode = IFREG|0600;
223		inodirty();
224	}
225	if ((mode == IFBLK || mode == IFCHR || mode == IFIFO ||
226	     mode == IFSOCK) && dp->di_size != 0) {
227		if (debug)
228			printf("bad special-file size %qu:", dp->di_size);
229		goto unknown;
230	}
231	if ((mode == IFBLK || mode == IFCHR) && (dev_t)dp->di_rdev == NODEV) {
232		if (debug)
233			printf("bad special-file rdev NODEV:");
234		goto unknown;
235	}
236	ndb = howmany(dp->di_size, sblock.fs_bsize);
237	if (ndb < 0) {
238		if (debug)
239			printf("bad size %qu ndb %d:",
240				dp->di_size, ndb);
241		goto unknown;
242	}
243	if (mode == IFBLK || mode == IFCHR)
244		ndb++;
245	if (mode == IFLNK) {
246		if (doinglevel2 &&
247		    dp->di_size > 0 && dp->di_size < MAXSYMLINKLEN &&
248		    dp->di_blocks != 0) {
249			symbuf = alloca(secsize);
250			if (bread(fsreadfd, symbuf,
251			    fsbtodb(&sblock, dp->di_db[0]),
252			    (long)secsize) != 0)
253				errx(EEXIT, "cannot read symlink");
254			if (debug) {
255				symbuf[dp->di_size] = 0;
256				printf("convert symlink %lu(%s) of size %ld\n",
257				    (u_long)inumber, symbuf, (long)dp->di_size);
258			}
259			dp = ginode(inumber);
260			memmove(dp->di_shortlink, symbuf, (long)dp->di_size);
261			dp->di_blocks = 0;
262			inodirty();
263		}
264		/*
265		 * Fake ndb value so direct/indirect block checks below
266		 * will detect any garbage after symlink string.
267		 */
268		if (dp->di_size < sblock.fs_maxsymlinklen) {
269			ndb = howmany(dp->di_size, sizeof(ufs_daddr_t));
270			if (ndb > NDADDR) {
271				j = ndb - NDADDR;
272				for (ndb = 1; j > 1; j--)
273					ndb *= NINDIR(&sblock);
274				ndb += NDADDR;
275			}
276		}
277	}
278	for (j = ndb; j < NDADDR; j++)
279		if (dp->di_db[j] != 0) {
280			if (debug)
281				printf("bad direct addr: %ld\n",
282				    (long)dp->di_db[j]);
283			goto unknown;
284		}
285	for (j = 0, ndb -= NDADDR; ndb > 0; j++)
286		ndb /= NINDIR(&sblock);
287	for (; j < NIADDR; j++)
288		if (dp->di_ib[j] != 0) {
289			if (debug)
290				printf("bad indirect addr: %ld\n",
291				    (long)dp->di_ib[j]);
292			goto unknown;
293		}
294	if (ftypeok(dp) == 0)
295		goto unknown;
296	n_files++;
297	inoinfo(inumber)->ino_linkcnt = dp->di_nlink;
298	if (dp->di_nlink <= 0) {
299		zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
300		if (zlnp == NULL) {
301			pfatal("LINK COUNT TABLE OVERFLOW");
302			if (reply("CONTINUE") == 0) {
303				ckfini(0);
304				exit(EEXIT);
305			}
306		} else {
307			zlnp->zlncnt = inumber;
308			zlnp->next = zlnhead;
309			zlnhead = zlnp;
310		}
311	}
312	if (mode == IFDIR) {
313		if (dp->di_size == 0)
314			inoinfo(inumber)->ino_state = DCLEAR;
315		else
316			inoinfo(inumber)->ino_state = DSTATE;
317		cacheino(dp, inumber);
318		countdirs++;
319	} else
320		inoinfo(inumber)->ino_state = FSTATE;
321	inoinfo(inumber)->ino_type = IFTODT(mode);
322	if (doinglevel2 &&
323	    (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) {
324		dp = ginode(inumber);
325		dp->di_uid = dp->di_ouid;
326		dp->di_ouid = -1;
327		dp->di_gid = dp->di_ogid;
328		dp->di_ogid = -1;
329		inodirty();
330	}
331	badblk = dupblk = 0;
332	idesc->id_number = inumber;
333	if (dp->di_flags & SF_SNAPSHOT)
334		idesc->id_type = SNAP;
335	else
336		idesc->id_type = ADDR;
337	(void)ckinode(dp, idesc);
338	idesc->id_entryno *= btodb(sblock.fs_fsize);
339	if (dp->di_blocks != idesc->id_entryno) {
340		pwarn("INCORRECT BLOCK COUNT I=%lu (%ld should be %ld)",
341		    inumber, dp->di_blocks, idesc->id_entryno);
342		if (preen)
343			printf(" (CORRECTED)\n");
344		else if (reply("CORRECT") == 0)
345			return;
346		dp = ginode(inumber);
347		dp->di_blocks = idesc->id_entryno;
348		inodirty();
349	}
350	return;
351unknown:
352	pfatal("UNKNOWN FILE TYPE I=%lu", inumber);
353	inoinfo(inumber)->ino_state = FCLEAR;
354	if (reply("CLEAR") == 1) {
355		inoinfo(inumber)->ino_state = USTATE;
356		dp = ginode(inumber);
357		clearinode(dp);
358		inodirty();
359	}
360}
361
362int
363pass1check(idesc)
364	register struct inodesc *idesc;
365{
366	int res = KEEPON;
367	int anyout, nfrags;
368	ufs_daddr_t blkno = idesc->id_blkno;
369	register struct dups *dlp;
370	struct dups *new;
371
372	if (idesc->id_type == SNAP) {
373		if (blkno == BLK_NOCOPY)
374			return (KEEPON);
375		if (idesc->id_number == cursnapshot) {
376			if (blkno == blkstofrags(&sblock, idesc->id_lbn))
377				return (KEEPON);
378			if (blkno == BLK_SNAP) {
379				blkno = blkstofrags(&sblock, idesc->id_lbn);
380				idesc->id_entryno -= idesc->id_numfrags;
381			}
382		} else {
383			if (blkno == BLK_SNAP)
384				return (KEEPON);
385		}
386	}
387	if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
388		blkerror(idesc->id_number, "BAD", blkno);
389		if (badblk++ >= MAXBAD) {
390			pwarn("EXCESSIVE BAD BLKS I=%lu",
391				idesc->id_number);
392			if (preen)
393				printf(" (SKIPPING)\n");
394			else if (reply("CONTINUE") == 0) {
395				ckfini(0);
396				exit(EEXIT);
397			}
398			return (STOP);
399		}
400	}
401	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
402		if (anyout && chkrange(blkno, 1)) {
403			res = SKIP;
404		} else if (!testbmap(blkno)) {
405			n_blks++;
406			setbmap(blkno);
407		} else {
408			blkerror(idesc->id_number, "DUP", blkno);
409			if (dupblk++ >= MAXDUP) {
410				pwarn("EXCESSIVE DUP BLKS I=%lu",
411					idesc->id_number);
412				if (preen)
413					printf(" (SKIPPING)\n");
414				else if (reply("CONTINUE") == 0) {
415					ckfini(0);
416					exit(EEXIT);
417				}
418				return (STOP);
419			}
420			new = (struct dups *)malloc(sizeof(struct dups));
421			if (new == NULL) {
422				pfatal("DUP TABLE OVERFLOW.");
423				if (reply("CONTINUE") == 0) {
424					ckfini(0);
425					exit(EEXIT);
426				}
427				return (STOP);
428			}
429			new->dup = blkno;
430			if (muldup == 0) {
431				duplist = muldup = new;
432				new->next = 0;
433			} else {
434				new->next = muldup->next;
435				muldup->next = new;
436			}
437			for (dlp = duplist; dlp != muldup; dlp = dlp->next)
438				if (dlp->dup == blkno)
439					break;
440			if (dlp == muldup && dlp->dup != blkno)
441				muldup = new;
442		}
443		/*
444		 * count the number of blocks found in id_entryno
445		 */
446		idesc->id_entryno++;
447	}
448	return (res);
449}
450