dc0947da78
libmisc/remove_tree.c, libmisc/copydir.c: Split remove_tree() outside of copydir.c to avoid linking against libacl or libattr.
136 lines
3.5 KiB
C
136 lines
3.5 KiB
C
/*
|
|
* Copyright (c) 1991 - 1994, Julianne Frances Haugh
|
|
* Copyright (c) 1996 - 2001, Marek Michałkiewicz
|
|
* Copyright (c) 2003 - 2006, Tomasz Kłoczko
|
|
* Copyright (c) 2007 - 2010, Nicolas François
|
|
* All rights reserved.
|
|
*
|
|
* 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. The name of the copyright holders or contributors may not be used to
|
|
* endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT
|
|
* HOLDERS 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 <config.h>
|
|
|
|
#ident "$Id$"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <dirent.h>
|
|
#include <unistd.h>
|
|
#include "prototypes.h"
|
|
#include "defines.h"
|
|
|
|
/*
|
|
* remove_tree - delete a directory tree
|
|
*
|
|
* remove_tree() walks a directory tree and deletes all the files
|
|
* and directories.
|
|
* At the end, it deletes the root directory itself.
|
|
*/
|
|
|
|
int remove_tree (const char *root, bool remove_root)
|
|
{
|
|
char *new_name = NULL;
|
|
int err = 0;
|
|
struct DIRECT *ent;
|
|
struct stat sb;
|
|
DIR *dir;
|
|
|
|
/*
|
|
* Open the source directory and read each entry. Every file
|
|
* entry in the directory is copied with the UID and GID set
|
|
* to the provided values. As an added security feature only
|
|
* regular files (and directories ...) are copied, and no file
|
|
* is made set-ID.
|
|
*/
|
|
dir = opendir (root);
|
|
if (NULL == dir) {
|
|
return -1;
|
|
}
|
|
|
|
while ((ent = readdir (dir))) {
|
|
size_t new_len = strlen (root) + strlen (ent->d_name) + 2;
|
|
|
|
/*
|
|
* Skip the "." and ".." entries
|
|
*/
|
|
|
|
if (strcmp (ent->d_name, ".") == 0 ||
|
|
strcmp (ent->d_name, "..") == 0) {
|
|
continue;
|
|
}
|
|
|
|
/*
|
|
* Make the filename for the current entry.
|
|
*/
|
|
|
|
if (NULL != new_name) {
|
|
free (new_name);
|
|
}
|
|
new_name = (char *) malloc (new_len);
|
|
if (NULL == new_name) {
|
|
err = -1;
|
|
break;
|
|
}
|
|
snprintf (new_name, new_len, "%s/%s", root, ent->d_name);
|
|
if (LSTAT (new_name, &sb) == -1) {
|
|
continue;
|
|
}
|
|
|
|
if (S_ISDIR (sb.st_mode)) {
|
|
/*
|
|
* Recursively delete this directory.
|
|
*/
|
|
if (remove_tree (new_name, true) != 0) {
|
|
err = -1;
|
|
break;
|
|
}
|
|
} else {
|
|
/*
|
|
* Delete the file.
|
|
*/
|
|
if (unlink (new_name) != 0) {
|
|
err = -1;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
if (NULL != new_name) {
|
|
free (new_name);
|
|
}
|
|
(void) closedir (dir);
|
|
|
|
if (remove_root && (0 == err)) {
|
|
if (rmdir (root) != 0) {
|
|
err = -1;
|
|
}
|
|
}
|
|
|
|
return err;
|
|
}
|
|
|