1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include <u.h>
#include <sys/stat.h>
#include <libc.h>
#define rmdir p9rmdir
char errbuf[ERRMAX];
int ignerr = 0;
static void
err(char *f)
{
if(!ignerr){
errbuf[0] = '\0';
errstr(errbuf, sizeof errbuf);
fprint(2, "rm: %s: %s\n", f, errbuf);
}
}
int
issymlink(char *name)
{
struct stat s;
return lstat(name, &s) >= 0 && S_ISLNK(s.st_mode);
}
/*
* f is a non-empty directory. Remove its contents and then it.
*/
void
rmdir(char *f)
{
char *name;
int fd, i, j, n, ndir, nname;
Dir *dirbuf;
fd = open(f, OREAD);
if(fd < 0){
err(f);
return;
}
n = dirreadall(fd, &dirbuf);
close(fd);
if(n < 0){
err("dirreadall");
return;
}
nname = strlen(f)+1+STATMAX+1; /* plenty! */
name = malloc(nname);
if(name == 0){
err("memory allocation");
return;
}
ndir = 0;
for(i=0; i<n; i++){
snprint(name, nname, "%s/%s", f, dirbuf[i].name);
if(remove(name) != -1 || issymlink(name))
dirbuf[i].qid.type = QTFILE; /* so we won't recurse */
else{
if(dirbuf[i].qid.type & QTDIR)
ndir++;
else
err(name);
}
}
if(ndir)
for(j=0; j<n; j++)
if(dirbuf[j].qid.type & QTDIR){
snprint(name, nname, "%s/%s", f, dirbuf[j].name);
rmdir(name);
}
if(remove(f) == -1)
err(f);
free(name);
free(dirbuf);
}
void
main(int argc, char *argv[])
{
int i;
int recurse;
char *f;
Dir *db;
ignerr = 0;
recurse = 0;
ARGBEGIN{
case 'r':
recurse = 1;
break;
case 'f':
ignerr = 1;
break;
default:
fprint(2, "usage: rm [-fr] file ...\n");
exits("usage");
}ARGEND
for(i=0; i<argc; i++){
f = argv[i];
if(remove(f) != -1)
continue;
db = nil;
if(recurse && (db=dirstat(f))!=nil && (db->qid.type&QTDIR))
rmdir(f);
else
err(f);
free(db);
}
exits(errbuf);
}
|