Newer
Older
use collections::vec::Vec;
use system::error::{Result, Error, EEXIST, EISDIR, ENOENT, ENOSPC, ENOTDIR, ENOTEMPTY};
use super::{Disk, ExNode, Extent, Header, Node};
let mut header = (1, Header::default());
try!(disk.read_at(header.0, &mut header.1));
if header.1.valid() {
let mut root = (header.1.root, Node::default());
try!(disk.read_at(root.0, &mut root.1));
let mut free = (header.1.free, Node::default());
try!(disk.read_at(free.0, &mut free.1));
/// Create a file system on a disk
let mut free = (3, Node::new(Node::MODE_FILE, "free", 0));
free.1.extents[0] = Extent::new(4, (size - 4 * 512));
try!(disk.write_at(free.0, &free.1));
let root = (2, Node::new(Node::MODE_DIR, "root", 0));
let header = (1, Header::new(size, root.0, free.0));
try!(disk.write_at(header.0, &header.1));
pub fn allocate(&mut self) -> Result<u64> {
//TODO: traverse next pointer
let free_block = self.header.1.free;
let mut free = try!(self.node(free_block));
for mut extent in free.1.extents.iter_mut() {
extent.length -= 512;
extent.block += 1;
break;
}
}
try!(self.disk.write_at(free.0, &free.1));
let free_block = self.header.1.free;
self.insert_block(block, free_block)
pub fn node(&mut self, block: u64) -> Result<(u64, Node)> {
let mut node = Node::default();
try!(self.disk.read_at(block, &mut node));
Ok((block, node))
pub fn ex_node(&mut self, block: u64) -> Result<(u64, ExNode)> {
let mut node = ExNode::default();
try!(self.disk.read_at(block, &mut node));
Ok((block, node))
}
pub fn child_nodes(&mut self, children: &mut Vec<(u64, Node)>, parent_block: u64) -> Result<()> {
if parent_block == 0 {
return Ok(());
}
let parent = try!(self.node(parent_block));
for extent in parent.1.extents.iter() {
for i in 0 .. extent.length/512 {
children.push(try!(self.node(extent.block + i)));
self.child_nodes(children, parent.1.next)
pub fn find_node(&mut self, name: &str, parent_block: u64) -> Result<(u64, Node)> {
if parent_block == 0 {
let parent = try!(self.node(parent_block));
for extent in parent.1.extents.iter() {
for i in 0 .. extent.length/512 {
let child = try!(self.node(extent.block + i));
let mut matches = false;
if let Ok(child_name) = child.1.name() {
if child_name == name {
matches = true;
self.find_node(name, parent.1.next)
}
fn insert_block(&mut self, block: u64, parent_block: u64) -> Result<()> {
if parent_block == 0 {
}
let mut inserted = false;
let mut parent = try!(self.node(parent_block));
for mut extent in parent.1.extents.iter_mut() {
if extent.length == 0 {
//New extent
inserted = true;
extent.block = block;
extent.length = 512;
break;
} else if extent.block == block + 1 {
//At beginning
inserted = true;
extent.block = block;
extent.length += 512;
} else if extent.block + extent.length/512 == block {
//At end
inserted = true;
extent.length += 512;
break;
}
}
if inserted {
try!(self.disk.write_at(parent.0, &parent.1));
} else {
if parent.1.next == 0 {
parent.1.next = try!(self.allocate());
try!(self.disk.write_at(parent.0, &parent.1));
try!(self.disk.write_at(parent.1.next, &Node::default()));
self.insert_block(block, parent.1.next)
pub fn create_node(&mut self, mode: u16, name: &str, parent_block: u64) -> Result<(u64, Node)> {
if self.find_node(name, parent_block).is_ok() {
Err(Error::new(EEXIST))
} else {
let node = (try!(self.allocate()), Node::new(mode, name, parent_block));
try!(self.disk.write_at(node.0, &node.1));
try!(self.insert_block(node.0, parent_block));
Ok(node)
fn remove_block(&mut self, block: u64, parent_block: u64) -> Result<()> {
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
}
let mut removed = false;
let mut replace_option = None;
let mut parent = try!(self.node(parent_block));
for mut extent in parent.1.extents.iter_mut() {
if block >= extent.block && block < extent.block + extent.length/512 {
//Inside
removed = true;
let left = Extent::new(extent.block, (block - extent.block) * 512);
let right = Extent::new(block + 1, ((extent.block + extent.length/512) - (block + 1)) * 512);
if left.length > 0 {
*extent = left;
if right.length > 0 {
replace_option = Some(right);
}
} else if right.length > 0 {
*extent = right;
} else {
*extent = Extent::default();
}
break;
}
}
if removed {
try!(self.disk.write_at(parent.0, &parent.1));
if let Some(replace) = replace_option {
for i in 0..replace.length/512 {
let block = replace.block + i;
//TODO: Check error
try!(self.insert_block(block, parent_block));
try!(self.deallocate(block));
parent.1.next = try!(self.allocate());
try!(self.disk.write_at(parent.0, &parent.1));
try!(self.disk.write_at(parent.1.next, &Node::default()));
}
self.remove_block(block, parent.1.next)
}
}
pub fn remove_node(&mut self, mode: u16, name: &str, parent_block: u64) -> Result<()> {
let node = try!(self.find_node(name, parent_block));
if node.1.mode & Node::MODE_TYPE == mode {
if node.1.is_dir() {
let mut children = Vec::new();
try!(self.child_nodes(&mut children, node.0));
if ! children.is_empty() {
return Err(Error::new(ENOTEMPTY));
try!(self.remove_block(node.0, parent_block));
try!(self.disk.write_at(node.0, &Node::default()));
Ok(())
} else if node.1.is_dir() {
Err(Error::new(EISDIR))
} else {
Err(Error::new(ENOTDIR))