/// Disk scheme replacement when making live disk use alloc::arc::Arc; use alloc::BTreeMap; use core::{cmp, slice}; use core::sync::atomic::{AtomicUsize, Ordering}; use spin::RwLock; use syscall::data::Stat; use syscall::error::*; use syscall::flag::{MODE_FILE, SEEK_SET, SEEK_CUR, SEEK_END}; use syscall::scheme::Scheme; struct Handle { path: &'static [u8], data: Arc>, mode: u16, seek: usize } pub struct DiskScheme { next_id: AtomicUsize, data: Arc>, handles: RwLock> } impl DiskScheme { pub fn new() -> DiskScheme { let data; unsafe { extern { static mut __live_start: u8; static mut __live_end: u8; } let start = &mut __live_start as *mut u8; let end = &mut __live_end as *mut u8; if end as usize >= start as usize { data = slice::from_raw_parts_mut(start, end as usize - start as usize); } else { data = &mut []; }; } DiskScheme { next_id: AtomicUsize::new(0), data: Arc::new(RwLock::new(data)), handles: RwLock::new(BTreeMap::new()) } } } impl Scheme for DiskScheme { fn open(&self, _path: &[u8], _flags: usize, _uid: u32, _gid: u32) -> Result { let id = self.next_id.fetch_add(1, Ordering::SeqCst); self.handles.write().insert(id, Handle { path: b"0", data: self.data.clone(), mode: MODE_FILE | 0o744, seek: 0 }); Ok(id) } fn dup(&self, id: usize, buf: &[u8]) -> Result { if ! buf.is_empty() { return Err(Error::new(EINVAL)); } let (path, data, mode, seek) = { let handles = self.handles.read(); let handle = handles.get(&id).ok_or(Error::new(EBADF))?; (handle.path, handle.data.clone(), handle.mode, handle.seek) }; let id = self.next_id.fetch_add(1, Ordering::SeqCst); self.handles.write().insert(id, Handle { path: path, data: data, mode: mode, seek: seek }); Ok(id) } fn read(&self, id: usize, buffer: &mut [u8]) -> Result { let mut handles = self.handles.write(); let mut handle = handles.get_mut(&id).ok_or(Error::new(EBADF))?; let data = handle.data.read(); let mut i = 0; while i < buffer.len() && handle.seek < data.len() { buffer[i] = data[handle.seek]; i += 1; handle.seek += 1; } Ok(i) } fn write(&self, id: usize, buffer: &[u8]) -> Result { let mut handles = self.handles.write(); let mut handle = handles.get_mut(&id).ok_or(Error::new(EBADF))?; let mut data = handle.data.write(); let mut i = 0; while i < buffer.len() && handle.seek < data.len() { data[handle.seek] = buffer[i]; i += 1; handle.seek += 1; } Ok(i) } fn seek(&self, id: usize, pos: usize, whence: usize) -> Result { let mut handles = self.handles.write(); let mut handle = handles.get_mut(&id).ok_or(Error::new(EBADF))?; let data = handle.data.read(); handle.seek = match whence { SEEK_SET => cmp::min(data.len(), pos), SEEK_CUR => cmp::max(0, cmp::min(data.len() as isize, handle.seek as isize + pos as isize)) as usize, SEEK_END => cmp::max(0, cmp::min(data.len() as isize, data.len() as isize + pos as isize)) as usize, _ => return Err(Error::new(EINVAL)) }; Ok(handle.seek) } fn fcntl(&self, id: usize, _cmd: usize, _arg: usize) -> Result { let handles = self.handles.read(); let _handle = handles.get(&id).ok_or(Error::new(EBADF))?; Ok(0) } fn fpath(&self, id: usize, buf: &mut [u8]) -> Result { let handles = self.handles.read(); let handle = handles.get(&id).ok_or(Error::new(EBADF))?; //TODO: Copy scheme part in kernel let mut i = 0; let scheme_path = b"disk:"; while i < buf.len() && i < scheme_path.len() { buf[i] = scheme_path[i]; i += 1; } let mut j = 0; while i < buf.len() && j < handle.path.len() { buf[i] = handle.path[j]; i += 1; j += 1; } Ok(i) } fn fstat(&self, id: usize, stat: &mut Stat) -> Result { let handles = self.handles.read(); let handle = handles.get(&id).ok_or(Error::new(EBADF))?; let data = handle.data.read(); stat.st_mode = handle.mode; stat.st_uid = 0; stat.st_gid = 0; stat.st_size = data.len() as u64; Ok(0) } fn fsync(&self, id: usize) -> Result { let handles = self.handles.read(); let _handle = handles.get(&id).ok_or(Error::new(EBADF))?; Ok(0) } fn close(&self, id: usize) -> Result { self.handles.write().remove(&id).ok_or(Error::new(EBADF)).and(Ok(0)) } }