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
|
mod widgets {
use super::{Tree, TreeIndex};
use petgraph::Direction;
use tui::buffer::Buffer;
use tui::layout::{Corner, Rect};
use tui::widgets::{Block, Borders, List, Text, Widget};
pub struct Entries<'a> {
pub tree: &'a Tree,
pub root: TreeIndex,
}
impl<'a> Widget for Entries<'a> {
fn draw(&mut self, area: Rect, buf: &mut Buffer) {
let Self { tree, root } = self;
List::new(
tree.neighbors_directed(*root, Direction::Outgoing)
.filter_map(|w| {
tree.node_weight(w).map(|w| {
Text::Raw(
format!("{} | ----- | {}", w.size, w.name.to_string_lossy()).into(),
)
})
}),
)
.block(Block::default().borders(Borders::ALL).title("Entries"))
.start_corner(Corner::TopLeft)
.draw(area, buf);
}
}
}
mod app {
use crate::{WalkOptions, WalkResult};
use failure::Error;
use petgraph::{prelude::NodeIndex, Directed, Direction, Graph};
use std::time::{Duration, Instant};
use std::{ffi::OsString, io, path::PathBuf};
use termion::input::{Keys, TermReadEventsAndRaw};
use tui::widgets::Widget;
use tui::{backend::Backend, Terminal};
pub type TreeIndexType = u32;
pub type TreeIndex = NodeIndex<TreeIndexType>;
pub type Tree = Graph<EntryData, (), Directed, TreeIndexType>;
#[derive(Eq, PartialEq, Debug, Default)]
pub struct EntryData {
pub name: OsString,
/// The entry's size in bytes. If it's a directory, the size is the aggregated file size of all children
pub size: u64,
/// If set, the item meta-data could not be obtained
pub metadata_io_error: bool,
}
/// State and methods representing the interactive disk usage analyser for the terminal
#[derive(Default, Debug)]
pub struct TerminalApp {
/// A tree representing the entire filestem traversal
pub tree: Tree,
/// The top-level node of the tree.
pub root_index: TreeIndex,
/// Amount of files or directories we have seen during the filesystem traversal
pub entries_traversed: u64,
/// Total amount of IO errors encountered when traversing the filesystem
pub io_errors: u64,
}
const GUI_REFRESH_RATE: Duration = Duration::from_millis(100);
impl TerminalApp {
pub fn process_events<B, R>(
&mut self,
_terminal: &mut Terminal<B>,
_keys: Keys<R>,
) -> Result<WalkResult, Error>
where
B: Backend,
R: io::Read + TermReadEventsAndRaw,
{
unimplemented!()
}
pub fn initialize<B>(
terminal: &mut Terminal<B>,
options: WalkOptions,
input: Vec<PathBuf>,
) -> Result<TerminalApp, Error>
where
B: Backend,
{
fn set_size_or_panic(
tree: &mut Tree,
parent_node_idx: TreeIndex,
current_size_at_depth: u64,
) {
tree.node_weight_mut(parent_node_idx)
.expect("node for parent index we just retrieved")
.size = current_size_at_depth;
}
fn parent_or_panic(tree: &mut Tree, parent_node_idx: TreeIndex) -> TreeIndex {
tree.neighbors_directed(parent_node_idx, Direction::Incoming)
.next()
.expect("every node in the iteration has a parent")
}
fn pop_or_panic(v: &mut Vec<u64>) -> u64 {
v.pop().expect("sizes per level to be in sync with graph")
}
let mut tree = Tree::new();
let mut io_errors = 0u64;
let mut entries_traversed = 0u64;
let root_index = tree.add_node(EntryData::default());
let (mut previous_node_idx, mut parent_node_idx) = (root_index, root_index);
let mut sizes_per_depth_level = Vec::new();
let mut current_size_at_depth = 0;
let mut previous_depth = 0;
let mut last_checked = Instant::now();
const INITIAL_CHECK_INTERVAL: usize = 500;
let mut check_instant_every = INITIAL_CHECK_INTERVAL;
let mut last_seen_eid;
for path in input.into_iter() {
last_seen_eid = 0;
for (eid, entry) in options
.iter_from_path(path.as_ref())
.into_iter()
.enumerate()
{
entries_traversed += 1;
let mut data = EntryData::default();
match entry {
Ok(entry) => {
data.name = entry.file_name;
let file_size = match entry.metadata {
Some(Ok(ref m)) if !m.is_dir() => m.len(),
Some(Ok(_)) => 0,
Some(Err(_)) => {
io_errors += 1;
data.metadata_io_error = true;
0
}
None => unreachable!(
"we ask for metadata, so we at least have Some(Err(..))). Issue in jwalk?"
),
};
match (entry.depth, previous_depth) {
(n, p) if n > p => {
sizes_per_depth_level.push(current_size_at_depth);
current_size_at_depth = file_size;
parent_node_idx = previous_node_idx;
}
(n, p) if n < p => {
for _ in n..p {
set_size_or_panic(
&mut tree,
parent_node_idx,
current_size_at_depth,
);
current_size_at_depth +=
pop_or_panic(&mut sizes_per_depth_level);
parent_node_idx =
parent_or_panic(&mut tree, parent_node_idx);
}
current_size_at_depth += file_size;
set_size_or_panic(
&mut tree,
parent_node_idx,
current_size_at_depth,
);
}
_ => {
current_size_at_depth += file_size;
}
};
data.size = file_size;
let entry_index = tree.add_node(data);
tree.add_edge(parent_node_idx, entry_index, ());
previous_node_idx = entry_index;
previous_depth = entry.depth;
}
Err(_) => io_errors += 1,
}
if eid != 0
&& eid % check_instant_every == 0
&& last_checked.elapsed() >= GUI_REFRESH_RATE
{
let now = Instant::now();
let elapsed = (now - last_checked).as_millis() as f64;
check_instant_every = (INITIAL_CHECK_INTERVAL as f64
* ((eid - last_seen_eid) as f64 / INITIAL_CHECK_INTERVAL as f64)
* (GUI_REFRESH_RATE.as_millis() as f64 / elapsed))
as usize;
last_seen_eid = eid;
last_checked = now;
terminal.draw(|mut f| {
let full_screen = f.size();
super::widgets::Entries {
tree: &tree,
root: root_index,
}
.render(&mut f, full_screen)
})?;
}
}
}
sizes_per_depth_level.push(current_size_at_depth);
current_size_at_depth = 0;
for _ in 0..previous_depth {
current_size_at_depth += pop_or_panic(&mut sizes_per_depth_level);
set_size_or_panic(&mut tree, parent_node_idx, current_size_at_depth);
parent_node_idx = parent_or_panic(&mut tree, parent_node_idx);
}
set_size_or_panic(&mut tree, root_index, current_size_at_depth);
Ok(TerminalApp {
tree,
root_index,
entries_traversed,
io_errors,
})
}
}
}
pub use self::app::*;
|
