Relicense Sortix to the ISC license.
I hereby relicense all my work on Sortix under the ISC license as below.
All Sortix contributions by other people are already under this license,
are not substantial enough to be copyrightable, or have been removed.
All imported code from other projects is compatible with this license.
All GPL licensed code from other projects had previously been removed.
Copyright 2011-2016 Jonas 'Sortie' Termansen and contributors.
Permission to use, copy, modify, and distribute this software for any
purpose with or without fee is hereby granted, provided that the above
copyright notice and this permission notice appear in all copies.
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
2016-03-02 17:38:16 -05:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2012 Jonas 'Sortie' Termansen.
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software for any
|
|
|
|
* purpose with or without fee is hereby granted, provided that the above
|
|
|
|
* copyright notice and this permission notice appear in all copies.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
|
|
|
|
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
|
|
|
|
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
|
|
|
|
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
|
|
|
|
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
|
|
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
|
|
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
|
|
|
|
*
|
|
|
|
* rm.c
|
|
|
|
* Remove files or directories.
|
|
|
|
*/
|
2012-03-11 10:57:13 -04:00
|
|
|
|
2012-10-23 07:52:07 -04:00
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
|
|
|
|
#include <dirent.h>
|
2011-11-22 11:26:47 -05:00
|
|
|
#include <errno.h>
|
2011-11-26 05:00:45 -05:00
|
|
|
#include <error.h>
|
2012-10-23 07:52:07 -04:00
|
|
|
#include <fcntl.h>
|
2016-02-28 18:40:20 -05:00
|
|
|
#include <stdbool.h>
|
2012-10-23 07:52:07 -04:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
|
|
|
|
// TODO: Wrong implementation of -f! It means ignore *nonexistent files*, not
|
|
|
|
// ignore all errors!
|
|
|
|
|
|
|
|
int DupHandleCWD(int fd)
|
|
|
|
{
|
|
|
|
if ( fd == AT_FDCWD )
|
|
|
|
return open(".", O_RDONLY);
|
|
|
|
return dup(fd);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool RemoveRecursively(int dirfd, const char* full, const char* rel,
|
|
|
|
bool force, bool verbose)
|
|
|
|
{
|
|
|
|
if ( unlinkat(dirfd, rel, 0) == 0 )
|
|
|
|
{
|
|
|
|
if ( verbose )
|
|
|
|
fprintf(stderr, "removed `%s'\n", full);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if ( errno != EISDIR )
|
|
|
|
{
|
|
|
|
if ( force && errno == ENOENT )
|
|
|
|
return true;
|
|
|
|
error(0, errno, "cannot remove: %s", full);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if ( unlinkat(dirfd, rel, AT_REMOVEDIR) == 0 )
|
|
|
|
{
|
|
|
|
if ( verbose )
|
|
|
|
fprintf(stderr, "removed `%s'\n", full);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if ( errno != ENOTEMPTY )
|
|
|
|
{
|
|
|
|
if ( force && errno == ENOENT )
|
|
|
|
return true;
|
|
|
|
error(0, errno, "cannot remove: %s", full);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
int targetfd = openat(dirfd, rel, O_RDONLY | O_DIRECTORY);
|
|
|
|
if ( targetfd < 0 )
|
|
|
|
{
|
|
|
|
if ( force && errno == ENOENT )
|
|
|
|
return true;
|
|
|
|
error(0, errno, "cannot open: %s", full);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
DIR* dir = fdopendir(targetfd);
|
|
|
|
if ( !dir )
|
|
|
|
{
|
|
|
|
error(0, errno, "fdopendir");
|
|
|
|
close(targetfd);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
bool ret = true;
|
2016-02-28 18:40:20 -05:00
|
|
|
struct dirent* entry;
|
|
|
|
while ( (entry = readdir(dir)) )
|
2012-10-23 07:52:07 -04:00
|
|
|
{
|
|
|
|
const char* name = entry->d_name;
|
|
|
|
if ( strcmp(name, ".") == 0 || strcmp(name, "..") == 0 )
|
|
|
|
continue;
|
2016-02-28 18:40:20 -05:00
|
|
|
char* newfull = (char*) malloc(strlen(full) + 1 + strlen(entry->d_name) + 1);
|
2012-10-23 07:52:07 -04:00
|
|
|
bool addslash = !full[0] || full[strlen(full)-1] != '/';
|
|
|
|
stpcpy(stpcpy(stpcpy(newfull, full), addslash ? "/" : ""), name);
|
|
|
|
bool ok = RemoveRecursively(targetfd, newfull, name, false, verbose);
|
2016-02-28 18:40:20 -05:00
|
|
|
free(newfull);
|
2012-10-23 07:52:07 -04:00
|
|
|
rewinddir(dir);
|
|
|
|
if ( !ok ) { ret = false; break; }
|
|
|
|
}
|
|
|
|
closedir(dir);
|
|
|
|
if ( ret )
|
|
|
|
{
|
|
|
|
if ( unlinkat(dirfd, rel, AT_REMOVEDIR) == 0 )
|
|
|
|
{
|
|
|
|
if ( verbose )
|
|
|
|
fprintf(stderr, "removed `%s'\n", full);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( !force || errno == ENOENT )
|
|
|
|
{
|
|
|
|
error(0, errno, "cannot remove: %s", full);
|
|
|
|
ret = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2015-07-29 19:08:49 -04:00
|
|
|
static void compact_arguments(int* argc, char*** argv)
|
|
|
|
{
|
|
|
|
for ( int i = 0; i < *argc; i++ )
|
|
|
|
{
|
|
|
|
while ( i < *argc && !(*argv)[i] )
|
|
|
|
{
|
|
|
|
for ( int n = i; n < *argc; n++ )
|
|
|
|
(*argv)[n] = (*argv)[n+1];
|
|
|
|
(*argc)--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void help(FILE* fp, const char* argv0)
|
2012-10-23 07:52:07 -04:00
|
|
|
{
|
|
|
|
fprintf(fp, "Usage: %s [OPTION]... FILE...\n", argv0);
|
|
|
|
fprintf(fp, "Remove files by unlinking their directory entries.\n");
|
|
|
|
}
|
|
|
|
|
2015-07-29 19:08:49 -04:00
|
|
|
static void version(FILE* fp, const char* argv0)
|
2012-10-23 07:52:07 -04:00
|
|
|
{
|
|
|
|
fprintf(fp, "%s (Sortix) %s\n", argv0, VERSIONSTR);
|
|
|
|
}
|
2011-11-21 12:49:55 -05:00
|
|
|
|
|
|
|
int main(int argc, char* argv[])
|
|
|
|
{
|
2012-10-23 07:52:07 -04:00
|
|
|
const char* argv0 = argv[0];
|
|
|
|
bool force = false;
|
|
|
|
bool recursive = false;
|
|
|
|
bool verbose = false;
|
|
|
|
for ( int i = 1; i < argc; i++ )
|
|
|
|
{
|
|
|
|
const char* arg = argv[i];
|
2015-07-29 19:08:49 -04:00
|
|
|
if ( arg[0] != '-' || !arg[1] )
|
2012-10-23 07:52:07 -04:00
|
|
|
continue;
|
|
|
|
argv[i] = NULL;
|
|
|
|
if ( !strcmp(arg, "--") )
|
|
|
|
break;
|
|
|
|
if ( arg[1] != '-' )
|
2015-07-29 19:08:49 -04:00
|
|
|
{
|
2016-02-28 18:40:20 -05:00
|
|
|
char c;
|
|
|
|
while ( (c = *++arg) ) switch ( c )
|
2015-07-29 19:08:49 -04:00
|
|
|
{
|
|
|
|
case 'f': force = true; break;
|
|
|
|
case 'r': recursive = true; break;
|
|
|
|
case 'R': recursive = true; break;
|
|
|
|
case 'v': verbose = true; break;
|
|
|
|
default:
|
2015-12-27 20:03:04 -05:00
|
|
|
fprintf(stderr, "%s: unknown option -- '%c'\n", argv0, c);
|
2015-07-29 19:08:49 -04:00
|
|
|
help(stderr, argv0);
|
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
2012-10-23 07:52:07 -04:00
|
|
|
else if ( !strcmp(arg, "--force") )
|
|
|
|
force = true;
|
|
|
|
else if ( !strcmp(arg, "--recursive") )
|
|
|
|
recursive = true;
|
|
|
|
else if ( !strcmp(arg, "--verbose") )
|
|
|
|
verbose = true;
|
2015-07-29 19:08:49 -04:00
|
|
|
else if ( !strcmp(arg, "--help") )
|
|
|
|
help(stdout, argv0), exit(0);
|
|
|
|
else if ( !strcmp(arg, "--version") )
|
|
|
|
version(stdout, argv0), exit(0);
|
2012-10-23 07:52:07 -04:00
|
|
|
else
|
|
|
|
{
|
|
|
|
fprintf(stderr, "%s: unknown option: %s\n", argv0, arg);
|
2015-07-29 19:08:49 -04:00
|
|
|
help(stderr, argv0);
|
2012-10-23 07:52:07 -04:00
|
|
|
exit(1);
|
|
|
|
}
|
|
|
|
}
|
2011-11-21 12:49:55 -05:00
|
|
|
|
2015-07-29 19:08:49 -04:00
|
|
|
compact_arguments(&argc, &argv);
|
2012-10-23 07:52:07 -04:00
|
|
|
|
2015-07-29 19:08:49 -04:00
|
|
|
if ( argc < 2 && !force )
|
|
|
|
error(1, 0, "missing operand");
|
2011-11-21 12:49:55 -05:00
|
|
|
|
2012-10-23 07:52:07 -04:00
|
|
|
int main_ret = 0;
|
2011-11-21 12:49:55 -05:00
|
|
|
for ( int i = 1; i < argc; i++ )
|
|
|
|
{
|
2012-10-23 07:52:07 -04:00
|
|
|
const char* arg = argv[i];
|
|
|
|
if ( unlink(arg) < 0 )
|
|
|
|
{
|
|
|
|
if ( !recursive || errno != EISDIR )
|
|
|
|
{
|
|
|
|
if ( force && errno == ENOENT )
|
|
|
|
continue;
|
|
|
|
error(0, errno, "cannot remove: %s", arg);
|
|
|
|
main_ret = 1;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if ( !RemoveRecursively(AT_FDCWD, arg, arg, force, verbose) )
|
|
|
|
{
|
|
|
|
main_ret = 1;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
2011-11-21 12:49:55 -05:00
|
|
|
{
|
2012-10-23 07:52:07 -04:00
|
|
|
if ( verbose )
|
|
|
|
fprintf(stderr, "removed `%s'\n", arg);
|
2011-11-21 12:49:55 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-10-23 07:52:07 -04:00
|
|
|
return main_ret;
|
2011-11-21 12:49:55 -05:00
|
|
|
}
|