rendy_graph/node/mod.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 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 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548
//! Defines node - building block for framegraph.
//!
pub mod present;
pub mod render;
use {
crate::{
command::{Capability, Families, Family, FamilyId, Fence, Queue, Submission, Submittable},
factory::{Factory, UploadError},
frame::Frames,
graph::GraphContext,
wsi::SwapchainError,
BufferId, ImageId, NodeId,
},
rendy_core::hal::{queue::QueueFamilyId, Backend},
};
/// Buffer access node will perform.
/// Node must not perform any access to the buffer not specified in `access`.
/// All access must be between logically first and last `stages`.
#[derive(Clone, Copy, Debug)]
pub struct BufferAccess {
/// Access flags.
pub access: rendy_core::hal::buffer::Access,
/// Intended usage flags for buffer.
/// TODO: Could derive from access?
pub usage: rendy_core::hal::buffer::Usage,
/// Pipeline stages at which buffer is accessd.
pub stages: rendy_core::hal::pso::PipelineStage,
}
/// Buffer pipeline barrier.
#[derive(Clone, Debug)]
pub struct BufferBarrier {
/// State transition for the buffer.
pub states: std::ops::Range<rendy_core::hal::buffer::State>,
/// Stages at which buffer is accessd.
pub stages: std::ops::Range<rendy_core::hal::pso::PipelineStage>,
/// Transfer between families.
pub families: Option<std::ops::Range<QueueFamilyId>>,
}
/// Buffer shared between nodes.
///
/// If Node doesn't actually use the buffer it can merge acquire and release barriers into one.
/// TODO: Make merge function.
#[derive(Clone, Debug)]
pub struct NodeBuffer {
/// Id of the buffer.
pub id: BufferId,
/// Region of the buffer that is the transient resource.
pub range: std::ops::Range<u64>,
/// Acquire barrier.
/// Node implementation must insert it before first command that uses the buffer.
/// Barrier must be inserted even if this node doesn't use the buffer.
pub acquire: Option<BufferBarrier>,
/// Release barrier.
/// Node implementation must insert it after last command that uses the buffer.
/// Barrier must be inserted even if this node doesn't use the buffer.
pub release: Option<BufferBarrier>,
}
/// Image access node wants to perform.
#[derive(Clone, Copy, Debug)]
pub struct ImageAccess {
/// Access flags.
pub access: rendy_core::hal::image::Access,
/// Intended usage flags for image.
/// TODO: Could derive from access?
pub usage: rendy_core::hal::image::Usage,
/// Preferred layout for access.
/// Actual layout will be reported int `NodeImage`.
/// Actual layout is guaranteed to support same operations.
/// TODO: Could derive from access?
pub layout: rendy_core::hal::image::Layout,
/// Pipeline stages at which image is accessd.
pub stages: rendy_core::hal::pso::PipelineStage,
}
/// Image pipeline barrier.
/// Node implementation must insert it before first command that uses the image.
/// Barrier must be inserted even if this node doesn't use the image.
#[derive(Clone, Debug)]
pub struct ImageBarrier {
/// State transition for the image.
pub states: std::ops::Range<rendy_core::hal::image::State>,
/// Stages at which image is accessd.
pub stages: std::ops::Range<rendy_core::hal::pso::PipelineStage>,
/// Transfer between families.
pub families: Option<std::ops::Range<QueueFamilyId>>,
}
/// Image shared between nodes.
#[derive(Clone, Debug)]
pub struct NodeImage {
/// Id of the image.
pub id: ImageId,
/// Region of the image that is the transient resource.
pub range: rendy_core::hal::image::SubresourceRange,
/// Image state for node.
pub layout: rendy_core::hal::image::Layout,
/// Specify that node should clear image to this value.
pub clear: Option<rendy_core::hal::command::ClearValue>,
/// Acquire barrier.
/// Node implementation must insert it before first command that uses the image.
/// Barrier must be inserted even if this node doesn't use the image.
pub acquire: Option<ImageBarrier>,
/// Release barrier.
/// Node implementation must insert it after last command that uses the image.
/// Barrier must be inserted even if this node doesn't use the image.
pub release: Option<ImageBarrier>,
}
/// NodeSubmittable
pub trait NodeSubmittable<'a, B: Backend> {
/// Submittable type returned from `Node`.
type Submittable: Submittable<B> + 'a;
/// Iterator over submittables returned from `Node`.
type Submittables: IntoIterator<Item = Self::Submittable>;
}
/// The node is building block of the framegraph.
/// Node defines set of resources and operations to perform over them.
/// Read-only data for operations comes from auxiliary data source `T`.
///
/// # Parameters
///
/// `B` - backend type.
/// `T` - auxiliary data type.
///
pub trait Node<B: Backend, T: ?Sized>:
for<'a> NodeSubmittable<'a, B> + std::fmt::Debug + Sized + Sync + Send + 'static
{
/// Capability required by node.
/// Graph will execute this node on command queue that supports this capability level.
type Capability: Capability;
/// Record commands required by node.
/// Returned submits are guaranteed to be submitted within specified frame.
fn run<'a>(
&'a mut self,
ctx: &GraphContext<B>,
factory: &Factory<B>,
aux: &T,
frames: &'a Frames<B>,
) -> <Self as NodeSubmittable<'a, B>>::Submittables;
/// Dispose of the node.
///
/// # Safety
///
/// Must be called after waiting for device idle.
unsafe fn dispose(self, factory: &mut Factory<B>, aux: &T);
}
/// Description of the node.
/// Implementation of the builder type provide framegraph with static information about node
/// that is used for building the node.
pub trait NodeDesc<B: Backend, T: ?Sized>: std::fmt::Debug + Sized + 'static {
/// Node this builder builds.
type Node: Node<B, T>;
/// Make node builder.
fn builder(self) -> DescBuilder<B, T, Self> {
DescBuilder::new(self)
}
/// Get set or buffer resources the node uses.
fn buffers(&self) -> Vec<BufferAccess> {
Vec::new()
}
/// Get set or image resources the node uses.
fn images(&self) -> Vec<ImageAccess> {
Vec::new()
}
/// Build the node.
///
/// # Parameters
///
/// `factory` - factory instance.
/// `aux` - auxiliary data.
/// `family` - id of the family this node will be executed on.
/// `resources` - set of transient resources managed by graph.
/// with barriers required for interface resources.
///
fn build<'a>(
self,
ctx: &GraphContext<B>,
factory: &mut Factory<B>,
family: &mut Family<B>,
queue: usize,
aux: &T,
buffers: Vec<NodeBuffer>,
images: Vec<NodeImage>,
) -> Result<Self::Node, NodeBuildError>;
}
/// Trait-object safe `Node`.
pub trait DynNode<B: Backend, T: ?Sized>: std::fmt::Debug + Sync + Send {
/// Record commands required by node.
/// Recorded buffers go into `submits`.
unsafe fn run<'a>(
&mut self,
ctx: &GraphContext<B>,
factory: &Factory<B>,
queue: &mut Queue<B>,
aux: &T,
frames: &Frames<B>,
waits: &[(&'a B::Semaphore, rendy_core::hal::pso::PipelineStage)],
signals: &[&'a B::Semaphore],
fence: Option<&mut Fence<B>>,
);
/// Dispose of the node.
///
/// # Safety
///
/// Must be called after waiting for device idle.
unsafe fn dispose(self: Box<Self>, factory: &mut Factory<B>, aux: &T);
}
impl<B, T, N> DynNode<B, T> for (N,)
where
B: Backend,
T: ?Sized,
N: Node<B, T>,
{
unsafe fn run<'a>(
&mut self,
ctx: &GraphContext<B>,
factory: &Factory<B>,
queue: &mut Queue<B>,
aux: &T,
frames: &Frames<B>,
waits: &[(&'a B::Semaphore, rendy_core::hal::pso::PipelineStage)],
signals: &[&'a B::Semaphore],
fence: Option<&mut Fence<B>>,
) {
let submittables = Node::run(&mut self.0, ctx, factory, aux, frames);
queue.submit(
Some(
Submission::new()
.submits(submittables)
.wait(waits.iter().cloned())
.signal(signals.iter().cloned()),
),
fence,
)
}
unsafe fn dispose(self: Box<Self>, factory: &mut Factory<B>, aux: &T) {
N::dispose(self.0, factory, aux);
}
}
/// Error building a node of the graph.
#[derive(Debug)]
pub enum NodeBuildError {
/// Filed to uplaod the data.
Upload(UploadError),
/// Mismatched queue family.
QueueFamily(FamilyId),
/// Failed to create an imate view.
View(rendy_core::hal::image::ViewError),
/// Failed to create a pipeline.
Pipeline(rendy_core::hal::pso::CreationError),
/// Failed to create a swap chain.
Swapchain(SwapchainError),
/// Ran out of memory when creating something.
OutOfMemory(rendy_core::hal::device::OutOfMemory),
}
/// Dynamic node builder that emits `DynNode`.
pub trait NodeBuilder<B: Backend, T: ?Sized>: std::fmt::Debug {
/// Pick family for this node to be executed onto.
fn family(&self, factory: &mut Factory<B>, families: &Families<B>) -> Option<FamilyId>;
/// Get buffer accessed by the node.
fn buffers(&self) -> Vec<(BufferId, BufferAccess)>;
/// Get images accessed by the node.
fn images(&self) -> Vec<(ImageId, ImageAccess)>;
/// Indices of nodes this one dependes on.
fn dependencies(&self) -> Vec<NodeId>;
/// Build node.
fn build<'a>(
self: Box<Self>,
ctx: &GraphContext<B>,
factory: &mut Factory<B>,
family: &mut Family<B>,
queue: usize,
aux: &T,
buffers: Vec<NodeBuffer>,
images: Vec<NodeImage>,
) -> Result<Box<dyn DynNode<B, T>>, NodeBuildError>;
}
/// Builder for the node.
pub struct DescBuilder<B: Backend, T: ?Sized, N> {
desc: N,
buffers: Vec<BufferId>,
images: Vec<ImageId>,
dependencies: Vec<NodeId>,
marker: std::marker::PhantomData<fn(B, &T)>,
}
impl<B, T, N> std::fmt::Debug for DescBuilder<B, T, N>
where
B: Backend,
T: ?Sized,
N: std::fmt::Debug,
{
fn fmt(&self, fmt: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
fmt.debug_struct("DescBuilder")
.field("desc", &self.desc)
.field("buffers", &self.buffers)
.field("images", &self.images)
.field("dependencies", &self.dependencies)
.finish()
}
}
impl<B, T, N> DescBuilder<B, T, N>
where
B: Backend,
T: ?Sized,
{
/// Create new builder out of desc
pub fn new(desc: N) -> Self {
DescBuilder {
desc,
buffers: Vec::new(),
images: Vec::new(),
dependencies: Vec::new(),
marker: std::marker::PhantomData,
}
}
/// Add buffer to the node.
/// This method must be called for each buffer node uses.
pub fn add_buffer(&mut self, buffer: BufferId) -> &mut Self {
self.buffers.push(buffer);
self
}
/// Add buffer to the node.
/// This method must be called for each buffer node uses.
pub fn with_buffer(mut self, buffer: BufferId) -> Self {
self.add_buffer(buffer);
self
}
/// Add image to the node.
/// This method must be called for each image node uses.
pub fn add_image(&mut self, image: ImageId) -> &mut Self {
self.images.push(image);
self
}
/// Add image to the node.
/// This method must be called for each image node uses.
pub fn with_image(mut self, image: ImageId) -> Self {
self.add_image(image);
self
}
/// Add dependency.
/// Node will be placed after its dependencies.
pub fn add_dependency(&mut self, dependency: NodeId) -> &mut Self {
self.dependencies.push(dependency);
self
}
/// Add dependency.
/// Node will be placed after its dependencies.
pub fn with_dependency(mut self, dependency: NodeId) -> Self {
self.add_dependency(dependency);
self
}
}
impl<B, T, N> NodeBuilder<B, T> for DescBuilder<B, T, N>
where
B: Backend,
T: ?Sized,
N: NodeDesc<B, T>,
{
fn family(&self, _factory: &mut Factory<B>, families: &Families<B>) -> Option<FamilyId> {
families.with_capability::<<N::Node as Node<B, T>>::Capability>()
}
fn buffers(&self) -> Vec<(BufferId, BufferAccess)> {
let desc_buffers = self.desc.buffers();
assert_eq!(self.buffers.len(), desc_buffers.len());
self.buffers.iter().cloned().zip(desc_buffers).collect()
}
fn images(&self) -> Vec<(ImageId, ImageAccess)> {
let desc_images = self.desc.images();
assert_eq!(self.images.len(), desc_images.len());
self.images.iter().cloned().zip(desc_images).collect()
}
fn dependencies(&self) -> Vec<NodeId> {
self.dependencies.clone()
}
fn build<'a>(
self: Box<Self>,
ctx: &GraphContext<B>,
factory: &mut Factory<B>,
family: &mut Family<B>,
queue: usize,
aux: &T,
buffers: Vec<NodeBuffer>,
images: Vec<NodeImage>,
) -> Result<Box<dyn DynNode<B, T>>, NodeBuildError> {
Ok(Box::new((self.desc.build(
ctx, factory, family, queue, aux, buffers, images,
)?,)))
}
}
/// Convert graph barriers into gfx barriers.
pub fn gfx_acquire_barriers<'a, 'b, B: Backend>(
ctx: &'a GraphContext<B>,
buffers: impl IntoIterator<Item = &'b NodeBuffer>,
images: impl IntoIterator<Item = &'b NodeImage>,
) -> (
std::ops::Range<rendy_core::hal::pso::PipelineStage>,
Vec<rendy_core::hal::memory::Barrier<'a, B>>,
) {
let mut bstart = rendy_core::hal::pso::PipelineStage::empty();
let mut bend = rendy_core::hal::pso::PipelineStage::empty();
let mut istart = rendy_core::hal::pso::PipelineStage::empty();
let mut iend = rendy_core::hal::pso::PipelineStage::empty();
let barriers: Vec<rendy_core::hal::memory::Barrier<'_, B>> = buffers
.into_iter()
.filter_map(|buffer| {
buffer.acquire.as_ref().map(|acquire| {
bstart |= acquire.stages.start;
bend |= acquire.stages.end;
rendy_core::hal::memory::Barrier::Buffer {
states: acquire.states.clone(),
families: acquire.families.clone(),
target: ctx
.get_buffer(buffer.id)
.expect("Buffer does not exist")
.raw(),
range: Some(buffer.range.start)..Some(buffer.range.end),
}
})
})
.chain(images.into_iter().filter_map(|image| {
image.acquire.as_ref().map(|acquire| {
istart |= acquire.stages.start;
iend |= acquire.stages.end;
rendy_core::hal::memory::Barrier::Image {
states: acquire.states.clone(),
families: acquire.families.clone(),
target: ctx.get_image(image.id).expect("Image does not exist").raw(),
range: image.range.clone(),
}
})
}))
.collect();
(bstart | istart..bend | iend, barriers)
}
/// Convert graph barriers into gfx barriers.
pub fn gfx_release_barriers<'a, B: Backend>(
ctx: &'a GraphContext<B>,
buffers: impl IntoIterator<Item = &'a NodeBuffer>,
images: impl IntoIterator<Item = &'a NodeImage>,
) -> (
std::ops::Range<rendy_core::hal::pso::PipelineStage>,
Vec<rendy_core::hal::memory::Barrier<'a, B>>,
) {
let mut bstart = rendy_core::hal::pso::PipelineStage::empty();
let mut bend = rendy_core::hal::pso::PipelineStage::empty();
let mut istart = rendy_core::hal::pso::PipelineStage::empty();
let mut iend = rendy_core::hal::pso::PipelineStage::empty();
let barriers: Vec<rendy_core::hal::memory::Barrier<'_, B>> = buffers
.into_iter()
.filter_map(|buffer| {
buffer.release.as_ref().map(|release| {
bstart |= release.stages.start;
bend |= release.stages.end;
rendy_core::hal::memory::Barrier::Buffer {
states: release.states.clone(),
families: release.families.clone(),
target: ctx
.get_buffer(buffer.id)
.expect("Buffer does not exist")
.raw(),
range: Some(buffer.range.start)..Some(buffer.range.end),
}
})
})
.chain(images.into_iter().filter_map(|image| {
image.release.as_ref().map(|release| {
istart |= release.stages.start;
iend |= release.stages.end;
rendy_core::hal::memory::Barrier::Image {
states: release.states.clone(),
families: release.families.clone(),
target: ctx.get_image(image.id).expect("Image does not exist").raw(),
range: image.range.clone(),
}
})
}))
.collect();
(bstart | istart..bend | iend, barriers)
}