diff options
| author | Idan Horowitz <idan.horowitz@gmail.com> | 2022-04-04 00:21:10 +0300 |
|---|---|---|
| committer | Andreas Kling <kling@serenityos.org> | 2022-04-04 00:16:11 +0200 |
| commit | d6e4a25e0c671437924703603e4b3f4a85887098 (patch) | |
| tree | 25a25473c47e38a747b94c1a935a4b77c22dde00 /Kernel | |
| parent | 1787d94907f8d619c85a43bf52a7e60a194c2b28 (diff) | |
| download | serenity-d6e4a25e0c671437924703603e4b3f4a85887098.zip | |
Kernel: Use the InstrusiveRedBlackTree::begin_from(V&) API
This let's us skip an O(logn) tree traversal.
Diffstat (limited to 'Kernel')
| -rw-r--r-- | Kernel/Memory/AddressSpace.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Kernel/Memory/AddressSpace.cpp b/Kernel/Memory/AddressSpace.cpp index c27afa85c5..a91bd45f96 100644 --- a/Kernel/Memory/AddressSpace.cpp +++ b/Kernel/Memory/AddressSpace.cpp @@ -271,7 +271,7 @@ ErrorOr<Vector<Region*>> AddressSpace::find_regions_intersecting(VirtualRange co auto* found_region = m_region_tree.regions().find_largest_not_above(range.base().get()); if (!found_region) return regions; - for (auto iter = m_region_tree.regions().begin_from((*found_region).vaddr().get()); !iter.is_end(); ++iter) { + for (auto iter = m_region_tree.regions().begin_from(*found_region); !iter.is_end(); ++iter) { auto const& iter_range = (*iter).range(); if (iter_range.base() < range.end() && iter_range.end() > range.base()) { TRY(regions.try_append(&*iter)); |