2018-06-20 14:55:49 +04:00
|
|
|
|
//! Shared memory & Copy-on-write extension for page table
|
2018-06-23 18:30:57 +04:00
|
|
|
|
//!
|
2018-10-09 17:39:34 +04:00
|
|
|
|
//! To use the CowExt, make a wrapper over the original apge table
|
|
|
|
|
//! Like: CowExt::new(origin_page_table)
|
|
|
|
|
//! Invoke page_fault_handler() on the CowExt to run the COW process
|
|
|
|
|
//! If the method above returns true, the COW process is executed, else do your own things.
|
2018-06-23 18:30:57 +04:00
|
|
|
|
//!
|
2018-10-09 17:39:34 +04:00
|
|
|
|
//! To implement the CowExt, we added a "shared state" to the page table entry
|
|
|
|
|
//! We use 2bits in the entry for "readonly and shared" and "writable and shared"
|
|
|
|
|
//! For CPU, the page of the entry is present and readonly,
|
|
|
|
|
//! and it's possible to read the page through different page tables
|
|
|
|
|
//! but when the page is writen, the page fault will be triggered.
|
|
|
|
|
//! When page fault is triggered, the page_fault_handler() on the CowExt should be invoked.
|
|
|
|
|
//! In the page_fault_handler() method, we return false if the page is accurately readonly.
|
|
|
|
|
//! Elsewise we copy the data in the page into a newly allocated frame,
|
|
|
|
|
//! and modify the page table entry to map the page to the frame, and set the present and writable bit.
|
2018-06-23 18:30:57 +04:00
|
|
|
|
//!
|
2018-10-09 17:39:34 +04:00
|
|
|
|
//! A frame can have write and read reference at the same time,
|
|
|
|
|
//! so we need to maintain the count of write and read reference.
|
|
|
|
|
//! When page fault occurs, if the read reference count is 0 and the write reference count is 1,
|
|
|
|
|
//! The copy process should be skipped and the entry is mark as writable directly.
|
2018-06-20 14:55:49 +04:00
|
|
|
|
|
|
|
|
|
use super::paging::*;
|
|
|
|
|
use super::*;
|
2018-08-04 12:20:25 +04:00
|
|
|
|
use alloc::collections::BTreeMap;
|
2018-06-20 14:55:49 +04:00
|
|
|
|
use core::ops::{Deref, DerefMut};
|
|
|
|
|
|
|
|
|
|
/// Wrapper for page table, supporting shared map & copy-on-write
|
2018-06-23 18:30:57 +04:00
|
|
|
|
pub struct CowExt<T: PageTable> {
|
2018-06-20 14:55:49 +04:00
|
|
|
|
page_table: T,
|
|
|
|
|
rc_map: FrameRcMap,
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<T: PageTable> CowExt<T> {
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief create a COW extension
|
|
|
|
|
** @param page_table: T the inner page table
|
|
|
|
|
** @retval CowExt the COW extension created
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
pub fn new(page_table: T) -> Self {
|
|
|
|
|
CowExt {
|
|
|
|
|
page_table,
|
|
|
|
|
rc_map: FrameRcMap::default(),
|
|
|
|
|
}
|
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief map the virtual address to a target physics address as shared
|
|
|
|
|
** @param addr: VirtAddr the virual address to map
|
|
|
|
|
** @param target: VirtAddr the target physics address
|
|
|
|
|
** @param writable: bool if it is true, set the page as writable and shared
|
|
|
|
|
** else set the page as readonly and shared
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
pub fn map_to_shared(&mut self, addr: VirtAddr, target: PhysAddr, writable: bool) {
|
|
|
|
|
let entry = self.page_table.map(addr, target);
|
|
|
|
|
entry.set_writable(false);
|
|
|
|
|
entry.set_shared(writable);
|
2018-06-23 15:11:41 +04:00
|
|
|
|
entry.update();
|
2018-06-20 14:55:49 +04:00
|
|
|
|
let frame = target / PAGE_SIZE;
|
|
|
|
|
match writable {
|
|
|
|
|
true => self.rc_map.write_increase(&frame),
|
|
|
|
|
false => self.rc_map.read_increase(&frame),
|
|
|
|
|
}
|
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief unmap a virual address from physics address
|
|
|
|
|
** with apecial additional process for shared page
|
|
|
|
|
** @param addr: VirtAddr the virual address to unmap
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
pub fn unmap_shared(&mut self, addr: VirtAddr) {
|
2018-10-26 19:43:12 +04:00
|
|
|
|
let entry = self.page_table.get_entry(addr)
|
|
|
|
|
.expect("entry not exist");
|
|
|
|
|
let frame = entry.target() / PAGE_SIZE;
|
|
|
|
|
if entry.readonly_shared() {
|
|
|
|
|
self.rc_map.read_decrease(&frame);
|
|
|
|
|
} else if entry.writable_shared() {
|
|
|
|
|
self.rc_map.write_decrease(&frame);
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
|
|
|
|
self.page_table.unmap(addr);
|
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief execute the COW process for page fault
|
|
|
|
|
** This function must be called whenever PageFault happens.
|
|
|
|
|
** @param addr: VirtAddr the virual address of the page fault
|
|
|
|
|
** @param alloc_frame: impl FnOnce() -> PhysAddr
|
|
|
|
|
** the page allocation function
|
|
|
|
|
** that allocate a page and returns physics address
|
|
|
|
|
** of beginning of the page
|
|
|
|
|
** @retval bool whether copy-on-write happens.
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
pub fn page_fault_handler(&mut self, addr: VirtAddr, alloc_frame: impl FnOnce() -> PhysAddr) -> bool {
|
2018-10-26 19:43:12 +04:00
|
|
|
|
let entry = self.page_table.get_entry(addr);
|
|
|
|
|
if entry.is_none() {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
let entry = entry.unwrap();
|
|
|
|
|
if !entry.readonly_shared() && !entry.writable_shared() {
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
let frame = entry.target() / PAGE_SIZE;
|
|
|
|
|
if self.rc_map.read_count(&frame) == 0 && self.rc_map.write_count(&frame) == 1 {
|
|
|
|
|
entry.clear_shared();
|
|
|
|
|
entry.set_writable(true);
|
|
|
|
|
entry.update();
|
|
|
|
|
self.rc_map.write_decrease(&frame);
|
|
|
|
|
return true;
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
|
|
|
|
use core::mem::uninitialized;
|
|
|
|
|
let mut temp_data: [u8; PAGE_SIZE] = unsafe { uninitialized() };
|
2018-06-23 21:44:14 +04:00
|
|
|
|
temp_data[..].copy_from_slice(self.get_page_slice_mut(addr));
|
2018-06-20 14:55:49 +04:00
|
|
|
|
|
|
|
|
|
self.unmap_shared(addr);
|
|
|
|
|
self.map(addr, alloc_frame());
|
|
|
|
|
|
2018-06-23 21:44:14 +04:00
|
|
|
|
self.get_page_slice_mut(addr).copy_from_slice(&temp_data[..]);
|
2018-06-20 14:55:49 +04:00
|
|
|
|
true
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<T: PageTable> Deref for CowExt<T> {
|
|
|
|
|
type Target = T;
|
|
|
|
|
|
|
|
|
|
fn deref(&self) -> &<Self as Deref>::Target {
|
|
|
|
|
&self.page_table
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
impl<T: PageTable> DerefMut for CowExt<T> {
|
|
|
|
|
fn deref_mut(&mut self) -> &mut <Self as Deref>::Target {
|
|
|
|
|
&mut self.page_table
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/// A map contains reference count for shared frame
|
2018-07-12 15:44:13 +04:00
|
|
|
|
///
|
|
|
|
|
/// It will lazily construct the `BTreeMap`, to avoid heap alloc when heap is unavailable.
|
2018-06-20 14:55:49 +04:00
|
|
|
|
#[derive(Default)]
|
2018-07-12 15:44:13 +04:00
|
|
|
|
struct FrameRcMap(Option<BTreeMap<Frame, (u16, u16)>>);
|
2018-06-20 14:55:49 +04:00
|
|
|
|
|
|
|
|
|
type Frame = usize;
|
|
|
|
|
|
|
|
|
|
impl FrameRcMap {
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief get the read reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to get the read reference count
|
|
|
|
|
** @retval u16 the read reference count
|
|
|
|
|
*/
|
2018-07-12 15:35:21 +04:00
|
|
|
|
fn read_count(&mut self, frame: &Frame) -> u16 {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
self.map().get(frame).unwrap_or(&(0, 0)).0
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief get the write reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to get the write reference count
|
|
|
|
|
** @retval u16 the write reference count
|
|
|
|
|
*/
|
2018-07-12 15:35:21 +04:00
|
|
|
|
fn write_count(&mut self, frame: &Frame) -> u16 {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
self.map().get(frame).unwrap_or(&(0, 0)).1
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief increase the read reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to increase the read reference count
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
fn read_increase(&mut self, frame: &Frame) {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
let (r, w) = self.map().get(&frame).unwrap_or(&(0, 0)).clone();
|
|
|
|
|
self.map().insert(frame.clone(), (r + 1, w));
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief decrease the read reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to decrease the read reference count
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
fn read_decrease(&mut self, frame: &Frame) {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
self.map().get_mut(frame).unwrap().0 -= 1;
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief increase the write reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to increase the write reference count
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
fn write_increase(&mut self, frame: &Frame) {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
let (r, w) = self.map().get(&frame).unwrap_or(&(0, 0)).clone();
|
|
|
|
|
self.map().insert(frame.clone(), (r, w + 1));
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief decrease the write reference count of the frame
|
|
|
|
|
** @param frame: &Frame the frame to decrease the write reference count
|
|
|
|
|
** @retval none
|
|
|
|
|
*/
|
2018-06-20 14:55:49 +04:00
|
|
|
|
fn write_decrease(&mut self, frame: &Frame) {
|
2018-07-12 15:44:13 +04:00
|
|
|
|
self.map().get_mut(frame).unwrap().1 -= 1;
|
|
|
|
|
}
|
2018-10-09 17:39:34 +04:00
|
|
|
|
/*
|
|
|
|
|
** @brief get the internal btree map, lazily initialize the btree map if it is not present
|
|
|
|
|
** @retval &mut BTreeMap<Frame, (u16, u16)>
|
|
|
|
|
** the internal btree map
|
|
|
|
|
*/
|
2018-07-12 15:44:13 +04:00
|
|
|
|
fn map(&mut self) -> &mut BTreeMap<Frame, (u16, u16)> {
|
|
|
|
|
if self.0.is_none() {
|
|
|
|
|
self.0 = Some(BTreeMap::new());
|
|
|
|
|
}
|
|
|
|
|
self.0.as_mut().unwrap()
|
2018-06-20 14:55:49 +04:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2018-06-23 18:30:57 +04:00
|
|
|
|
pub mod test {
|
2018-06-20 14:55:49 +04:00
|
|
|
|
use super::*;
|
|
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
|
fn test() {
|
|
|
|
|
let mut pt = CowExt::new(MockPageTable::new());
|
|
|
|
|
let pt0 = unsafe { &mut *(&mut pt as *mut CowExt<MockPageTable>) };
|
|
|
|
|
|
|
|
|
|
struct FrameAlloc(usize);
|
|
|
|
|
impl FrameAlloc {
|
|
|
|
|
fn alloc(&mut self) -> PhysAddr {
|
|
|
|
|
let pa = self.0 * PAGE_SIZE;
|
|
|
|
|
self.0 += 1;
|
|
|
|
|
pa
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
let mut alloc = FrameAlloc(4);
|
|
|
|
|
|
|
|
|
|
pt.page_table.set_handler(Box::new(move |_, addr: VirtAddr| {
|
|
|
|
|
pt0.page_fault_handler(addr, || alloc.alloc());
|
|
|
|
|
}));
|
2018-06-23 18:30:57 +04:00
|
|
|
|
|
|
|
|
|
test_with(&mut pt);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
pub fn test_with(pt: &mut CowExt<impl PageTable>) {
|
2018-06-20 14:55:49 +04:00
|
|
|
|
let target = 0x0;
|
|
|
|
|
let frame = 0x0;
|
|
|
|
|
|
|
|
|
|
pt.map(0x1000, target);
|
|
|
|
|
pt.write(0x1000, 1);
|
|
|
|
|
assert_eq!(pt.read(0x1000), 1);
|
|
|
|
|
pt.unmap(0x1000);
|
|
|
|
|
|
|
|
|
|
pt.map_to_shared(0x1000, target, true);
|
|
|
|
|
pt.map_to_shared(0x2000, target, true);
|
|
|
|
|
pt.map_to_shared(0x3000, target, false);
|
|
|
|
|
assert_eq!(pt.rc_map.read_count(&frame), 1);
|
|
|
|
|
assert_eq!(pt.rc_map.write_count(&frame), 2);
|
|
|
|
|
assert_eq!(pt.read(0x1000), 1);
|
|
|
|
|
assert_eq!(pt.read(0x2000), 1);
|
|
|
|
|
assert_eq!(pt.read(0x3000), 1);
|
|
|
|
|
|
|
|
|
|
pt.write(0x1000, 2);
|
|
|
|
|
assert_eq!(pt.rc_map.read_count(&frame), 1);
|
|
|
|
|
assert_eq!(pt.rc_map.write_count(&frame), 1);
|
2018-10-26 19:43:12 +04:00
|
|
|
|
assert_ne!(pt.get_entry(0x1000).unwrap().target(), target);
|
2018-06-20 14:55:49 +04:00
|
|
|
|
assert_eq!(pt.read(0x1000), 2);
|
|
|
|
|
assert_eq!(pt.read(0x2000), 1);
|
|
|
|
|
assert_eq!(pt.read(0x3000), 1);
|
|
|
|
|
|
|
|
|
|
pt.unmap_shared(0x3000);
|
|
|
|
|
assert_eq!(pt.rc_map.read_count(&frame), 0);
|
|
|
|
|
assert_eq!(pt.rc_map.write_count(&frame), 1);
|
2018-06-23 18:30:57 +04:00
|
|
|
|
// assert!(!pt.get_entry(0x3000).present());
|
2018-06-20 14:55:49 +04:00
|
|
|
|
|
|
|
|
|
pt.write(0x2000, 3);
|
|
|
|
|
assert_eq!(pt.rc_map.read_count(&frame), 0);
|
|
|
|
|
assert_eq!(pt.rc_map.write_count(&frame), 0);
|
2018-10-26 19:43:12 +04:00
|
|
|
|
assert_eq!(pt.get_entry(0x2000).unwrap().target(), target,
|
2018-06-20 14:55:49 +04:00
|
|
|
|
"The last write reference should not allocate new frame.");
|
|
|
|
|
assert_eq!(pt.read(0x1000), 2);
|
|
|
|
|
assert_eq!(pt.read(0x2000), 3);
|
|
|
|
|
}
|
|
|
|
|
}
|