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 #if 0 38 #ifndef lint 39 static const char copyright[] = 40 "@(#) Copyright (c) 1990, 1993\n\ 41 The Regents of the University of California. All rights reserved.\n"; 42 #endif /* not lint */ 43 44 #ifndef lint 45 static char sccsid[] = "@(#)clri.c 8.2 (Berkeley) 9/23/93"; 46 #endif /* not lint */ 47 #endif 48 #include <sys/cdefs.h> 49 __FBSDID("$FreeBSD$"); 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 special_device inode_number ...\n"); 73 exit(1); 74 } 75 76 int 77 main(int argc, char *argv[]) 78 { 79 struct fs *sbp; 80 struct ufs1_dinode *dp1; 81 struct ufs2_dinode *dp2; 82 char *ibuf[MAXBSIZE]; 83 long generation, bsize; 84 off_t offset; 85 int i, fd, inonum; 86 char *fs, sblock[SBLOCKSIZE]; 87 88 if (argc < 3) 89 usage(); 90 91 fs = *++argv; 92 93 /* get the superblock. */ 94 if ((fd = open(fs, O_RDWR, 0)) < 0) 95 err(1, "%s", fs); 96 for (i = 0; sblock_try[i] != -1; i++) { 97 if (lseek(fd, (off_t)(sblock_try[i]), SEEK_SET) < 0) 98 err(1, "%s", fs); 99 if (read(fd, sblock, sizeof(sblock)) != sizeof(sblock)) 100 errx(1, "%s: can't read superblock", fs); 101 sbp = (struct fs *)sblock; 102 if ((sbp->fs_magic == FS_UFS1_MAGIC || 103 (sbp->fs_magic == FS_UFS2_MAGIC && 104 sbp->fs_sblockloc == sblock_try[i])) && 105 sbp->fs_bsize <= MAXBSIZE && 106 sbp->fs_bsize >= (int)sizeof(struct fs)) 107 break; 108 } 109 if (sblock_try[i] == -1) { 110 fprintf(stderr, "Cannot find file system superblock\n"); 111 exit(2); 112 } 113 bsize = sbp->fs_bsize; 114 115 /* remaining arguments are inode numbers. */ 116 while (*++argv) { 117 /* get the inode number. */ 118 if ((inonum = atoi(*argv)) <= 0) 119 errx(1, "%s is not a valid inode number", *argv); 120 (void)printf("clearing %d\n", inonum); 121 122 /* read in the appropriate block. */ 123 offset = ino_to_fsba(sbp, inonum); /* inode to fs blk */ 124 offset = fsbtodb(sbp, offset); /* fs blk disk blk */ 125 offset *= DEV_BSIZE; /* disk blk to bytes */ 126 127 /* seek and read the block */ 128 if (lseek(fd, offset, SEEK_SET) < 0) 129 err(1, "%s", fs); 130 if (read(fd, ibuf, bsize) != bsize) 131 err(1, "%s", fs); 132 133 if (sbp->fs_magic == FS_UFS2_MAGIC) { 134 /* get the inode within the block. */ 135 dp2 = &(((struct ufs2_dinode *)ibuf) 136 [ino_to_fsbo(sbp, inonum)]); 137 138 /* clear the inode, and bump the generation count. */ 139 generation = dp2->di_gen + 1; 140 memset(dp2, 0, sizeof(*dp2)); 141 dp2->di_gen = generation; 142 } else { 143 /* get the inode within the block. */ 144 dp1 = &(((struct ufs1_dinode *)ibuf) 145 [ino_to_fsbo(sbp, inonum)]); 146 147 /* clear the inode, and bump the generation count. */ 148 generation = dp1->di_gen + 1; 149 memset(dp1, 0, sizeof(*dp1)); 150 dp1->di_gen = generation; 151 } 152 153 /* backup and write the block */ 154 if (lseek(fd, (off_t)-bsize, SEEK_CUR) < 0) 155 err(1, "%s", fs); 156 if (write(fd, ibuf, bsize) != bsize) 157 err(1, "%s", fs); 158 (void)fsync(fd); 159 } 160 (void)close(fd); 161 exit(0); 162 } 163