Struct bevy_render::render_graph::RenderGraph
source · [−]pub struct RenderGraph { /* private fields */ }
Expand description
The render graph configures the modular, parallel and re-usable render logic. It is a retained and stateless (nodes itself my have their internal state) structure, which can not be modified while it is executed by the graph runner.
The RenderGraphRunner
is responsible for executing the entire graph each frame.
It consists of three main components: Nodes
, Edges
and Slots
.
Nodes are responsible for generating draw calls and operating on input and output slots. Edges specify the order of execution for nodes and connect input and output slots together. Slots describe the render resources created or used by the nodes.
Additionally a render graph can contain multiple sub graphs, which are run by the corresponding nodes. Every render graph can have it’s own optional input node.
Example
Here is a simple render graph example with two nodes connected by a node edge.
let mut graph = RenderGraph::default();
graph.add_node("input_node", MyNode);
graph.add_node("output_node", MyNode);
graph.add_node_edge("output_node", "input_node").unwrap();
Implementations
sourceimpl RenderGraph
impl RenderGraph
sourcepub const INPUT_NODE_NAME: &'static str = "GraphInputNode"
pub const INPUT_NODE_NAME: &'static str = "GraphInputNode"
The name of the GraphInputNode
of this graph. Used to connect other nodes to it.
sourcepub fn update(&mut self, world: &mut World)
pub fn update(&mut self, world: &mut World)
Updates all nodes and sub graphs of the render graph. Should be called before executing it.
sourcepub fn set_input(&mut self, inputs: Vec<SlotInfo>) -> NodeId
pub fn set_input(&mut self, inputs: Vec<SlotInfo>) -> NodeId
Creates an GraphInputNode
with the specified slots if not already present.
sourcepub fn input_node(&self) -> Option<&NodeState>
pub fn input_node(&self) -> Option<&NodeState>
Returns the NodeState
of the input node of this graph..
sourcepub fn add_node<T>(
&mut self,
name: impl Into<Cow<'static, str>>,
node: T
) -> NodeId where
T: Node,
pub fn add_node<T>(
&mut self,
name: impl Into<Cow<'static, str>>,
node: T
) -> NodeId where
T: Node,
Adds the node
with the name
to the graph.
If the name is already present replaces it instead.
sourcepub fn remove_node(
&mut self,
name: impl Into<Cow<'static, str>>
) -> Result<(), RenderGraphError>
pub fn remove_node(
&mut self,
name: impl Into<Cow<'static, str>>
) -> Result<(), RenderGraphError>
Removes the node
with the name
from the graph.
If the name is does not exist, nothing happens.
sourcepub fn get_node_state(
&self,
label: impl Into<NodeLabel>
) -> Result<&NodeState, RenderGraphError>
pub fn get_node_state(
&self,
label: impl Into<NodeLabel>
) -> Result<&NodeState, RenderGraphError>
Retrieves the NodeState
referenced by the label
.
sourcepub fn get_node_state_mut(
&mut self,
label: impl Into<NodeLabel>
) -> Result<&mut NodeState, RenderGraphError>
pub fn get_node_state_mut(
&mut self,
label: impl Into<NodeLabel>
) -> Result<&mut NodeState, RenderGraphError>
Retrieves the NodeState
referenced by the label
mutably.
sourcepub fn get_node_id(
&self,
label: impl Into<NodeLabel>
) -> Result<NodeId, RenderGraphError>
pub fn get_node_id(
&self,
label: impl Into<NodeLabel>
) -> Result<NodeId, RenderGraphError>
Retrieves the NodeId
referenced by the label
.
sourcepub fn get_node<T>(
&self,
label: impl Into<NodeLabel>
) -> Result<&T, RenderGraphError> where
T: Node,
pub fn get_node<T>(
&self,
label: impl Into<NodeLabel>
) -> Result<&T, RenderGraphError> where
T: Node,
Retrieves the Node
referenced by the label
.
sourcepub fn get_node_mut<T>(
&mut self,
label: impl Into<NodeLabel>
) -> Result<&mut T, RenderGraphError> where
T: Node,
pub fn get_node_mut<T>(
&mut self,
label: impl Into<NodeLabel>
) -> Result<&mut T, RenderGraphError> where
T: Node,
Retrieves the Node
referenced by the label
mutably.
sourcepub fn add_slot_edge(
&mut self,
output_node: impl Into<NodeLabel>,
output_slot: impl Into<SlotLabel>,
input_node: impl Into<NodeLabel>,
input_slot: impl Into<SlotLabel>
) -> Result<(), RenderGraphError>
pub fn add_slot_edge(
&mut self,
output_node: impl Into<NodeLabel>,
output_slot: impl Into<SlotLabel>,
input_node: impl Into<NodeLabel>,
input_slot: impl Into<SlotLabel>
) -> Result<(), RenderGraphError>
Adds the Edge::SlotEdge
to the graph. This guarantees that the output_node
is run before the input_node
and also connects the output_slot
to the input_slot
.
sourcepub fn remove_slot_edge(
&mut self,
output_node: impl Into<NodeLabel>,
output_slot: impl Into<SlotLabel>,
input_node: impl Into<NodeLabel>,
input_slot: impl Into<SlotLabel>
) -> Result<(), RenderGraphError>
pub fn remove_slot_edge(
&mut self,
output_node: impl Into<NodeLabel>,
output_slot: impl Into<SlotLabel>,
input_node: impl Into<NodeLabel>,
input_slot: impl Into<SlotLabel>
) -> Result<(), RenderGraphError>
Removes the Edge::SlotEdge
from the graph. If any nodes or slots do not exist then
nothing happens.
sourcepub fn add_node_edge(
&mut self,
output_node: impl Into<NodeLabel>,
input_node: impl Into<NodeLabel>
) -> Result<(), RenderGraphError>
pub fn add_node_edge(
&mut self,
output_node: impl Into<NodeLabel>,
input_node: impl Into<NodeLabel>
) -> Result<(), RenderGraphError>
Adds the Edge::NodeEdge
to the graph. This guarantees that the output_node
is run before the input_node
.
sourcepub fn remove_node_edge(
&mut self,
output_node: impl Into<NodeLabel>,
input_node: impl Into<NodeLabel>
) -> Result<(), RenderGraphError>
pub fn remove_node_edge(
&mut self,
output_node: impl Into<NodeLabel>,
input_node: impl Into<NodeLabel>
) -> Result<(), RenderGraphError>
Removes the Edge::NodeEdge
from the graph. If either node does not exist then nothing
happens.
sourcepub fn validate_edge(
&mut self,
edge: &Edge,
should_exist: EdgeExistence
) -> Result<(), RenderGraphError>
pub fn validate_edge(
&mut self,
edge: &Edge,
should_exist: EdgeExistence
) -> Result<(), RenderGraphError>
Verifies that the edge existence is as expected and checks that slot edges are connected correctly.
sourcepub fn has_edge(&self, edge: &Edge) -> bool
pub fn has_edge(&self, edge: &Edge) -> bool
Checks whether the edge
already exists in the graph.
sourcepub fn iter_nodes(&self) -> impl Iterator<Item = &NodeState>
pub fn iter_nodes(&self) -> impl Iterator<Item = &NodeState>
Returns an iterator over the NodeStates
.
sourcepub fn iter_nodes_mut(&mut self) -> impl Iterator<Item = &mut NodeState>
pub fn iter_nodes_mut(&mut self) -> impl Iterator<Item = &mut NodeState>
Returns an iterator over the NodeStates
, that allows modifying each value.
sourcepub fn iter_sub_graphs(&self) -> impl Iterator<Item = (&str, &RenderGraph)>
pub fn iter_sub_graphs(&self) -> impl Iterator<Item = (&str, &RenderGraph)>
Returns an iterator over the sub graphs.
sourcepub fn iter_sub_graphs_mut(
&mut self
) -> impl Iterator<Item = (&str, &mut RenderGraph)>
pub fn iter_sub_graphs_mut(
&mut self
) -> impl Iterator<Item = (&str, &mut RenderGraph)>
Returns an iterator over the sub graphs, that allows modifying each value.
sourcepub fn iter_node_inputs(
&self,
label: impl Into<NodeLabel>
) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError>
pub fn iter_node_inputs(
&self,
label: impl Into<NodeLabel>
) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError>
Returns an iterator over a tuple of the input edges and the corresponding output nodes for the node referenced by the label.
sourcepub fn iter_node_outputs(
&self,
label: impl Into<NodeLabel>
) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError>
pub fn iter_node_outputs(
&self,
label: impl Into<NodeLabel>
) -> Result<impl Iterator<Item = (&Edge, &NodeState)>, RenderGraphError>
Returns an iterator over a tuple of the output edges and the corresponding input nodes for the node referenced by the label.
sourcepub fn add_sub_graph(
&mut self,
name: impl Into<Cow<'static, str>>,
sub_graph: RenderGraph
)
pub fn add_sub_graph(
&mut self,
name: impl Into<Cow<'static, str>>,
sub_graph: RenderGraph
)
Adds the sub_graph
with the name
to the graph.
If the name is already present replaces it instead.
sourcepub fn remove_sub_graph(&mut self, name: impl Into<Cow<'static, str>>)
pub fn remove_sub_graph(&mut self, name: impl Into<Cow<'static, str>>)
Removes the sub_graph
with the name
from the graph.
If the name does not exist then nothing happens.
sourcepub fn get_sub_graph(&self, name: impl AsRef<str>) -> Option<&RenderGraph>
pub fn get_sub_graph(&self, name: impl AsRef<str>) -> Option<&RenderGraph>
Retrieves the sub graph corresponding to the name
.
sourcepub fn get_sub_graph_mut(
&mut self,
name: impl AsRef<str>
) -> Option<&mut RenderGraph>
pub fn get_sub_graph_mut(
&mut self,
name: impl AsRef<str>
) -> Option<&mut RenderGraph>
Retrieves the sub graph corresponding to the name
mutably.
Trait Implementations
sourceimpl Debug for RenderGraph
impl Debug for RenderGraph
sourceimpl Default for RenderGraph
impl Default for RenderGraph
sourcefn default() -> RenderGraph
fn default() -> RenderGraph
Returns the “default value” for a type. Read more
Auto Trait Implementations
impl !RefUnwindSafe for RenderGraph
impl Send for RenderGraph
impl Sync for RenderGraph
impl Unpin for RenderGraph
impl !UnwindSafe for RenderGraph
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
sourcefn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
Convert Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
. Read more
sourcefn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
sourcefn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
sourcefn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert &mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s. Read more
sourceimpl<T> DowncastSync for T where
T: Any + Send + Sync,
impl<T> DowncastSync for T where
T: Any + Send + Sync,
sourceimpl<T> FromWorld for T where
T: Default,
impl<T> FromWorld for T where
T: Default,
sourcefn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates Self
using data from the given World
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> WithSubscriber for T
impl<T> WithSubscriber for T
sourcefn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self> where
S: Into<Dispatch>,
Attaches the provided Subscriber
to this type, returning a
WithDispatch
wrapper. Read more
sourcefn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Attaches the current default Subscriber
to this type, returning a
WithDispatch
wrapper. Read more