2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1980, 1986, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
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.
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
34 static const char sccsid[] = "@(#)inode.c 8.8 (Berkeley) 4/28/95";
37 #include <sys/cdefs.h>
38 __FBSDID("$FreeBSD$");
40 #include <sys/param.h>
42 #include <sys/stdint.h>
43 #include <sys/sysctl.h>
45 #include <ufs/ufs/dinode.h>
46 #include <ufs/ufs/dir.h>
47 #include <ufs/ffs/fs.h>
57 struct bufarea *icachebp; /* inode cache buffer */
59 static int iblock(struct inodesc *, off_t isize, int type);
60 static ufs2_daddr_t indir_blkatoff(ufs2_daddr_t, ino_t, ufs_lbn_t, ufs_lbn_t,
62 static int snapclean(struct inodesc *idesc);
63 static void chkcopyonwrite(struct fs *, ufs2_daddr_t,
64 ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t, long));
67 ckinode(union dinode *dp, struct inodesc *idesc)
69 off_t remsize, sizepb;
75 char pathbuf[MAXPATHLEN + 1];
77 if (idesc->id_fix != IGNORE)
78 idesc->id_fix = DONTKNOW;
81 idesc->id_lballoc = -1;
83 idesc->id_entryno = 0;
84 idesc->id_filesize = DIP(dp, di_size);
85 mode = DIP(dp, di_mode) & IFMT;
86 if (mode == IFBLK || mode == IFCHR || (mode == IFLNK &&
87 DIP(dp, di_size) < (unsigned)sblock.fs_maxsymlinklen))
89 if (sblock.fs_magic == FS_UFS1_MAGIC)
93 ndb = howmany(DIP(&dino, di_size), sblock.fs_bsize);
94 for (i = 0; i < UFS_NDADDR; i++) {
97 (offset = blkoff(&sblock, DIP(&dino, di_size))) != 0)
99 numfrags(&sblock, fragroundup(&sblock, offset));
101 idesc->id_numfrags = sblock.fs_frag;
102 if (DIP(&dino, di_db[i]) == 0) {
103 if (idesc->id_type == DATA && ndb >= 0) {
104 /* An empty block in a directory XXX */
105 getpathname(pathbuf, idesc->id_number,
107 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
109 if (reply("ADJUST LENGTH") == 1) {
110 ginode(idesc->id_number, &ip);
111 DIP_SET(ip.i_dp, di_size,
112 i * sblock.fs_bsize);
114 "YOU MUST RERUN FSCK AFTERWARDS\n");
122 idesc->id_blkno = DIP(&dino, di_db[i]);
123 if (idesc->id_type != DATA)
124 ret = (*idesc->id_func)(idesc);
126 ret = dirscan(idesc);
130 idesc->id_numfrags = sblock.fs_frag;
131 remsize = DIP(&dino, di_size) - sblock.fs_bsize * UFS_NDADDR;
132 sizepb = sblock.fs_bsize;
133 for (i = 0; i < UFS_NIADDR; i++) {
134 sizepb *= NINDIR(&sblock);
135 idesc->id_level = i + 1;
136 if (DIP(&dino, di_ib[i])) {
137 idesc->id_blkno = DIP(&dino, di_ib[i]);
138 ret = iblock(idesc, remsize, BT_LEVEL1 + i);
141 } else if (remsize > 0) {
142 idesc->id_lbn += sizepb / sblock.fs_bsize;
143 if (idesc->id_type == DATA) {
144 /* An empty block in a directory XXX */
145 getpathname(pathbuf, idesc->id_number,
147 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
149 if (reply("ADJUST LENGTH") == 1) {
150 ginode(idesc->id_number, &ip);
151 DIP_SET(ip.i_dp, di_size,
152 DIP(ip.i_dp, di_size) - remsize);
155 "YOU MUST RERUN FSCK AFTERWARDS\n");
169 iblock(struct inodesc *idesc, off_t isize, int type)
173 int i, n, (*func)(struct inodesc *), nif;
176 char pathbuf[MAXPATHLEN + 1];
178 if (idesc->id_type != DATA) {
179 func = idesc->id_func;
180 if (((n = (*func)(idesc)) & KEEPON) == 0)
184 bp = getdatablk(idesc->id_blkno, sblock.fs_bsize, type);
185 if (bp->b_errs != 0) {
191 for (sizepb = sblock.fs_bsize, i = 0; i < idesc->id_level; i++)
192 sizepb *= NINDIR(&sblock);
193 if (howmany(isize, sizepb) > NINDIR(&sblock))
194 nif = NINDIR(&sblock);
196 nif = howmany(isize, sizepb);
197 if (idesc->id_func == pass1check && nif < NINDIR(&sblock)) {
198 for (i = nif; i < NINDIR(&sblock); i++) {
199 if (IBLK(bp, i) == 0)
201 (void)sprintf(buf, "PARTIALLY TRUNCATED INODE I=%lu",
202 (u_long)idesc->id_number);
205 } else if (dofix(idesc, buf)) {
210 flush(fswritefd, bp);
212 for (i = 0; i < nif; i++) {
214 idesc->id_blkno = IBLK(bp, i);
216 if (idesc->id_level == 0) {
220 n = iblock(idesc, isize, type - 1);
228 idesc->id_lbn += sizepb / sblock.fs_bsize;
229 if (idesc->id_type == DATA && isize > 0) {
230 /* An empty block in a directory XXX */
231 getpathname(pathbuf, idesc->id_number,
233 pfatal("DIRECTORY %s: CONTAINS EMPTY BLOCKS",
235 if (reply("ADJUST LENGTH") == 1) {
236 ginode(idesc->id_number, &ip);
237 DIP_SET(ip.i_dp, di_size,
238 DIP(ip.i_dp, di_size) - isize);
241 "YOU MUST RERUN FSCK AFTERWARDS\n");
256 * Finds the disk block address at the specified lbn within the inode
257 * specified by dp. This follows the whole tree and honors di_size and
258 * di_extsize so it is a true test of reachability. The lbn may be
259 * negative if an extattr or indirect block is requested.
262 ino_blkatoff(union dinode *dp, ino_t ino, ufs_lbn_t lbn, int *frags,
263 struct bufarea **bpp)
274 * Handle extattr blocks first.
276 if (lbn < 0 && lbn >= -UFS_NXADDR) {
278 if (lbn > lblkno(&sblock, dp->dp2.di_extsize - 1))
280 *frags = numfrags(&sblock,
281 sblksize(&sblock, dp->dp2.di_extsize, lbn));
282 return (dp->dp2.di_extb[lbn]);
285 * Now direct and indirect.
287 if (DIP(dp, di_mode) == IFLNK &&
288 DIP(dp, di_size) < sblock.fs_maxsymlinklen)
290 if (lbn >= 0 && lbn < UFS_NDADDR) {
291 *frags = numfrags(&sblock,
292 sblksize(&sblock, DIP(dp, di_size), lbn));
293 return (DIP(dp, di_db[lbn]));
295 *frags = sblock.fs_frag;
297 for (i = 0, tmpval = NINDIR(&sblock), cur = UFS_NDADDR; i < UFS_NIADDR;
298 i++, tmpval *= NINDIR(&sblock), cur = next) {
301 return (DIP(dp, di_ib[i]));
303 * Determine whether the lbn in question is within this tree.
305 if (lbn < 0 && -lbn >= next)
307 if (lbn > 0 && lbn >= next)
309 if (DIP(dp, di_ib[i]) == 0)
311 return (indir_blkatoff(DIP(dp, di_ib[i]), ino, -cur - i, lbn,
314 pfatal("lbn %jd not in ino %ju\n", lbn, (uintmax_t)ino);
319 * Fetch an indirect block to find the block at a given lbn. The lbn
320 * may be negative to fetch a specific indirect block pointer or positive
321 * to fetch a specific block.
324 indir_blkatoff(ufs2_daddr_t blk, ino_t ino, ufs_lbn_t cur, ufs_lbn_t lbn,
325 struct bufarea **bpp)
332 level = lbn_level(cur);
334 pfatal("Invalid indir lbn %jd in ino %ju\n",
335 lbn, (uintmax_t)ino);
336 if (level == 0 && lbn < 0)
337 pfatal("Invalid lbn %jd in ino %ju\n",
338 lbn, (uintmax_t)ino);
340 base = -(cur + level);
341 for (i = level; i > 0; i--)
342 lbnadd *= NINDIR(&sblock);
344 i = (lbn - base) / lbnadd;
346 i = (-lbn - base) / lbnadd;
347 if (i < 0 || i >= NINDIR(&sblock)) {
348 pfatal("Invalid indirect index %d produced by lbn %jd "
349 "in ino %ju\n", i, lbn, (uintmax_t)ino);
353 cur = base + (i * lbnadd);
355 cur = -(base + (i * lbnadd)) - (level - 1);
356 bp = getdatablk(blk, sblock.fs_bsize, BT_LEVEL1 + level);
361 if (cur == lbn || blk == 0) {
370 pfatal("Invalid lbn %jd at level 0 for ino %ju\n", lbn,
372 return (indir_blkatoff(blk, ino, cur, lbn, bpp));
376 * Check that a block in a legal block number.
377 * Return 0 if in range, 1 if out of range.
380 chkrange(ufs2_daddr_t blk, int cnt)
384 if (cnt <= 0 || blk <= 0 || blk > maxfsblock ||
385 cnt - 1 > maxfsblock - blk) {
387 printf("out of range: blk %ld, offset %i, size %d\n",
388 (long)blk, (int)fragnum(&sblock, blk), cnt);
391 if (cnt > sblock.fs_frag ||
392 fragnum(&sblock, blk) + cnt > sblock.fs_frag) {
394 printf("bad size: blk %ld, offset %i, size %d\n",
395 (long)blk, (int)fragnum(&sblock, blk), cnt);
398 c = dtog(&sblock, blk);
399 if (blk < cgdmin(&sblock, c)) {
400 if ((blk + cnt) > cgsblock(&sblock, c)) {
402 printf("blk %ld < cgdmin %ld;",
403 (long)blk, (long)cgdmin(&sblock, c));
404 printf(" blk + cnt %ld > cgsbase %ld\n",
406 (long)cgsblock(&sblock, c));
411 if ((blk + cnt) > cgbase(&sblock, c+1)) {
413 printf("blk %ld >= cgdmin %ld;",
414 (long)blk, (long)cgdmin(&sblock, c));
415 printf(" blk + cnt %ld > sblock.fs_fpg %ld\n",
416 (long)(blk + cnt), (long)sblock.fs_fpg);
425 * General purpose interface for reading inodes.
427 * firstinum and lastinum track contents of getnextino() cache (below).
429 static ino_t firstinum, lastinum;
430 static struct bufarea inobuf;
433 ginode(ino_t inumber, struct inode *ip)
437 if (inumber < UFS_ROOTINO || inumber > maxino)
438 errx(EEXIT, "bad inode number %ju to ginode",
440 ip->i_number = inumber;
441 if (inumber >= firstinum && inumber < lastinum) {
442 /* contents in getnextino() cache */
445 inobuf.b_index = firstinum;
446 } else if (icachebp != NULL &&
447 inumber >= icachebp->b_index &&
448 inumber < icachebp->b_index + INOPB(&sblock)) {
449 /* take an additional reference for the returned inode */
450 icachebp->b_refcnt++;
453 iblk = ino_to_fsba(&sblock, inumber);
454 /* release our cache-hold reference on old icachebp */
455 if (icachebp != NULL)
457 icachebp = getdatablk(iblk, sblock.fs_bsize, BT_INODES);
458 if (icachebp->b_errs != 0) {
464 /* take a cache-hold reference on new icachebp */
465 icachebp->b_refcnt++;
466 icachebp->b_index = rounddown(inumber, INOPB(&sblock));
469 if (sblock.fs_magic == FS_UFS1_MAGIC) {
470 ip->i_dp = (union dinode *)
471 &ip->i_bp->b_un.b_dinode1[inumber - ip->i_bp->b_index];
474 ip->i_dp = (union dinode *)
475 &ip->i_bp->b_un.b_dinode2[inumber - ip->i_bp->b_index];
476 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)ip->i_dp)) {
477 pwarn("INODE CHECK-HASH FAILED");
479 if (preen || reply("FIX") != 0) {
481 printf(" (FIXED)\n");
482 ffs_update_dinode_ckhash(&sblock,
483 (struct ufs2_dinode *)ip->i_dp);
490 * Release a held inode.
493 irelse(struct inode *ip)
496 /* Check for failed inode read */
497 if (ip->i_bp == NULL)
499 if (ip->i_bp->b_refcnt <= 0)
500 pfatal("irelse: releasing unreferenced ino %ju\n",
501 (uintmax_t) ip->i_number);
506 * Special purpose version of ginode used to optimize first pass
507 * over all the inodes in numerical order.
509 static ino_t nextinum, lastvalidinum;
510 static long readcount, readpercg, fullcnt, inobufsize, partialcnt, partialsize;
513 getnextinode(ino_t inumber, int rebuildcg)
518 ufs2_daddr_t ndb, blk;
521 static caddr_t nextinop;
523 if (inumber != nextinum++ || inumber > lastvalidinum)
524 errx(EEXIT, "bad inode number %ju to nextinode",
526 if (inumber >= lastinum) {
528 firstinum = lastinum;
529 blk = ino_to_fsba(&sblock, lastinum);
530 if (readcount % readpercg == 0) {
532 lastinum += partialcnt;
538 * Flush old contents in case they have been updated.
539 * If getblk encounters an error, it will already have zeroed
540 * out the buffer, so we do not need to do so here.
542 if (inobuf.b_refcnt != 0)
543 pfatal("Non-zero getnextinode() ref count %d\n",
545 flush(fswritefd, &inobuf);
546 getblk(&inobuf, blk, size);
547 nextinop = inobuf.b_un.b_buf;
549 dp = (union dinode *)nextinop;
550 if (sblock.fs_magic == FS_UFS1_MAGIC)
551 nextinop += sizeof(struct ufs1_dinode);
553 nextinop += sizeof(struct ufs2_dinode);
554 if ((ckhashadd & CK_INODE) != 0) {
555 ffs_update_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp);
558 if (ffs_verify_dinode_ckhash(&sblock, (struct ufs2_dinode *)dp) != 0) {
559 pwarn("INODE CHECK-HASH FAILED");
562 ip.i_number = inumber;
564 if (preen || reply("FIX") != 0) {
566 printf(" (FIXED)\n");
567 ffs_update_dinode_ckhash(&sblock,
568 (struct ufs2_dinode *)dp);
572 if (rebuildcg && (char *)dp == inobuf.b_un.b_buf) {
574 * Try to determine if we have reached the end of the
577 mode = DIP(dp, di_mode) & IFMT;
579 if (memcmp(dp->dp2.di_db, zino.dp2.di_db,
580 UFS_NDADDR * sizeof(ufs2_daddr_t)) ||
581 memcmp(dp->dp2.di_ib, zino.dp2.di_ib,
582 UFS_NIADDR * sizeof(ufs2_daddr_t)) ||
583 dp->dp2.di_mode || dp->dp2.di_size)
589 ndb = howmany(DIP(dp, di_size), sblock.fs_bsize);
592 if (mode == IFBLK || mode == IFCHR)
596 * Fake ndb value so direct/indirect block checks below
597 * will detect any garbage after symlink string.
599 if (DIP(dp, di_size) < (off_t)sblock.fs_maxsymlinklen) {
600 ndb = howmany(DIP(dp, di_size),
601 sizeof(ufs2_daddr_t));
602 if (ndb > UFS_NDADDR) {
603 j = ndb - UFS_NDADDR;
604 for (ndb = 1; j > 1; j--)
605 ndb *= NINDIR(&sblock);
610 for (j = ndb; ndb < UFS_NDADDR && j < UFS_NDADDR; j++)
611 if (DIP(dp, di_db[j]) != 0)
613 for (j = 0, ndb -= UFS_NDADDR; ndb > 0; j++)
614 ndb /= NINDIR(&sblock);
615 for (; j < UFS_NIADDR; j++)
616 if (DIP(dp, di_ib[j]) != 0)
623 setinodebuf(int cg, ino_t inosused)
627 inum = cg * sblock.fs_ipg;
628 lastvalidinum = inum + inosused - 1;
632 /* Flush old contents in case they have been updated */
633 flush(fswritefd, &inobuf);
635 if (inobuf.b_un.b_buf == NULL) {
636 inobufsize = blkroundup(&sblock,
637 MAX(INOBUFSIZE, sblock.fs_bsize));
638 initbarea(&inobuf, BT_INODES);
639 if ((inobuf.b_un.b_buf = Malloc((unsigned)inobufsize)) == NULL)
640 errx(EEXIT, "cannot allocate space for inode buffer");
642 fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ?
643 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode));
644 readpercg = inosused / fullcnt;
645 partialcnt = inosused % fullcnt;
646 partialsize = fragroundup(&sblock,
647 partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ?
648 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)));
649 if (partialcnt != 0) {
652 partialcnt = fullcnt;
653 partialsize = inobufsize;
658 freeblock(struct inodesc *idesc)
661 struct bufarea *cgbp;
666 blkno = idesc->id_blkno;
667 if (idesc->id_type == SNAP) {
668 pfatal("clearing a snapshot dinode\n");
671 size = lfragtosize(&sblock, idesc->id_numfrags);
672 if (snapblkfree(&sblock, blkno, size, idesc->id_number,
675 for (nfrags = idesc->id_numfrags; nfrags > 0; blkno++, nfrags--) {
676 if (chkrange(blkno, 1)) {
678 } else if (testbmap(blkno)) {
679 for (dlp = duplist; dlp; dlp = dlp->next) {
680 if (dlp->dup != blkno)
682 dlp->dup = duplist->dup;
684 duplist = duplist->next;
695 * If all successfully returned, account for them.
698 cgbp = cglookup(dtog(&sblock, idesc->id_blkno));
699 cgp = cgbp->b_un.b_cg;
700 if (idesc->id_numfrags == sblock.fs_frag)
701 cgp->cg_cs.cs_nbfree++;
703 cgp->cg_cs.cs_nffree += idesc->id_numfrags;
710 * Prepare a snapshot file for being removed.
713 snapremove(ino_t inum)
715 struct inodesc idesc;
719 for (i = 0; i < snapcnt; i++)
720 if (snaplist[i].i_number == inum)
726 if ((DIP(ip.i_dp, di_flags) & SF_SNAPSHOT) == 0) {
727 printf("snapremove: inode %jd is not a snapshot\n",
734 printf("snapremove: remove %sactive snapshot %jd\n",
735 i == snapcnt ? "in" : "", (intmax_t)inum);
737 * If on active snapshot list, remove it.
740 for (i++; i < FSMAXSNAP; i++) {
741 if (sblock.fs_snapinum[i] == 0)
743 snaplist[i - 1] = snaplist[i];
744 sblock.fs_snapinum[i - 1] = sblock.fs_snapinum[i];
746 sblock.fs_snapinum[i - 1] = 0;
747 bzero(&snaplist[i - 1], sizeof(struct inode));
750 idesc.id_type = SNAP;
751 idesc.id_func = snapclean;
752 idesc.id_number = inum;
753 (void)ckinode(ip.i_dp, &idesc);
754 DIP_SET(ip.i_dp, di_flags, DIP(ip.i_dp, di_flags) & ~SF_SNAPSHOT);
760 snapclean(struct inodesc *idesc)
766 blkno = idesc->id_blkno;
772 if (blkno == BLK_NOCOPY || blkno == BLK_SNAP) {
773 if (idesc->id_lbn < UFS_NDADDR)
774 DIP_SET(dp, di_db[idesc->id_lbn], 0);
776 IBLK_SET(bp, bp->b_index, 0);
783 * Notification that a block is being freed. Return zero if the free
784 * should be allowed to proceed. Return non-zero if the snapshot file
785 * wants to claim the block. The block will be claimed if it is an
786 * uncopied part of one of the snapshots. It will be freed if it is
787 * either a BLK_NOCOPY or has already been copied in all of the snapshots.
788 * If a fragment is being freed, then all snapshots that care about
789 * it must make a copy since a snapshot file can only claim full sized
790 * blocks. Note that if more than one snapshot file maps the block,
791 * we can pick one at random to claim it. Since none of the snapshots
792 * can change, we are assurred that they will all see the same unmodified
793 * image. When deleting a snapshot file (see ino_trunc above), we
794 * must push any of these claimed blocks to one of the other snapshots
795 * that maps it. These claimed blocks are easily identified as they will
796 * have a block number equal to their logical block number within the
797 * snapshot. A copied block can never have this property because they
798 * must always have been allocated from a BLK_NOCOPY location.
801 snapblkfree(struct fs *fs, ufs2_daddr_t bno, long size, ino_t inum,
802 ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t blkno, long frags))
806 struct bufarea *snapbp;
808 ufs2_daddr_t blkno, relblkno;
809 int i, frags, claimedblk, copydone;
811 /* If no snapshots, nothing to do */
815 printf("snapblkfree: in ino %jd free blkno %jd, size %jd\n",
816 (intmax_t)inum, (intmax_t)bno, (intmax_t)size);
817 relblkno = blknum(fs, bno);
818 lbn = fragstoblks(fs, relblkno);
819 /* Direct blocks are always pre-copied */
820 if (lbn < UFS_NDADDR)
824 for (i = 0; i < snapcnt; i++) {
826 * Lookup block being freed.
830 blkno = ino_blkatoff(dp, inum != 0 ? inum : ip.i_number,
831 lbn, &frags, &snapbp);
833 * Check to see if block needs to be copied.
837 * A block that we map is being freed. If it has not
838 * been claimed yet, we will claim or copy it (below).
841 } else if (blkno == BLK_SNAP) {
843 * No previous snapshot claimed the block,
844 * so it will be freed and become a BLK_NOCOPY
845 * (don't care) for us.
848 pfatal("snapblkfree: inconsistent block type");
849 IBLK_SET(snapbp, snapbp->b_index, BLK_NOCOPY);
853 } else /* BLK_NOCOPY or default */ {
855 * If the snapshot has already copied the block
856 * (default), or does not care about the block,
863 * If this is a full size block, we will just grab it
864 * and assign it to the snapshot inode. Otherwise we
865 * will proceed to copy it. See explanation for this
866 * routine as to why only a single snapshot needs to
869 if (size == fs->fs_bsize) {
871 printf("Grabonremove snapshot %ju lbn %jd "
872 "from inum %ju\n", (intmax_t)ip.i_number,
873 (intmax_t)lbn, (uintmax_t)inum);
874 IBLK_SET(snapbp, snapbp->b_index, relblkno);
877 DIP_SET(dp, di_blocks,
878 DIP(dp, di_blocks) + btodb(size));
883 /* First time through, read the contents of the old block. */
886 if (blread(fsreadfd, copybuf, fsbtodb(fs, relblkno),
887 fs->fs_bsize) != 0) {
888 pfatal("Could not read snapshot %ju block "
889 "%jd\n", (intmax_t)ip.i_number,
895 * This allocation will never require any additional
896 * allocations for the snapshot inode.
898 blkno = allocblk(dtog(fs, relblkno), fs->fs_frag,
901 pfatal("Could not allocate block for snapshot %ju\n",
902 (intmax_t)ip.i_number);
906 printf("Copyonremove: snapino %jd lbn %jd for inum %ju "
907 "size %ld new blkno %jd\n", (intmax_t)ip.i_number,
908 (intmax_t)lbn, (uintmax_t)inum, size,
910 blwrite(fswritefd, copybuf, fsbtodb(fs, blkno), fs->fs_bsize);
911 IBLK_SET(snapbp, snapbp->b_index, blkno);
914 DIP_SET(dp, di_blocks,
915 DIP(dp, di_blocks) + btodb(fs->fs_bsize));
922 * Notification that a block is being written. Return if the block
923 * is part of a snapshot as snapshots never track other snapshots.
924 * The block will be copied in all of the snapshots that are tracking
925 * it and have not yet copied it. Some buffers may hold more than one
926 * block. Here we need to check each block in the buffer.
929 copyonwrite(struct fs *fs, struct bufarea *bp,
930 ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t blkno, long frags))
932 ufs2_daddr_t copyblkno;
935 /* If no snapshots, nothing to do. */
938 numblks = blkroundup(fs, bp->b_size) / fs->fs_bsize;
940 prtbuf(bp, "copyonwrite: checking %jd block%s in buffer",
941 (intmax_t)numblks, numblks > 1 ? "s" : "");
942 copyblkno = blknum(fs, dbtofsb(fs, bp->b_bno));
943 for (i = 0; i < numblks; i++) {
944 chkcopyonwrite(fs, copyblkno, checkblkavail);
945 copyblkno += fs->fs_frag;
950 chkcopyonwrite(struct fs *fs, ufs2_daddr_t copyblkno,
951 ufs2_daddr_t (*checkblkavail)(ufs2_daddr_t blkno, long frags))
955 struct bufarea *snapbp;
957 int i, frags, copydone;
960 lbn = fragstoblks(fs, copyblkno);
961 /* Direct blocks are always pre-copied */
962 if (lbn < UFS_NDADDR)
965 for (i = 0; i < snapcnt; i++) {
967 * Lookup block being freed.
971 blkno = ino_blkatoff(dp, ip.i_number, lbn, &frags, &snapbp);
973 * Check to see if block needs to be copied.
977 * A block that we have already copied or don't track.
982 /* First time through, read the contents of the old block. */
985 if (blread(fsreadfd, copybuf, fsbtodb(fs, copyblkno),
986 fs->fs_bsize) != 0) {
987 pfatal("Could not read snapshot %ju block "
988 "%jd\n", (intmax_t)ip.i_number,
989 (intmax_t)copyblkno);
994 * This allocation will never require any additional
995 * allocations for the snapshot inode.
997 if ((blkno = allocblk(dtog(fs, copyblkno), fs->fs_frag,
998 checkblkavail)) == 0) {
999 pfatal("Could not allocate block for snapshot %ju\n",
1000 (intmax_t)ip.i_number);
1004 prtbuf(snapbp, "Copyonwrite: snapino %jd lbn %jd using "
1005 "blkno %ju setting in buffer",
1006 (intmax_t)ip.i_number, (intmax_t)lbn,
1008 blwrite(fswritefd, copybuf, fsbtodb(fs, blkno), fs->fs_bsize);
1009 IBLK_SET(snapbp, snapbp->b_index, blkno);
1012 DIP_SET(dp, di_blocks,
1013 DIP(dp, di_blocks) + btodb(fs->fs_bsize));
1020 * Traverse an inode and check that its block count is correct
1021 * fixing it if necessary.
1024 check_blkcnt(struct inode *ip)
1026 struct inodesc idesc;
1032 memset(&idesc, 0, sizeof(struct inodesc));
1033 idesc.id_func = pass1check;
1034 idesc.id_number = ip->i_number;
1035 idesc.id_type = (DIP(dp, di_flags) & SF_SNAPSHOT) == 0 ? ADDR : SNAP;
1036 (void)ckinode(dp, &idesc);
1037 if (sblock.fs_magic == FS_UFS2_MAGIC && dp->dp2.di_extsize > 0) {
1038 ndb = howmany(dp->dp2.di_extsize, sblock.fs_bsize);
1039 for (j = 0; j < UFS_NXADDR; j++) {
1041 (offset = blkoff(&sblock, dp->dp2.di_extsize)) != 0)
1042 idesc.id_numfrags = numfrags(&sblock,
1043 fragroundup(&sblock, offset));
1045 idesc.id_numfrags = sblock.fs_frag;
1046 if (dp->dp2.di_extb[j] == 0)
1048 idesc.id_blkno = dp->dp2.di_extb[j];
1049 ret = (*idesc.id_func)(&idesc);
1054 idesc.id_entryno *= btodb(sblock.fs_fsize);
1055 if (DIP(dp, di_blocks) != idesc.id_entryno) {
1056 if (!(sujrecovery && preen)) {
1057 pwarn("INCORRECT BLOCK COUNT I=%lu (%ju should be %ju)",
1058 (u_long)idesc.id_number,
1059 (uintmax_t)DIP(dp, di_blocks),
1060 (uintmax_t)idesc.id_entryno);
1062 printf(" (CORRECTED)\n");
1063 else if (reply("CORRECT") == 0)
1066 if (bkgrdflag == 0) {
1067 DIP_SET(dp, di_blocks, idesc.id_entryno);
1070 cmd.value = idesc.id_number;
1071 cmd.size = idesc.id_entryno - DIP(dp, di_blocks);
1073 printf("adjblkcnt ino %ju amount %lld\n",
1074 (uintmax_t)cmd.value, (long long)cmd.size);
1075 if (sysctl(adjblkcnt, MIBSIZE, 0, 0,
1076 &cmd, sizeof cmd) == -1)
1077 rwerror("ADJUST INODE BLOCK COUNT", cmd.value);
1089 * Flush old contents in case they have been updated.
1091 flush(fswritefd, &inobuf);
1092 if (inobuf.b_un.b_buf != NULL)
1093 free((char *)inobuf.b_un.b_buf);
1094 inobuf.b_un.b_buf = NULL;
1095 firstinum = lastinum = 0;
1097 * Reload the snapshot inodes in case any of them changed.
1099 for (i = 0; i < snapcnt; i++) {
1100 bp = snaplist[i].i_bp;
1101 bp->b_errs = blread(fsreadfd, bp->b_un.b_buf, bp->b_bno,
1107 * Routines to maintain information about directory inodes.
1108 * This is built during the first pass and used during the
1109 * second and third passes.
1111 * Enter inodes into the cache.
1114 cacheino(union dinode *dp, ino_t inumber)
1116 struct inoinfo *inp;
1119 if (getinoinfo(inumber) != NULL)
1120 pfatal("cacheino: duplicate entry for ino %jd\n",
1122 if (howmany(DIP(dp, di_size), sblock.fs_bsize) > UFS_NDADDR)
1123 blks = UFS_NDADDR + UFS_NIADDR;
1124 else if (DIP(dp, di_size) > 0)
1125 blks = howmany(DIP(dp, di_size), sblock.fs_bsize);
1128 inp = (struct inoinfo *)
1129 Malloc(sizeof(*inp) + (blks - 1) * sizeof(ufs2_daddr_t));
1131 errx(EEXIT, "cannot increase directory list");
1132 SLIST_INSERT_HEAD(&inphash[inumber % dirhash], inp, i_hash);
1134 inp->i_parent = inumber == UFS_ROOTINO ? UFS_ROOTINO : (ino_t)0;
1135 inp->i_dotdot = (ino_t)0;
1136 inp->i_number = inumber;
1137 inp->i_isize = DIP(dp, di_size);
1138 inp->i_numblks = blks;
1139 for (i = 0; i < MIN(blks, UFS_NDADDR); i++)
1140 inp->i_blks[i] = DIP(dp, di_db[i]);
1141 if (blks > UFS_NDADDR)
1142 for (i = 0; i < UFS_NIADDR; i++)
1143 inp->i_blks[UFS_NDADDR + i] = DIP(dp, di_ib[i]);
1144 if (inplast == listmax) {
1146 inpsort = (struct inoinfo **)reallocarray((char *)inpsort,
1147 listmax, sizeof(struct inoinfo *));
1148 if (inpsort == NULL)
1149 errx(EEXIT, "cannot increase directory list");
1151 inpsort[inplast++] = inp;
1156 * Look up an inode cache structure.
1159 getinoinfo(ino_t inumber)
1161 struct inoinfo *inp;
1163 SLIST_FOREACH(inp, &inphash[inumber % dirhash], i_hash) {
1164 if (inp->i_number != inumber)
1172 * Remove an entry from the inode cache and disk-order sorted list.
1173 * Return 0 on success and 1 on failure.
1176 removecachedino(ino_t inumber)
1178 struct inoinfo *inp, **inpp;
1182 SLIST_FOREACH(inp, &inphash[inumber % dirhash], i_hash) {
1183 if (inp->i_number != inumber)
1185 SLIST_REMOVE(&inphash[inumber % dirhash], inp, inoinfo, i_hash);
1186 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--) {
1189 *inpp = inpsort[inplast - 1];
1197 pfatal("removecachedino: entry for ino %jd not found on %s list\n",
1198 (intmax_t)inumber, listtype);
1203 * Clean up all the inode cache structure.
1208 struct inoinfo **inpp;
1210 if (inphash == NULL)
1212 for (inpp = &inpsort[inplast - 1]; inpp >= inpsort; inpp--)
1213 free((char *)(*inpp));
1214 free((char *)inphash);
1216 free((char *)inpsort);
1221 inodirty(struct inode *ip)
1224 if (sblock.fs_magic == FS_UFS2_MAGIC)
1225 ffs_update_dinode_ckhash(&sblock,
1226 (struct ufs2_dinode *)ip->i_dp);
1231 clri(struct inodesc *idesc, const char *type, int flag)
1236 ginode(idesc->id_number, &ip);
1239 pwarn("%s %s", type,
1240 (DIP(dp, di_mode) & IFMT) == IFDIR ? "DIR" : "FILE");
1244 if (preen || reply("CLEAR") == 1) {
1246 printf(" (CLEARED)\n");
1248 if (bkgrdflag == 0) {
1249 if (idesc->id_type == SNAP) {
1250 snapremove(idesc->id_number);
1251 idesc->id_type = ADDR;
1253 (void)ckinode(dp, idesc);
1254 inoinfo(idesc->id_number)->ino_state = USTATE;
1258 cmd.value = idesc->id_number;
1259 cmd.size = -DIP(dp, di_nlink);
1261 printf("adjrefcnt ino %ld amt %lld\n",
1262 (long)cmd.value, (long long)cmd.size);
1263 if (sysctl(adjrefcnt, MIBSIZE, 0, 0,
1264 &cmd, sizeof cmd) == -1)
1265 rwerror("ADJUST INODE", cmd.value);
1272 findname(struct inodesc *idesc)
1274 struct direct *dirp = idesc->id_dirp;
1276 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
1277 idesc->id_entryno++;
1280 memmove(idesc->id_name, dirp->d_name, (size_t)dirp->d_namlen + 1);
1281 return (STOP|FOUND);
1285 findino(struct inodesc *idesc)
1287 struct direct *dirp = idesc->id_dirp;
1289 if (dirp->d_ino == 0)
1291 if (strcmp(dirp->d_name, idesc->id_name) == 0 &&
1292 dirp->d_ino >= UFS_ROOTINO && dirp->d_ino <= maxino) {
1293 idesc->id_parent = dirp->d_ino;
1294 return (STOP|FOUND);
1300 clearentry(struct inodesc *idesc)
1302 struct direct *dirp = idesc->id_dirp;
1304 if (dirp->d_ino != idesc->id_parent || idesc->id_entryno < 2) {
1305 idesc->id_entryno++;
1309 return (STOP|FOUND|ALTERED);
1313 prtinode(struct inode *ip)
1321 printf(" I=%lu ", (u_long)ip->i_number);
1322 if (ip->i_number < UFS_ROOTINO || ip->i_number > maxino)
1325 if ((pw = getpwuid((int)DIP(dp, di_uid))) != NULL)
1326 printf("%s ", pw->pw_name);
1328 printf("%u ", (unsigned)DIP(dp, di_uid));
1329 printf("MODE=%o\n", DIP(dp, di_mode));
1331 printf("%s: ", cdevname);
1332 printf("SIZE=%ju ", (uintmax_t)DIP(dp, di_size));
1333 t = DIP(dp, di_mtime);
1334 if ((p = ctime(&t)) != NULL)
1335 printf("MTIME=%12.12s %4.4s ", &p[4], &p[20]);
1339 blkerror(ino_t ino, const char *type, ufs2_daddr_t blk)
1342 pfatal("%jd %s I=%ju", (intmax_t)blk, type, (uintmax_t)ino);
1344 switch (inoinfo(ino)->ino_state) {
1348 inoinfo(ino)->ino_state = FCLEAR;
1353 inoinfo(ino)->ino_state = DCLEAR;
1361 errx(EEXIT, "BAD STATE %d TO BLKERR", inoinfo(ino)->ino_state);
1367 * allocate an unused inode
1370 allocino(ino_t request, int type)
1375 struct bufarea *cgbp;
1381 request = UFS_ROOTINO;
1383 } else if (inoinfo(request)->ino_state != USTATE)
1386 for (ino = request; ino < maxino; ino++)
1387 if (inoinfo(ino)->ino_state == USTATE)
1391 cg = ino_to_cg(&sblock, ino);
1392 cgbp = cglookup(cg);
1393 cgp = cgbp->b_un.b_cg;
1394 if (!check_cgmagic(cg, cgbp, 0)) {
1397 request = (cg + 1) * sblock.fs_ipg;
1400 setbit(cg_inosused(cgp), ino % sblock.fs_ipg);
1401 cgp->cg_cs.cs_nifree--;
1402 switch (type & IFMT) {
1404 inoinfo(ino)->ino_state = DSTATE;
1405 cgp->cg_cs.cs_ndir++;
1409 inoinfo(ino)->ino_state = FSTATE;
1417 DIP_SET(dp, di_db[0], allocblk(ino_to_cg(&sblock, ino), (long)1,
1418 std_checkblkavail));
1419 if (DIP(dp, di_db[0]) == 0) {
1420 inoinfo(ino)->ino_state = USTATE;
1424 DIP_SET(dp, di_mode, type);
1425 DIP_SET(dp, di_flags, 0);
1426 DIP_SET(dp, di_atime, time(NULL));
1427 DIP_SET(dp, di_ctime, DIP(dp, di_atime));
1428 DIP_SET(dp, di_mtime, DIP(dp, di_ctime));
1429 DIP_SET(dp, di_mtimensec, 0);
1430 DIP_SET(dp, di_ctimensec, 0);
1431 DIP_SET(dp, di_atimensec, 0);
1432 DIP_SET(dp, di_size, sblock.fs_fsize);
1433 DIP_SET(dp, di_blocks, btodb(sblock.fs_fsize));
1437 inoinfo(ino)->ino_type = IFTODT(type);
1442 * deallocate an inode
1447 struct inodesc idesc;
1451 memset(&idesc, 0, sizeof(struct inodesc));
1452 idesc.id_type = ADDR;
1453 idesc.id_func = freeblock;
1454 idesc.id_number = ino;
1457 (void)ckinode(dp, &idesc);
1461 inoinfo(ino)->ino_state = USTATE;