inode.c revision 1.44 1 1.44 dbj /* $NetBSD: inode.c,v 1.44 2004/01/03 17:27:35 dbj Exp $ */
2 1.13 cgd
3 1.1 cgd /*
4 1.9 mycroft * Copyright (c) 1980, 1986, 1993
5 1.9 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.40 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.24 lukem #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.13 cgd #if 0
35 1.26 lukem static char sccsid[] = "@(#)inode.c 8.8 (Berkeley) 4/28/95";
36 1.13 cgd #else
37 1.44 dbj __RCSID("$NetBSD: inode.c,v 1.44 2004/01/03 17:27:35 dbj Exp $");
38 1.13 cgd #endif
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #include <sys/param.h>
42 1.7 cgd #include <sys/time.h>
43 1.26 lukem
44 1.9 mycroft #include <ufs/ufs/dinode.h>
45 1.9 mycroft #include <ufs/ufs/dir.h>
46 1.9 mycroft #include <ufs/ffs/fs.h>
47 1.27 bouyer #include <ufs/ffs/ffs_extern.h>
48 1.32 fvdl #include <ufs/ufs/ufs_bswap.h>
49 1.28 kleink
50 1.6 cgd #ifndef SMALL
51 1.26 lukem #include <err.h>
52 1.1 cgd #include <pwd.h>
53 1.6 cgd #endif
54 1.12 cgd #include <stdio.h>
55 1.1 cgd #include <stdlib.h>
56 1.1 cgd #include <string.h>
57 1.28 kleink #include <time.h>
58 1.12 cgd
59 1.1 cgd #include "fsck.h"
60 1.22 christos #include "fsutil.h"
61 1.12 cgd #include "extern.h"
62 1.1 cgd
63 1.1 cgd static ino_t startinum;
64 1.1 cgd
65 1.21 christos static int iblock __P((struct inodesc *, long, u_int64_t));
66 1.37 fvdl static void swap_dinode1(union dinode *, int);
67 1.37 fvdl static void swap_dinode2(union dinode *, int);
68 1.12 cgd
69 1.12 cgd int
70 1.1 cgd ckinode(dp, idesc)
71 1.37 fvdl union dinode *dp;
72 1.24 lukem struct inodesc *idesc;
73 1.1 cgd {
74 1.37 fvdl int ret, offset, i;
75 1.37 fvdl union dinode dino;
76 1.27 bouyer u_int64_t sizepb;
77 1.27 bouyer int64_t remsize;
78 1.37 fvdl daddr_t ndb;
79 1.9 mycroft mode_t mode;
80 1.23 thorpej char pathbuf[MAXPATHLEN + 1];
81 1.1 cgd
82 1.1 cgd if (idesc->id_fix != IGNORE)
83 1.1 cgd idesc->id_fix = DONTKNOW;
84 1.1 cgd idesc->id_entryno = 0;
85 1.37 fvdl idesc->id_filesize = iswap64(DIP(dp, size));
86 1.37 fvdl mode = iswap16(DIP(dp, mode)) & IFMT;
87 1.9 mycroft if (mode == IFBLK || mode == IFCHR || (mode == IFLNK &&
88 1.27 bouyer (idesc->id_filesize < sblock->fs_maxsymlinklen ||
89 1.35 dbj (isappleufs && (idesc->id_filesize < APPLEUFS_MAXSYMLINKLEN)) ||
90 1.37 fvdl (sblock->fs_maxsymlinklen == 0 && DIP(dp, blocks) == 0))))
91 1.1 cgd return (KEEPON);
92 1.37 fvdl if (is_ufs2)
93 1.37 fvdl dino.dp2 = dp->dp2;
94 1.37 fvdl else
95 1.37 fvdl dino.dp1 = dp->dp1;
96 1.37 fvdl ndb = howmany(iswap64(DIP(&dino, size)), sblock->fs_bsize);
97 1.37 fvdl for (i = 0; i < NDADDR; i++) {
98 1.27 bouyer if (--ndb == 0 &&
99 1.37 fvdl (offset = blkoff(sblock, iswap64(DIP(&dino, size)))) != 0)
100 1.1 cgd idesc->id_numfrags =
101 1.27 bouyer numfrags(sblock, fragroundup(sblock, offset));
102 1.1 cgd else
103 1.27 bouyer idesc->id_numfrags = sblock->fs_frag;
104 1.37 fvdl if (DIP(&dino, db[i]) == 0) {
105 1.23 thorpej if (idesc->id_type == DATA && ndb >= 0) {
106 1.23 thorpej /* An empty block in a directory XXX */
107 1.27 bouyer markclean = 0;
108 1.39 itojun getpathname(pathbuf, sizeof(pathbuf),
109 1.39 itojun idesc->id_number, idesc->id_number);
110 1.37 fvdl pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS I",
111 1.23 thorpej pathbuf);
112 1.37 fvdl abort();
113 1.23 thorpej if (reply("ADJUST LENGTH") == 1) {
114 1.23 thorpej dp = ginode(idesc->id_number);
115 1.37 fvdl DIP(dp, size) = iswap64(i *
116 1.27 bouyer sblock->fs_bsize);
117 1.23 thorpej printf(
118 1.23 thorpej "YOU MUST RERUN FSCK AFTERWARDS\n");
119 1.23 thorpej rerun = 1;
120 1.23 thorpej inodirty();
121 1.23 thorpej }
122 1.23 thorpej }
123 1.1 cgd continue;
124 1.23 thorpej }
125 1.37 fvdl if (is_ufs2)
126 1.37 fvdl idesc->id_blkno = iswap64(dino.dp2.di_db[i]);
127 1.37 fvdl else
128 1.37 fvdl idesc->id_blkno = iswap32(dino.dp1.di_db[i]);
129 1.1 cgd if (idesc->id_type == ADDR)
130 1.1 cgd ret = (*idesc->id_func)(idesc);
131 1.1 cgd else
132 1.1 cgd ret = dirscan(idesc);
133 1.1 cgd if (ret & STOP)
134 1.1 cgd return (ret);
135 1.1 cgd }
136 1.27 bouyer idesc->id_numfrags = sblock->fs_frag;
137 1.37 fvdl remsize = iswap64(DIP(&dino, size)) - sblock->fs_bsize * NDADDR;
138 1.27 bouyer sizepb = sblock->fs_bsize;
139 1.37 fvdl for (i = 0; i < NIADDR; i++) {
140 1.37 fvdl if (DIP(&dino, ib[i])) {
141 1.37 fvdl if (is_ufs2)
142 1.37 fvdl idesc->id_blkno = iswap64(dino.dp2.di_ib[i]);
143 1.37 fvdl else
144 1.37 fvdl idesc->id_blkno = iswap32(dino.dp1.di_ib[i]);
145 1.37 fvdl ret = iblock(idesc, i + 1, remsize);
146 1.1 cgd if (ret & STOP)
147 1.1 cgd return (ret);
148 1.23 thorpej } else {
149 1.23 thorpej if (idesc->id_type == DATA && remsize > 0) {
150 1.23 thorpej /* An empty block in a directory XXX */
151 1.27 bouyer markclean = 0;
152 1.39 itojun getpathname(pathbuf, sizeof(pathbuf),
153 1.39 itojun idesc->id_number, idesc->id_number);
154 1.23 thorpej pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
155 1.23 thorpej pathbuf);
156 1.23 thorpej if (reply("ADJUST LENGTH") == 1) {
157 1.23 thorpej dp = ginode(idesc->id_number);
158 1.37 fvdl DIP(dp, size) =
159 1.37 fvdl iswap64(iswap64(DIP(dp, size))
160 1.37 fvdl - remsize);
161 1.23 thorpej remsize = 0;
162 1.23 thorpej printf(
163 1.23 thorpej "YOU MUST RERUN FSCK AFTERWARDS\n");
164 1.23 thorpej rerun = 1;
165 1.23 thorpej inodirty();
166 1.23 thorpej break;
167 1.23 thorpej }
168 1.23 thorpej }
169 1.1 cgd }
170 1.27 bouyer sizepb *= NINDIR(sblock);
171 1.9 mycroft remsize -= sizepb;
172 1.1 cgd }
173 1.1 cgd return (KEEPON);
174 1.1 cgd }
175 1.1 cgd
176 1.21 christos static int
177 1.1 cgd iblock(idesc, ilevel, isize)
178 1.1 cgd struct inodesc *idesc;
179 1.9 mycroft long ilevel;
180 1.19 mycroft u_int64_t isize;
181 1.1 cgd {
182 1.24 lukem struct bufarea *bp;
183 1.21 christos int i, n, (*func) __P((struct inodesc *)), nif;
184 1.19 mycroft u_int64_t sizepb;
185 1.1 cgd char buf[BUFSIZ];
186 1.23 thorpej char pathbuf[MAXPATHLEN + 1];
187 1.37 fvdl union dinode *dp;
188 1.1 cgd
189 1.1 cgd if (idesc->id_type == ADDR) {
190 1.1 cgd func = idesc->id_func;
191 1.1 cgd if (((n = (*func)(idesc)) & KEEPON) == 0)
192 1.1 cgd return (n);
193 1.1 cgd } else
194 1.1 cgd func = dirscan;
195 1.1 cgd if (chkrange(idesc->id_blkno, idesc->id_numfrags))
196 1.1 cgd return (SKIP);
197 1.27 bouyer bp = getdatablk(idesc->id_blkno, sblock->fs_bsize);
198 1.1 cgd ilevel--;
199 1.27 bouyer for (sizepb = sblock->fs_bsize, i = 0; i < ilevel; i++)
200 1.27 bouyer sizepb *= NINDIR(sblock);
201 1.37 fvdl if (howmany(isize, sizepb) > NINDIR(sblock))
202 1.27 bouyer nif = NINDIR(sblock);
203 1.18 mycroft else
204 1.18 mycroft nif = howmany(isize, sizepb);
205 1.27 bouyer if (do_blkswap) { /* swap byte order of the whole blk */
206 1.37 fvdl if (is_ufs2) {
207 1.37 fvdl for (i = 0; i < nif; i++)
208 1.37 fvdl bp->b_un.b_indir2[i] =
209 1.37 fvdl bswap64(bp->b_un.b_indir2[i]);
210 1.37 fvdl } else {
211 1.37 fvdl for (i = 0; i < nif; i++)
212 1.37 fvdl bp->b_un.b_indir1[i] =
213 1.38 fvdl bswap32(bp->b_un.b_indir1[i]);
214 1.37 fvdl }
215 1.27 bouyer dirty(bp);
216 1.27 bouyer flush(fswritefd, bp);
217 1.27 bouyer }
218 1.27 bouyer if (idesc->id_func == pass1check && nif < NINDIR(sblock)) {
219 1.37 fvdl for (i = nif; i < NINDIR(sblock); i++) {
220 1.37 fvdl if (IBLK(bp, i) == 0)
221 1.1 cgd continue;
222 1.29 mycroft (void)snprintf(buf, sizeof(buf),
223 1.29 mycroft "PARTIALLY TRUNCATED INODE I=%u", idesc->id_number);
224 1.1 cgd if (dofix(idesc, buf)) {
225 1.37 fvdl IBLK(bp, i) = 0;
226 1.1 cgd dirty(bp);
227 1.27 bouyer } else
228 1.27 bouyer markclean= 0;
229 1.1 cgd }
230 1.1 cgd flush(fswritefd, bp);
231 1.1 cgd }
232 1.37 fvdl for (i = 0; i < nif; i++) {
233 1.37 fvdl if (IBLK(bp, i)) {
234 1.37 fvdl if (is_ufs2)
235 1.37 fvdl idesc->id_blkno = iswap64(bp->b_un.b_indir2[i]);
236 1.37 fvdl else
237 1.37 fvdl idesc->id_blkno = iswap32(bp->b_un.b_indir1[i]);
238 1.9 mycroft if (ilevel == 0)
239 1.9 mycroft n = (*func)(idesc);
240 1.1 cgd else
241 1.9 mycroft n = iblock(idesc, ilevel, isize);
242 1.1 cgd if (n & STOP) {
243 1.1 cgd bp->b_flags &= ~B_INUSE;
244 1.1 cgd return (n);
245 1.23 thorpej }
246 1.23 thorpej } else {
247 1.23 thorpej if (idesc->id_type == DATA && isize > 0) {
248 1.23 thorpej /* An empty block in a directory XXX */
249 1.27 bouyer markclean= 0;
250 1.39 itojun getpathname(pathbuf, sizeof(pathbuf),
251 1.39 itojun idesc->id_number, idesc->id_number);
252 1.23 thorpej pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
253 1.23 thorpej pathbuf);
254 1.23 thorpej if (reply("ADJUST LENGTH") == 1) {
255 1.23 thorpej dp = ginode(idesc->id_number);
256 1.37 fvdl DIP(dp, size) =
257 1.37 fvdl iswap64(iswap64(DIP(dp, size))
258 1.37 fvdl - isize);
259 1.23 thorpej isize = 0;
260 1.23 thorpej printf(
261 1.23 thorpej "YOU MUST RERUN FSCK AFTERWARDS\n");
262 1.23 thorpej rerun = 1;
263 1.23 thorpej inodirty();
264 1.23 thorpej bp->b_flags &= ~B_INUSE;
265 1.23 thorpej return(STOP);
266 1.23 thorpej }
267 1.1 cgd }
268 1.1 cgd }
269 1.9 mycroft isize -= sizepb;
270 1.1 cgd }
271 1.1 cgd bp->b_flags &= ~B_INUSE;
272 1.1 cgd return (KEEPON);
273 1.1 cgd }
274 1.1 cgd
275 1.1 cgd /*
276 1.1 cgd * Check that a block in a legal block number.
277 1.1 cgd * Return 0 if in range, 1 if out of range.
278 1.1 cgd */
279 1.12 cgd int
280 1.1 cgd chkrange(blk, cnt)
281 1.36 fvdl daddr_t blk;
282 1.1 cgd int cnt;
283 1.1 cgd {
284 1.24 lukem int c;
285 1.1 cgd
286 1.1 cgd if ((unsigned)(blk + cnt) > maxfsblock)
287 1.1 cgd return (1);
288 1.37 fvdl if (cnt > sblock->fs_frag ||
289 1.37 fvdl fragnum(sblock, blk) + cnt > sblock->fs_frag) {
290 1.37 fvdl if (debug)
291 1.37 fvdl printf("bad size: blk %lld, offset %d, size %d\n",
292 1.37 fvdl (long long)blk, (int)fragnum(sblock, blk), cnt);
293 1.37 fvdl }
294 1.27 bouyer c = dtog(sblock, blk);
295 1.27 bouyer if (blk < cgdmin(sblock, c)) {
296 1.27 bouyer if ((blk + cnt) > cgsblock(sblock, c)) {
297 1.1 cgd if (debug) {
298 1.36 fvdl printf("blk %lld < cgdmin %lld;",
299 1.36 fvdl (long long)blk,
300 1.36 fvdl (long long)cgdmin(sblock, c));
301 1.36 fvdl printf(" blk + cnt %lld > cgsbase %lld\n",
302 1.36 fvdl (long long)(blk + cnt),
303 1.36 fvdl (long long)cgsblock(sblock, c));
304 1.1 cgd }
305 1.1 cgd return (1);
306 1.1 cgd }
307 1.1 cgd } else {
308 1.27 bouyer if ((blk + cnt) > cgbase(sblock, c+1)) {
309 1.1 cgd if (debug) {
310 1.36 fvdl printf("blk %lld >= cgdmin %lld;",
311 1.36 fvdl (long long)blk,
312 1.36 fvdl (long long)cgdmin(sblock, c));
313 1.36 fvdl printf(" blk + cnt %lld > sblock->fs_fpg %d\n",
314 1.36 fvdl (long long)(blk+cnt), sblock->fs_fpg);
315 1.1 cgd }
316 1.1 cgd return (1);
317 1.1 cgd }
318 1.1 cgd }
319 1.1 cgd return (0);
320 1.1 cgd }
321 1.1 cgd
322 1.1 cgd /*
323 1.1 cgd * General purpose interface for reading inodes.
324 1.1 cgd */
325 1.37 fvdl union dinode *
326 1.1 cgd ginode(inumber)
327 1.1 cgd ino_t inumber;
328 1.1 cgd {
329 1.36 fvdl daddr_t iblk;
330 1.30 thorpej int blkoff;
331 1.1 cgd
332 1.1 cgd if (inumber < ROOTINO || inumber > maxino)
333 1.26 lukem errx(EEXIT, "bad inode number %d to ginode", inumber);
334 1.1 cgd if (startinum == 0 ||
335 1.27 bouyer inumber < startinum || inumber >= startinum + INOPB(sblock)) {
336 1.27 bouyer iblk = ino_to_fsba(sblock, inumber);
337 1.1 cgd if (pbp != 0)
338 1.1 cgd pbp->b_flags &= ~B_INUSE;
339 1.27 bouyer pbp = getdatablk(iblk, sblock->fs_bsize);
340 1.27 bouyer startinum = (inumber / INOPB(sblock)) * INOPB(sblock);
341 1.1 cgd }
342 1.37 fvdl if (is_ufs2) {
343 1.37 fvdl blkoff = (inumber % INOPB(sblock)) * DINODE2_SIZE;
344 1.37 fvdl return ((union dinode *)((caddr_t)pbp->b_un.b_buf + blkoff));
345 1.37 fvdl }
346 1.37 fvdl blkoff = (inumber % INOPB(sblock)) * DINODE1_SIZE;
347 1.37 fvdl return ((union dinode *)((caddr_t)pbp->b_un.b_buf + blkoff));
348 1.37 fvdl }
349 1.37 fvdl
350 1.37 fvdl static void
351 1.37 fvdl swap_dinode1(union dinode *dp, int n)
352 1.37 fvdl {
353 1.37 fvdl int i, j;
354 1.37 fvdl struct ufs1_dinode *dp1;
355 1.37 fvdl
356 1.37 fvdl dp1 = (struct ufs1_dinode *)&dp->dp1;
357 1.37 fvdl for (i = 0; i < n; i++, dp1++) {
358 1.37 fvdl ffs_dinode1_swap(dp1, dp1);
359 1.42 dbj if (((iswap16(dp1->di_mode) & IFMT) != IFLNK) ||
360 1.42 dbj (isappleufs && (iswap64(dp1->di_size) >
361 1.42 dbj APPLEUFS_MAXSYMLINKLEN)) ||
362 1.44 dbj doinglevel2 ||
363 1.43 dbj (sblock->fs_maxsymlinklen < 0) ||
364 1.42 dbj (iswap64(dp1->di_size) > sblock->fs_maxsymlinklen)) {
365 1.37 fvdl for (j = 0; j < (NDADDR + NIADDR); j++)
366 1.37 fvdl dp1->di_db[j] = bswap32(dp1->di_db[j]);
367 1.37 fvdl }
368 1.37 fvdl }
369 1.37 fvdl }
370 1.37 fvdl
371 1.37 fvdl static void
372 1.37 fvdl swap_dinode2(union dinode *dp, int n)
373 1.37 fvdl {
374 1.37 fvdl int i, j;
375 1.37 fvdl struct ufs2_dinode *dp2;
376 1.37 fvdl
377 1.37 fvdl dp2 = (struct ufs2_dinode *)&dp->dp2;
378 1.37 fvdl for (i = 0; i < n; i++, dp2++) {
379 1.37 fvdl ffs_dinode2_swap(dp2, dp2);
380 1.37 fvdl if ((iswap16(dp2->di_mode) & IFMT) != IFLNK) {
381 1.37 fvdl for (j = 0; j < (NDADDR + NIADDR + NXADDR); j++)
382 1.37 fvdl dp2->di_extb[j] = bswap64(dp2->di_extb[j]);
383 1.37 fvdl }
384 1.37 fvdl }
385 1.1 cgd }
386 1.1 cgd
387 1.1 cgd /*
388 1.1 cgd * Special purpose version of ginode used to optimize first pass
389 1.1 cgd * over all the inodes in numerical order.
390 1.1 cgd */
391 1.37 fvdl ino_t nextino, lastinum, lastvalidinum;
392 1.1 cgd long readcnt, readpercg, fullcnt, inobufsize, partialcnt, partialsize;
393 1.37 fvdl union dinode *inodebuf;
394 1.1 cgd
395 1.37 fvdl union dinode *
396 1.1 cgd getnextinode(inumber)
397 1.1 cgd ino_t inumber;
398 1.1 cgd {
399 1.1 cgd long size;
400 1.36 fvdl daddr_t dblk;
401 1.37 fvdl static union dinode *dp;
402 1.37 fvdl union dinode *ret;
403 1.1 cgd
404 1.37 fvdl if (inumber != nextino++ || inumber > lastvalidinum) {
405 1.37 fvdl abort();
406 1.26 lukem errx(EEXIT, "bad inode number %d to nextinode", inumber);
407 1.37 fvdl }
408 1.37 fvdl
409 1.1 cgd if (inumber >= lastinum) {
410 1.1 cgd readcnt++;
411 1.27 bouyer dblk = fsbtodb(sblock, ino_to_fsba(sblock, lastinum));
412 1.1 cgd if (readcnt % readpercg == 0) {
413 1.1 cgd size = partialsize;
414 1.1 cgd lastinum += partialcnt;
415 1.1 cgd } else {
416 1.1 cgd size = inobufsize;
417 1.1 cgd lastinum += fullcnt;
418 1.1 cgd }
419 1.37 fvdl (void)bread(fsreadfd, (caddr_t)inodebuf, dblk, size);
420 1.27 bouyer if (doswap) {
421 1.37 fvdl if (is_ufs2)
422 1.37 fvdl swap_dinode2(inodebuf, lastinum - inumber);
423 1.37 fvdl else
424 1.37 fvdl swap_dinode1(inodebuf, lastinum - inumber);
425 1.27 bouyer bwrite(fswritefd, (char *)inodebuf, dblk, size);
426 1.27 bouyer }
427 1.37 fvdl dp = (union dinode *)inodebuf;
428 1.1 cgd }
429 1.37 fvdl ret = dp;
430 1.37 fvdl dp = (union dinode *)
431 1.37 fvdl ((char *)dp + (is_ufs2 ? DINODE2_SIZE : DINODE1_SIZE));
432 1.37 fvdl return ret;
433 1.1 cgd }
434 1.1 cgd
435 1.12 cgd void
436 1.37 fvdl setinodebuf(inum)
437 1.37 fvdl ino_t inum;
438 1.1 cgd {
439 1.1 cgd
440 1.37 fvdl if (inum % sblock->fs_ipg != 0)
441 1.37 fvdl errx(EEXIT, "bad inode number %d to setinodebuf", inum);
442 1.37 fvdl
443 1.37 fvdl lastvalidinum = inum + sblock->fs_ipg - 1;
444 1.1 cgd startinum = 0;
445 1.37 fvdl nextino = inum;
446 1.37 fvdl lastinum = inum;
447 1.1 cgd readcnt = 0;
448 1.37 fvdl if (inodebuf != NULL)
449 1.37 fvdl return;
450 1.27 bouyer inobufsize = blkroundup(sblock, INOBUFSIZE);
451 1.37 fvdl fullcnt = inobufsize / (is_ufs2 ? DINODE2_SIZE : DINODE1_SIZE);
452 1.27 bouyer readpercg = sblock->fs_ipg / fullcnt;
453 1.27 bouyer partialcnt = sblock->fs_ipg % fullcnt;
454 1.37 fvdl partialsize = partialcnt * (is_ufs2 ? DINODE2_SIZE : DINODE1_SIZE);
455 1.1 cgd if (partialcnt != 0) {
456 1.1 cgd readpercg++;
457 1.1 cgd } else {
458 1.1 cgd partialcnt = fullcnt;
459 1.1 cgd partialsize = inobufsize;
460 1.1 cgd }
461 1.1 cgd if (inodebuf == NULL &&
462 1.37 fvdl (inodebuf = malloc((unsigned)inobufsize)) == NULL)
463 1.26 lukem errx(EEXIT, "Cannot allocate space for inode buffer");
464 1.1 cgd }
465 1.1 cgd
466 1.12 cgd void
467 1.1 cgd freeinodebuf()
468 1.1 cgd {
469 1.1 cgd
470 1.1 cgd if (inodebuf != NULL)
471 1.1 cgd free((char *)inodebuf);
472 1.1 cgd inodebuf = NULL;
473 1.1 cgd }
474 1.1 cgd
475 1.1 cgd /*
476 1.1 cgd * Routines to maintain information about directory inodes.
477 1.1 cgd * This is built during the first pass and used during the
478 1.1 cgd * second and third passes.
479 1.1 cgd *
480 1.1 cgd * Enter inodes into the cache.
481 1.1 cgd */
482 1.12 cgd void
483 1.1 cgd cacheino(dp, inumber)
484 1.37 fvdl union dinode *dp;
485 1.1 cgd ino_t inumber;
486 1.1 cgd {
487 1.24 lukem struct inoinfo *inp;
488 1.41 itojun struct inoinfo **inpp, **ninpsort;
489 1.37 fvdl unsigned int blks;
490 1.37 fvdl int i;
491 1.37 fvdl int64_t size;
492 1.1 cgd
493 1.37 fvdl size = iswap64(DIP(dp, size));
494 1.37 fvdl blks = howmany(size, sblock->fs_bsize);
495 1.1 cgd if (blks > NDADDR)
496 1.1 cgd blks = NDADDR + NIADDR;
497 1.37 fvdl
498 1.37 fvdl inp = (struct inoinfo *) malloc(sizeof(*inp) + (blks - 1)
499 1.37 fvdl * sizeof (int64_t));
500 1.1 cgd if (inp == NULL)
501 1.1 cgd return;
502 1.37 fvdl inpp = &inphead[inumber % dirhash];
503 1.1 cgd inp->i_nexthash = *inpp;
504 1.1 cgd *inpp = inp;
505 1.20 mycroft inp->i_child = inp->i_sibling = inp->i_parentp = 0;
506 1.14 mycroft if (inumber == ROOTINO)
507 1.14 mycroft inp->i_parent = ROOTINO;
508 1.14 mycroft else
509 1.14 mycroft inp->i_parent = (ino_t)0;
510 1.1 cgd inp->i_dotdot = (ino_t)0;
511 1.1 cgd inp->i_number = inumber;
512 1.37 fvdl inp->i_isize = size;
513 1.37 fvdl inp->i_numblks = blks;
514 1.37 fvdl for (i = 0; i < (blks < NDADDR ? blks : NDADDR); i++)
515 1.37 fvdl inp->i_blks[i] = DIP(dp, db[i]);
516 1.37 fvdl if (blks > NDADDR)
517 1.37 fvdl for (i = 0; i < NIADDR; i++)
518 1.37 fvdl inp->i_blks[NDADDR + i] = DIP(dp, ib[i]);
519 1.1 cgd if (inplast == listmax) {
520 1.41 itojun ninpsort = (struct inoinfo **)realloc((char *)inpsort,
521 1.41 itojun (unsigned)(listmax + 100) * sizeof(struct inoinfo *));
522 1.1 cgd if (inpsort == NULL)
523 1.26 lukem errx(EEXIT, "cannot increase directory list");
524 1.41 itojun inpsort = ninpsort;
525 1.41 itojun listmax += 100;
526 1.1 cgd }
527 1.1 cgd inpsort[inplast++] = inp;
528 1.1 cgd }
529 1.1 cgd
530 1.1 cgd /*
531 1.1 cgd * Look up an inode cache structure.
532 1.1 cgd */
533 1.1 cgd struct inoinfo *
534 1.1 cgd getinoinfo(inumber)
535 1.1 cgd ino_t inumber;
536 1.1 cgd {
537 1.24 lukem struct inoinfo *inp;
538 1.1 cgd
539 1.37 fvdl for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) {
540 1.1 cgd if (inp->i_number != inumber)
541 1.1 cgd continue;
542 1.1 cgd return (inp);
543 1.1 cgd }
544 1.26 lukem errx(EEXIT, "cannot find inode %d", inumber);
545 1.1 cgd return ((struct inoinfo *)0);
546 1.1 cgd }
547 1.1 cgd
548 1.1 cgd /*
549 1.1 cgd * Clean up all the inode cache structure.
550 1.1 cgd */
551 1.12 cgd void
552 1.1 cgd inocleanup()
553 1.1 cgd {
554 1.24 lukem struct inoinfo **inpp;
555 1.1 cgd
556 1.1 cgd if (inphead == NULL)
557 1.1 cgd return;
558 1.1 cgd for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
559 1.1 cgd free((char *)(*inpp));
560 1.1 cgd free((char *)inphead);
561 1.1 cgd free((char *)inpsort);
562 1.1 cgd inphead = inpsort = NULL;
563 1.1 cgd }
564 1.9 mycroft
565 1.12 cgd void
566 1.1 cgd inodirty()
567 1.1 cgd {
568 1.1 cgd
569 1.1 cgd dirty(pbp);
570 1.1 cgd }
571 1.1 cgd
572 1.12 cgd void
573 1.1 cgd clri(idesc, type, flag)
574 1.24 lukem struct inodesc *idesc;
575 1.1 cgd char *type;
576 1.1 cgd int flag;
577 1.1 cgd {
578 1.37 fvdl union dinode *dp;
579 1.1 cgd
580 1.1 cgd dp = ginode(idesc->id_number);
581 1.1 cgd if (flag == 1) {
582 1.1 cgd pwarn("%s %s", type,
583 1.37 fvdl (iswap16(DIP(dp, mode)) & IFMT) == IFDIR ? "DIR" : "FILE");
584 1.1 cgd pinode(idesc->id_number);
585 1.1 cgd }
586 1.1 cgd if (preen || reply("CLEAR") == 1) {
587 1.1 cgd if (preen)
588 1.1 cgd printf(" (CLEARED)\n");
589 1.1 cgd n_files--;
590 1.1 cgd (void)ckinode(dp, idesc);
591 1.1 cgd clearinode(dp);
592 1.37 fvdl inoinfo(idesc->id_number)->ino_state = USTATE;
593 1.1 cgd inodirty();
594 1.27 bouyer } else
595 1.27 bouyer markclean= 0;
596 1.1 cgd }
597 1.1 cgd
598 1.12 cgd int
599 1.1 cgd findname(idesc)
600 1.1 cgd struct inodesc *idesc;
601 1.1 cgd {
602 1.24 lukem struct direct *dirp = idesc->id_dirp;
603 1.1 cgd
604 1.37 fvdl if (iswap32(dirp->d_ino) != idesc->id_parent || idesc->id_entryno < 2) {
605 1.37 fvdl idesc->id_entryno++;
606 1.1 cgd return (KEEPON);
607 1.37 fvdl }
608 1.26 lukem memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1);
609 1.1 cgd return (STOP|FOUND);
610 1.1 cgd }
611 1.1 cgd
612 1.12 cgd int
613 1.1 cgd findino(idesc)
614 1.1 cgd struct inodesc *idesc;
615 1.1 cgd {
616 1.24 lukem struct direct *dirp = idesc->id_dirp;
617 1.1 cgd
618 1.1 cgd if (dirp->d_ino == 0)
619 1.1 cgd return (KEEPON);
620 1.1 cgd if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
621 1.27 bouyer iswap32(dirp->d_ino) >= ROOTINO && iswap32(dirp->d_ino) <= maxino) {
622 1.27 bouyer idesc->id_parent = iswap32(dirp->d_ino);
623 1.1 cgd return (STOP|FOUND);
624 1.1 cgd }
625 1.1 cgd return (KEEPON);
626 1.1 cgd }
627 1.1 cgd
628 1.37 fvdl int
629 1.37 fvdl clearentry(idesc)
630 1.37 fvdl struct inodesc *idesc;
631 1.37 fvdl {
632 1.37 fvdl struct direct *dirp = idesc->id_dirp;
633 1.37 fvdl
634 1.37 fvdl if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
635 1.37 fvdl idesc->id_entryno++;
636 1.37 fvdl return (KEEPON);
637 1.37 fvdl }
638 1.37 fvdl dirp->d_ino = 0;
639 1.37 fvdl return (STOP|FOUND|ALTERED);
640 1.37 fvdl }
641 1.37 fvdl
642 1.12 cgd void
643 1.1 cgd pinode(ino)
644 1.1 cgd ino_t ino;
645 1.1 cgd {
646 1.37 fvdl union dinode *dp;
647 1.24 lukem char *p;
648 1.1 cgd struct passwd *pw;
649 1.17 thorpej time_t t;
650 1.1 cgd
651 1.21 christos printf(" I=%u ", ino);
652 1.1 cgd if (ino < ROOTINO || ino > maxino)
653 1.1 cgd return;
654 1.1 cgd dp = ginode(ino);
655 1.1 cgd printf(" OWNER=");
656 1.6 cgd #ifndef SMALL
657 1.37 fvdl if ((pw = getpwuid((int)iswap32(DIP(dp, uid)))) != 0)
658 1.1 cgd printf("%s ", pw->pw_name);
659 1.1 cgd else
660 1.6 cgd #endif
661 1.37 fvdl printf("%u ", (unsigned)iswap32(DIP(dp, uid)));
662 1.37 fvdl printf("MODE=%o\n", iswap16(DIP(dp, mode)));
663 1.1 cgd if (preen)
664 1.21 christos printf("%s: ", cdevname());
665 1.37 fvdl printf("SIZE=%llu ", (unsigned long long)iswap64(DIP(dp, size)));
666 1.37 fvdl t = iswap32(DIP(dp, mtime));
667 1.17 thorpej p = ctime(&t);
668 1.1 cgd printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
669 1.1 cgd }
670 1.1 cgd
671 1.12 cgd void
672 1.1 cgd blkerror(ino, type, blk)
673 1.1 cgd ino_t ino;
674 1.1 cgd char *type;
675 1.36 fvdl daddr_t blk;
676 1.1 cgd {
677 1.37 fvdl struct inostat *info;
678 1.1 cgd
679 1.36 fvdl pfatal("%lld %s I=%u", (long long)blk, type, ino);
680 1.1 cgd printf("\n");
681 1.37 fvdl info = inoinfo(ino);
682 1.37 fvdl switch (info->ino_state) {
683 1.1 cgd
684 1.1 cgd case FSTATE:
685 1.37 fvdl info->ino_state = FCLEAR;
686 1.1 cgd return;
687 1.1 cgd
688 1.1 cgd case DSTATE:
689 1.37 fvdl info->ino_state = DCLEAR;
690 1.1 cgd return;
691 1.1 cgd
692 1.1 cgd case FCLEAR:
693 1.1 cgd case DCLEAR:
694 1.1 cgd return;
695 1.1 cgd
696 1.1 cgd default:
697 1.37 fvdl errx(EEXIT, "BAD STATE %d TO BLKERR", info->ino_state);
698 1.1 cgd /* NOTREACHED */
699 1.1 cgd }
700 1.1 cgd }
701 1.1 cgd
702 1.1 cgd /*
703 1.1 cgd * allocate an unused inode
704 1.1 cgd */
705 1.1 cgd ino_t
706 1.1 cgd allocino(request, type)
707 1.1 cgd ino_t request;
708 1.1 cgd int type;
709 1.1 cgd {
710 1.24 lukem ino_t ino;
711 1.37 fvdl union dinode *dp;
712 1.37 fvdl struct ufs1_dinode *dp1;
713 1.37 fvdl struct ufs2_dinode *dp2;
714 1.16 thorpej time_t t;
715 1.32 fvdl struct cg *cgp = cgrp;
716 1.32 fvdl int cg;
717 1.37 fvdl struct inostat *info;
718 1.1 cgd
719 1.1 cgd if (request == 0)
720 1.1 cgd request = ROOTINO;
721 1.37 fvdl else if (inoinfo(request)->ino_state != USTATE)
722 1.1 cgd return (0);
723 1.37 fvdl for (ino = request; ino < maxino; ino++) {
724 1.37 fvdl info = inoinfo(ino);
725 1.37 fvdl if (info->ino_state == USTATE)
726 1.1 cgd break;
727 1.37 fvdl }
728 1.1 cgd if (ino == maxino)
729 1.1 cgd return (0);
730 1.32 fvdl cg = ino_to_cg(sblock, ino);
731 1.32 fvdl getblk(&cgblk, cgtod(sblock, cg), sblock->fs_cgsize);
732 1.32 fvdl memcpy(cgp, cgblk.b_un.b_cg, sblock->fs_cgsize);
733 1.32 fvdl if ((doswap && !needswap) || (!doswap && needswap))
734 1.37 fvdl ffs_cg_swap(cgblk.b_un.b_cg, cgp, sblock);
735 1.32 fvdl if (!cg_chkmagic(cgp, 0))
736 1.32 fvdl pfatal("CG %d: ALLOCINO: BAD MAGIC NUMBER\n", cg);
737 1.32 fvdl if (doswap)
738 1.32 fvdl cgdirty();
739 1.32 fvdl setbit(cg_inosused(cgp, 0), ino % sblock->fs_ipg);
740 1.32 fvdl cgp->cg_cs.cs_nifree--;
741 1.1 cgd switch (type & IFMT) {
742 1.1 cgd case IFDIR:
743 1.37 fvdl info->ino_state = DSTATE;
744 1.32 fvdl cgp->cg_cs.cs_ndir++;
745 1.1 cgd break;
746 1.1 cgd case IFREG:
747 1.1 cgd case IFLNK:
748 1.37 fvdl info->ino_state = FSTATE;
749 1.1 cgd break;
750 1.1 cgd default:
751 1.1 cgd return (0);
752 1.1 cgd }
753 1.32 fvdl cgdirty();
754 1.1 cgd dp = ginode(ino);
755 1.37 fvdl if (is_ufs2) {
756 1.37 fvdl dp2 = &dp->dp2;
757 1.37 fvdl dp2->di_db[0] = iswap64(allocblk(1));
758 1.37 fvdl if (dp2->di_db[0] == 0) {
759 1.37 fvdl info->ino_state = USTATE;
760 1.37 fvdl return (0);
761 1.37 fvdl }
762 1.37 fvdl dp2->di_mode = iswap16(type);
763 1.37 fvdl dp2->di_flags = 0;
764 1.37 fvdl (void)time(&t);
765 1.37 fvdl dp2->di_atime = iswap64(t);
766 1.37 fvdl dp2->di_mtime = dp2->di_ctime = dp2->di_atime;
767 1.37 fvdl dp2->di_size = iswap64(sblock->fs_fsize);
768 1.37 fvdl dp2->di_blocks = iswap64(btodb(sblock->fs_fsize));
769 1.37 fvdl } else {
770 1.37 fvdl dp1 = &dp->dp1;
771 1.37 fvdl dp1->di_db[0] = iswap32(allocblk(1));
772 1.37 fvdl if (dp1->di_db[0] == 0) {
773 1.37 fvdl info->ino_state = USTATE;
774 1.37 fvdl return (0);
775 1.37 fvdl }
776 1.37 fvdl dp1->di_mode = iswap16(type);
777 1.37 fvdl dp1->di_flags = 0;
778 1.37 fvdl (void)time(&t);
779 1.37 fvdl dp1->di_atime = iswap32(t);
780 1.37 fvdl dp1->di_mtime = dp1->di_ctime = dp1->di_atime;
781 1.37 fvdl dp1->di_size = iswap64(sblock->fs_fsize);
782 1.37 fvdl dp1->di_blocks = iswap32(btodb(sblock->fs_fsize));
783 1.1 cgd }
784 1.1 cgd n_files++;
785 1.1 cgd inodirty();
786 1.9 mycroft if (newinofmt)
787 1.37 fvdl info->ino_type = IFTODT(type);
788 1.1 cgd return (ino);
789 1.1 cgd }
790 1.1 cgd
791 1.1 cgd /*
792 1.1 cgd * deallocate an inode
793 1.1 cgd */
794 1.12 cgd void
795 1.1 cgd freeino(ino)
796 1.1 cgd ino_t ino;
797 1.1 cgd {
798 1.1 cgd struct inodesc idesc;
799 1.37 fvdl union dinode *dp;
800 1.1 cgd
801 1.11 mycroft memset(&idesc, 0, sizeof(struct inodesc));
802 1.1 cgd idesc.id_type = ADDR;
803 1.1 cgd idesc.id_func = pass4check;
804 1.1 cgd idesc.id_number = ino;
805 1.1 cgd dp = ginode(ino);
806 1.1 cgd (void)ckinode(dp, &idesc);
807 1.1 cgd clearinode(dp);
808 1.1 cgd inodirty();
809 1.37 fvdl inoinfo(ino)->ino_state = USTATE;
810 1.1 cgd n_files--;
811 1.1 cgd }
812