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