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