2025-03-14 08:37:37 +08:00

152 lines
4.2 KiB
Rust

// SPDX-License-Identifier: MPL-2.0
//! A fixed-size local cache for frame allocation.
use core::{alloc::Layout, cell::RefCell};
use ostd::{
cpu_local,
mm::{Paddr, PAGE_SIZE},
trap::DisabledLocalIrqGuard,
};
cpu_local! {
static CACHE: RefCell<CacheOfSizes> = RefCell::new(CacheOfSizes::new());
}
struct CacheOfSizes {
cache1: CacheArray<1, 12>,
cache2: CacheArray<2, 6>,
cache3: CacheArray<3, 6>,
cache4: CacheArray<4, 6>,
}
/// A fixed-size local cache for frame allocation.
///
/// Each cache array contains at most `COUNT` segments. Each segment contains
/// `NR_CONT_FRAMES` contiguous frames.
struct CacheArray<const NR_CONT_FRAMES: usize, const COUNT: usize> {
inner: [Option<Paddr>; COUNT],
size: usize,
}
impl<const NR_CONT_FRAMES: usize, const COUNT: usize> CacheArray<NR_CONT_FRAMES, COUNT> {
const fn new() -> Self {
Self {
inner: [const { None }; COUNT],
size: 0,
}
}
/// The size of the segments that this cache manages.
const fn segment_size() -> usize {
NR_CONT_FRAMES * PAGE_SIZE
}
/// Allocates a segment of frames.
///
/// It may allocate directly from this cache. If the cache is empty, it
/// will fill the cache.
fn alloc(&mut self, guard: &DisabledLocalIrqGuard) -> Option<Paddr> {
if let Some(frame) = self.pop_front() {
return Some(frame);
}
let nr_to_alloc = COUNT * 2 / 3;
let allocated = super::pools::alloc(
guard,
Layout::from_size_align(nr_to_alloc * Self::segment_size(), PAGE_SIZE).unwrap(),
)?;
for i in 1..nr_to_alloc {
self.push_front(allocated + i * Self::segment_size());
}
Some(allocated)
}
/// Deallocates a segment of frames.
///
/// It may deallocate directly to this cache. If the cache is full, it will
/// deallocate to the global pool.
fn add_free_memory(&mut self, guard: &DisabledLocalIrqGuard, addr: Paddr) {
if self.push_front(addr).is_none() {
super::pools::add_free_memory(guard, addr, Self::segment_size());
let nr_to_dealloc = COUNT * 2 / 3;
for _ in 0..nr_to_dealloc {
let frame = self.pop_front().unwrap();
super::pools::add_free_memory(guard, frame, Self::segment_size());
}
};
}
fn push_front(&mut self, frame: Paddr) -> Option<()> {
if self.size == COUNT {
return None;
}
self.inner[self.size] = Some(frame);
self.size += 1;
Some(())
}
fn pop_front(&mut self) -> Option<Paddr> {
if self.size == 0 {
return None;
}
let frame = self.inner[self.size - 1].take().unwrap();
self.size -= 1;
Some(frame)
}
}
impl CacheOfSizes {
const fn new() -> Self {
Self {
cache1: CacheArray::new(),
cache2: CacheArray::new(),
cache3: CacheArray::new(),
cache4: CacheArray::new(),
}
}
}
pub(super) fn alloc(guard: &DisabledLocalIrqGuard, layout: Layout) -> Option<Paddr> {
let nr_frames = layout.size() / PAGE_SIZE;
if layout.align() > layout.size() {
return super::pools::alloc(guard, layout);
}
let cache_cell = CACHE.get_with(guard);
let mut cache = cache_cell.borrow_mut();
match nr_frames {
1 => cache.cache1.alloc(guard),
2 => cache.cache2.alloc(guard),
3 => cache.cache3.alloc(guard),
4 => cache.cache4.alloc(guard),
_ => super::pools::alloc(guard, layout),
}
}
pub(super) fn add_free_memory(guard: &DisabledLocalIrqGuard, addr: Paddr, size: usize) {
let nr_frames = size / PAGE_SIZE;
if nr_frames > 4 {
super::pools::add_free_memory(guard, addr, size);
return;
}
let cache_cell = CACHE.get_with(guard);
let mut cache = cache_cell.borrow_mut();
match nr_frames {
1 => cache.cache1.add_free_memory(guard, addr),
2 => cache.cache2.add_free_memory(guard, addr),
3 => cache.cache3.add_free_memory(guard, addr),
4 => cache.cache4.add_free_memory(guard, addr),
_ => super::pools::add_free_memory(guard, addr, size),
}
}