mirror of
https://github.com/RGBCube/serenity
synced 2025-06-01 09:08:10 +00:00
497c759ab7
This does not affect functionality right now, but it means that the regions vector will now never have any overlapping regions, which will allow the use of balance binary search trees instead of a vector in the future. (since they require keys to be exclusive)
105 lines
4 KiB
C++
105 lines
4 KiB
C++
/*
|
|
* Copyright (c) 2018-2021, Andreas Kling <kling@serenityos.org>
|
|
* Copyright (c) 2021, Leon Albrecht <leon2002.la@gmail.com>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
* list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <AK/NonnullOwnPtrVector.h>
|
|
#include <AK/Vector.h>
|
|
#include <AK/WeakPtr.h>
|
|
#include <Kernel/UnixTypes.h>
|
|
#include <Kernel/VM/AllocationStrategy.h>
|
|
#include <Kernel/VM/PageDirectory.h>
|
|
|
|
namespace Kernel {
|
|
|
|
class Space {
|
|
public:
|
|
static OwnPtr<Space> create(Process&, const Space* parent);
|
|
~Space();
|
|
|
|
PageDirectory& page_directory() { return *m_page_directory; }
|
|
const PageDirectory& page_directory() const { return *m_page_directory; }
|
|
|
|
Region& add_region(NonnullOwnPtr<Region>);
|
|
|
|
size_t region_count() const { return m_regions.size(); }
|
|
|
|
NonnullOwnPtrVector<Region>& regions() { return m_regions; }
|
|
const NonnullOwnPtrVector<Region>& regions() const { return m_regions; }
|
|
|
|
void dump_regions();
|
|
|
|
Optional<Range> allocate_range(VirtualAddress, size_t, size_t alignment = PAGE_SIZE);
|
|
|
|
KResultOr<Region*> allocate_region_with_vmobject(const Range&, NonnullRefPtr<VMObject>, size_t offset_in_vmobject, const String& name, int prot, bool shared);
|
|
KResultOr<Region*> allocate_region(const Range&, const String& name, int prot = PROT_READ | PROT_WRITE, AllocationStrategy strategy = AllocationStrategy::Reserve);
|
|
bool deallocate_region(Region& region);
|
|
OwnPtr<Region> take_region(Region& region);
|
|
|
|
Region& allocate_split_region(const Region& source_region, const Range&, size_t offset_in_vmobject);
|
|
Vector<Region*, 2> split_region_around_range(const Region& source_region, const Range&);
|
|
|
|
Region* find_region_from_range(const Range&);
|
|
Region* find_region_containing(const Range&);
|
|
|
|
Vector<Region*> find_regions_intersecting(const Range&);
|
|
|
|
bool enforces_syscall_regions() const { return m_enforces_syscall_regions; }
|
|
void set_enforces_syscall_regions(bool b) { m_enforces_syscall_regions = b; }
|
|
|
|
void remove_all_regions(Badge<Process>);
|
|
|
|
RecursiveSpinLock& get_lock() const { return m_lock; }
|
|
|
|
size_t amount_clean_inode() const;
|
|
size_t amount_dirty_private() const;
|
|
size_t amount_virtual() const;
|
|
size_t amount_resident() const;
|
|
size_t amount_shared() const;
|
|
size_t amount_purgeable_volatile() const;
|
|
size_t amount_purgeable_nonvolatile() const;
|
|
|
|
private:
|
|
Space(Process&, NonnullRefPtr<PageDirectory>);
|
|
|
|
Process* m_process { nullptr };
|
|
mutable RecursiveSpinLock m_lock;
|
|
|
|
RefPtr<PageDirectory> m_page_directory;
|
|
|
|
NonnullOwnPtrVector<Region> m_regions;
|
|
|
|
struct RegionLookupCache {
|
|
Optional<Range> range;
|
|
WeakPtr<Region> region;
|
|
};
|
|
RegionLookupCache m_region_lookup_cache;
|
|
|
|
bool m_enforces_syscall_regions { false };
|
|
};
|
|
|
|
}
|