/* * Copyright (c) 2018-2021, Andreas Kling * Copyright (c) 2021, Leon Albrecht * * SPDX-License-Identifier: BSD-2-Clause */ #include #include #include namespace Kernel { Vector Range::carve(const Range& taken) const { VERIFY((taken.size() % PAGE_SIZE) == 0); Vector parts; if (taken == *this) return {}; if (taken.base() > base()) parts.append({ base(), taken.base().get() - base().get() }); if (taken.end() < end()) parts.append({ taken.end(), end().get() - taken.end().get() }); return parts; } Range Range::intersect(const Range& other) const { if (*this == other) { return *this; } auto new_base = max(base(), other.base()); auto new_end = min(end(), other.end()); VERIFY(new_base < new_end); return Range(new_base, (new_end - new_base).get()); } }