/* * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this * file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * Copyright (c) 1990, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Rich $alz of BBN Inc. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ #include <sys/param.h> #include <sys/time.h> #include <ufs/ufs/dinode.h> #include <ufs/ffs/fs.h> #include <err.h> #include <errno.h> #include <fcntl.h> #include <stdlib.h> #include <string.h> #include <stdio.h> #include <unistd.h> #if REV_ENDIAN_FS #import "ufs_byte_order.h" #include <libkern/OSByteOrder.h> #endif /* REV_ENDIAN_FS */ #if REV_ENDIAN_FS int rev_endian=0; #endif /* REV_ENDIAN_FS */ int main(argc, argv) int argc; char *argv[]; { register struct fs *sbp; register struct dinode *ip; register int fd; struct dinode ibuf[MAXBSIZE / sizeof (struct dinode)]; int32_t generation, bsize; off_t offset; int inonum; #ifdef __APPLE__ long dev_bsize; #endif /* __APPLE__ */ char *fs, sblock[SBSIZE]; if (argc < 3) { (void)fprintf(stderr, "usage: clri filesystem inode ...\n"); exit(1); } fs = *++argv; /* get the superblock. */ if ((fd = open(fs, O_RDWR, 0)) < 0) err(1, "%s", fs); #ifdef __APPLE__ if (lseek(fd, (off_t)SBOFF, SEEK_SET) < 0) #else if (lseek(fd, (off_t)(SBLOCK * DEV_BSIZE), SEEK_SET) < 0) #endif /* __APPLE__ */ err(1, "%s", fs); if (read(fd, sblock, sizeof(sblock)) != sizeof(sblock)) errx(1, "%s: can't read superblock", fs); sbp = (struct fs *)sblock; if (sbp->fs_magic != FS_MAGIC) #if REV_ENDIAN_FS { byte_swap_sbin(sbp); if (sbp->fs_magic != FS_MAGIC) { #endif /* REV_ENDIAN_FS */ errx(1, "%s: superblock magic number 0x%x, not 0x%x", fs, sbp->fs_magic, FS_MAGIC); #if REV_ENDIAN_FS } else { (void)printf("Reverse Byte order Filesystem Detected\n"); rev_endian=1; } } else rev_endian = 0; #endif /* REV_ENDIAN_FS */ bsize = sbp->fs_bsize; #ifdef __APPLE__ dev_bsize = sbp->fs_fsize / fsbtodb(sbp, 1); #endif /* __APPLE__ */ /* remaining arguments are inode numbers. */ while (*++argv) { /* get the inode number. */ if ((inonum = atoi(*argv)) <= 0) errx(1, "%s is not a valid inode number", *argv); (void)printf("clearing %d\n", inonum); /* read in the appropriate block. */ offset = ino_to_fsba(sbp, inonum); /* inode to fs blk */ offset = fsbtodb(sbp, offset); /* fs blk disk blk */ #ifdef __APPLE__ offset *= dev_bsize; /* disk blk to bytes */ #else offset *= DEV_BSIZE; /* disk blk to bytes */ #endif /* __APPLE__ */ /* seek and read the block */ if (lseek(fd, offset, SEEK_SET) < 0) err(1, "%s", fs); if (read(fd, ibuf, bsize) != bsize) err(1, "%s", fs); /* get the inode within the block. */ ip = &ibuf[ino_to_fsbo(sbp, inonum)]; /* clear the inode, and bump the generation count. */ #if REV_ENDIAN_FS if (rev_endian) ip->di_gen = OSSwapInt32(ip->di_gen); #endif /* REV_ENDIAN_FS */ generation = ip->di_gen + 1; memset(ip, 0, sizeof(*ip)); #if REV_ENDIAN_FS if (rev_endian) generation = OSSwapInt32(generation); #endif /* REV_ENDIAN_FS */ ip->di_gen = generation; /* backup and write the block */ if (lseek(fd, (off_t)-bsize, SEEK_CUR) < 0) err(1, "%s", fs); if (write(fd, ibuf, bsize) != bsize) err(1, "%s", fs); (void)fsync(fd); } (void)close(fd); exit(0); }