|
Line 0
Link Here
|
|
|
1 |
/*- |
| 2 |
* Copyright (c) 1990, 1993, 1994 |
| 3 |
* The Regents of the University of California. All rights reserved. |
| 4 |
* |
| 5 |
* Redistribution and use in source and binary forms, with or without |
| 6 |
* modification, are permitted provided that the following conditions |
| 7 |
* are met: |
| 8 |
* 1. Redistributions of source code must retain the above copyright |
| 9 |
* notice, this list of conditions and the following disclaimer. |
| 10 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 11 |
* notice, this list of conditions and the following disclaimer in the |
| 12 |
* documentation and/or other materials provided with the distribution. |
| 13 |
* 3. All advertising materials mentioning features or use of this software |
| 14 |
* must display the following acknowledgement: |
| 15 |
* This product includes software developed by the University of |
| 16 |
* California, Berkeley and its contributors. |
| 17 |
* 4. Neither the name of the University nor the names of its contributors |
| 18 |
* may be used to endorse or promote products derived from this software |
| 19 |
* without specific prior written permission. |
| 20 |
* |
| 21 |
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| 22 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 23 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 24 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| 25 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 26 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 27 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 28 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 29 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 30 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 31 |
* SUCH DAMAGE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#ifndef lint |
| 35 |
static const char copyright[] = |
| 36 |
"@(#) Copyright (c) 1990, 1993, 1994\n\ |
| 37 |
The Regents of the University of California. All rights reserved.\n"; |
| 38 |
#endif /* not lint */ |
| 39 |
|
| 40 |
#ifndef lint |
| 41 |
#if 0 |
| 42 |
static char sccsid[] = "@(#)rm.c 8.5 (Berkeley) 4/18/94"; |
| 43 |
#else |
| 44 |
static const char rcsid[] = |
| 45 |
"$FreeBSD: src/bin/rm/rm.c,v 1.30 2000/05/01 18:34:36 asmodai Exp $"; |
| 46 |
#endif |
| 47 |
#endif /* not lint */ |
| 48 |
|
| 49 |
#include <sys/param.h> |
| 50 |
#include <sys/mount.h> |
| 51 |
#include <sys/stat.h> |
| 52 |
|
| 53 |
#include <err.h> |
| 54 |
#include <fcntl.h> |
| 55 |
#include <stdlib.h> |
| 56 |
#include <unistd.h> |
| 57 |
|
| 58 |
/* |
| 59 |
* obliterate -- |
| 60 |
* Overwrite the file 3 times with varying bit patterns. |
| 61 |
* |
| 62 |
* XXX |
| 63 |
* This is a cheap way to *really* delete files. Note that only regular |
| 64 |
* files are deleted, directories (and therefore names) will remain. |
| 65 |
* Also, this assumes a fixed-block file system (like FFS, or a V7 or a |
| 66 |
* System V file system). In a logging file system, you'll have to have |
| 67 |
* kernel support. |
| 68 |
*/ |
| 69 |
int |
| 70 |
obliterate(file, sbp) |
| 71 |
char *file; |
| 72 |
struct stat *sbp; |
| 73 |
{ |
| 74 |
struct stat sb; |
| 75 |
struct statfs fsb; |
| 76 |
off_t len; |
| 77 |
int bsize, fd, wlen; |
| 78 |
char *buf = NULL; |
| 79 |
|
| 80 |
fd = -1; |
| 81 |
if (sbp == NULL) { |
| 82 |
if (lstat(file, &sb)) |
| 83 |
goto err; |
| 84 |
sbp = &sb; |
| 85 |
} |
| 86 |
if (!S_ISREG(sbp->st_mode)) |
| 87 |
return 0; |
| 88 |
if ((fd = open(file, O_WRONLY, 0)) == -1) |
| 89 |
goto err; |
| 90 |
if (fstatfs(fd, &fsb) == -1) |
| 91 |
goto err; |
| 92 |
bsize = MAX(fsb.f_iosize, 1024); |
| 93 |
if ((buf = malloc(bsize)) == NULL) |
| 94 |
err(1, "malloc"); |
| 95 |
|
| 96 |
#define PASS(byte) { \ |
| 97 |
memset(buf, byte, bsize); \ |
| 98 |
for (len = sbp->st_size; len > 0; len -= wlen) { \ |
| 99 |
wlen = len < bsize ? len : bsize; \ |
| 100 |
if (write(fd, buf, wlen) != wlen) \ |
| 101 |
goto err; \ |
| 102 |
} \ |
| 103 |
} |
| 104 |
PASS(0xff); |
| 105 |
if (fsync(fd) || lseek(fd, (off_t)0, SEEK_SET)) |
| 106 |
goto err; |
| 107 |
PASS(0x00); |
| 108 |
if (fsync(fd) || lseek(fd, (off_t)0, SEEK_SET)) |
| 109 |
goto err; |
| 110 |
PASS(0xff); |
| 111 |
if (!fsync(fd) && !close(fd)) { |
| 112 |
free(buf); |
| 113 |
return 0; |
| 114 |
} |
| 115 |
|
| 116 |
err: if (buf) |
| 117 |
free(buf); |
| 118 |
warn("%s", file); |
| 119 |
return -1; |
| 120 |
} |
| 121 |
|