Struct CudaGraph 

pub struct CudaGraph { /* private fields */ }

CUDA Graph: a directed acyclic graph of GPU operations

Implementations

impl CudaGraph

pub fn new(name: &str) -> Self

Create a new empty graph

pub fn name(&self) -> &str

Get graph name

pub fn node_count(&self) -> usize

Get node count

pub fn add_kernel_node( &mut self, name: &str, grid: [u32; 3], block: [u32; 3], dependencies: &[NodeId], ) -> Result<NodeId>

Add a kernel node

pub fn add_memcpy_node( &mut self, size: usize, kind: MemcpyDirection, dependencies: &[NodeId], ) -> Result<NodeId>

Add a memcpy node

pub fn add_memset_node( &mut self, size: usize, value: u8, dependencies: &[NodeId], ) -> Result<NodeId>

Add a memset node

pub fn add_host_node( &mut self, name: &str, dependencies: &[NodeId], ) -> Result<NodeId>

Add a host callback node

pub fn add_empty_node(&mut self, dependencies: &[NodeId]) -> Result<NodeId>

Add an empty synchronization node

pub fn get_node(&self, id: NodeId) -> Option<&GraphNode>

Get a node by ID

pub fn root_nodes(&self) -> Vec<NodeId>

Get all root nodes (no dependencies)

pub fn topological_order(&self) -> Result<Vec<NodeId>>

Get topological ordering of nodes for execution

pub fn validate(&self) -> Result<()>

Check if the graph is a valid DAG (no cycles)

pub fn instantiate(&mut self) -> Result<GraphExec>

Instantiate the graph (compile for execution)

pub fn is_instantiated(&self) -> bool

Whether the graph has been instantiated