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
|
/*
* Copyright (c) 2020, Stijn De Ridder <stijn.deridder@hotmail.com>
* 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/LexicalPath.h>
#include <AK/LogStream.h>
#include <AK/QuickSort.h>
#include <AK/String.h>
#include <AK/StringBuilder.h>
#include <AK/Vector.h>
#include <LibCore/ArgsParser.h>
#include <LibCore/DirIterator.h>
#include <cstdio>
#include <sys/stat.h>
static bool flag_show_hidden_files = false;
static bool flag_show_only_directories = false;
static int max_depth = INT_MAX;
static int g_directories_seen = 0;
static int g_files_seen = 0;
static void print_directory_tree(const String& root_path, int depth, const String& indent_string)
{
if (depth > 0) {
String root_indent_string;
if (depth > 1) {
root_indent_string = indent_string.substring(0, (depth - 1) * 4);
} else {
root_indent_string = "";
}
out("{}|-- ", root_indent_string);
}
String root_dir_name = AK::LexicalPath(root_path).basename();
out("\033[34;1m{}\033[0m\n", root_dir_name);
if (depth >= max_depth) {
return;
}
Core::DirIterator di(root_path, flag_show_hidden_files ? Core::DirIterator::SkipParentAndBaseDir : Core::DirIterator::SkipDots);
if (di.has_error()) {
warnln("{}: {}", root_path, di.error_string());
return;
}
Vector<String> names;
while (di.has_next()) {
String name = di.next_path();
if (di.has_error()) {
warnln("{}: {}", root_path, di.error_string());
continue;
}
names.append(name);
}
quick_sort(names);
for (size_t i = 0; i < names.size(); i++) {
String name = names[i];
StringBuilder builder;
builder.append(root_path);
if (!root_path.ends_with('/')) {
builder.append('/');
}
builder.append(name);
String full_path = builder.to_string();
struct stat st;
int rc = lstat(full_path.characters(), &st);
if (rc == -1) {
warnln("lstat({}) failed: {}", full_path, strerror(errno));
continue;
}
if (S_ISDIR(st.st_mode)) {
g_directories_seen++;
bool at_last_entry = i == names.size() - 1;
String new_indent_string;
if (at_last_entry) {
new_indent_string = String::formatted("{} ", indent_string);
} else {
new_indent_string = String::formatted("{}| ", indent_string);
}
print_directory_tree(full_path.characters(), depth + 1, new_indent_string);
} else if (!flag_show_only_directories) {
g_files_seen++;
outln("{}|-- {}", indent_string, name);
}
}
}
int main(int argc, char** argv)
{
if (pledge("stdio rpath tty", nullptr) < 0) {
perror("pledge");
return 1;
}
Vector<const char*> directories;
Core::ArgsParser args_parser;
args_parser.add_option(flag_show_hidden_files, "Show hidden files", "all", 'a');
args_parser.add_option(flag_show_only_directories, "Show only directories", "only-directories", 'd');
args_parser.add_option(max_depth, "Maximum depth of the tree", "maximum-depth", 'L', "level");
args_parser.add_positional_argument(directories, "Directories to print", "directories", Core::ArgsParser::Required::No);
args_parser.parse(argc, argv);
if (max_depth < 1) {
warnln("{}: Invalid level, must be greater than 0.", argv[0]);
return 1;
}
if (directories.is_empty()) {
print_directory_tree(".", 0, "");
puts("");
} else {
for (const char* directory : directories) {
print_directory_tree(directory, 0, "");
puts("");
}
}
outln("{} directories, {} files", g_directories_seen, g_files_seen);
return 0;
}
|
