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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
|
/* `rm' file deletion utility for GNU.
Copyright (C) 1988, 1990, 1991 Free Software Foundation, Inc.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
/* Written by Paul Rubin, David MacKenzie, and Richard Stallman. */
#include <stdio.h>
#include <getopt.h>
#include <sys/types.h>
#include "system.h"
#ifdef _POSIX_SOURCE
/* POSIX.1 doesn't have inodes, so fake them to avoid lots of ifdefs. */
#define ino_t unsigned long
#define D_INO(dp) 1
#else
#define D_INO(dp) ((dp)->d_ino)
#endif
char *basename ();
char *stpcpy ();
char *xmalloc ();
char *xrealloc ();
int eaccess_stat ();
int yesno ();
void error ();
void strip_trailing_slashes ();
static int clear_directory ();
static int duplicate_entry ();
static int remove_dir ();
static int remove_file ();
static int rm ();
static void usage ();
/* Path of file now being processed; extended as necessary. */
static char *pathname;
/* Number of bytes currently allocated for `pathname';
made larger when necessary, but never smaller. */
static int pnsize;
/* Name this program was run with. */
char *program_name;
/* If nonzero, display the name of each file removed. */
static int verbose;
/* If nonzero, ignore nonexistant files. */
static int ignore_missing_files;
/* If nonzero, recursively remove directories. */
static int recursive;
/* If nonzero, query the user about whether to remove each file. */
static int interactive;
/* If nonzero, remove directories with unlink instead of rmdir, and don't
require a directory to be empty before trying to unlink it.
Only works for the super-user. */
static int unlink_dirs;
/* If nonzero, stdin is a tty. */
static int stdin_tty;
static struct option const long_opts[] =
{
{"directory", 0, &unlink_dirs, 1},
{"force", 0, NULL, 'f'},
{"interactive", 0, NULL, 'i'},
{"recursive", 0, &recursive, 1},
{"verbose", 0, &verbose, 1},
{NULL, 0, NULL, 0}
};
void
main (argc, argv)
int argc;
char **argv;
{
int err = 0;
int c;
verbose = ignore_missing_files = recursive = interactive
= unlink_dirs = 0;
pnsize = 256;
pathname = xmalloc (pnsize);
program_name = argv[0];
while ((c = getopt_long (argc, argv, "dfirvR", long_opts, (int *) 0)) != EOF)
{
switch (c)
{
case 0: /* Long option. */
break;
case 'd':
unlink_dirs = 1;
break;
case 'f':
interactive = 0;
ignore_missing_files = 1;
break;
case 'i':
interactive = 1;
ignore_missing_files = 0;
break;
case 'r':
case 'R':
recursive = 1;
break;
case 'v':
verbose = 1;
break;
default:
usage ();
}
}
if (optind == argc)
usage ();
stdin_tty = isatty (0);
for (; optind < argc; optind++)
{
int len;
/* Stripping slashes is harmless for rmdir;
if the arg is not a directory, it will fail with ENOTDIR. */
strip_trailing_slashes (argv[optind]);
len = strlen (argv[optind]);
if (len + 1 > pnsize)
{
free (pathname);
pnsize = 2 * (len + 1);
pathname = xmalloc (pnsize);
}
strcpy (pathname, argv[optind]);
err += rm ();
}
exit (err > 0);
}
/* Remove file or directory `pathname' after checking appropriate things.
Return 0 if `pathname' is removed, 1 if not. */
static int
rm ()
{
struct stat path_stats;
char *base = basename (pathname);
if (base[0] == '.' && (base[1] == '\0'
|| (base[1] == '.' && base[2] == '\0')))
{
error (0, 0, "cannot remove `.' or `..'");
return 1;
}
if (lstat (pathname, &path_stats))
{
if (errno == ENOENT && ignore_missing_files)
return 0;
error (0, errno, "%s", pathname);
return 1;
}
if (S_ISDIR (path_stats.st_mode) && !unlink_dirs)
return remove_dir (&path_stats);
else
return remove_file (&path_stats);
}
/* Query the user if appropriate, and if ok try to remove the
non-directory `pathname', which STATP contains info about.
Return 0 if `pathname' is removed, 1 if not. */
static int
remove_file (statp)
struct stat *statp;
{
if (!ignore_missing_files && (interactive || stdin_tty)
&& eaccess_stat (statp, W_OK))
{
fprintf (stderr, "%s: remove %s`%s', overriding mode %04o? ",
program_name,
S_ISDIR (statp->st_mode) ? "directory " : "",
pathname,
statp->st_mode & 07777);
if (!yesno ())
return 1;
}
else if (interactive)
{
fprintf (stderr, "%s: remove %s`%s'? ", program_name,
S_ISDIR (statp->st_mode) ? "directory " : "",
pathname);
if (!yesno ())
return 1;
}
if (verbose)
printf ("%s\n", pathname);
if (unlink (pathname) && (errno != ENOENT || !ignore_missing_files))
{
error (0, errno, "%s", pathname);
return 1;
}
return 0;
}
/* If not in recursive mode, print an error message and return 1.
Otherwise, query the user if appropriate, then try to recursively
remove directory `pathname', which STATP contains info about.
Return 0 if `pathname' is removed, 1 if not. */
static int
remove_dir (statp)
struct stat *statp;
{
int err;
if (!recursive)
{
error (0, 0, "%s: is a directory", pathname);
return 1;
}
if (!ignore_missing_files && (interactive || stdin_tty)
&& eaccess_stat (statp, W_OK))
{
fprintf (stderr,
"%s: descend directory `%s', overriding mode %04o? ",
program_name, pathname, statp->st_mode & 07777);
if (!yesno ())
return 1;
}
else if (interactive)
{
fprintf (stderr, "%s: descend directory `%s'? ",
program_name, pathname);
if (!yesno ())
return 1;
}
if (verbose)
printf ("%s\n", pathname);
err = clear_directory (statp);
if (interactive)
{
if (err)
fprintf (stderr, "%s: remove directory `%s' (might be nonempty)? ",
program_name, pathname);
else
fprintf (stderr, "%s: remove directory `%s'? ",
program_name, pathname);
if (!yesno ())
return 1;
}
if (rmdir (pathname) && (errno != ENOENT || !ignore_missing_files))
{
error (0, errno, "%s", pathname);
return 1;
}
return 0;
}
/* An element in a stack of pointers into `pathname'.
`pathp' points to where in `pathname' the terminating '\0' goes
for this level's directory name. */
struct pathstack
{
struct pathstack *next;
char *pathp;
ino_t inum;
};
/* Linked list of pathnames of directories in progress in recursive rm.
The entries actually contain pointers into `pathname'.
`pathstack' is the current deepest level. */
static struct pathstack *pathstack = NULL;
/* Read directory `pathname' and remove all of its entries,
avoiding use of chdir.
On entry, STATP points to the results of stat on `pathname'.
Return 0 for success, error count for failure.
Upon return, `pathname' will have the same contents as before,
but its address might be different; in that case, `pnsize' will
be larger, as well. */
static int
clear_directory (statp)
struct stat *statp;
{
DIR *dirp;
struct direct *dp;
char *name_space; /* Copy of directory's filenames. */
char *namep; /* Current entry in `name_space'. */
unsigned name_size; /* Bytes allocated for `name_space'. */
int name_length; /* Length of filename in `namep' plus '\0'. */
int pathname_length; /* Length of `pathname'. */
ino_t *inode_space; /* Copy of directory's inodes. */
ino_t *inodep; /* Current entry in `inode_space'. */
unsigned inode_size; /* Bytes allocated for `inode_space'. */
int err = 0; /* Return status. */
struct pathstack pathframe; /* New top of stack. */
struct pathstack *pp; /* Temporary. */
name_size = statp->st_size;
name_space = (char *) xmalloc (name_size);
inode_size = statp->st_size;
inode_space = (ino_t *) xmalloc (inode_size);
do
{
namep = name_space;
inodep = inode_space;
errno = 0;
dirp = opendir (pathname);
if (dirp == NULL)
{
if (errno != ENOENT || !ignore_missing_files)
{
error (0, errno, "%s", pathname);
err = 1;
}
free (name_space);
free (inode_space);
return err;
}
while ((dp = readdir (dirp)) != NULL)
{
/* Skip "." and ".." (some NFS filesystems' directories lack them). */
if (dp->d_name[0] != '.'
|| (dp->d_name[1] != '\0'
&& (dp->d_name[1] != '.' || dp->d_name[2] != '\0')))
{
unsigned size_needed = (namep - name_space) + NLENGTH (dp) + 2;
if (size_needed > name_size)
{
char *new_name_space;
while (size_needed > name_size)
name_size += 1024;
new_name_space = xrealloc (name_space, name_size);
namep += new_name_space - name_space;
name_space = new_name_space;
}
namep = stpcpy (namep, dp->d_name) + 1;
if (inodep == inode_space + inode_size)
{
ino_t *new_inode_space;
inode_size += 1024;
new_inode_space = (ino_t *) xrealloc (inode_space, inode_size);
inodep += new_inode_space - inode_space;
inode_space = new_inode_space;
}
*inodep++ = D_INO (dp);
}
}
*namep = '\0';
if (CLOSEDIR (dirp))
{
error (0, errno, "%s", pathname);
err = 1;
}
pathname_length = strlen (pathname);
for (namep = name_space, inodep = inode_space; *namep != '\0';
namep += name_length, inodep++)
{
name_length = strlen (namep) + 1;
/* Satisfy GNU requirement that filenames can be arbitrarily long. */
if (pathname_length + 1 + name_length > pnsize)
{
char *new_pathname;
pnsize = (pathname_length + 1 + name_length) * 2;
new_pathname = xrealloc (pathname, pnsize);
/* Update the all the pointers in the stack to use the new area. */
for (pp = pathstack; pp != NULL; pp = pp->next)
pp->pathp += new_pathname - pathname;
pathname = new_pathname;
}
/* Add a new frame to the top of the path stack. */
pathframe.pathp = pathname + pathname_length;
pathframe.inum = *inodep;
pathframe.next = pathstack;
pathstack = &pathframe;
/* Append '/' and the filename to current pathname, take care of the
file (which could result in recursive calls), and take the filename
back off. */
*pathstack->pathp = '/';
strcpy (pathstack->pathp + 1, namep);
/* If the i-number has already appeared, there's an error. */
if (duplicate_entry (pathstack->next, pathstack->inum))
err++;
else if (rm ())
err++;
*pathstack->pathp = '\0';
pathstack = pathstack->next; /* Pop the stack. */
}
}
/* Keep trying while there are still files to remove. */
while (namep > name_space && err == 0);
free (name_space);
free (inode_space);
return err;
}
/* If STACK does not already have an entry with the same i-number as INUM,
return 0. Otherwise, ask the user whether to continue;
if yes, return 1, and if no, exit.
This assumes that no one tries to remove filesystem mount points;
doing so could cause duplication of i-numbers that would not indicate
a corrupted file system. */
static int
duplicate_entry (stack, inum)
struct pathstack *stack;
ino_t inum;
{
#ifndef _POSIX_SOURCE
struct pathstack *p;
for (p = stack; p != NULL; p = p->next)
{
if (p->inum == inum)
{
fprintf (stderr, "\
%s: WARNING: Circular directory structure.\n\
This almost certainly means that you have a corrupted file system.\n\
NOTIFY YOUR SYSTEM MANAGER.\n\
Cycle detected:\n\
%s\n\
is the same file as\n", program_name, pathname);
*p->pathp = '\0'; /* Truncate pathname. */
fprintf (stderr, "%s\n", pathname);
*p->pathp = '/'; /* Put it back. */
if (interactive)
{
fprintf (stderr, "%s: continue? ", program_name);
if (!yesno ())
exit (1);
return 1;
}
else
exit (1);
}
}
#endif
return 0;
}
static void
usage ()
{
fprintf (stderr, "\
Usage: %s [-dfirvR] [--directory] [--force] [--interactive] [--recursive]\n\
[--verbose] path...\n",
program_name);
exit (1);
}
|