clri.c revision 1.19 1 1.19 xtraeme /* $NetBSD: clri.c,v 1.19 2005/01/20 15:50:47 xtraeme Exp $ */
2 1.9 cgd
3 1.1 cgd /*
4 1.6 mycroft * Copyright (c) 1990, 1993
5 1.6 mycroft * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * This code is derived from software contributed to Berkeley by
8 1.1 cgd * Rich $alz of BBN Inc.
9 1.1 cgd *
10 1.1 cgd * Redistribution and use in source and binary forms, with or without
11 1.1 cgd * modification, are permitted provided that the following conditions
12 1.1 cgd * are met:
13 1.1 cgd * 1. Redistributions of source code must retain the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer.
15 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
16 1.1 cgd * notice, this list of conditions and the following disclaimer in the
17 1.1 cgd * documentation and/or other materials provided with the distribution.
18 1.16 agc * 3. Neither the name of the University nor the names of its contributors
19 1.1 cgd * may be used to endorse or promote products derived from this software
20 1.1 cgd * without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.1 cgd * SUCH DAMAGE.
33 1.1 cgd */
34 1.1 cgd
35 1.10 lukem #include <sys/cdefs.h>
36 1.1 cgd #ifndef lint
37 1.10 lukem __COPYRIGHT("@(#) Copyright (c) 1990, 1993\n\
38 1.10 lukem The Regents of the University of California. All rights reserved.\n");
39 1.1 cgd #endif /* not lint */
40 1.1 cgd
41 1.1 cgd #ifndef lint
42 1.9 cgd #if 0
43 1.11 lukem static char sccsid[] = "@(#)clri.c 8.3 (Berkeley) 4/28/95";
44 1.9 cgd #else
45 1.19 xtraeme __RCSID("$NetBSD: clri.c,v 1.19 2005/01/20 15:50:47 xtraeme Exp $");
46 1.9 cgd #endif
47 1.1 cgd #endif /* not lint */
48 1.1 cgd
49 1.1 cgd #include <sys/param.h>
50 1.5 cgd #include <sys/time.h>
51 1.6 mycroft
52 1.6 mycroft #include <ufs/ufs/dinode.h>
53 1.12 bouyer #include <ufs/ufs/ufs_bswap.h>
54 1.6 mycroft #include <ufs/ffs/fs.h>
55 1.12 bouyer #include <ufs/ffs/ffs_extern.h>
56 1.6 mycroft
57 1.6 mycroft #include <err.h>
58 1.6 mycroft #include <errno.h>
59 1.6 mycroft #include <fcntl.h>
60 1.6 mycroft #include <stdlib.h>
61 1.6 mycroft #include <string.h>
62 1.6 mycroft #include <stdio.h>
63 1.1 cgd #include <unistd.h>
64 1.1 cgd
65 1.15 fvdl /*
66 1.15 fvdl * Possible superblock locations ordered from most to least likely.
67 1.15 fvdl */
68 1.15 fvdl static off_t sblock_try[] = SBLOCKSEARCH;
69 1.15 fvdl off_t sblockloc;
70 1.15 fvdl
71 1.15 fvdl
72 1.6 mycroft int
73 1.19 xtraeme main(int argc, char *argv[])
74 1.1 cgd {
75 1.10 lukem struct fs *sbp;
76 1.15 fvdl struct ufs1_dinode *ip1;
77 1.15 fvdl struct ufs2_dinode *ip2;
78 1.10 lukem int fd;
79 1.15 fvdl char *ibuf[MAXBSIZE];
80 1.8 mycroft int32_t generation;
81 1.6 mycroft off_t offset;
82 1.8 mycroft size_t bsize;
83 1.1 cgd int inonum;
84 1.15 fvdl char *fs, sblock[SBLOCKSIZE];
85 1.15 fvdl int needswap = 0, is_ufs2 = 0;
86 1.12 bouyer int i, imax;
87 1.1 cgd
88 1.1 cgd if (argc < 3) {
89 1.1 cgd (void)fprintf(stderr, "usage: clri filesystem inode ...\n");
90 1.1 cgd exit(1);
91 1.1 cgd }
92 1.1 cgd
93 1.1 cgd fs = *++argv;
94 1.1 cgd
95 1.12 bouyer
96 1.1 cgd /* get the superblock. */
97 1.1 cgd if ((fd = open(fs, O_RDWR, 0)) < 0)
98 1.6 mycroft err(1, "%s", fs);
99 1.17 dsl for (i = 0;; i++) {
100 1.17 dsl sblockloc = sblock_try[i];
101 1.17 dsl if (sblockloc == -1)
102 1.17 dsl errx(1, "%s: can't find superblock", fs);
103 1.17 dsl if (pread(fd, sblock, sizeof(sblock), sblockloc) != sizeof(sblock))
104 1.15 fvdl errx(1, "%s: can't read superblock", fs);
105 1.1 cgd
106 1.15 fvdl sbp = (struct fs *)sblock;
107 1.15 fvdl switch(sbp->fs_magic) {
108 1.15 fvdl case FS_UFS2_MAGIC:
109 1.15 fvdl is_ufs2 = 1;
110 1.15 fvdl /*FALLTHROUGH*/
111 1.15 fvdl case FS_UFS1_MAGIC:
112 1.17 dsl break;
113 1.15 fvdl case FS_UFS2_MAGIC_SWAPPED:
114 1.15 fvdl is_ufs2 = 1;
115 1.15 fvdl /*FALLTHROUGH*/
116 1.15 fvdl case FS_UFS1_MAGIC_SWAPPED:
117 1.12 bouyer needswap = 1;
118 1.17 dsl break;
119 1.15 fvdl default:
120 1.15 fvdl continue;
121 1.15 fvdl }
122 1.17 dsl
123 1.17 dsl /* check we haven't found an alternate */
124 1.18 dsl if (is_ufs2 || sbp->fs_old_flags & FS_FLAGS_UPDATED) {
125 1.17 dsl if (sblockloc != ufs_rw64(sbp->fs_sblockloc, needswap))
126 1.17 dsl continue;
127 1.17 dsl } else {
128 1.17 dsl if (sblockloc == SBLOCK_UFS2)
129 1.17 dsl continue;
130 1.17 dsl }
131 1.17 dsl
132 1.17 dsl break;
133 1.13 ross }
134 1.12 bouyer
135 1.12 bouyer /* check that inode numbers are valid */
136 1.12 bouyer imax = ufs_rw32(sbp->fs_ncg, needswap) *
137 1.12 bouyer ufs_rw32(sbp->fs_ipg, needswap);
138 1.12 bouyer for (i = 1; i < (argc - 1); i++)
139 1.12 bouyer if (atoi(argv[i]) <= 0 || atoi(argv[i]) >= imax)
140 1.12 bouyer errx(1, "%s is not a valid inode number", argv[i]);
141 1.12 bouyer
142 1.12 bouyer /* delete clean flag in the superblok */
143 1.17 dsl sbp->fs_clean = ufs_rw32(ufs_rw32(sbp->fs_clean, needswap) << 1,
144 1.17 dsl needswap);
145 1.15 fvdl if (lseek(fd, sblockloc, SEEK_SET) < 0)
146 1.12 bouyer err(1, "%s", fs);
147 1.12 bouyer if (write(fd, sblock, sizeof(sblock)) != sizeof(sblock))
148 1.12 bouyer errx(1, "%s: can't rewrite superblock", fs);
149 1.12 bouyer (void)fsync(fd);
150 1.12 bouyer
151 1.12 bouyer if (needswap)
152 1.14 lukem ffs_sb_swap(sbp, sbp);
153 1.1 cgd bsize = sbp->fs_bsize;
154 1.1 cgd
155 1.1 cgd /* remaining arguments are inode numbers. */
156 1.1 cgd while (*++argv) {
157 1.1 cgd /* get the inode number. */
158 1.12 bouyer inonum = atoi(*argv);
159 1.1 cgd (void)printf("clearing %d\n", inonum);
160 1.1 cgd
161 1.1 cgd /* read in the appropriate block. */
162 1.6 mycroft offset = ino_to_fsba(sbp, inonum); /* inode to fs blk */
163 1.6 mycroft offset = fsbtodb(sbp, offset); /* fs blk disk blk */
164 1.6 mycroft offset *= DEV_BSIZE; /* disk blk to bytes */
165 1.1 cgd
166 1.1 cgd /* seek and read the block */
167 1.1 cgd if (lseek(fd, offset, SEEK_SET) < 0)
168 1.6 mycroft err(1, "%s", fs);
169 1.6 mycroft if (read(fd, ibuf, bsize) != bsize)
170 1.6 mycroft err(1, "%s", fs);
171 1.1 cgd
172 1.1 cgd /* get the inode within the block. */
173 1.15 fvdl if (is_ufs2) {
174 1.15 fvdl ip2 = &((struct ufs2_dinode *)ibuf)
175 1.15 fvdl [ino_to_fsbo(sbp, inonum)];
176 1.15 fvdl /* clear the inode, and bump the generation count. */
177 1.15 fvdl generation = ip2->di_gen + 1;
178 1.15 fvdl memset(ip2, 0, sizeof(*ip2));
179 1.15 fvdl ip2->di_gen = generation;
180 1.15 fvdl } else {
181 1.15 fvdl ip1 = &((struct ufs1_dinode *)ibuf)
182 1.15 fvdl [ino_to_fsbo(sbp, inonum)];
183 1.15 fvdl /* clear the inode, and bump the generation count. */
184 1.15 fvdl generation = ip1->di_gen + 1;
185 1.15 fvdl memset(ip1, 0, sizeof(*ip1));
186 1.15 fvdl ip1->di_gen = generation;
187 1.15 fvdl }
188 1.1 cgd
189 1.1 cgd /* backup and write the block */
190 1.8 mycroft if (lseek(fd, offset, SEEK_SET) < 0)
191 1.6 mycroft err(1, "%s", fs);
192 1.6 mycroft if (write(fd, ibuf, bsize) != bsize)
193 1.6 mycroft err(1, "%s", fs);
194 1.1 cgd (void)fsync(fd);
195 1.1 cgd }
196 1.1 cgd (void)close(fd);
197 1.1 cgd exit(0);
198 1.1 cgd }
199