Kernel: Use the InstrusiveRedBlackTree::begin_from(V&) API

This let's us skip an O(logn) tree traversal.
luteresa · Apr 3, 2022 · d6e4a25 · d6e4a25
1 parent 1787d94
commit d6e4a25
Showing 1 changed file with 1 addition and 1 deletion.
diff --git 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));