rust-fatfs/src/file.rs

309 lines
11 KiB
Rust
Raw Normal View History

2017-09-23 06:22:31 +08:00
use std::cmp;
2017-09-23 04:27:39 +08:00
use std::io::prelude::*;
use std::io::{SeekFrom, ErrorKind};
2017-09-23 04:27:39 +08:00
use std::io;
2017-09-23 05:20:06 +08:00
use fs::FileSystemRef;
use dir::{FileEntryInfo, DateTime};
2017-09-23 04:27:39 +08:00
#[derive(Clone)]
pub struct File<'a, 'b: 'a> {
// Note first_cluster is None if file is empty
first_cluster: Option<u32>,
2017-10-10 03:14:28 +08:00
// Note: if offset points between clusters current_cluster is the previous cluster
current_cluster: Option<u32>,
// current position in this file
offset: u32,
// file dir entry - None for root dir
entry: Option<FileEntryInfo>,
// should file dir entry be flushed?
entry_dirty: bool,
fs: FileSystemRef<'a, 'b>,
2017-09-23 04:27:39 +08:00
}
impl <'a, 'b> File<'a, 'b> {
pub(crate) fn new(first_cluster: Option<u32>, entry: Option<FileEntryInfo>, fs: FileSystemRef<'a, 'b>) -> Self {
File {
first_cluster, entry, fs,
2017-10-10 03:14:28 +08:00
current_cluster: None, // cluster before first one
offset: 0,
entry_dirty: false,
}
}
fn update_size(&mut self) {
2017-10-15 21:56:01 +08:00
let offset = self.offset;
match self.entry {
Some(ref mut e) => {
2017-10-15 21:56:01 +08:00
if e.data.size().map_or(false, |s| offset > s) {
e.data.set_size(offset);
self.entry_dirty = true;
}
},
_ => {},
}
}
2017-10-10 03:14:28 +08:00
pub fn truncate(&mut self) -> io::Result<()> {
2017-10-15 21:56:01 +08:00
let offset = self.offset;
match self.entry {
Some(ref mut e) => {
2017-10-15 21:56:01 +08:00
if e.data.size().map_or(false, |s| offset == s) {
2017-10-10 03:14:28 +08:00
return Ok(());
}
2017-10-10 03:14:28 +08:00
e.data.set_size(self.offset);
2017-10-10 03:14:28 +08:00
if self.offset == 0 {
e.data.set_first_cluster(None);
}
self.entry_dirty = true;
},
_ => {},
}
2017-10-10 03:14:28 +08:00
if self.offset > 0 {
debug_assert!(self.current_cluster.is_some());
self.fs.cluster_iter(self.current_cluster.unwrap()).truncate() // safe
2017-10-10 03:14:28 +08:00
} else {
debug_assert!(self.current_cluster.is_none());
match self.first_cluster {
Some(n) => self.fs.cluster_iter(n).free()?,
_ => {},
}
2017-10-10 03:14:28 +08:00
self.first_cluster = None;
Ok(())
}
}
pub(crate) fn global_pos(&self) -> Option<u64> {
// Returns current position relative to filesystem start
2017-10-10 03:14:28 +08:00
// Note: when between clusters it returns position after previous cluster
match self.current_cluster {
Some(n) => {
let cluster_size = self.fs.get_cluster_size();
let offset_in_cluster = self.offset % cluster_size;
let offset_in_fs = self.fs.offset_from_cluster(n) + (offset_in_cluster as u64);
Some(offset_in_fs)
},
None => None,
}
}
pub(crate) fn flush_dir_entry(&self) -> io::Result<()> {
if self.entry_dirty {
match self.entry {
Some(ref e) => e.write(self.fs)?,
_ => {},
}
}
Ok(())
}
pub fn set_modified(&mut self, date_time: DateTime) {
match self.entry {
Some(ref mut e) => {
e.data.set_modified(date_time);
self.entry_dirty = true;
},
_ => {},
}
}
fn bytes_left_in_file(&self) -> Option<usize> {
match self.entry {
2017-10-15 21:56:01 +08:00
Some(ref e) => e.data.size().map(|s| (s - self.offset) as usize),
None => None,
2017-09-23 04:27:39 +08:00
}
}
2017-10-10 03:14:28 +08:00
fn set_first_cluster(&mut self, cluster: u32) {
self.first_cluster = Some(cluster);
match self.entry {
Some(ref mut e) => {
e.data.set_first_cluster(self.first_cluster);
},
None => {},
}
self.entry_dirty = true;
}
}
impl<'a, 'b> Drop for File<'a, 'b> {
fn drop(&mut self) {
self.flush().expect("flush failed");
}
}
impl<'a, 'b> Read for File<'a, 'b> {
fn read(&mut self, buf: &mut [u8]) -> io::Result<usize> {
let cluster_size = self.fs.get_cluster_size();
let current_cluster_opt = if self.offset % cluster_size == 0 {
// next cluster
match self.current_cluster {
None => self.first_cluster,
Some(n) => {
let r = self.fs.cluster_iter(n).next();
match r {
Some(Err(err)) => return Err(err),
Some(Ok(n)) => Some(n),
None => None,
}
},
}
} else {
self.current_cluster
};
let current_cluster = match current_cluster_opt {
Some(n) => n,
None => return Ok(0),
};
let offset_in_cluster = self.offset % cluster_size;
let bytes_left_in_cluster = (cluster_size - offset_in_cluster) as usize;
let bytes_left_in_file = self.bytes_left_in_file().unwrap_or(bytes_left_in_cluster);
let read_size = cmp::min(cmp::min(buf.len(), bytes_left_in_cluster), bytes_left_in_file);
if read_size == 0 {
return Ok(0);
}
trace!("read {} bytes in cluster {}", read_size, current_cluster);
let offset_in_fs = self.fs.offset_from_cluster(current_cluster) + (offset_in_cluster as u64);
let read_bytes = {
let mut disk = self.fs.disk.borrow_mut();
disk.seek(SeekFrom::Start(offset_in_fs))?;
disk.read(&mut buf[..read_size])?
};
if read_bytes == 0 {
return Ok(0);
}
self.offset += read_bytes as u32;
self.current_cluster = Some(current_cluster);
Ok(read_bytes)
2017-09-23 04:27:39 +08:00
}
}
impl<'a, 'b> Write for File<'a, 'b> {
fn write(&mut self, buf: &[u8]) -> io::Result<usize> {
let cluster_size = self.fs.get_cluster_size();
let offset_in_cluster = self.offset % cluster_size;
let bytes_left_in_cluster = (cluster_size - offset_in_cluster) as usize;
let write_size = cmp::min(buf.len(), bytes_left_in_cluster);
// Exit early if we are going to write no data
if write_size == 0 {
return Ok(0);
}
// Get cluster for write possibly allocating new one
let current_cluster = if self.offset % cluster_size == 0 {
// next cluster
let next_cluster = match self.current_cluster {
None => self.first_cluster,
Some(n) => {
let r = self.fs.cluster_iter(n).next();
match r {
Some(Err(err)) => return Err(err),
Some(Ok(n)) => Some(n),
None => None,
}
},
2017-10-10 03:14:28 +08:00
};
match next_cluster {
2017-10-10 03:14:28 +08:00
Some(n) => n,
None => {
// end of chain reached - allocate new cluster
let new_cluster = self.fs.alloc_cluster(self.current_cluster)?;
if self.first_cluster.is_none() {
self.set_first_cluster(new_cluster);
}
new_cluster
},
}
} else {
// self.current_cluster should be a valid cluster
match self.current_cluster {
Some(n) => n,
None => panic!("Offset inside cluster but no cluster allocated"),
}
};
trace!("write {} bytes in cluster {}", write_size, current_cluster);
let offset_in_fs = self.fs.offset_from_cluster(current_cluster) + (offset_in_cluster as u64);
let written_bytes = {
let mut disk = self.fs.disk.borrow_mut();
disk.seek(SeekFrom::Start(offset_in_fs))?;
disk.write(&buf[..write_size])?
};
if written_bytes == 0 {
return Ok(0);
}
self.offset += written_bytes as u32;
self.current_cluster = Some(current_cluster);
self.update_size();
Ok(written_bytes)
}
fn flush(&mut self) -> io::Result<()> {
self.flush_dir_entry()?;
let mut disk = self.fs.disk.borrow_mut();
disk.flush()
}
}
impl<'a, 'b> Seek for File<'a, 'b> {
fn seek(&mut self, pos: SeekFrom) -> io::Result<u64> {
let mut new_pos = match pos {
SeekFrom::Current(x) => self.offset as i64 + x,
SeekFrom::Start(x) => x as i64,
2017-10-15 21:56:01 +08:00
SeekFrom::End(x) => self.entry.iter().next().map_or(None, |e| e.data.size()).expect("cannot seek from end if size is unknown") as i64 + x,
};
if new_pos < 0 {
return Err(io::Error::new(ErrorKind::InvalidInput, "invalid seek"));
}
new_pos = match self.entry {
2017-10-15 21:56:01 +08:00
Some(ref e) => {
if e.data.size().map_or(false, |s| new_pos > s as i64) {
info!("seek beyond end of file");
e.data.size().unwrap() as i64 // safe
} else {
new_pos
}
},
_ => new_pos,
};
2017-10-15 21:56:01 +08:00
trace!("file seek {} -> {} - entry {:?}", self.offset, new_pos, self.entry);
if new_pos == self.offset as i64 {
return Ok(self.offset as u64);
}
let cluster_size = self.fs.get_cluster_size();
// get number of clusters to seek (favoring previous cluster in corner case)
let cluster_count = ((new_pos + cluster_size as i64 - 1) / cluster_size as i64 - 1) as isize;
let old_cluster_count = ((self.offset as i64 + cluster_size as i64 - 1) / cluster_size as i64 - 1) as isize;
let new_cluster = if new_pos == 0 {
2017-10-10 03:14:28 +08:00
None
} else if cluster_count == old_cluster_count {
self.current_cluster
2017-10-10 03:14:28 +08:00
} else {
match self.first_cluster {
Some(n) => {
let mut cluster = n;
let mut iter = self.fs.cluster_iter(n);
for i in 0..cluster_count {
cluster = match iter.next() {
Some(r) => r?,
None => {
// chain ends before new position - seek to end of last cluster
new_pos = (i + 1) as i64 * cluster_size as i64;
break;
},
};
}
Some(cluster)
},
None => {
// empty file - always seek to 0
new_pos = 0;
None
},
}
};
self.offset = new_pos as u32;
self.current_cluster = new_cluster;
Ok(self.offset as u64)
}
}