rendy_chain/schedule/
family.rs1use super::{
2 queue::{Queue, QueueId},
3 submission::{Submission, SubmissionId},
4};
5
6#[derive(Clone, Debug)]
9pub struct Family<S> {
10 id: rendy_core::hal::queue::QueueFamilyId,
11 queues: Vec<Queue<S>>,
12}
13
14impl<S> Family<S> {
15 pub fn new(id: rendy_core::hal::queue::QueueFamilyId) -> Self {
17 Family {
18 id,
19 queues: Vec::default(),
20 }
21 }
22
23 pub fn id(&self) -> rendy_core::hal::queue::QueueFamilyId {
25 self.id
26 }
27
28 pub fn queue(&self, qid: QueueId) -> Option<&Queue<S>> {
35 assert_eq!(self.id, qid.family());
36 self.queues.get(qid.index())
37 }
38
39 pub fn queue_mut(&mut self, qid: QueueId) -> Option<&mut Queue<S>> {
46 assert_eq!(self.id, qid.family());
47 self.queues.get_mut(qid.index())
48 }
49
50 pub fn ensure_queue(&mut self, qid: QueueId) -> &mut Queue<S> {
58 assert_eq!(self.id, qid.family());
59 let len = self.queues.len();
60 self.queues
61 .extend((len..qid.index() + 1).map(|i| Queue::new(QueueId::new(qid.family(), i))));
62 &mut self.queues[qid.index()]
63 }
64
65 pub fn submission(&self, sid: SubmissionId) -> Option<&Submission<S>> {
72 assert_eq!(self.id, sid.family());
73 self.queue(sid.queue())
74 .and_then(|queue| queue.submission(sid))
75 }
76
77 pub fn submission_mut(&mut self, sid: SubmissionId) -> Option<&mut Submission<S>> {
84 assert_eq!(self.id, sid.family());
85 self.queue_mut(sid.queue())
86 .and_then(|queue| queue.submission_mut(sid))
87 }
88
89 pub fn iter(&self) -> impl Iterator<Item = &Queue<S>> {
91 self.queues.iter()
92 }
93
94 pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut Queue<S>> {
96 self.queues.iter_mut()
97 }
98
99 pub fn queue_count(&self) -> usize {
101 self.queues.len()
102 }
103}