pass1.c revision 70050 
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 70050 2000-12-15 14:23:55Z iedowse $";
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	int ndb, j;
187	mode_t mode;
188	char *symbuf;
189
190	dp = getnextinode(inumber);
191	mode = dp->di_mode & IFMT;
192	if (mode == 0) {
193		if (memcmp(dp->di_db, zino.di_db,
194			NDADDR * sizeof(ufs_daddr_t)) ||
195		    memcmp(dp->di_ib, zino.di_ib,
196			NIADDR * sizeof(ufs_daddr_t)) ||
197		    dp->di_mode || dp->di_size) {
198			pfatal("PARTIALLY ALLOCATED INODE I=%lu", inumber);
199			if (reply("CLEAR") == 1) {
200				dp = ginode(inumber);
201				clearinode(dp);
202				inodirty();
203			}
204		}
205		inoinfo(inumber)->ino_state = USTATE;
206		return;
207	}
208	lastino = inumber;
209	if (/* dp->di_size < 0 || */
210	    dp->di_size + sblock.fs_bsize - 1 < dp->di_size ||
211	    (mode == IFDIR && dp->di_size > MAXDIRSIZE)) {
212		if (debug)
213			printf("bad size %qu:", dp->di_size);
214		goto unknown;
215	}
216	if (!preen && mode == IFMT && reply("HOLD BAD BLOCK") == 1) {
217		dp = ginode(inumber);
218		dp->di_size = sblock.fs_fsize;
219		dp->di_mode = IFREG|0600;
220		inodirty();
221	}
222	if ((mode == IFBLK || mode == IFCHR || mode == IFIFO ||
223	     mode == IFSOCK) && dp->di_size != 0) {
224		if (debug)
225			printf("bad special-file size %qu:", dp->di_size);
226		goto unknown;
227	}
228	ndb = howmany(dp->di_size, sblock.fs_bsize);
229	if (ndb < 0) {
230		if (debug)
231			printf("bad size %qu ndb %d:",
232				dp->di_size, ndb);
233		goto unknown;
234	}
235	if (mode == IFBLK || mode == IFCHR)
236		ndb++;
237	if (mode == IFLNK) {
238		if (doinglevel2 &&
239		    dp->di_size > 0 && dp->di_size < MAXSYMLINKLEN &&
240		    dp->di_blocks != 0) {
241			symbuf = alloca(secsize);
242			if (bread(fsreadfd, symbuf,
243			    fsbtodb(&sblock, dp->di_db[0]),
244			    (long)secsize) != 0)
245				errx(EEXIT, "cannot read symlink");
246			if (debug) {
247				symbuf[dp->di_size] = 0;
248				printf("convert symlink %lu(%s) of size %ld\n",
249				    (u_long)inumber, symbuf, (long)dp->di_size);
250			}
251			dp = ginode(inumber);
252			memmove(dp->di_shortlink, symbuf, (long)dp->di_size);
253			dp->di_blocks = 0;
254			inodirty();
255		}
256		/*
257		 * Fake ndb value so direct/indirect block checks below
258		 * will detect any garbage after symlink string.
259		 */
260		if (dp->di_size < sblock.fs_maxsymlinklen) {
261			ndb = howmany(dp->di_size, sizeof(ufs_daddr_t));
262			if (ndb > NDADDR) {
263				j = ndb - NDADDR;
264				for (ndb = 1; j > 1; j--)
265					ndb *= NINDIR(&sblock);
266				ndb += NDADDR;
267			}
268		}
269	}
270	for (j = ndb; j < NDADDR; j++)
271		if (dp->di_db[j] != 0) {
272			if (debug)
273				printf("bad direct addr: %ld\n",
274				    (long)dp->di_db[j]);
275			goto unknown;
276		}
277	for (j = 0, ndb -= NDADDR; ndb > 0; j++)
278		ndb /= NINDIR(&sblock);
279	for (; j < NIADDR; j++)
280		if (dp->di_ib[j] != 0) {
281			if (debug)
282				printf("bad indirect addr: %ld\n",
283				    (long)dp->di_ib[j]);
284			goto unknown;
285		}
286	if (ftypeok(dp) == 0)
287		goto unknown;
288	n_files++;
289	inoinfo(inumber)->ino_linkcnt = dp->di_nlink;
290	if (dp->di_nlink <= 0) {
291		zlnp = (struct zlncnt *)malloc(sizeof *zlnp);
292		if (zlnp == NULL) {
293			pfatal("LINK COUNT TABLE OVERFLOW");
294			if (reply("CONTINUE") == 0) {
295				ckfini(0);
296				exit(EEXIT);
297			}
298		} else {
299			zlnp->zlncnt = inumber;
300			zlnp->next = zlnhead;
301			zlnhead = zlnp;
302		}
303	}
304	if (mode == IFDIR) {
305		if (dp->di_size == 0)
306			inoinfo(inumber)->ino_state = DCLEAR;
307		else
308			inoinfo(inumber)->ino_state = DSTATE;
309		cacheino(dp, inumber);
310		countdirs++;
311	} else
312		inoinfo(inumber)->ino_state = FSTATE;
313	inoinfo(inumber)->ino_type = IFTODT(mode);
314	if (doinglevel2 &&
315	    (dp->di_ouid != (u_short)-1 || dp->di_ogid != (u_short)-1)) {
316		dp = ginode(inumber);
317		dp->di_uid = dp->di_ouid;
318		dp->di_ouid = -1;
319		dp->di_gid = dp->di_ogid;
320		dp->di_ogid = -1;
321		inodirty();
322	}
323	badblk = dupblk = 0;
324	idesc->id_number = inumber;
325	if (dp->di_flags & SF_SNAPSHOT)
326		idesc->id_type = SNAP;
327	else
328		idesc->id_type = ADDR;
329	(void)ckinode(dp, idesc);
330	idesc->id_entryno *= btodb(sblock.fs_fsize);
331	if (dp->di_blocks != idesc->id_entryno) {
332		pwarn("INCORRECT BLOCK COUNT I=%lu (%ld should be %ld)",
333		    inumber, dp->di_blocks, idesc->id_entryno);
334		if (preen)
335			printf(" (CORRECTED)\n");
336		else if (reply("CORRECT") == 0)
337			return;
338		dp = ginode(inumber);
339		dp->di_blocks = idesc->id_entryno;
340		inodirty();
341	}
342	return;
343unknown:
344	pfatal("UNKNOWN FILE TYPE I=%lu", inumber);
345	inoinfo(inumber)->ino_state = FCLEAR;
346	if (reply("CLEAR") == 1) {
347		inoinfo(inumber)->ino_state = USTATE;
348		dp = ginode(inumber);
349		clearinode(dp);
350		inodirty();
351	}
352}
353
354int
355pass1check(idesc)
356	register struct inodesc *idesc;
357{
358	int res = KEEPON;
359	int anyout, nfrags;
360	ufs_daddr_t blkno = idesc->id_blkno;
361	register struct dups *dlp;
362	struct dups *new;
363
364	if (idesc->id_type == SNAP) {
365		if (blkno == BLK_NOCOPY)
366			return (KEEPON);
367		if (idesc->id_number == cursnapshot) {
368			if (blkno == blkstofrags(&sblock, idesc->id_lbn))
369				return (KEEPON);
370			if (blkno == BLK_SNAP) {
371				blkno = blkstofrags(&sblock, idesc->id_lbn);
372				idesc->id_entryno -= idesc->id_numfrags;
373			}
374		} else {
375			if (blkno == BLK_SNAP)
376				return (KEEPON);
377		}
378	}
379	if ((anyout = chkrange(blkno, idesc->id_numfrags)) != 0) {
380		blkerror(idesc->id_number, "BAD", blkno);
381		if (badblk++ >= MAXBAD) {
382			pwarn("EXCESSIVE BAD BLKS I=%lu",
383				idesc->id_number);
384			if (preen)
385				printf(" (SKIPPING)\n");
386			else if (reply("CONTINUE") == 0) {
387				ckfini(0);
388				exit(EEXIT);
389			}
390			return (STOP);
391		}
392	}
393	for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
394		if (anyout && chkrange(blkno, 1)) {
395			res = SKIP;
396		} else if (!testbmap(blkno)) {
397			n_blks++;
398			setbmap(blkno);
399		} else {
400			blkerror(idesc->id_number, "DUP", blkno);
401			if (dupblk++ >= MAXDUP) {
402				pwarn("EXCESSIVE DUP BLKS I=%lu",
403					idesc->id_number);
404				if (preen)
405					printf(" (SKIPPING)\n");
406				else if (reply("CONTINUE") == 0) {
407					ckfini(0);
408					exit(EEXIT);
409				}
410				return (STOP);
411			}
412			new = (struct dups *)malloc(sizeof(struct dups));
413			if (new == NULL) {
414				pfatal("DUP TABLE OVERFLOW.");
415				if (reply("CONTINUE") == 0) {
416					ckfini(0);
417					exit(EEXIT);
418				}
419				return (STOP);
420			}
421			new->dup = blkno;
422			if (muldup == 0) {
423				duplist = muldup = new;
424				new->next = 0;
425			} else {
426				new->next = muldup->next;
427				muldup->next = new;
428			}
429			for (dlp = duplist; dlp != muldup; dlp = dlp->next)
430				if (dlp->dup == blkno)
431					break;
432			if (dlp == muldup && dlp->dup != blkno)
433				muldup = new;
434		}
435		/*
436		 * count the number of blocks found in id_entryno
437		 */
438		idesc->id_entryno++;
439	}
440	return (res);
441}
442