Struct Graph 

pub struct Graph { /* private fields */ }

A CUDA graph — DAG of operations, replayable via Graph::instantiate.

Implementations

impl Graph

pub fn new() -> Result<Self>

Create an empty graph.

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

Compile this graph into an executable form.

pub fn node_count(&self) -> Result<usize>

Approximate node count (for debugging).

pub fn as_raw(&self) -> cudaGraph_t

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

Add an empty “barrier” node with the given dependencies.

pub unsafe fn add_kernel_node( &self, dependencies: &[GraphNode], kernel: &Kernel, grid: Dim3, block: Dim3, shared_mem_bytes: u32, args: &mut [*mut c_void], ) -> Result<GraphNode>

Add a kernel-launch node.

Safety

Same discipline as crate::LaunchBuilder::launch: argument count/order/types must match the kernel’s C signature.

pub fn add_memset_u32_node( &self, dependencies: &[GraphNode], dst: *mut c_void, value: u32, count: usize, ) -> Result<GraphNode>

Add a memset node filling count 4-byte words at dst with value.

pub unsafe fn add_host_node( &self, dependencies: &[GraphNode], fn_: unsafe extern "C" fn(*mut c_void), user_data: *mut c_void, ) -> Result<GraphNode>

Add a host-function node. fn_ runs on a driver-owned thread when this node executes.

Safety

fn_ must remain callable with user_data as long as any GraphExec derived from this graph is alive.

pub fn add_child_graph_node( &self, dependencies: &[GraphNode], child: &Graph, ) -> Result<GraphNode>

Add a child-graph node.

pub fn add_event_record_node( &self, dependencies: &[GraphNode], event: &Event, ) -> Result<GraphNode>

Add an event-record node.

pub fn add_event_wait_node( &self, dependencies: &[GraphNode], event: &Event, ) -> Result<GraphNode>

Add an event-wait node.

pub fn add_mem_alloc_node( &self, dependencies: &[GraphNode], device: &Device, bytesize: usize, ) -> Result<(GraphNode, *mut c_void)>

Add a stream-ordered mem-alloc node. Returns the node plus the device pointer the node will allocate at launch time.

pub unsafe fn add_mem_free_node( &self, dependencies: &[GraphNode], dptr: *mut c_void, ) -> Result<GraphNode>

Add a stream-ordered mem-free node for dptr.

Safety

dptr must be a pointer returned by a prior mem-alloc node in this graph.

pub fn conditional_handle_create( &self, default_launch_value: u32, flags: u32, ) -> Result<u64>

Create a conditional-node handle (CUDA 12.3+). The returned u64 is an opaque driver handle used by cuGraphAddNode-style conditional-node construction, which the runtime exposes via cudaGraphAddNode. default_launch_value is the handle’s starting value (commonly 0 = “don’t execute”), flags = 0 for the default. Returns crate::Error::FeatureNotSupported on older CUDA.

pub unsafe fn add_node_raw( &self, dependencies: &[GraphNode], node_params: *mut c_void, ) -> Result<GraphNode>

Low-level cudaGraphAddNode — add a node from a tagged cudaGraphNodeParams struct. baracuda-runtime exposes typed builders for the common node types (kernel, memset, host, etc.); this escape hatch exists for the node types the typed API does not cover (notably conditional nodes on CUDA 12.3+).

Safety

node_params must point at a correctly-tagged cudaGraphNodeParams whose union payload matches the type field.

pub fn add_dependencies( &self, from: &[GraphNode], to: &[GraphNode], ) -> Result<()>

Add dependency edges from[i] -> to[i].

impl Graph

pub fn retain_user_object( &self, object: &UserObject, count: u32, flags: u32, ) -> Result<()>

Have this graph retain count references to object.

pub fn release_user_object(&self, object: &UserObject, count: u32) -> Result<()>

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Graph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.