Currently get_node_debug_info finds the next node by iterating over the nodes rbtree. However, this can be sped up by using cursor_lower_bound(), reducing the cost from O(n) to O(log n).
This requires submitting a proper patch to the LKML and the Rust for Linux mailing list. Please recall to test your changes (including generating the documentation if changed, running the Rust doctests if changed, etc.), to justify the commit well in the message (""what"" & ""why""), to use a proper title for the commit, to sign your commit under the Developer's Certificate of Origin and to add a Suggested-by: tag, and a Link: tag to this issue. Please see https://docs.kernel.org/process/submitting-patches.html and https://rust-for-linux.com/contributing for details.
Currently
get_node_debug_infofinds the next node by iterating over thenodesrbtree. However, this can be sped up by usingcursor_lower_bound(), reducing the cost from O(n) to O(log n).This requires submitting a proper patch to the LKML and the Rust for Linux mailing list. Please recall to test your changes (including generating the documentation if changed, running the Rust doctests if changed, etc.), to justify the commit well in the message (""what"" & ""why""), to use a proper title for the commit, to sign your commit under the Developer's Certificate of Origin and to add a
Suggested-by:tag, and aLink:tag to this issue. Please see https://docs.kernel.org/process/submitting-patches.html and https://rust-for-linux.com/contributing for details.