diff options
| author | Qu Wenruo <wqu@suse.com> | 2020-02-25 14:20:13 +0800 |
|---|---|---|
| committer | David Sterba <dsterba@suse.com> | 2020-05-25 11:25:18 +0200 |
| commit | 1f872924663f9a15924cc7169932608c1d697ee1 (patch) | |
| tree | 15047e703f9a39ef78b593814c965527187fc58c /tools/perf/scripts/python/bin | |
| parent | btrfs: reloc: remove the open-coded goto loop for breadth-first search (diff) | |
| download | linux-1f872924663f9a15924cc7169932608c1d697ee1.tar.gz linux-1f872924663f9a15924cc7169932608c1d697ee1.zip | |
btrfs: reloc: refactor finishing part of upper linkage into finish_upper_links()
After handle_one_tree_backref(), all newly added (not cached) edges and
nodes have the following features:
- Only backref_edge::list[LOWER] is linked.
This means, we can only iterate from botton to top, not the other
direction.
- Newly added nodes are not added to cache rb_tree yet
So to finish the backref cache, we still need to finish the links and
add all nodes into backref cache rb_tree.
This patch will refactor the existing code into finish_upper_links(),
add more comments of each branch, and why we need to do all the work.
Reviewed-by: Josef Bacik <josef@toxicpanda.com>
Signed-off-by: Qu Wenruo <wqu@suse.com>
Reviewed-by: David Sterba <dsterba@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
Diffstat (limited to 'tools/perf/scripts/python/bin')
0 files changed, 0 insertions, 0 deletions