- Jul 14, 2021
-
-
Yorhel authored
-
- Jul 13, 2021
-
-
Yorhel authored
This complicated the scan code more than I had anticipated and has a few inherent bugs with respect to calculating shared hardlink sizes. Still, the merge approach avoids creating a full copy of the subtree, so that's another memory usage related win compared to the C version. On the other hand, it does leak memory if nodes can't be reused. Not quite as well tested as I should have, so I'm sure there's bugs.
-
- Jul 06, 2021
-
-
Yorhel authored
Two differences compared to the C version: - You can now select individual paths in the listing, pressing enter will open the selected path in the browser window. - Creating this listing is much slower and requires, in the worst case, a full traversal through the in-memory tree. I've tested this without the same-dev and shared-parent optimizations (i.e. worst case) on an import with 30M files and performance was still quite acceptable - the listing completed in a second - so I didn't bother adding a loading indicator. On slower systems and even larger trees this may be a little annoying, though. (also, calling nonl() apparently breaks detection of the return key, neither \n nor KEY_ENTER are emitted for some reason)
-
- Jun 11, 2021
-
-
Yorhel authored
Doesn't display the item's path anymore (seems rather redundant) but adds a few more other fields.
-
- Jun 07, 2021
-
-
Yorhel authored
The good news is: apart from this little thing, everything seems to just work(tm) on FreeBSD. Think I had more trouble with C because of minor header file differences.
-
Yorhel authored
I had used them as a HashSet with mutable keys already in order to avoid padding problems. This is not always necessary anymore now that Zig's new HashMap uses separate arrays for keys and values, but I still need the HashSet trick for the link_count nodes table, as the key itself would otherwise have padding.
-
- Jun 01, 2021
-
-
Yorhel authored
It still feels kind of sluggish, but not entirely sure how to improve it.
-
Yorhel authored
Under the assumption that there are no external references to files mentioned in the dump, i.e. a file's nlink count matches the number of times the file occurs in the dump. This machinery could also be used for regular scans, when you want to scan an individual directory without caring about external hard links. Maybe that should be the default, even? Not sure...
-
- May 30, 2021
-
-
Yorhel authored
-
- May 29, 2021
-
-
Yorhel authored
-
Yorhel authored
In a similar way to the C version of ncdu: by wrapping malloc(). It's simpler to handle allocation failures at the source to allow for easy retries, pushing the retries up the stack will complicate code somewhat more. Likewise, this is a best-effort approach to handling OOM, allocation failures in ncurses aren't handled and display glitches may occur when we get an OOM inside a drawing function. This is a somewhat un-Zig-like way of handling errors and adds scary-looking 'catch unreachable's all over the code, but that's okay.
-
Yorhel authored
Performance is looking great, but the code is rather ugly and potentially buggy. Also doesn't handle hard links without an "nlink" field yet. Error handling of the import code is different from what I've been doing until now. That's intentional, I'll change error handling of other pieces to call ui.die() directly rather than propagating error enums. The approach is less testable but conceptually simpler, it's perfectly fine for a tiny application like ncdu.
-
- May 24, 2021
-
-
Yorhel authored
-
- May 23, 2021
-
-
Yorhel authored
I plan to add more display options, but ran out of keys to bind. Probably going for a quick-select menu thingy so that we can keep the old key bindings for people accustomed to it. The graph width algorithm is slightly different, but I think this one's a minor improvement.
-
- May 12, 2021
-
- May 11, 2021
-
-
Yorhel authored
(+ 2 minor crash fixes due to out-of-bounds cursor_idx)
-
- May 09, 2021
-
-
Yorhel authored
-
- May 08, 2021
-
-
Yorhel authored
-
- May 07, 2021
-
-
Yorhel authored
Now we're getting somewhere. This works surprisingly well, too. Existing ncdu behavior is to remember which entry was previously selected but not which entry was displayed at the top, so the view would be slightly different when switching directories. This new approach remembers both the entry and the offset.
-
Yorhel authored
-
- May 06, 2021
-
-
Yorhel authored
I initially wanted to keep a directory's block count and size as a separate field so that exporting an in-memory tree to a JSON dump would be easier to do, but that doesn't seem like a common operation to optimize for. We'll probably need the algorithms to subtract sub-items from directory counts anyway, so such an export can still be implemented, albeit slower.
-
- May 05, 2021
-
-
Yorhel authored
libc locale-dependent APIs are pure madness, but I can't avoid them as long as I use ncurses. libtickit seems like a much saner alternative (at first glance), but no popular application seems to use it. :(
-
- May 03, 2021
-
-
Yorhel authored
Eaiser to implement now that we're linking against libc. But exclude pattern matching is extremely slow, so that should really be rewritten with a custom fnmatch implementation. It's exactly as slow as in ncdu 1.x as well, I'm surprised nobody's complained about it yet. And while I'm at it, supporting .gitignore-style patterns would be pretty neat, too.
-
Yorhel authored
I tried playing with zbox (pure Zig termbox-like lib) for a bit, but I don't think I want to have to deal with the terminal support issues that will inevitably come with it. I already stumbled upon one myself: it doesn't properly put the terminal in a sensible state after cleanup in tmux. As much as I dislike ncurses, it /is/ ubiquitous and tends to kind of work.
-
- May 01, 2021
-
-
Yorhel authored
-
- Apr 30, 2021
-
-
Yorhel authored
Supporting kernfs checking is going to be a bit more annoying. And so is exclude patterns. Ugh.
-
- Apr 29, 2021
-
-
Yorhel authored
-
Yorhel authored
The new data model is supposed to solve a few problems with ncdu 1.x's 'struct dir': - Reduce memory overhead, - Fix extremely slow counting of hard links in some scenarios (issue #121) - Add support for counting 'shared' data with other directories (issue #36) Quick memory usage comparison of my root directory with ~3.5 million files (normal / extended mode): ncdu 1.15.1: 379M / 451M new (unaligned): 145M / 178M new (aligned): 155M / 200M There's still a /lot/ of to-do's left before this is usable, however, and there's a bunch of issues I haven't really decided on yet, such as which TUI library to use. Backporting this data model to the C version of ncdu is also possible, but somewhat painful. Let's first see how far I get with Zig.
-
- Mar 04, 2021
-
-
Yorhel authored
Fixes #171
-
- Jul 12, 2020
-
-
Christian Göttsche authored
Use 'max(10, column_size / 7)' instead of a fixed size of 10
-
- Jun 10, 2020
-
- Jun 07, 2020
-
-
Yorhel authored
What a mess. https://code.blicky.net/yorhel/ncdu/issues/153#issuecomment-764
-
- Jun 05, 2020
-
-
Christian Göttsche authored
Avoid undeclared identifiers when compiling with older kernel headers.
-
- May 30, 2020
-
-
Christian Göttsche authored
-
Yorhel authored
-
- May 15, 2020
- May 13, 2020
-
-
Saagar Jha authored
-