Commit | Line | Data |
---|---|---|
19052d90 | 1 | #ifndef lint |
f0ed004a | 2 | static char version[] = "@(#)pass1.c 3.5 (Berkeley) %G%"; |
19052d90 KM |
3 | #endif |
4 | ||
5 | #include <sys/param.h> | |
6 | #include <sys/inode.h> | |
7 | #include <sys/fs.h> | |
8 | #include "fsck.h" | |
9 | ||
993a756c KM |
10 | static daddr_t badblk; |
11 | static daddr_t dupblk; | |
12 | int pass1check(); | |
19052d90 KM |
13 | |
14 | pass1() | |
15 | { | |
993a756c | 16 | register int c, i, j; |
19052d90 | 17 | register DINODE *dp; |
7718c0e6 | 18 | int ndb, partial, cgd; |
19052d90 KM |
19 | struct inodesc idesc; |
20 | ino_t inumber; | |
21 | ||
7718c0e6 KM |
22 | /* |
23 | * Set file system reserved blocks in used block map. | |
24 | */ | |
25 | for (c = 0; c < sblock.fs_ncg; c++) { | |
26 | cgd = cgdmin(&sblock, c); | |
27 | if (c == 0) { | |
28 | i = cgbase(&sblock, c); | |
29 | cgd += howmany(sblock.fs_cssize, sblock.fs_fsize); | |
30 | } else | |
31 | i = cgsblock(&sblock, c); | |
32 | for (; i < cgd; i++) | |
33 | setbmap(i); | |
34 | } | |
35 | /* | |
36 | * Find all allocated blocks. | |
37 | */ | |
19052d90 KM |
38 | bzero((char *)&idesc, sizeof(struct inodesc)); |
39 | idesc.id_type = ADDR; | |
40 | idesc.id_func = pass1check; | |
41 | inumber = 0; | |
993a756c | 42 | n_files = n_blks = 0; |
19052d90 | 43 | for (c = 0; c < sblock.fs_ncg; c++) { |
19052d90 | 44 | for (i = 0; i < sblock.fs_ipg; i++, inumber++) { |
993a756c | 45 | if (inumber < ROOTINO) |
19052d90 | 46 | continue; |
39c18287 | 47 | dp = ginode(inumber); |
993a756c KM |
48 | if (!ALLOC(dp)) { |
49 | if (bcmp((char *)dp->di_db, (char *)zino.di_db, | |
50 | NDADDR * sizeof(daddr_t)) || | |
51 | bcmp((char *)dp->di_ib, (char *)zino.di_ib, | |
52 | NIADDR * sizeof(daddr_t)) || | |
53 | dp->di_mode || dp->di_size) { | |
19052d90 KM |
54 | pfatal("PARTIALLY ALLOCATED INODE I=%u", |
55 | inumber); | |
56 | if (reply("CLEAR") == 1) { | |
57 | zapino(dp); | |
58 | inodirty(); | |
19052d90 KM |
59 | } |
60 | } | |
993a756c KM |
61 | statemap[inumber] = USTATE; |
62 | continue; | |
63 | } | |
64 | lastino = inumber; | |
65 | if (dp->di_size < 0) { | |
66 | if (debug) | |
67 | printf("bad size %d:", dp->di_size); | |
68 | goto unknown; | |
69 | } | |
70 | ndb = howmany(dp->di_size, sblock.fs_bsize); | |
71 | if (SPECIAL(dp)) | |
72 | ndb++; | |
73 | for (j = ndb; j < NDADDR; j++) | |
74 | if (dp->di_db[j] != 0) { | |
75 | if (debug) | |
76 | printf("bad direct addr: %d\n", | |
77 | dp->di_db[j]); | |
78 | goto unknown; | |
79 | } | |
80 | for (j = 0, ndb -= NDADDR; ndb > 0; j++) | |
81 | ndb /= NINDIR(&sblock); | |
82 | for (; j < NIADDR; j++) | |
83 | if (dp->di_ib[j] != 0) { | |
84 | if (debug) | |
85 | printf("bad indirect addr: %d\n", | |
86 | dp->di_ib[j]); | |
87 | goto unknown; | |
88 | } | |
89 | if (!preen && (dp->di_mode & IFMT) == IFMT && | |
90 | reply("HOLD BAD BLOCK") == 1) { | |
91 | dp->di_size = sblock.fs_fsize; | |
92 | dp->di_mode = IFREG|0600; | |
93 | inodirty(); | |
94 | } else if (ftypeok(dp) == 0) | |
95 | goto unknown; | |
96 | n_files++; | |
97 | lncntp[inumber] = dp->di_nlink; | |
98 | if (dp->di_nlink <= 0) { | |
99 | if (badlnp < &badlncnt[MAXLNCNT]) | |
100 | *badlnp++ = inumber; | |
101 | else { | |
102 | pfatal("LINK COUNT TABLE OVERFLOW"); | |
103 | if (reply("CONTINUE") == 0) | |
104 | errexit(""); | |
105 | } | |
106 | } | |
107 | statemap[inumber] = DIRCT(dp) ? DSTATE : FSTATE; | |
108 | badblk = dupblk = 0; maxblk = 0; | |
109 | idesc.id_number = inumber; | |
993a756c | 110 | (void)ckinode(dp, &idesc); |
f0ed004a KM |
111 | idesc.id_entryno *= btodb(sblock.fs_fsize); |
112 | if (dp->di_blocks != idesc.id_entryno) { | |
993a756c | 113 | pwarn("INCORRECT BLOCK COUNT I=%u (%ld should be %ld)", |
f0ed004a | 114 | inumber, dp->di_blocks, idesc.id_entryno); |
993a756c KM |
115 | if (preen) |
116 | printf(" (CORRECTED)\n"); | |
117 | else if (reply("CORRECT") == 0) | |
118 | continue; | |
f0ed004a | 119 | dp->di_blocks = idesc.id_entryno; |
993a756c KM |
120 | inodirty(); |
121 | } | |
122 | continue; | |
123 | unknown: | |
124 | pfatal("UNKNOWN FILE TYPE I=%u", inumber); | |
125 | if (reply("CLEAR") == 1) { | |
126 | zapino(dp); | |
127 | inodirty(); | |
19052d90 KM |
128 | } |
129 | } | |
19052d90 KM |
130 | } |
131 | } | |
132 | ||
133 | pass1check(idesc) | |
134 | register struct inodesc *idesc; | |
135 | { | |
136 | register daddr_t *dlp; | |
137 | int res = KEEPON; | |
138 | int anyout, nfrags; | |
139 | daddr_t blkno = idesc->id_blkno; | |
140 | ||
7718c0e6 KM |
141 | if ((anyout = outrange(blkno, idesc->id_numfrags)) != 0) { |
142 | blkerr(idesc->id_number, "BAD", blkno); | |
143 | if (++badblk >= MAXBAD) { | |
144 | pwarn("EXCESSIVE BAD BLKS I=%u", | |
145 | idesc->id_number); | |
146 | if (preen) | |
147 | printf(" (SKIPPING)\n"); | |
148 | else if (reply("CONTINUE") == 0) | |
149 | errexit(""); | |
150 | return (STOP); | |
151 | } | |
152 | } | |
19052d90 KM |
153 | for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) { |
154 | if (anyout && outrange(blkno, 1)) { | |
19052d90 | 155 | res = SKIP; |
7718c0e6 KM |
156 | } else if (!getbmap(blkno)) { |
157 | n_blks++; | |
158 | setbmap(blkno); | |
159 | } else { | |
19052d90 KM |
160 | blkerr(idesc->id_number, "DUP", blkno); |
161 | if (++dupblk >= MAXDUP) { | |
162 | pwarn("EXCESSIVE DUP BLKS I=%u", | |
163 | idesc->id_number); | |
164 | if (preen) | |
165 | printf(" (SKIPPING)\n"); | |
166 | else if (reply("CONTINUE") == 0) | |
167 | errexit(""); | |
168 | return (STOP); | |
169 | } | |
170 | if (enddup >= &duplist[DUPTBLSIZE]) { | |
171 | pfatal("DUP TABLE OVERFLOW."); | |
172 | if (reply("CONTINUE") == 0) | |
173 | errexit(""); | |
174 | return (STOP); | |
175 | } | |
176 | for (dlp = duplist; dlp < muldup; dlp++) | |
177 | if (*dlp == blkno) { | |
178 | *enddup++ = blkno; | |
179 | break; | |
180 | } | |
181 | if (dlp >= muldup) { | |
182 | *enddup++ = *muldup; | |
183 | *muldup++ = blkno; | |
184 | } | |
19052d90 | 185 | } |
f0ed004a KM |
186 | /* |
187 | * count the number of blocks found in id_entryno | |
188 | */ | |
189 | idesc->id_entryno++; | |
19052d90 KM |
190 | } |
191 | return (res); | |
192 | } |