mirror of
				https://github.com/RGBCube/serenity
				synced 2025-10-31 12:02:43 +00:00 
			
		
		
		
	
		
			
				
	
	
		
			72 lines
		
	
	
	
		
			2.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			72 lines
		
	
	
	
		
			2.4 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /*
 | |
|  * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
 | |
|  * 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/Traits.h>
 | |
| #include <AK/Vector.h>
 | |
| #include <Kernel/SpinLock.h>
 | |
| #include <Kernel/VM/Range.h>
 | |
| 
 | |
| namespace Kernel {
 | |
| 
 | |
| class RangeAllocator {
 | |
| public:
 | |
|     RangeAllocator();
 | |
|     ~RangeAllocator();
 | |
| 
 | |
|     void initialize_with_range(VirtualAddress, size_t);
 | |
|     void initialize_from_parent(const RangeAllocator&);
 | |
| 
 | |
|     Optional<Range> allocate_anywhere(size_t, size_t alignment = PAGE_SIZE);
 | |
|     Optional<Range> allocate_specific(VirtualAddress, size_t);
 | |
|     Optional<Range> allocate_randomized(size_t, size_t alignment);
 | |
|     void deallocate(const Range&);
 | |
| 
 | |
|     void dump() const;
 | |
| 
 | |
|     bool contains(const Range& range) const
 | |
|     {
 | |
|         ScopedSpinLock lock(m_lock);
 | |
|         return m_total_range.contains(range);
 | |
|     }
 | |
| 
 | |
| private:
 | |
|     void carve_at_index(int, const Range&);
 | |
| 
 | |
|     Vector<Range> m_available_ranges;
 | |
|     Range m_total_range;
 | |
|     mutable SpinLock<u8> m_lock;
 | |
| };
 | |
| 
 | |
| }
 | |
| 
 | |
| namespace AK {
 | |
| template<>
 | |
| struct Traits<Kernel::Range> : public GenericTraits<Kernel::Range> {
 | |
|     static constexpr bool is_trivial() { return true; }
 | |
| };
 | |
| }
 | 
