1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1980, 1986, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32 #if 0
33 #ifndef lint
34 static const char sccsid[] = "@(#)inode.c 8.8 (Berkeley) 4/28/95";
35 #endif /* not lint */
36 #endif
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
39
40 #include <sys/param.h>
41 #include <sys/stdint.h>
42 #include <sys/sysctl.h>
43
44 #include <ufs/ufs/dinode.h>
45 #include <ufs/ufs/dir.h>
46 #include <ufs/ffs/fs.h>
47
48 #include <err.h>
49 #include <pwd.h>
50 #include <string.h>
51 #include <time.h>
52 #include <libufs.h>
53
54 #include "fsck.h"
55
56 struct bufarea *icachebp; /* inode cache buffer */
57
58 static int iblock(struct inodesc *, off_t isize, int type);
59 static ufs2_daddr_t indir_blkatoff(ufs2_daddr_t, ino_t, ufs_lbn_t, ufs_lbn_t,
60 struct bufarea **);
61
62 int
ckinode(union dinode * dp,struct inodesc * idesc)63 ckinode(union dinode *dp, struct inodesc *idesc)
64 {
65 off_t remsize, sizepb;
66 int i, offset, ret;
67 struct inode ip;
68 union dinode dino;
69 ufs2_daddr_t ndb;
70 mode_t mode;
71 char pathbuf[MAXPATHLEN + 1];
72
73 if (idesc->id_fix != IGNORE)
74 idesc->id_fix = DONTKNOW;
75 idesc->id_dp = dp;
76 idesc->id_lbn = -1;
77 idesc->id_lballoc = -1;
78 idesc->id_level = 0;
79 idesc->id_entryno = 0;
80 idesc->id_filesize = DIP(dp, di_size);
81 mode = DIP(dp, di_mode) & IFMT;
82 if (mode == IFBLK || mode == IFCHR || (mode == IFLNK &&
83 DIP(dp, di_size) < (unsigned)sblock.fs_maxsymlinklen))
84 return (KEEPON);
85 if (sblock.fs_magic == FS_UFS1_MAGIC)
86 dino.dp1 = dp->dp1;
87 else
88 dino.dp2 = dp->dp2;
89 ndb = howmany(DIP(&dino, di_size), sblock.fs_bsize);
90 for (i = 0; i < UFS_NDADDR; i++) {
91 idesc->id_lbn++;
92 if (--ndb == 0 &&
93 (offset = blkoff(&sblock, DIP(&dino, di_size))) != 0)
94 idesc->id_numfrags =
95 numfrags(&sblock, fragroundup(&sblock, offset));
96 else
97 idesc->id_numfrags = sblock.fs_frag;
98 if (DIP(&dino, di_db[i]) == 0) {
99 if (idesc->id_type == DATA && ndb >= 0) {
100 /* An empty block in a directory XXX */
101 getpathname(pathbuf, idesc->id_number,
102 idesc->id_number);
103 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
104 pathbuf);
105 if (reply("ADJUST LENGTH") == 1) {
106 ginode(idesc->id_number, &ip);
107 DIP_SET(ip.i_dp, di_size,
108 i * sblock.fs_bsize);
109 printf(
110 "YOU MUST RERUN FSCK AFTERWARDS\n");
111 rerun = 1;
112 inodirty(&ip);
113 irelse(&ip);
114 }
115 }
116 continue;
117 }
118 idesc->id_blkno = DIP(&dino, di_db[i]);
119 if (idesc->id_type != DATA)
120 ret = (*idesc->id_func)(idesc);
121 else
122 ret = dirscan(idesc);
123 if (ret & STOP)
124 return (ret);
125 }
126 idesc->id_numfrags = sblock.fs_frag;
127 remsize = DIP(&dino, di_size) - sblock.fs_bsize * UFS_NDADDR;
128 sizepb = sblock.fs_bsize;
129 for (i = 0; i < UFS_NIADDR; i++) {
130 sizepb *= NINDIR(&sblock);
131 idesc->id_level = i + 1;
132 if (DIP(&dino, di_ib[i])) {
133 idesc->id_blkno = DIP(&dino, di_ib[i]);
134 ret = iblock(idesc, remsize, BT_LEVEL1 + i);
135 if (ret & STOP)
136 return (ret);
137 } else if (remsize > 0) {
138 idesc->id_lbn += sizepb / sblock.fs_bsize;
139 if (idesc->id_type == DATA) {
140 /* An empty block in a directory XXX */
141 getpathname(pathbuf, idesc->id_number,
142 idesc->id_number);
143 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
144 pathbuf);
145 if (reply("ADJUST LENGTH") == 1) {
146 ginode(idesc->id_number, &ip);
147 DIP_SET(ip.i_dp, di_size,
148 DIP(ip.i_dp, di_size) - remsize);
149 remsize = 0;
150 printf(
151 "YOU MUST RERUN FSCK AFTERWARDS\n");
152 rerun = 1;
153 inodirty(&ip);
154 irelse(&ip);
155 break;
156 }
157 }
158 }
159 remsize -= sizepb;
160 }
161 return (KEEPON);
162 }
163
164 static int
iblock(struct inodesc * idesc,off_t isize,int type)165 iblock(struct inodesc *idesc, off_t isize, int type)
166 {
167 struct inode ip;
168 struct bufarea *bp;
169 int i, n, (*func)(struct inodesc *), nif;
170 off_t sizepb;
171 char buf[BUFSIZ];
172 char pathbuf[MAXPATHLEN + 1];
173
174 if (idesc->id_type != DATA) {
175 func = idesc->id_func;
176 if (((n = (*func)(idesc)) & KEEPON) == 0)
177 return (n);
178 } else
179 func = dirscan;
180 bp = getdatablk(idesc->id_blkno, sblock.fs_bsize, type);
181 if (bp->b_errs != 0) {
182 brelse(bp);
183 return (SKIP);
184 }
185 idesc->id_bp = bp;
186 idesc->id_level--;
187 for (sizepb = sblock.fs_bsize, i = 0; i < idesc->id_level; i++)
188 sizepb *= NINDIR(&sblock);
189 if (howmany(isize, sizepb) > NINDIR(&sblock))
190 nif = NINDIR(&sblock);
191 else
192 nif = howmany(isize, sizepb);
193 if (idesc->id_func == pass1check && nif < NINDIR(&sblock)) {
194 for (i = nif; i < NINDIR(&sblock); i++) {
195 if (IBLK(bp, i) == 0)
196 continue;
197 (void)sprintf(buf, "PARTIALLY TRUNCATED INODE I=%lu",
198 (u_long)idesc->id_number);
199 if (preen) {
200 pfatal("%s", buf);
201 } else if (dofix(idesc, buf)) {
202 IBLK_SET(bp, i, 0);
203 dirty(bp);
204 }
205 }
206 flush(fswritefd, bp);
207 }
208 for (i = 0; i < nif; i++) {
209 if (IBLK(bp, i)) {
210 idesc->id_blkno = IBLK(bp, i);
211 bp->b_index = i;
212 if (idesc->id_level == 0) {
213 idesc->id_lbn++;
214 n = (*func)(idesc);
215 } else {
216 n = iblock(idesc, isize, type);
217 idesc->id_level++;
218 }
219 if (n & STOP) {
220 brelse(bp);
221 return (n);
222 }
223 } else {
224 idesc->id_lbn += sizepb / sblock.fs_bsize;
225 if (idesc->id_type == DATA && isize > 0) {
226 /* An empty block in a directory XXX */
227 getpathname(pathbuf, idesc->id_number,
228 idesc->id_number);
229 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
230 pathbuf);
231 if (reply("ADJUST LENGTH") == 1) {
232 ginode(idesc->id_number, &ip);
233 DIP_SET(ip.i_dp, di_size,
234 DIP(ip.i_dp, di_size) - isize);
235 isize = 0;
236 printf(
237 "YOU MUST RERUN FSCK AFTERWARDS\n");
238 rerun = 1;
239 inodirty(&ip);
240 brelse(bp);
241 return(STOP);
242 }
243 }
244 }
245 isize -= sizepb;
246 }
247 brelse(bp);
248 return (KEEPON);
249 }
250
251 /*
252 * Finds the disk block address at the specified lbn within the inode
253 * specified by dp. This follows the whole tree and honors di_size and
254 * di_extsize so it is a true test of reachability. The lbn may be
255 * negative if an extattr or indirect block is requested.
256 */
257 ufs2_daddr_t
ino_blkatoff(union dinode * dp,ino_t ino,ufs_lbn_t lbn,int * frags,struct bufarea ** bpp)258 ino_blkatoff(union dinode *dp, ino_t ino, ufs_lbn_t lbn, int *frags,
259 struct bufarea **bpp)
260 {
261 ufs_lbn_t tmpval;
262 ufs_lbn_t cur;
263 ufs_lbn_t next;
264 int i;
265
266 *frags = 0;
267 if (bpp != NULL)
268 *bpp = NULL;
269 /*
270 * Handle extattr blocks first.
271 */
272 if (lbn < 0 && lbn >= -UFS_NXADDR) {
273 lbn = -1 - lbn;
274 if (lbn > lblkno(&sblock, dp->dp2.di_extsize - 1))
275 return (0);
276 *frags = numfrags(&sblock,
277 sblksize(&sblock, dp->dp2.di_extsize, lbn));
278 return (dp->dp2.di_extb[lbn]);
279 }
280 /*
281 * Now direct and indirect.
282 */
283 if (DIP(dp, di_mode) == IFLNK &&
284 DIP(dp, di_size) < sblock.fs_maxsymlinklen)
285 return (0);
286 if (lbn >= 0 && lbn < UFS_NDADDR) {
287 *frags = numfrags(&sblock,
288 sblksize(&sblock, DIP(dp, di_size), lbn));
289 return (DIP(dp, di_db[lbn]));
290 }
291 *frags = sblock.fs_frag;
292
293 for (i = 0, tmpval = NINDIR(&sblock), cur = UFS_NDADDR; i < UFS_NIADDR;
294 i++, tmpval *= NINDIR(&sblock), cur = next) {
295 next = cur + tmpval;
296 if (lbn == -cur - i)
297 return (DIP(dp, di_ib[i]));
298 /*
299 * Determine whether the lbn in question is within this tree.
300 */
301 if (lbn < 0 && -lbn >= next)
302 continue;
303 if (lbn > 0 && lbn >= next)
304 continue;
305 if (DIP(dp, di_ib[i]) == 0)
306 return (0);
307 return (indir_blkatoff(DIP(dp, di_ib[i]), ino, -cur - i, lbn,
308 bpp));
309 }
310 pfatal("lbn %jd not in ino %ju\n", lbn, (uintmax_t)ino);
311 return (0);
312 }
313
314 /*
315 * Fetch an indirect block to find the block at a given lbn. The lbn
316 * may be negative to fetch a specific indirect block pointer or positive
317 * to fetch a specific block.
318 */
319 static ufs2_daddr_t
indir_blkatoff(ufs2_daddr_t blk,ino_t ino,ufs_lbn_t cur,ufs_lbn_t lbn,struct bufarea ** bpp)320 indir_blkatoff(ufs2_daddr_t blk, ino_t ino, ufs_lbn_t cur, ufs_lbn_t lbn,
321 struct bufarea **bpp)
322 {
323 struct bufarea *bp;
324 ufs_lbn_t lbnadd;
325 ufs_lbn_t base;
326 int i, level;
327
328 level = lbn_level(cur);
329 if (level == -1)
330 pfatal("Invalid indir lbn %jd in ino %ju\n",
331 lbn, (uintmax_t)ino);
332 if (level == 0 && lbn < 0)
333 pfatal("Invalid lbn %jd in ino %ju\n",
334 lbn, (uintmax_t)ino);
335 lbnadd = 1;
336 base = -(cur + level);
337 for (i = level; i > 0; i--)
338 lbnadd *= NINDIR(&sblock);
339 if (lbn > 0)
340 i = (lbn - base) / lbnadd;
341 else
342 i = (-lbn - base) / lbnadd;
343 if (i < 0 || i >= NINDIR(&sblock)) {
344 pfatal("Invalid indirect index %d produced by lbn %jd "
345 "in ino %ju\n", i, lbn, (uintmax_t)ino);
346 return (0);
347 }
348 if (level == 0)
349 cur = base + (i * lbnadd);
350 else
351 cur = -(base + (i * lbnadd)) - (level - 1);
352 bp = getdatablk(blk, sblock.fs_bsize, BT_LEVEL1 + level);
353 if (bp->b_errs != 0)
354 return (0);
355 blk = IBLK(bp, i);
356 bp->b_index = i;
357 if (cur == lbn || blk == 0) {
358 if (bpp != NULL)
359 *bpp = bp;
360 else
361 brelse(bp);
362 return (blk);
363 }
364 brelse(bp);
365 if (level == 0)
366 pfatal("Invalid lbn %jd at level 0 for ino %ju\n", lbn,
367 (uintmax_t)ino);
368 return (indir_blkatoff(blk, ino, cur, lbn, bpp));
369 }
370
371 /*
372 * Check that a block in a legal block number.
373 * Return 0 if in range, 1 if out of range.
374 */
375 int
chkrange(ufs2_daddr_t blk,int cnt)376 chkrange(ufs2_daddr_t blk, int cnt)
377 {
378 int c;
379
380 if (cnt <= 0 || blk <= 0 || blk > maxfsblock ||
381 cnt - 1 > maxfsblock - blk)
382 return (1);
383 if (cnt > sblock.fs_frag ||
384 fragnum(&sblock, blk) + cnt > sblock.fs_frag) {
385 if (debug)
386 printf("bad size: blk %ld, offset %i, size %d\n",
387 (long)blk, (int)fragnum(&sblock, blk), cnt);
388 return (1);
389 }
390 c = dtog(&sblock, blk);
391 if (blk < cgdmin(&sblock, c)) {
392 if ((blk + cnt) > cgsblock(&sblock, c)) {
393 if (debug) {
394 printf("blk %ld < cgdmin %ld;",
395 (long)blk, (long)cgdmin(&sblock, c));
396 printf(" blk + cnt %ld > cgsbase %ld\n",
397 (long)(blk + cnt),
398 (long)cgsblock(&sblock, c));
399 }
400 return (1);
401 }
402 } else {
403 if ((blk + cnt) > cgbase(&sblock, c+1)) {
404 if (debug) {
405 printf("blk %ld >= cgdmin %ld;",
406 (long)blk, (long)cgdmin(&sblock, c));
407 printf(" blk + cnt %ld > sblock.fs_fpg %ld\n",
408 (long)(blk + cnt), (long)sblock.fs_fpg);
409 }
410 return (1);
411 }
412 }
413 return (0);
414 }
415
416 /*
417 * General purpose interface for reading inodes.
418 */
419 void
ginode(ino_t inumber,struct inode * ip)420 ginode(ino_t inumber, struct inode *ip)
421 {
422 ufs2_daddr_t iblk;
423
424 if (inumber < UFS_ROOTINO || inumber > maxino)
425 errx(EEXIT, "bad inode number %ju to ginode",
426 (uintmax_t)inumber);
427 ip->i_number = inumber;
428 if (icachebp != NULL &&
429 inumber >= icachebp->b_index &&
430 inumber < icachebp->b_index + INOPB(&sblock)) {
431 /* take an additional reference for the returned inode */
432 icachebp->b_refcnt++;
433 } else {
434 iblk = ino_to_fsba(&sblock, inumber);
435 /* release our cache-hold reference on old icachebp */
436 if (icachebp != NULL)
437 brelse(icachebp);
438 icachebp = getdatablk(iblk, sblock.fs_bsize, BT_INODES);
439 if (icachebp->b_errs != 0) {
440 icachebp = NULL;
441 ip->i_bp = NULL;
442 ip->i_dp = &zino;
443 return;
444 }
445 /* take a cache-hold reference on new icachebp */
446 icachebp->b_refcnt++;
447 icachebp->b_index = rounddown(inumber, INOPB(&sblock));
448 }
449 ip->i_bp = icachebp;
450 if (sblock.fs_magic == FS_UFS1_MAGIC) {
451 ip->i_dp = (union dinode *)
452 &icachebp->b_un.b_dinode1[inumber % INOPB(&sblock)];
453 return;
454 }
455 ip->i_dp = (union dinode *)
456 &icachebp->b_un.b_dinode2[inumber % INOPB(&sblock)];
457 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)ip->i_dp)) {
458 pwarn("INODE CHECK-HASH FAILED");
459 prtinode(ip);
460 if (preen || reply("FIX") != 0) {
461 if (preen)
462 printf(" (FIXED)\n");
463 ffs_update_dinode_ckhash(&sblock,
464 (struct ufs2_dinode *)ip->i_dp);
465 inodirty(ip);
466 }
467 }
468 }
469
470 /*
471 * Release a held inode.
472 */
473 void
irelse(struct inode * ip)474 irelse(struct inode *ip)
475 {
476
477 if (ip->i_bp->b_refcnt <= 0)
478 pfatal("irelse: releasing unreferenced ino %ju\n",
479 (uintmax_t) ip->i_number);
480 brelse(ip->i_bp);
481 }
482
483 /*
484 * Special purpose version of ginode used to optimize first pass
485 * over all the inodes in numerical order.
486 */
487 static ino_t nextino, lastinum, lastvalidinum;
488 static long readcount, readpercg, fullcnt, inobufsize, partialcnt, partialsize;
489 static struct bufarea inobuf;
490
491 union dinode *
getnextinode(ino_t inumber,int rebuildcg)492 getnextinode(ino_t inumber, int rebuildcg)
493 {
494 int j;
495 long size;
496 mode_t mode;
497 ufs2_daddr_t ndb, blk;
498 union dinode *dp;
499 struct inode ip;
500 static caddr_t nextinop;
501
502 if (inumber != nextino++ || inumber > lastvalidinum)
503 errx(EEXIT, "bad inode number %ju to nextinode",
504 (uintmax_t)inumber);
505 if (inumber >= lastinum) {
506 readcount++;
507 blk = ino_to_fsba(&sblock, lastinum);
508 if (readcount % readpercg == 0) {
509 size = partialsize;
510 lastinum += partialcnt;
511 } else {
512 size = inobufsize;
513 lastinum += fullcnt;
514 }
515 /*
516 * Flush old contents in case they have been updated.
517 * If getblk encounters an error, it will already have zeroed
518 * out the buffer, so we do not need to do so here.
519 */
520 flush(fswritefd, &inobuf);
521 getblk(&inobuf, blk, size);
522 nextinop = inobuf.b_un.b_buf;
523 }
524 dp = (union dinode *)nextinop;
525 if (sblock.fs_magic == FS_UFS1_MAGIC)
526 nextinop += sizeof(struct ufs1_dinode);
527 else
528 nextinop += sizeof(struct ufs2_dinode);
529 if ((ckhashadd & CK_INODE) != 0) {
530 ffs_update_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp);
531 dirty(&inobuf);
532 }
533 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp) != 0) {
534 pwarn("INODE CHECK-HASH FAILED");
535 ip.i_bp = NULL;
536 ip.i_dp = dp;
537 ip.i_number = inumber;
538 prtinode(&ip);
539 if (preen || reply("FIX") != 0) {
540 if (preen)
541 printf(" (FIXED)\n");
542 ffs_update_dinode_ckhash(&sblock,
543 (struct ufs2_dinode *)dp);
544 dirty(&inobuf);
545 }
546 }
547 if (rebuildcg && (char *)dp == inobuf.b_un.b_buf) {
548 /*
549 * Try to determine if we have reached the end of the
550 * allocated inodes.
551 */
552 mode = DIP(dp, di_mode) & IFMT;
553 if (mode == 0) {
554 if (memcmp(dp->dp2.di_db, zino.dp2.di_db,
555 UFS_NDADDR * sizeof(ufs2_daddr_t)) ||
556 memcmp(dp->dp2.di_ib, zino.dp2.di_ib,
557 UFS_NIADDR * sizeof(ufs2_daddr_t)) ||
558 dp->dp2.di_mode || dp->dp2.di_size)
559 return (NULL);
560 return (dp);
561 }
562 if (!ftypeok(dp))
563 return (NULL);
564 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
565 if (ndb < 0)
566 return (NULL);
567 if (mode == IFBLK || mode == IFCHR)
568 ndb++;
569 if (mode == IFLNK) {
570 /*
571 * Fake ndb value so direct/indirect block checks below
572 * will detect any garbage after symlink string.
573 */
574 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
575 ndb = howmany(DIP(dp, di_size),
576 sizeof(ufs2_daddr_t));
577 if (ndb > UFS_NDADDR) {
578 j = ndb - UFS_NDADDR;
579 for (ndb = 1; j > 1; j--)
580 ndb *= NINDIR(&sblock);
581 ndb += UFS_NDADDR;
582 }
583 }
584 }
585 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++)
586 if (DIP(dp, di_db[j]) != 0)
587 return (NULL);
588 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++)
589 ndb /= NINDIR(&sblock);
590 for (; j < UFS_NIADDR; j++)
591 if (DIP(dp, di_ib[j]) != 0)
592 return (NULL);
593 }
594 return (dp);
595 }
596
597 void
setinodebuf(int cg,ino_t inosused)598 setinodebuf(int cg, ino_t inosused)
599 {
600 ino_t inum;
601
602 inum = cg * sblock.fs_ipg;
603 lastvalidinum = inum + inosused - 1;
604 nextino = inum;
605 lastinum = inum;
606 readcount = 0;
607 /* Flush old contents in case they have been updated */
608 flush(fswritefd, &inobuf);
609 inobuf.b_bno = 0;
610 if (inobuf.b_un.b_buf == NULL) {
611 inobufsize = blkroundup(&sblock,
612 MAX(INOBUFSIZE, sblock.fs_bsize));
613 initbarea(&inobuf, BT_INODES);
614 if ((inobuf.b_un.b_buf = Malloc((unsigned)inobufsize)) == NULL)
615 errx(EEXIT, "cannot allocate space for inode buffer");
616 }
617 fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ?
618 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode));
619 readpercg = inosused / fullcnt;
620 partialcnt = inosused % fullcnt;
621 partialsize = fragroundup(&sblock,
622 partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ?
623 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)));
624 if (partialcnt != 0) {
625 readpercg++;
626 } else {
627 partialcnt = fullcnt;
628 partialsize = inobufsize;
629 }
630 }
631
632 int
freeblock(struct inodesc * idesc)633 freeblock(struct inodesc *idesc)
634 {
635 struct dups *dlp;
636 ufs2_daddr_t blkno;
637 long nfrags, res;
638
639 res = KEEPON;
640 blkno = idesc->id_blkno;
641 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
642 if (chkrange(blkno, 1)) {
643 res = SKIP;
644 } else if (testbmap(blkno)) {
645 for (dlp = duplist; dlp; dlp = dlp->next) {
646 if (dlp->dup != blkno)
647 continue;
648 dlp->dup = duplist->dup;
649 dlp = duplist;
650 duplist = duplist->next;
651 free((char *)dlp);
652 break;
653 }
654 if (dlp == NULL) {
655 clrbmap(blkno);
656 n_blks--;
657 }
658 }
659 }
660 return (res);
661 }
662
663 void
freeinodebuf(void)664 freeinodebuf(void)
665 {
666
667 /*
668 * Flush old contents in case they have been updated.
669 */
670 flush(fswritefd, &inobuf);
671 if (inobuf.b_un.b_buf != NULL)
672 free((char *)inobuf.b_un.b_buf);
673 inobuf.b_un.b_buf = NULL;
674 }
675
676 /*
677 * Routines to maintain information about directory inodes.
678 * This is built during the first pass and used during the
679 * second and third passes.
680 *
681 * Enter inodes into the cache.
682 */
683 void
cacheino(union dinode * dp,ino_t inumber)684 cacheino(union dinode *dp, ino_t inumber)
685 {
686 struct inoinfo *inp, **inpp;
687 int i, blks;
688
689 if (howmany(DIP(dp, di_size), sblock.fs_bsize) > UFS_NDADDR)
690 blks = UFS_NDADDR + UFS_NIADDR;
691 else if (DIP(dp, di_size) > 0)
692 blks = howmany(DIP(dp, di_size), sblock.fs_bsize);
693 else
694 blks = 1;
695 inp = (struct inoinfo *)
696 Malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t));
697 if (inp == NULL)
698 errx(EEXIT, "cannot increase directory list");
699 inpp = &inphead[inumber % dirhash];
700 inp->i_nexthash = *inpp;
701 *inpp = inp;
702 inp->i_parent = inumber == UFS_ROOTINO ? UFS_ROOTINO : (ino_t)0;
703 inp->i_dotdot = (ino_t)0;
704 inp->i_number = inumber;
705 inp->i_isize = DIP(dp, di_size);
706 inp->i_numblks = blks;
707 for (i = 0; i < MIN(blks, UFS_NDADDR); i++)
708 inp->i_blks[i] = DIP(dp, di_db[i]);
709 if (blks > UFS_NDADDR)
710 for (i = 0; i < UFS_NIADDR; i++)
711 inp->i_blks[UFS_NDADDR + i] = DIP(dp, di_ib[i]);
712 if (inplast == listmax) {
713 listmax += 100;
714 inpsort = (struct inoinfo **)reallocarray((char *)inpsort,
715 listmax, sizeof(struct inoinfo *));
716 if (inpsort == NULL)
717 errx(EEXIT, "cannot increase directory list");
718 }
719 inpsort[inplast++] = inp;
720 }
721
722 /*
723 * Look up an inode cache structure.
724 */
725 struct inoinfo *
getinoinfo(ino_t inumber)726 getinoinfo(ino_t inumber)
727 {
728 struct inoinfo *inp;
729
730 for (inp = inphead[inumber % dirhash]; inp; inp = inp->i_nexthash) {
731 if (inp->i_number != inumber)
732 continue;
733 return (inp);
734 }
735 errx(EEXIT, "cannot find inode %ju", (uintmax_t)inumber);
736 return ((struct inoinfo *)0);
737 }
738
739 /*
740 * Clean up all the inode cache structure.
741 */
742 void
inocleanup(void)743 inocleanup(void)
744 {
745 struct inoinfo **inpp;
746
747 if (inphead == NULL)
748 return;
749 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
750 free((char *)(*inpp));
751 free((char *)inphead);
752 free((char *)inpsort);
753 inphead = inpsort = NULL;
754 }
755
756 void
inodirty(struct inode * ip)757 inodirty(struct inode *ip)
758 {
759
760 if (sblock.fs_magic == FS_UFS2_MAGIC)
761 ffs_update_dinode_ckhash(&sblock,
762 (struct ufs2_dinode *)ip->i_dp);
763 dirty(ip->i_bp);
764 }
765
766 void
clri(struct inodesc * idesc,const char * type,int flag)767 clri(struct inodesc *idesc, const char *type, int flag)
768 {
769 union dinode *dp;
770 struct inode ip;
771
772 ginode(idesc->id_number, &ip);
773 dp = ip.i_dp;
774 if (flag == 1) {
775 pwarn("%s %s", type,
776 (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE");
777 prtinode(&ip);
778 printf("\n");
779 }
780 if (preen || reply("CLEAR") == 1) {
781 if (preen)
782 printf(" (CLEARED)\n");
783 n_files--;
784 if (bkgrdflag == 0) {
785 (void)ckinode(dp, idesc);
786 inoinfo(idesc->id_number)->ino_state = USTATE;
787 clearinode(dp);
788 inodirty(&ip);
789 } else {
790 cmd.value = idesc->id_number;
791 cmd.size = -DIP(dp, di_nlink);
792 if (debug)
793 printf("adjrefcnt ino %ld amt %lld\n",
794 (long)cmd.value, (long long)cmd.size);
795 if (sysctl(adjrefcnt, MIBSIZE, 0, 0,
796 &cmd, sizeof cmd) == -1)
797 rwerror("ADJUST INODE", cmd.value);
798 }
799 }
800 irelse(&ip);
801 }
802
803 int
findname(struct inodesc * idesc)804 findname(struct inodesc *idesc)
805 {
806 struct direct *dirp = idesc->id_dirp;
807
808 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
809 idesc->id_entryno++;
810 return (KEEPON);
811 }
812 memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1);
813 return (STOP|FOUND);
814 }
815
816 int
findino(struct inodesc * idesc)817 findino(struct inodesc *idesc)
818 {
819 struct direct *dirp = idesc->id_dirp;
820
821 if (dirp->d_ino == 0)
822 return (KEEPON);
823 if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
824 dirp->d_ino >= UFS_ROOTINO && dirp->d_ino <= maxino) {
825 idesc->id_parent = dirp->d_ino;
826 return (STOP|FOUND);
827 }
828 return (KEEPON);
829 }
830
831 int
clearentry(struct inodesc * idesc)832 clearentry(struct inodesc *idesc)
833 {
834 struct direct *dirp = idesc->id_dirp;
835
836 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
837 idesc->id_entryno++;
838 return (KEEPON);
839 }
840 dirp->d_ino = 0;
841 return (STOP|FOUND|ALTERED);
842 }
843
844 void
prtinode(struct inode * ip)845 prtinode(struct inode *ip)
846 {
847 char *p;
848 union dinode *dp;
849 struct passwd *pw;
850 time_t t;
851
852 dp = ip->i_dp;
853 printf(" I=%lu ", (u_long)ip->i_number);
854 if (ip->i_number < UFS_ROOTINO || ip->i_number > maxino)
855 return;
856 printf(" OWNER=");
857 if ((pw = getpwuid((int)DIP(dp, di_uid))) != NULL)
858 printf("%s ", pw->pw_name);
859 else
860 printf("%u ", (unsigned)DIP(dp, di_uid));
861 printf("MODE=%o\n", DIP(dp, di_mode));
862 if (preen)
863 printf("%s: ", cdevname);
864 printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size));
865 t = DIP(dp, di_mtime);
866 p = ctime(&t);
867 printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
868 }
869
870 void
blkerror(ino_t ino,const char * type,ufs2_daddr_t blk)871 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk)
872 {
873
874 pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino);
875 printf("\n");
876 switch (inoinfo(ino)->ino_state) {
877
878 case FSTATE:
879 case FZLINK:
880 inoinfo(ino)->ino_state = FCLEAR;
881 return;
882
883 case DSTATE:
884 case DZLINK:
885 inoinfo(ino)->ino_state = DCLEAR;
886 return;
887
888 case FCLEAR:
889 case DCLEAR:
890 return;
891
892 default:
893 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state);
894 /* NOTREACHED */
895 }
896 }
897
898 /*
899 * allocate an unused inode
900 */
901 ino_t
allocino(ino_t request,int type)902 allocino(ino_t request, int type)
903 {
904 ino_t ino;
905 struct inode ip;
906 union dinode *dp;
907 struct bufarea *cgbp;
908 struct cg *cgp;
909 int cg, anyino;
910
911 anyino = 0;
912 if (request == 0) {
913 request = UFS_ROOTINO;
914 anyino = 1;
915 } else if (inoinfo(request)->ino_state != USTATE)
916 return (0);
917 retry:
918 for (ino = request; ino < maxino; ino++)
919 if (inoinfo(ino)->ino_state == USTATE)
920 break;
921 if (ino >= maxino)
922 return (0);
923 cg = ino_to_cg(&sblock, ino);
924 cgbp = cglookup(cg);
925 cgp = cgbp->b_un.b_cg;
926 if (!check_cgmagic(cg, cgbp, 0)) {
927 if (anyino == 0)
928 return (0);
929 request = (cg + 1) * sblock.fs_ipg;
930 goto retry;
931 }
932 setbit(cg_inosused(cgp), ino % sblock.fs_ipg);
933 cgp->cg_cs.cs_nifree--;
934 switch (type & IFMT) {
935 case IFDIR:
936 inoinfo(ino)->ino_state = DSTATE;
937 cgp->cg_cs.cs_ndir++;
938 break;
939 case IFREG:
940 case IFLNK:
941 inoinfo(ino)->ino_state = FSTATE;
942 break;
943 default:
944 return (0);
945 }
946 cgdirty(cgbp);
947 ginode(ino, &ip);
948 dp = ip.i_dp;
949 DIP_SET(dp, di_db[0], allocblk((long)1));
950 if (DIP(dp, di_db[0]) == 0) {
951 inoinfo(ino)->ino_state = USTATE;
952 irelse(&ip);
953 return (0);
954 }
955 DIP_SET(dp, di_mode, type);
956 DIP_SET(dp, di_flags, 0);
957 DIP_SET(dp, di_atime, time(NULL));
958 DIP_SET(dp, di_ctime, DIP(dp, di_atime));
959 DIP_SET(dp, di_mtime, DIP(dp, di_ctime));
960 DIP_SET(dp, di_mtimensec, 0);
961 DIP_SET(dp, di_ctimensec, 0);
962 DIP_SET(dp, di_atimensec, 0);
963 DIP_SET(dp, di_size, sblock.fs_fsize);
964 DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize));
965 n_files++;
966 inodirty(&ip);
967 irelse(&ip);
968 inoinfo(ino)->ino_type = IFTODT(type);
969 return (ino);
970 }
971
972 /*
973 * deallocate an inode
974 */
975 void
freeino(ino_t ino)976 freeino(ino_t ino)
977 {
978 struct inodesc idesc;
979 union dinode *dp;
980 struct inode ip;
981
982 memset(&idesc, 0, sizeof(struct inodesc));
983 idesc.id_type = inoinfo(ino)->ino_idtype;
984 idesc.id_func = freeblock;
985 idesc.id_number = ino;
986 ginode(ino, &ip);
987 dp = ip.i_dp;
988 (void)ckinode(dp, &idesc);
989 clearinode(dp);
990 inodirty(&ip);
991 irelse(&ip);
992 inoinfo(ino)->ino_state = USTATE;
993 n_files--;
994 }
995