rendy_chain/schedule/
submission.rsuse super::queue::QueueId;
use crate::Id;
use std::collections::HashMap;
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub struct SubmissionId {
pub queue: QueueId,
pub index: usize,
}
impl SubmissionId {
pub fn new(queue: QueueId, index: usize) -> Self {
SubmissionId { queue, index }
}
pub fn family(&self) -> rendy_core::hal::queue::QueueFamilyId {
self.queue.family()
}
pub fn queue(&self) -> QueueId {
self.queue
}
pub fn index(&self) -> usize {
self.index
}
}
#[derive(Clone, Debug)]
pub struct Submission<S> {
node: usize,
id: SubmissionId,
buffer_links: HashMap<Id, usize>,
image_links: HashMap<Id, usize>,
wait_factor: usize,
submit_order: usize,
sync: S,
}
impl<S> Submission<S> {
pub fn node(&self) -> usize {
self.node
}
pub fn id(&self) -> SubmissionId {
self.id
}
pub fn sync(&self) -> &S {
&self.sync
}
pub fn wait_factor(&self) -> usize {
self.wait_factor
}
pub fn submit_order(&self) -> usize {
self.submit_order
}
pub fn buffer_link_index(&self, id: Id) -> usize {
self.buffer_links[&id]
}
pub fn set_buffer_link(&mut self, id: Id, link: usize) {
assert!(self.buffer_links.insert(id, link).is_none());
}
pub fn image_link_index(&self, id: Id) -> usize {
self.image_links[&id]
}
pub fn set_image_link(&mut self, id: Id, link: usize) {
assert!(self.image_links.insert(id, link).is_none());
}
pub(crate) fn new(
node: usize,
wait_factor: usize,
submit_order: usize,
id: SubmissionId,
sync: S,
) -> Self {
Submission {
node,
buffer_links: HashMap::default(),
image_links: HashMap::default(),
id,
wait_factor,
submit_order,
sync,
}
}
pub fn set_sync<T>(&self, sync: T) -> Submission<T> {
Submission {
node: self.node,
buffer_links: self.buffer_links.clone(),
image_links: self.image_links.clone(),
id: self.id,
wait_factor: self.wait_factor,
submit_order: self.submit_order,
sync,
}
}
}