mirror of
https://github.com/kdave/btrfs-progs
synced 2025-04-17 12:35:19 +00:00
0bbd407cbb
Originally print-tree uses depth first search to print trees.
This works fine until we reach 3 level trees (root node level is 2).
For tall trees whose root level is 2 or higher, DFS will mix nodes and
leaves like the following example:
Level 2 A
/ \
Level 1 B C
/ | | \
Level 0 D E F G
DFS will cause the following output sequence:
A B D E C F G
Which in term of node/leave is:
N N L L N L L
Such mixed node/leave result is sometimes hard for human to read.
This patch will introduce 2 new options, --bfs and --dfs.
--dfs: keeps the original output sequence, and to keep things
compatible it's the default behavior.
--bfs: uses breadth-first search, and will cause better output
sequence like:
A B C D E F G
Which in term of node/leave is:
N N N L L L L
Much better sorted and may become default in the future.
Reviewed-by: Nikolay Borisov <nborisov@suse.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
|
||
|---|---|---|
| .. | ||
| asciidoc.conf | ||
| btrfs-balance.asciidoc | ||
| btrfs-check.asciidoc | ||
| btrfs-convert.asciidoc | ||
| btrfs-device.asciidoc | ||
| btrfs-filesystem.asciidoc | ||
| btrfs-find-root.asciidoc | ||
| btrfs-image.asciidoc | ||
| btrfs-inspect-internal.asciidoc | ||
| btrfs-ioctl.asciidoc | ||
| btrfs-man5.asciidoc | ||
| btrfs-map-logical.asciidoc | ||
| btrfs-property.asciidoc | ||
| btrfs-qgroup.asciidoc | ||
| btrfs-quota.asciidoc | ||
| btrfs-receive.asciidoc | ||
| btrfs-replace.asciidoc | ||
| btrfs-rescue.asciidoc | ||
| btrfs-restore.asciidoc | ||
| btrfs-scrub.asciidoc | ||
| btrfs-select-super.asciidoc | ||
| btrfs-send.asciidoc | ||
| btrfs-subvolume.asciidoc | ||
| btrfs.asciidoc | ||
| btrfsck.8 | ||
| btrfstune.asciidoc | ||
| CodingConventions | ||
| DocConventions | ||
| fsck.btrfs.asciidoc | ||
| Makefile.in | ||
| manpage-base.xsl | ||
| manpage-bold-literal.xsl | ||
| manpage-normal.xsl | ||
| mkfs.btrfs.asciidoc | ||
| ReleaseChecklist | ||