Home
last modified time | relevance | path

Searched hist:"75 db7fd99075bf46f3bfeaa8f1aaa8b13b2590cf" (Results 1 – 3 of 3) sorted by relevance

/linux/fs/
H A Dpnode.h75db7fd99075bf46f3bfeaa8f1aaa8b13b2590cf Tue Aug 19 16:22:03 UTC 2025 Al Viro <viro@zeniv.linux.org.uk> umount_tree(): take all victims out of propagation graph at once

For each removed mount we need to calculate where the slaves will end up.
To avoid duplicating that work, do it for all mounts to be removed
at once, taking the mounts themselves out of propagation graph as
we go, then do all transfers; the duplicate work on finding destinations
is avoided since if we run into a mount that already had destination found,
we don't need to trace the rest of the way. That's guaranteed
O(removed mounts) for finding destinations and removing from propagation
graph and O(surviving mounts that have master removed) for transfers.

Reviewed-by: Christian Brauner <brauner@kernel.org>
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
H A Dpnode.c75db7fd99075bf46f3bfeaa8f1aaa8b13b2590cf Tue Aug 19 16:22:03 UTC 2025 Al Viro <viro@zeniv.linux.org.uk> umount_tree(): take all victims out of propagation graph at once

For each removed mount we need to calculate where the slaves will end up.
To avoid duplicating that work, do it for all mounts to be removed
at once, taking the mounts themselves out of propagation graph as
we go, then do all transfers; the duplicate work on finding destinations
is avoided since if we run into a mount that already had destination found,
we don't need to trace the rest of the way. That's guaranteed
O(removed mounts) for finding destinations and removing from propagation
graph and O(surviving mounts that have master removed) for transfers.

Reviewed-by: Christian Brauner <brauner@kernel.org>
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>
H A Dnamespace.c75db7fd99075bf46f3bfeaa8f1aaa8b13b2590cf Tue Aug 19 16:22:03 UTC 2025 Al Viro <viro@zeniv.linux.org.uk> umount_tree(): take all victims out of propagation graph at once

For each removed mount we need to calculate where the slaves will end up.
To avoid duplicating that work, do it for all mounts to be removed
at once, taking the mounts themselves out of propagation graph as
we go, then do all transfers; the duplicate work on finding destinations
is avoided since if we run into a mount that already had destination found,
we don't need to trace the rest of the way. That's guaranteed
O(removed mounts) for finding destinations and removing from propagation
graph and O(surviving mounts that have master removed) for transfers.

Reviewed-by: Christian Brauner <brauner@kernel.org>
Signed-off-by: Al Viro <viro@zeniv.linux.org.uk>