pub struct CudaMemoryPool {
pub free_blocks: HashMap<usize, Vec<CudaMemoryBlock>>,
pub allocated_blocks: HashMap<usize, CudaMemoryBlock>,
pub total_allocated: usize,
pub memory_limit: usize,
}Expand description
CUDA memory pool for efficient allocation
Fields§
§free_blocks: HashMap<usize, Vec<CudaMemoryBlock>>Available memory blocks
allocated_blocks: HashMap<usize, CudaMemoryBlock>Allocated memory blocks
total_allocated: usizeTotal allocated memory
memory_limit: usizeMemory allocation limit
Implementations§
Source§impl CudaMemoryPool
impl CudaMemoryPool
Sourcepub fn allocate(&mut self, size: usize) -> Option<CudaMemoryBlock>
pub fn allocate(&mut self, size: usize) -> Option<CudaMemoryBlock>
Allocate memory block
Sourcepub fn get_stats(&self) -> CudaMemoryStats
pub fn get_stats(&self) -> CudaMemoryStats
Get memory usage statistics
Trait Implementations§
Auto Trait Implementations§
impl Freeze for CudaMemoryPool
impl RefUnwindSafe for CudaMemoryPool
impl Send for CudaMemoryPool
impl Sync for CudaMemoryPool
impl Unpin for CudaMemoryPool
impl UnwindSafe for CudaMemoryPool
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.