xref: /freebsd/sbin/clri/clri.c (revision 5e152c79343de64871ee117f4e6b59787d1ed437)
1 /*
2  * Copyright (c) 1990, 1993
3  *	The Regents of the University of California.  All rights reserved.
4  *
5  * This code is derived from software contributed to Berkeley by
6  * Rich $alz of BBN Inc.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted provided that the following conditions
10  * are met:
11  * 1. Redistributions of source code must retain the above copyright
12  *    notice, this list of conditions and the following disclaimer.
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  * 3. All advertising materials mentioning features or use of this software
17  *    must display the following acknowledgement:
18  *	This product includes software developed by the University of
19  *	California, Berkeley and its contributors.
20  * 4. Neither the name of the University nor the names of its contributors
21  *    may be used to endorse or promote products derived from this software
22  *    without specific prior written permission.
23  *
24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34  * SUCH DAMAGE.
35  */
36 
37 #ifndef lint
38 static const char copyright[] =
39 "@(#) Copyright (c) 1990, 1993\n\
40 	The Regents of the University of California.  All rights reserved.\n";
41 #endif /* not lint */
42 
43 #ifndef lint
44 #if 0
45 static char sccsid[] = "@(#)clri.c	8.2 (Berkeley) 9/23/93";
46 #endif
47 #endif /* not lint */
48 
49 #include <sys/cdefs.h>
50 __FBSDID("$FreeBSD$");
51 
52 #include <sys/param.h>
53 #include <sys/disklabel.h>
54 
55 #include <ufs/ufs/dinode.h>
56 #include <ufs/ffs/fs.h>
57 
58 #include <err.h>
59 #include <fcntl.h>
60 #include <stdlib.h>
61 #include <string.h>
62 #include <stdio.h>
63 #include <unistd.h>
64 
65 /*
66  * Possible superblock locations ordered from most to least likely.
67  */
68 static int sblock_try[] = SBLOCKSEARCH;
69 
70 static void
71 usage(void)
72 {
73 	(void)fprintf(stderr, "usage: clri special_device inode_number ...\n");
74 	exit(1);
75 }
76 
77 int
78 main(int argc, char *argv[])
79 {
80 	struct fs *sbp;
81 	struct ufs1_dinode *dp1;
82 	struct ufs2_dinode *dp2;
83 	char *ibuf[MAXBSIZE];
84 	long generation, bsize;
85 	off_t offset;
86 	int i, fd, inonum;
87 	char *fs, sblock[SBLOCKSIZE];
88 
89 	if (argc < 3)
90 		usage();
91 
92 	fs = *++argv;
93 
94 	/* get the superblock. */
95 	if ((fd = open(fs, O_RDWR, 0)) < 0)
96 		err(1, "%s", fs);
97 	for (i = 0; sblock_try[i] != -1; i++) {
98 		if (lseek(fd, (off_t)(sblock_try[i]), SEEK_SET) < 0)
99 			err(1, "%s", fs);
100 		if (read(fd, sblock, sizeof(sblock)) != sizeof(sblock))
101 			errx(1, "%s: can't read superblock", fs);
102 		sbp = (struct fs *)sblock;
103 		if ((sbp->fs_magic == FS_UFS1_MAGIC ||
104 		     (sbp->fs_magic == FS_UFS2_MAGIC &&
105 		      sbp->fs_sblockloc == numfrags(sbp, sblock_try[i]))) &&
106 		    sbp->fs_bsize <= MAXBSIZE &&
107 		    sbp->fs_bsize >= (int)sizeof(struct fs))
108 			break;
109 	}
110 	if (sblock_try[i] == -1) {
111 		fprintf(stderr, "Cannot find file system superblock\n");
112 		exit(2);
113 	}
114 	bsize = sbp->fs_bsize;
115 
116 	/* remaining arguments are inode numbers. */
117 	while (*++argv) {
118 		/* get the inode number. */
119 		if ((inonum = atoi(*argv)) <= 0)
120 			errx(1, "%s is not a valid inode number", *argv);
121 		(void)printf("clearing %d\n", inonum);
122 
123 		/* read in the appropriate block. */
124 		offset = ino_to_fsba(sbp, inonum);	/* inode to fs blk */
125 		offset = fsbtodb(sbp, offset);		/* fs blk disk blk */
126 		offset *= DEV_BSIZE;			/* disk blk to bytes */
127 
128 		/* seek and read the block */
129 		if (lseek(fd, offset, SEEK_SET) < 0)
130 			err(1, "%s", fs);
131 		if (read(fd, ibuf, bsize) != bsize)
132 			err(1, "%s", fs);
133 
134 		if (sbp->fs_magic == FS_UFS2_MAGIC) {
135 			/* get the inode within the block. */
136 			dp2 = &(((struct ufs2_dinode *)ibuf)
137 			    [ino_to_fsbo(sbp, inonum)]);
138 
139 			/* clear the inode, and bump the generation count. */
140 			generation = dp2->di_gen + 1;
141 			memset(dp2, 0, sizeof(*dp2));
142 			dp2->di_gen = generation;
143 		} else {
144 			/* get the inode within the block. */
145 			dp1 = &(((struct ufs1_dinode *)ibuf)
146 			    [ino_to_fsbo(sbp, inonum)]);
147 
148 			/* clear the inode, and bump the generation count. */
149 			generation = dp1->di_gen + 1;
150 			memset(dp1, 0, sizeof(*dp1));
151 			dp1->di_gen = generation;
152 		}
153 
154 		/* backup and write the block */
155 		if (lseek(fd, (off_t)-bsize, SEEK_CUR) < 0)
156 			err(1, "%s", fs);
157 		if (write(fd, ibuf, bsize) != bsize)
158 			err(1, "%s", fs);
159 		(void)fsync(fd);
160 	}
161 	(void)close(fd);
162 	exit(0);
163 }
164