pub struct GraphNode { /* private fields */ }Expand description
A node inside a Graph. Lightweight Copy handle that borrows the
parent graph’s storage.
Implementations§
Source§impl GraphNode
impl GraphNode
pub fn as_raw(&self) -> cudaGraphNode_t
Sourcepub fn node_type(&self) -> Result<i32>
pub fn node_type(&self) -> Result<i32>
Return the cudaGraphNodeType integer. Compare against CUDA’s
enum values in the runtime API docs (0=Kernel, 1=Memcpy, 2=Memset,
3=Host, 4=Graph, 5=Empty, 6=WaitEvent, 7=EventRecord, 10=MemAlloc,
11=MemFree).
Sourcepub fn mem_free_ptr(&self) -> Result<*mut c_void>
pub fn mem_free_ptr(&self) -> Result<*mut c_void>
For MemFree nodes: return the device pointer this node will free.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GraphNode
impl RefUnwindSafe for GraphNode
impl !Send for GraphNode
impl !Sync for GraphNode
impl Unpin for GraphNode
impl UnsafeUnpin for GraphNode
impl UnwindSafe for GraphNode
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more