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
|
use crate::{crossdev, InodeFilter, WalkOptions, WalkResult};
use anyhow::Result;
use colored::{Color, Colorize};
use filesize::PathExt;
use std::time::Duration;
use std::{
borrow::Cow,
io,
path::Path,
sync::{
atomic::{AtomicU64, Ordering},
Arc,
},
thread,
};
/// Aggregate the given `paths` and write information about them to `out` in a human-readable format.
/// If `compute_total` is set, it will write an additional line with the total size across all given `paths`.
/// If `sort_by_size_in_bytes` is set, we will sort all sizes (ascending) before outputting them.
pub fn aggregate(
mut out: impl io::Write,
err: Option<impl io::Write + Send + 'static>,
walk_options: WalkOptions,
compute_total: bool,
sort_by_size_in_bytes: bool,
paths: impl IntoIterator<Item = impl AsRef<Path>>,
) -> Result<(WalkResult, Statistics)> {
let mut res = WalkResult::default();
let mut stats = Statistics {
smallest_file_in_bytes: u128::max_value(),
..Default::default()
};
let mut total = 0;
let mut num_roots = 0;
let mut aggregates = Vec::new();
let mut inodes = InodeFilter::default();
let paths: Vec<_> = paths.into_iter().collect();
let shared_count = Arc::new(AtomicU64::new(0));
if let Some(mut err) = err {
thread::spawn({
let shared_count = Arc::clone(&shared_count);
move || {
thread::sleep(Duration::from_secs(1));
loop {
thread::sleep(Duration::from_millis(100));
write!(
err,
"Enumerating {} entries\r",
shared_count.load(Ordering::Acquire)
)
.ok();
}
}
});
}
rayon::ThreadPoolBuilder::new()
.num_threads(8)
.build_global()
.unwrap();
fn recursive_descent(
root: impl AsRef<Path>,
cb: impl Fn(&Path, std::fs::Metadata) + Send + Sync + Copy,
) {
use rayon::prelude::*;
let root = root.as_ref();
match std::fs::symlink_metadata(root).map(|m| {
let is_dir = m.file_type().is_dir();
(m, is_dir)
}) {
Ok((metadata, is_dir)) => {
if is_dir {
std::fs::read_dir(root)
.map({
|iter| {
iter.filter_map(Result::ok)
.collect::<Vec<_>>()
.into_par_iter()
.map({ |entry| recursive_descent(entry.path(), cb) })
.for_each(|_| {})
}
})
.unwrap_or_default()
} else {
cb(root, metadata);
}
}
Err(_) => {}
};
}
for path in paths.into_iter() {
num_roots += 1;
let mut num_bytes = 0u128;
let mut num_errors = 0u64;
let device_id = crossdev::init(path.as_ref())?;
recursive_descent(path.as_ref(), |_path, _m| {});
// for entry in walk_options.iter_from_path(path.as_ref()) {
// stats.entries_traversed += 1;
// shared_count.fetch_add(1, Ordering::Relaxed);
// match entry {
// Ok(entry) => {
// let file_size = match entry.client_state {
// Some(Ok(ref m))
// if !m.is_dir()
// && (walk_options.count_hard_links || inodes.add(m))
// && (walk_options.cross_filesystems
// || crossdev::is_same_device(device_id, m)) =>
// {
// if walk_options.apparent_size {
// m.len()
// } else {
// entry.path().size_on_disk_fast(m).unwrap_or_else(|_| {
// num_errors += 1;
// 0
// })
// }
// }
// Some(Ok(_)) => 0,
// Some(Err(_)) => {
// num_errors += 1;
// 0
// }
// None => 0, // ignore directory
// } as u128;
// stats.largest_file_in_bytes = stats.largest_file_in_bytes.max(file_size);
// stats.smallest_file_in_bytes = stats.smallest_file_in_bytes.min(file_size);
// num_bytes += file_size;
// }
// Err(_) => num_errors += 1,
// }
// }
if sort_by_size_in_bytes {
aggregates.push((path.as_ref().to_owned(), num_bytes, num_errors));
} else {
output_colored_path(
&mut out,
&walk_options,
&path,
num_bytes,
num_errors,
path_color_of(&path),
)?;
}
total += num_bytes;
res.num_errors += num_errors;
}
if stats.entries_traversed == 0 {
stats.smallest_file_in_bytes = 0;
}
if sort_by_size_in_bytes {
aggregates.sort_by_key(|&(_, num_bytes, _)| num_bytes);
for (path, num_bytes, num_errors) in aggregates.into_iter() {
output_colored_path(
&mut out,
&walk_options,
&path,
num_bytes,
num_errors,
path_color_of(&path),
)?;
}
}
if num_roots > 1 && compute_total {
output_colored_path(
&mut out,
&walk_options,
Path::new("total"),
total,
res.num_errors,
None,
)?;
}
Ok((res, stats))
}
fn path_color_of(path: impl AsRef<Path>) -> Option<Color> {
if path.as_ref().is_file() {
None
} else {
Some(Color::Cyan)
}
}
fn output_colored_path(
out: &mut impl io::Write,
options: &WalkOptions,
path: impl AsRef<Path>,
num_bytes: u128,
num_errors: u64,
path_color: Option<colored::Color>,
) -> std::result::Result<(), io::Error> {
writeln!(
out,
"{:>byte_column_width$} {}{}",
options
.byte_format
.display(num_bytes)
.to_string()
.as_str()
.green(),
{
let path = path.as_ref().display().to_string();
match path_color {
Some(color) => path.color(color),
None => path.normal(),
}
},
if num_errors == 0 {
Cow::Borrowed("")
} else {
Cow::Owned(format!(
" <{} IO Error{}>",
num_errors,
if num_errors > 1 { "s" } else { "" }
))
},
byte_column_width = options.byte_format.width()
)
}
/// Statistics obtained during a filesystem walk
#[derive(Default, Debug)]
pub struct Statistics {
/// The amount of entries we have seen during filesystem traversal
pub entries_traversed: u64,
/// The size of the smallest file encountered in bytes
pub smallest_file_in_bytes: u128,
/// The size of the largest file encountered in bytes
pub largest_file_in_bytes: u128,
}
|
