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 * @(#) Copyright (c) 1990, 1993 The Regents of the University of California. All rights reserved. 37 * @(#)clri.c 8.2 (Berkeley) 9/23/93 38 * $FreeBSD: src/sbin/clri/clri.c,v 1.4 1999/08/28 00:12:32 peter Exp $ 39 * $DragonFly: src/sbin/clri/clri.c,v 1.4 2003/09/28 14:39:16 hmp Exp $ 40 */ 41 42 #include <sys/param.h> 43 44 #include <vfs/ufs/dinode.h> 45 #include <vfs/ufs/fs.h> 46 47 #include <err.h> 48 #include <fcntl.h> 49 #include <stdlib.h> 50 #include <string.h> 51 #include <stdio.h> 52 #include <unistd.h> 53 54 static void 55 usage(void) 56 { 57 (void)fprintf(stderr, "usage: clri filesystem inode ...\n"); 58 exit(1); 59 } 60 61 int 62 main(int argc, char **argv) 63 { 64 register struct fs *sbp; 65 register struct dinode *ip; 66 register int fd; 67 struct dinode ibuf[MAXBSIZE / sizeof (struct dinode)]; 68 long generation, bsize; 69 off_t offset; 70 int inonum; 71 char *fs, sblock[SBSIZE]; 72 73 if (argc < 3) 74 usage(); 75 76 fs = *++argv; 77 78 /* get the superblock. */ 79 if ((fd = open(fs, O_RDWR, 0)) < 0) 80 err(1, "%s", fs); 81 if (lseek(fd, (off_t)(SBLOCK * DEV_BSIZE), SEEK_SET) < 0) 82 err(1, "%s", fs); 83 if (read(fd, sblock, sizeof(sblock)) != sizeof(sblock)) 84 errx(1, "%s: can't read superblock", fs); 85 86 sbp = (struct fs *)sblock; 87 if (sbp->fs_magic != FS_MAGIC) 88 errx(1, "%s: superblock magic number 0x%x, not 0x%x", 89 fs, sbp->fs_magic, FS_MAGIC); 90 bsize = sbp->fs_bsize; 91 92 /* remaining arguments are inode numbers. */ 93 while (*++argv) { 94 /* get the inode number. */ 95 if ((inonum = atoi(*argv)) <= 0) 96 errx(1, "%s is not a valid inode number", *argv); 97 (void)printf("clearing %d\n", inonum); 98 99 /* read in the appropriate block. */ 100 offset = ino_to_fsba(sbp, inonum); /* inode to fs blk */ 101 offset = fsbtodb(sbp, offset); /* fs blk disk blk */ 102 offset *= DEV_BSIZE; /* disk blk to bytes */ 103 104 /* seek and read the block */ 105 if (lseek(fd, offset, SEEK_SET) < 0) 106 err(1, "%s", fs); 107 if (read(fd, ibuf, bsize) != bsize) 108 err(1, "%s", fs); 109 110 /* get the inode within the block. */ 111 ip = &ibuf[ino_to_fsbo(sbp, inonum)]; 112 113 /* clear the inode, and bump the generation count. */ 114 generation = ip->di_gen + 1; 115 memset(ip, 0, sizeof(*ip)); 116 ip->di_gen = generation; 117 118 /* backup and write the block */ 119 if (lseek(fd, (off_t)-bsize, SEEK_CUR) < 0) 120 err(1, "%s", fs); 121 if (write(fd, ibuf, bsize) != bsize) 122 err(1, "%s", fs); 123 (void)fsync(fd); 124 } 125 (void)close(fd); 126 exit(0); 127 } 128