pub struct DevicePointer<T>where
T: DeviceCopy + ?Sized,{ /* private fields */ }
Expand description
A pointer to device memory.
DevicePointer
cannot be dereferenced by the CPU, as it is a pointer to a memory allocation in
the device. It can be safely copied to the device (eg. as part of a kernel launch) and either
unwrapped or transmuted to an appropriate pointer.
DevicePointer
is guaranteed to have an equivalent internal representation to a raw pointer.
Thus, it can be safely reinterpreted or transmuted to *mut T
. It is safe to pass a
DevicePointer
through an FFI boundary to C code expecting a *mut T
, so long as the code on
the other side of that boundary does not attempt to dereference the pointer on the CPU. It is
thus possible to pass a DevicePointer
to a CUDA kernel written in C.
Implementations§
Source§impl<T> DevicePointer<T>where
T: DeviceCopy + ?Sized,
impl<T> DevicePointer<T>where
T: DeviceCopy + ?Sized,
Sourcepub fn as_ptr(&self) -> *const T
pub fn as_ptr(&self) -> *const T
Returns a rust pointer
created from this pointer, meant for FFI purposes.
The pointer is not dereferenceable from the CPU!
Sourcepub fn as_mut_ptr(&self) -> *mut T
pub fn as_mut_ptr(&self) -> *mut T
Returns a rust pointer
created from this pointer, meant for FFI purposes.
The pointer is not dereferenceable from the CPU!
Sourcepub fn from_raw(ptr: u64) -> DevicePointer<T>
pub fn from_raw(ptr: u64) -> DevicePointer<T>
Create a DevicePointer from a raw CUDA pointer
Sourcepub fn is_null(self) -> bool
pub fn is_null(self) -> bool
Returns true if the pointer is null.
§Examples
use cust::memory::*;
use std::ptr;
unsafe {
let null : *mut u64 = ptr::null_mut();
assert!(DevicePointer::wrap(null).is_null());
}
Sourcepub fn null() -> DevicePointer<T>
pub fn null() -> DevicePointer<T>
Returns a null device pointer.
Sourcepub unsafe fn offset(self, count: isize) -> DevicePointer<T>
pub unsafe fn offset(self, count: isize) -> DevicePointer<T>
Calculates the offset from a device pointer.
count
is in units of T; eg. a count
of 3 represents a pointer offset of
3 * size_of::<T>()
bytes.
§Safety
If any of the following conditions are violated, the result is Undefined Behavior:
-
Both the starting and resulting pointer must be either in bounds or one byte past the end of the same allocated object.
-
The computed offset, in bytes, cannot overflow an
isize
. -
The offset being in bounds cannot rely on “wrapping around” the address space. That is, the infinite-precision sum, in bytes must fit in a usize.
Consider using wrapping_offset
instead if these constraints are
difficult to satisfy. The only advantage of this method is that it
enables more aggressive compiler optimizations.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.offset(1); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub fn wrapping_offset(self, count: isize) -> DevicePointer<T>
pub fn wrapping_offset(self, count: isize) -> DevicePointer<T>
Calculates the offset from a device pointer using wrapping arithmetic.
count
is in units of T; eg. a count
of 3 represents a pointer offset of
3 * size_of::<T>()
bytes.
§Safety
The resulting pointer does not need to be in bounds, but it is
potentially hazardous to dereference (which requires unsafe
).
In particular, the resulting pointer may not be used to access a
different allocated object than the one self
points to. In other
words, x.wrapping_offset(y.wrapping_offset_from(x))
is
not the same as y
, and dereferencing it is undefined behavior
unless x
and y
point into the same allocated object.
Always use .offset(count)
instead when possible, because offset
allows the compiler to optimize better. If you need to cross object
boundaries, cast the pointer to an integer and do the arithmetic there.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.wrapping_offset(1); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub unsafe fn add(self, count: usize) -> DevicePointer<T>
pub unsafe fn add(self, count: usize) -> DevicePointer<T>
Calculates the offset from a pointer (convenience for .offset(count as isize)
).
count
is in units of T; e.g. a count
of 3 represents a pointer
offset of 3 * size_of::<T>()
bytes.
§Safety
If any of the following conditions are violated, the result is Undefined Behavior:
-
Both the starting and resulting pointer must be either in bounds or one byte past the end of an allocated object.
-
The computed offset, in bytes, cannot overflow an
isize
. -
The offset being in bounds cannot rely on “wrapping around” the address space. That is, the infinite-precision sum must fit in a
usize
.
Consider using wrapping_offset
instead if these constraints are
difficult to satisfy. The only advantage of this method is that it
enables more aggressive compiler optimizations.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.add(1); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub unsafe fn sub(self, count: usize) -> DevicePointer<T>
pub unsafe fn sub(self, count: usize) -> DevicePointer<T>
Calculates the offset from a pointer (convenience for
.offset((count as isize).wrapping_neg())
).
count
is in units of T; e.g. a count
of 3 represents a pointer
offset of 3 * size_of::<T>()
bytes.
§Safety
If any of the following conditions are violated, the result is Undefined Behavior:
-
Both the starting and resulting pointer must be either in bounds or one byte past the end of an allocated object.
-
The computed offset, in bytes, cannot overflow an
isize
. -
The offset being in bounds cannot rely on “wrapping around” the address space. That is, the infinite-precision sum must fit in a
usize
.
Consider using wrapping_offset
instead if these constraints are
difficult to satisfy. The only advantage of this method is that it
enables more aggressive compiler optimizations.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.add(4).sub(3); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub fn wrapping_add(self, count: usize) -> DevicePointer<T>
pub fn wrapping_add(self, count: usize) -> DevicePointer<T>
Calculates the offset from a pointer using wrapping arithmetic.
(convenience for .wrapping_offset(count as isize)
)
count
is in units of T; e.g. a count
of 3 represents a pointer
offset of 3 * size_of::<T>()
bytes.
§Safety
The resulting pointer does not need to be in bounds, but it is potentially hazardous to dereference.
Always use .add(count)
instead when possible, because add
allows the compiler to optimize better.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.wrapping_add(1); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub fn wrapping_sub(self, count: usize) -> DevicePointer<T>
pub fn wrapping_sub(self, count: usize) -> DevicePointer<T>
Calculates the offset from a pointer using wrapping arithmetic.
(convenience for .wrapping_offset((count as isize).wrapping_sub())
)
count
is in units of T; e.g. a count
of 3 represents a pointer
offset of 3 * size_of::<T>()
bytes.
§Safety
The resulting pointer does not need to be in bounds, but it is
potentially hazardous to dereference (which requires unsafe
).
Always use .sub(count)
instead when possible, because sub
allows the compiler to optimize better.
§Examples
use cust::memory::*;
unsafe {
let mut dev_ptr = cuda_malloc::<u64>(5).unwrap();
let offset = dev_ptr.wrapping_add(4).wrapping_sub(3); // Points to the 2nd u64 in the buffer
cuda_free(dev_ptr); // Must free the buffer using the original pointer
}
Sourcepub fn cast<U>(self) -> DevicePointer<U>where
U: DeviceCopy,
pub fn cast<U>(self) -> DevicePointer<U>where
U: DeviceCopy,
Casts this device pointer to another type.
Trait Implementations§
Source§impl<T> Clone for DevicePointer<T>
impl<T> Clone for DevicePointer<T>
Source§fn clone(&self) -> DevicePointer<T>
fn clone(&self) -> DevicePointer<T>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl<T> Debug for DevicePointer<T>
impl<T> Debug for DevicePointer<T>
Source§impl<T> Hash for DevicePointer<T>
impl<T> Hash for DevicePointer<T>
Source§impl<T> Ord for DevicePointer<T>
impl<T> Ord for DevicePointer<T>
Source§fn cmp(&self, other: &DevicePointer<T>) -> Ordering
fn cmp(&self, other: &DevicePointer<T>) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl<T> PartialEq for DevicePointer<T>
impl<T> PartialEq for DevicePointer<T>
Source§impl<T> PartialOrd for DevicePointer<T>
impl<T> PartialOrd for DevicePointer<T>
Source§impl<T> Pointer for DevicePointer<T>where
T: DeviceCopy,
impl<T> Pointer for DevicePointer<T>where
T: DeviceCopy,
impl<T> Copy for DevicePointer<T>
impl<T> DeviceCopy for DevicePointer<T>where
T: DeviceCopy + ?Sized,
impl<T> Eq for DevicePointer<T>
impl<T> StructuralPartialEq for DevicePointer<T>where
T: DeviceCopy + ?Sized,
Auto Trait Implementations§
impl<T> Freeze for DevicePointer<T>
impl<T> RefUnwindSafe for DevicePointer<T>where
T: RefUnwindSafe,
impl<T> !Send for DevicePointer<T>
impl<T> !Sync for DevicePointer<T>
impl<T> Unpin for DevicePointer<T>
impl<T> UnwindSafe for DevicePointer<T>where
T: RefUnwindSafe,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DeviceCopyExt for Twhere
T: DeviceCopy,
impl<T> DeviceCopyExt for Twhere
T: DeviceCopy,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.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>
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>
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<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>
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self
to the equivalent element of its superset.