btrfs: relocation: build_backref_cache() refactor part 2
Get series with b4
b4 am [email protected]Versions newest first
- v1 Latest3 patches 5 repliesIn review
Patches in v1 No applies recorded yet
| # | Subject and files | Size | Replies | Applied |
|---|---|---|---|---|
| 1/3 | btrfs: relocation: Use wrapper to replace open-coded edge linkingfs/ | +37 | 1 reply | |
| 2/3 | btrfs: relocation: Specify essential members for alloc_backref_node()fs/ | +12 | 1 reply | |
| 3/3 | btrfs: relocation: Remove the open-coded goto loop for breadth-first searchfs/ | +90 | 3 replies |
Reviews trailers per patch
2 of 3 patches have a Reviewed-by or Acked-by.
| Patch | Josef Bacik |
|---|---|
| 1/3 | R-b |
| 2/3 | R-b |
| 3/3 |
Trailers given in replies are filled; those carried in the patches from earlier versions are outlined with dashes.
Cover letter [PATCH 0/3] btrfs: relocation: build_backref_cache() refactor part 2
This patchset can be fetched from:
https://github.com/adam900710/linux/tree/backref_cache_new
Since it is based on previous btrfs_backref_iter facility, it's recommended to fetch from above repo.
This patchset mostly refactors the backref handling code out of the bit loop in build_backref_cache().
Now build_backref_tree() can be easily divided into 4 small parts:
- Basic structure allocation
- Breadth-first search for backrefs
- Handling edges of upper nodes
- Removing useless nodes
Qu Wenruo (3):
btrfs: relocation: Use wrapper to replace open-coded edge linking
btrfs: relocation: Specify essential members for alloc_backref_node()
btrfs: relocation: Remove the open-coded goto loop for breadth-first
search
fs/btrfs/relocation.c | 241 ++++++++++++++++++++++++------------------ 1 file changed, 138 insertions(+), 103 deletions(-)
Signature · 1 line
2.25.1