mirror of
https://github.com/kdave/btrfs-progs
synced 2025-04-07 17:51:23 +00:00
0b8512b7f5
This is how we can implement stuff like `btrfs subvol list`. Rather than producing the entire list upfront, the iterator approach uses less memory in the common case where the whole list is not stored (O(max subvolume path length)). It supports both pre-order traversal (useful for, e.g, recursive snapshot) and post-order traversal (useful for recursive delete). Signed-off-by: Omar Sandoval <osandov@fb.com> Signed-off-by: David Sterba <dsterba@suse.com> |
||
|---|---|---|
| .. | ||
| tests | ||
| .gitignore | ||
| btrfsutilpy.h | ||
| error.c | ||
| filesystem.c | ||
| module.c | ||
| qgroup.c | ||
| setup.py | ||
| subvolume.c | ||