2020-01-02 15:13:47 -05:00
|
|
|
// Copyright 2018-2020 the Deno authors. All rights reserved. MIT license.
|
2019-10-23 12:32:28 -04:00
|
|
|
|
|
|
|
// Think of Resources as File Descriptors. They are integers that are allocated by
|
|
|
|
// the privileged side of Deno to refer to various rust objects that need to be
|
|
|
|
// referenced between multiple ops. For example, network sockets are resources.
|
|
|
|
// Resources may or may not correspond to a real operating system file
|
|
|
|
// descriptor (hence the different name).
|
|
|
|
|
|
|
|
use std::any::Any;
|
|
|
|
use std::collections::HashMap;
|
|
|
|
|
|
|
|
/// ResourceId is Deno's version of a file descriptor. ResourceId is also referred
|
|
|
|
/// to as rid in the code base.
|
|
|
|
pub type ResourceId = u32;
|
|
|
|
|
|
|
|
/// These store Deno's file descriptors. These are not necessarily the operating
|
|
|
|
/// system ones.
|
2020-09-14 22:33:18 -04:00
|
|
|
type ResourceMap = HashMap<ResourceId, (String, Box<dyn Any>)>;
|
2019-10-23 12:32:28 -04:00
|
|
|
|
|
|
|
#[derive(Default)]
|
|
|
|
pub struct ResourceTable {
|
2019-11-07 18:52:21 -05:00
|
|
|
map: ResourceMap,
|
2019-10-23 12:32:28 -04:00
|
|
|
next_id: u32,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl ResourceTable {
|
2020-02-26 01:01:24 -05:00
|
|
|
pub fn has(&self, rid: ResourceId) -> bool {
|
|
|
|
self.map.contains_key(&rid)
|
|
|
|
}
|
|
|
|
|
2020-09-14 22:33:18 -04:00
|
|
|
pub fn get<T: Any>(&self, rid: ResourceId) -> Option<&T> {
|
|
|
|
let (_, resource) = self.map.get(&rid)?;
|
|
|
|
resource.downcast_ref::<T>()
|
2019-10-23 12:32:28 -04:00
|
|
|
}
|
|
|
|
|
2020-09-14 22:33:18 -04:00
|
|
|
pub fn get_mut<T: Any>(&mut self, rid: ResourceId) -> Option<&mut T> {
|
|
|
|
let (_, resource) = self.map.get_mut(&rid)?;
|
|
|
|
resource.downcast_mut::<T>()
|
2019-10-23 12:32:28 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: resource id allocation should probably be randomized for security.
|
|
|
|
fn next_rid(&mut self) -> ResourceId {
|
|
|
|
let next_rid = self.next_id;
|
|
|
|
self.next_id += 1;
|
|
|
|
next_rid as ResourceId
|
|
|
|
}
|
|
|
|
|
2020-09-14 22:33:18 -04:00
|
|
|
pub fn add(&mut self, name: &str, resource: Box<dyn Any>) -> ResourceId {
|
2019-10-23 12:32:28 -04:00
|
|
|
let rid = self.next_rid();
|
2019-11-06 12:17:28 -05:00
|
|
|
let r = self.map.insert(rid, (name.to_string(), resource));
|
2019-10-23 12:32:28 -04:00
|
|
|
assert!(r.is_none());
|
|
|
|
rid
|
|
|
|
}
|
|
|
|
|
2020-09-17 12:09:50 -04:00
|
|
|
pub fn entries(&self) -> HashMap<ResourceId, String> {
|
2019-10-28 20:42:44 -04:00
|
|
|
self
|
|
|
|
.map
|
|
|
|
.iter()
|
2019-11-06 12:17:28 -05:00
|
|
|
.map(|(key, (name, _resource))| (*key, name.clone()))
|
2019-10-28 20:42:44 -04:00
|
|
|
.collect()
|
|
|
|
}
|
|
|
|
|
2019-10-23 12:32:28 -04:00
|
|
|
// close(2) is done by dropping the value. Therefore we just need to remove
|
2019-11-14 12:10:25 -05:00
|
|
|
// the resource from the resource table.
|
2019-10-28 20:42:44 -04:00
|
|
|
pub fn close(&mut self, rid: ResourceId) -> Option<()> {
|
2019-11-07 09:59:02 -05:00
|
|
|
self.map.remove(&rid).map(|(_name, _resource)| ())
|
2019-10-23 12:32:28 -04:00
|
|
|
}
|
2020-04-18 11:21:20 -04:00
|
|
|
|
2020-09-14 22:33:18 -04:00
|
|
|
pub fn remove<T: Any>(&mut self, rid: ResourceId) -> Option<Box<T>> {
|
2020-04-18 11:21:20 -04:00
|
|
|
if let Some((_name, resource)) = self.map.remove(&rid) {
|
|
|
|
let res = match resource.downcast::<T>() {
|
|
|
|
Ok(res) => Some(res),
|
|
|
|
Err(_e) => None,
|
|
|
|
};
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
None
|
|
|
|
}
|
2019-10-23 12:32:28 -04:00
|
|
|
}
|
|
|
|
|
2020-02-29 12:35:45 -05:00
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
|
|
|
use super::*;
|
|
|
|
|
|
|
|
struct FakeResource {
|
|
|
|
not_empty: u128,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl FakeResource {
|
|
|
|
fn new(value: u128) -> FakeResource {
|
|
|
|
FakeResource { not_empty: value }
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_create_resource_table_default() {
|
|
|
|
let table = ResourceTable::default();
|
|
|
|
assert_eq!(table.map.len(), 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_add_to_resource_table_not_empty() {
|
|
|
|
let mut table = ResourceTable::default();
|
|
|
|
table.add("fake1", Box::new(FakeResource::new(1)));
|
|
|
|
table.add("fake2", Box::new(FakeResource::new(2)));
|
|
|
|
assert_eq!(table.map.len(), 2);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_add_to_resource_table_are_contiguous() {
|
|
|
|
let mut table = ResourceTable::default();
|
|
|
|
let rid1 = table.add("fake1", Box::new(FakeResource::new(1)));
|
|
|
|
let rid2 = table.add("fake2", Box::new(FakeResource::new(2)));
|
|
|
|
assert_eq!(rid1 + 1, rid2);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_get_from_resource_table_is_what_was_given() {
|
|
|
|
let mut table = ResourceTable::default();
|
|
|
|
let rid = table.add("fake", Box::new(FakeResource::new(7)));
|
|
|
|
let resource = table.get::<FakeResource>(rid);
|
|
|
|
assert_eq!(resource.unwrap().not_empty, 7);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_remove_from_resource_table() {
|
|
|
|
let mut table = ResourceTable::default();
|
|
|
|
let rid1 = table.add("fake1", Box::new(FakeResource::new(1)));
|
|
|
|
let rid2 = table.add("fake2", Box::new(FakeResource::new(2)));
|
|
|
|
assert_eq!(table.map.len(), 2);
|
|
|
|
table.close(rid1);
|
|
|
|
assert_eq!(table.map.len(), 1);
|
|
|
|
table.close(rid2);
|
|
|
|
assert_eq!(table.map.len(), 0);
|
|
|
|
}
|
2020-04-18 11:21:20 -04:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_take_from_resource_table() {
|
|
|
|
let mut table = ResourceTable::default();
|
|
|
|
let rid1 = table.add("fake1", Box::new(FakeResource::new(1)));
|
|
|
|
let rid2 = table.add("fake2", Box::new(FakeResource::new(2)));
|
|
|
|
assert_eq!(table.map.len(), 2);
|
|
|
|
let res1 = table.remove::<FakeResource>(rid1);
|
|
|
|
assert_eq!(table.map.len(), 1);
|
|
|
|
assert!(res1.is_some());
|
|
|
|
let res2 = table.remove::<FakeResource>(rid2);
|
|
|
|
assert_eq!(table.map.len(), 0);
|
|
|
|
assert!(res2.is_some());
|
|
|
|
}
|
2020-02-29 12:35:45 -05:00
|
|
|
}
|