mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-27 01:50:24 +00:00
0248ddc427
This enables a nice warning in case a function becomes dead code.
98 lines
3.2 KiB
C++
98 lines
3.2 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
* 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.
|
|
*
|
|
* 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 HOLDER 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 <AK/String.h>
|
|
#include <AK/StringBuilder.h>
|
|
#include <AK/Vector.h>
|
|
#include <LibCore/ArgsParser.h>
|
|
#include <LibCore/DirIterator.h>
|
|
#include <dirent.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <sys/stat.h>
|
|
#include <unistd.h>
|
|
|
|
static int remove(bool recursive, bool force, String path)
|
|
{
|
|
struct stat path_stat;
|
|
if (lstat(path.characters(), &path_stat) < 0) {
|
|
if (!force)
|
|
perror("lstat");
|
|
return 1;
|
|
}
|
|
|
|
if (S_ISDIR(path_stat.st_mode) && recursive) {
|
|
auto di = Core::DirIterator(path, Core::DirIterator::SkipParentAndBaseDir);
|
|
if (di.has_error()) {
|
|
if (!force)
|
|
fprintf(stderr, "DirIterator: %s\n", di.error_string());
|
|
return 1;
|
|
}
|
|
|
|
while (di.has_next()) {
|
|
int s = remove(true, force, di.next_full_path());
|
|
if (s != 0 && !force)
|
|
return s;
|
|
}
|
|
|
|
int s = rmdir(path.characters());
|
|
if (s < 0 && !force) {
|
|
perror("rmdir");
|
|
return 1;
|
|
}
|
|
} else {
|
|
int rc = unlink(path.characters());
|
|
if (rc < 0 && !force) {
|
|
perror("unlink");
|
|
return 1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
if (pledge("stdio rpath cpath", nullptr) < 0) {
|
|
perror("pledge");
|
|
return 1;
|
|
}
|
|
|
|
bool recursive = false;
|
|
bool force = false;
|
|
Vector<const char*> paths;
|
|
|
|
Core::ArgsParser args_parser;
|
|
args_parser.add_option(recursive, "Delete directories recursively", "recursive", 'r');
|
|
args_parser.add_option(force, "Force", "force", 'f');
|
|
args_parser.add_positional_argument(paths, "Path(s) to remove", "path");
|
|
args_parser.parse(argc, argv);
|
|
|
|
int rc = 0;
|
|
for (auto& path : paths) {
|
|
rc |= remove(recursive, force, path);
|
|
}
|
|
return rc;
|
|
}
|