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 static const char rcsid[] = 48 "$FreeBSD$"; 49 #endif /* not lint */ 50 51 #include <sys/param.h> 52 #include <sys/disklabel.h> 53 54 #include <ufs/ufs/dinode.h> 55 #include <ufs/ffs/fs.h> 56 57 #include <err.h> 58 #include <fcntl.h> 59 #include <stdlib.h> 60 #include <string.h> 61 #include <stdio.h> 62 #include <unistd.h> 63 64 /* 65 * Possible superblock locations ordered from most to least likely. 66 */ 67 static int sblock_try[] = SBLOCKSEARCH; 68 69 static void 70 usage(void) 71 { 72 (void)fprintf(stderr, "usage: clri filesystem inode ...\n"); 73 exit(1); 74 } 75 76 int 77 main(argc, argv) 78 int argc; 79 char *argv[]; 80 { 81 struct fs *sbp; 82 struct ufs1_dinode *dp1; 83 struct ufs2_dinode *dp2; 84 char *ibuf[MAXBSIZE]; 85 long generation, bsize; 86 off_t offset; 87 int i, fd, inonum; 88 char *fs, sblock[SBLOCKSIZE]; 89 90 if (argc < 3) 91 usage(); 92 93 fs = *++argv; 94 95 /* get the superblock. */ 96 if ((fd = open(fs, O_RDWR, 0)) < 0) 97 err(1, "%s", fs); 98 for (i = 0; sblock_try[i] != -1; i++) { 99 if (lseek(fd, (off_t)(sblock_try[i]), SEEK_SET) < 0) 100 err(1, "%s", fs); 101 if (read(fd, sblock, sizeof(sblock)) != sizeof(sblock)) 102 errx(1, "%s: can't read superblock", fs); 103 sbp = (struct fs *)sblock; 104 if ((sbp->fs_magic == FS_UFS1_MAGIC || 105 (sbp->fs_magic == FS_UFS2_MAGIC && 106 sbp->fs_sblockloc == numfrags(sbp, sblock_try[i]))) && 107 sbp->fs_bsize <= MAXBSIZE && 108 sbp->fs_bsize >= sizeof(struct fs)) 109 break; 110 } 111 if (sblock_try[i] == -1) { 112 fprintf(stderr, "Cannot find filesystem\n"); 113 exit(2); 114 } 115 bsize = sbp->fs_bsize; 116 117 /* remaining arguments are inode numbers. */ 118 while (*++argv) { 119 /* get the inode number. */ 120 if ((inonum = atoi(*argv)) <= 0) 121 errx(1, "%s is not a valid inode number", *argv); 122 (void)printf("clearing %d\n", inonum); 123 124 /* read in the appropriate block. */ 125 offset = ino_to_fsba(sbp, inonum); /* inode to fs blk */ 126 offset = fsbtodb(sbp, offset); /* fs blk disk blk */ 127 offset *= DEV_BSIZE; /* disk blk to bytes */ 128 129 /* seek and read the block */ 130 if (lseek(fd, offset, SEEK_SET) < 0) 131 err(1, "%s", fs); 132 if (read(fd, ibuf, bsize) != bsize) 133 err(1, "%s", fs); 134 135 if (sbp->fs_magic == FS_UFS2_MAGIC) { 136 /* get the inode within the block. */ 137 dp2 = &(((struct ufs2_dinode *)ibuf) 138 [ino_to_fsbo(sbp, inonum)]); 139 140 /* clear the inode, and bump the generation count. */ 141 generation = dp2->di_gen + 1; 142 memset(dp2, 0, sizeof(*dp2)); 143 dp2->di_gen = generation; 144 } else { 145 /* get the inode within the block. */ 146 dp1 = &(((struct ufs1_dinode *)ibuf) 147 [ino_to_fsbo(sbp, inonum)]); 148 149 /* clear the inode, and bump the generation count. */ 150 generation = dp1->di_gen + 1; 151 memset(dp1, 0, sizeof(*dp1)); 152 dp1->di_gen = generation; 153 } 154 155 /* backup and write the block */ 156 if (lseek(fd, (off_t)-bsize, SEEK_CUR) < 0) 157 err(1, "%s", fs); 158 if (write(fd, ibuf, bsize) != bsize) 159 err(1, "%s", fs); 160 (void)fsync(fd); 161 } 162 (void)close(fd); 163 exit(0); 164 } 165