1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722
use super::DeviceCopy;
use error::*;
use memory::malloc::{cuda_free_unified, cuda_malloc_unified};
use memory::UnifiedPointer;
use std::borrow::{Borrow, BorrowMut};
use std::cmp::Ordering;
use std::convert::{AsMut, AsRef};
use std::fmt::{self, Display, Pointer};
use std::hash::{Hash, Hasher};
use std::mem;
use std::ops::{Deref, DerefMut};
use std::ptr;
use std::slice;
/// A pointer type for heap-allocation in CUDA unified memory.
///
/// See the [`module-level documentation`](../memory/index.html) for more information on unified
/// memory. Should behave equivalently to `std::boxed::Box`, except that the allocated memory can be
/// seamlessly shared between host and device.
#[derive(Debug)]
pub struct UnifiedBox<T: DeviceCopy> {
ptr: UnifiedPointer<T>,
}
impl<T: DeviceCopy> UnifiedBox<T> {
/// Allocate unified memory and place val into it.
///
/// This doesn't actually allocate if `T` is zero-sized.
///
/// # Errors:
///
/// If a CUDA error occurs, returns that error.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let five = UnifiedBox::new(5).unwrap();
/// ```
pub fn new(val: T) -> CudaResult<Self> {
if mem::size_of::<T>() == 0 {
Ok(UnifiedBox {
ptr: UnifiedPointer::null(),
})
} else {
let mut ubox = unsafe { UnifiedBox::uninitialized()? };
*ubox = val;
Ok(ubox)
}
}
/// Allocate unified memory without initializing it.
///
/// This doesn't actually allocate if `T` is zero-sized.
///
/// # Safety:
///
/// Since the backing memory is not initialized, this function is not safe. The caller must
/// ensure that the backing memory is set to a valid value before it is read, else undefined
/// behavior may occur.
///
/// # Errors:
///
/// If a CUDA error occurs, returns that error.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let mut five = unsafe{ UnifiedBox::uninitialized().unwrap() };
/// *five = 5u64;
/// ```
pub unsafe fn uninitialized() -> CudaResult<Self> {
if mem::size_of::<T>() == 0 {
Ok(UnifiedBox {
ptr: UnifiedPointer::null(),
})
} else {
let ptr = cuda_malloc_unified(1)?;
Ok(UnifiedBox { ptr })
}
}
/// Constructs a UnifiedBox from a raw pointer.
///
/// After calling this function, the raw pointer and the memory it points to is owned by the
/// UnifiedBox. The UnifiedBox destructor will free the allocated memory, but will not call the destructor
/// of `T`. This function may accept any pointer produced by the `cuMemAllocManaged` CUDA API
/// call.
///
/// # Safety:
///
/// This function is unsafe because improper use may lead to memory problems. For example, a
/// double free may occur if this function is called twice on the same pointer, or a segfault
/// may occur if the pointer is not one returned by the appropriate API call.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let x = UnifiedBox::new(5).unwrap();
/// let ptr = UnifiedBox::into_unified(x).as_raw_mut();
/// let x = unsafe { UnifiedBox::from_raw(ptr) };
/// ```
pub unsafe fn from_raw(ptr: *mut T) -> Self {
UnifiedBox {
ptr: UnifiedPointer::wrap(ptr),
}
}
/// Constructs a UnifiedBox from a UnifiedPointer.
///
/// After calling this function, the pointer and the memory it points to is owned by the
/// UnifiedBox. The UnifiedBox destructor will free the allocated memory, but will not call the destructor
/// of `T`. This function may accept any pointer produced by the `cuMemAllocManaged` CUDA API
/// call, such as one taken from `UnifiedBox::into_unified`.
///
/// # Safety:
///
/// This function is unsafe because improper use may lead to memory problems. For example, a
/// double free may occur if this function is called twice on the same pointer, or a segfault
/// may occur if the pointer is not one returned by the appropriate API call.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let x = UnifiedBox::new(5).unwrap();
/// let ptr = UnifiedBox::into_unified(x);
/// let x = unsafe { UnifiedBox::from_unified(ptr) };
/// ```
pub unsafe fn from_unified(ptr: UnifiedPointer<T>) -> Self {
UnifiedBox { ptr }
}
/// Consumes the UnifiedBox, returning the wrapped UnifiedPointer.
///
/// After calling this function, the caller is responsible for the memory previously managed by
/// the UnifiedBox. In particular, the caller should properly destroy T and deallocate the memory.
/// The easiest way to do so is to create a new UnifiedBox using the `UnifiedBox::from_unified` function.
///
/// Note: This is an associated function, which means that you have to all it as
/// `UnifiedBox::into_unified(b)` instead of `b.into_unified()` This is so that there is no conflict with
/// a method on the inner type.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let x = UnifiedBox::new(5).unwrap();
/// let ptr = UnifiedBox::into_unified(x);
/// # unsafe { UnifiedBox::from_unified(ptr) };
/// ```
#[allow(wrong_self_convention)]
pub fn into_unified(mut b: UnifiedBox<T>) -> UnifiedPointer<T> {
let ptr = mem::replace(&mut b.ptr, UnifiedPointer::null());
mem::forget(b);
ptr
}
/// Returns the contained unified pointer without consuming the box.
///
/// This is useful for passing the box to a kernel launch.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let mut x = UnifiedBox::new(5).unwrap();
/// let ptr = x.as_unified_ptr();
/// println!("{:p}", ptr);
/// ```
pub fn as_unified_ptr(&mut self) -> UnifiedPointer<T> {
self.ptr
}
/// Consumes and leaks the UnifiedBox, returning a mutable reference, &'a mut T. Note that the type T
/// must outlive the chosen lifetime 'a. If the type has only static references, or none at all,
/// this may be chosen to be 'static.
///
/// This is mainly useful for data that lives for the remainder of the program's life. Dropping
/// the returned reference will cause a memory leak. If this is not acceptable, the reference
/// should be wrapped with the UnifiedBox::from_raw function to produce a new UnifiedBox. This UnifiedBox can then
/// be dropped, which will properly destroy T and release the allocated memory.
///
/// Note: This is an associated function, which means that you have to all it as
/// `UnifiedBox::leak(b)` instead of `b.leak()` This is so that there is no conflict with
/// a method on the inner type.
pub fn leak<'a>(b: UnifiedBox<T>) -> &'a mut T
where
T: 'a,
{
unsafe { &mut *UnifiedBox::into_unified(b).as_raw_mut() }
}
/// Destroy a `UnifiedBox`, returning an error.
///
/// Deallocating unified memory can return errors from previous asynchronous work. This function
/// destroys the given box and returns the error and the un-destroyed box on failure.
///
/// # Example:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let x = UnifiedBox::new(5).unwrap();
/// match UnifiedBox::drop(x) {
/// Ok(()) => println!("Successfully destroyed"),
/// Err((e, uni_box)) => {
/// println!("Failed to destroy box: {:?}", e);
/// // Do something with uni_box
/// },
/// }
/// ```
pub fn drop(mut uni_box: UnifiedBox<T>) -> DropResult<UnifiedBox<T>> {
if uni_box.ptr.is_null() {
return Ok(());
}
let ptr = mem::replace(&mut uni_box.ptr, UnifiedPointer::null());
unsafe {
match cuda_free_unified(ptr) {
Ok(()) => {
mem::forget(uni_box);
Ok(())
}
Err(e) => Err((e, UnifiedBox { ptr })),
}
}
}
}
impl<T: DeviceCopy> Drop for UnifiedBox<T> {
fn drop(&mut self) {
if !self.ptr.is_null() {
let ptr = mem::replace(&mut self.ptr, UnifiedPointer::null());
// No choice but to panic if this fails.
unsafe {
cuda_free_unified(ptr).expect("Failed to deallocate CUDA Unified memory.");
}
}
}
}
impl<T: DeviceCopy> Borrow<T> for UnifiedBox<T> {
fn borrow(&self) -> &T {
&**self
}
}
impl<T: DeviceCopy> BorrowMut<T> for UnifiedBox<T> {
fn borrow_mut(&mut self) -> &mut T {
&mut **self
}
}
impl<T: DeviceCopy> AsRef<T> for UnifiedBox<T> {
fn as_ref(&self) -> &T {
&**self
}
}
impl<T: DeviceCopy> AsMut<T> for UnifiedBox<T> {
fn as_mut(&mut self) -> &mut T {
&mut **self
}
}
impl<T: DeviceCopy> Deref for UnifiedBox<T> {
type Target = T;
fn deref(&self) -> &T {
unsafe { &*self.ptr.as_raw() }
}
}
impl<T: DeviceCopy> DerefMut for UnifiedBox<T> {
fn deref_mut(&mut self) -> &mut T {
unsafe { &mut *self.ptr.as_raw_mut() }
}
}
impl<T: Display + DeviceCopy> Display for UnifiedBox<T> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Display::fmt(&**self, f)
}
}
impl<T: DeviceCopy> Pointer for UnifiedBox<T> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
fmt::Pointer::fmt(&self.ptr, f)
}
}
impl<T: DeviceCopy + PartialEq> PartialEq for UnifiedBox<T> {
fn eq(&self, other: &UnifiedBox<T>) -> bool {
PartialEq::eq(&**self, &**other)
}
}
impl<T: DeviceCopy + Eq> Eq for UnifiedBox<T> {}
impl<T: DeviceCopy + PartialOrd> PartialOrd for UnifiedBox<T> {
fn partial_cmp(&self, other: &UnifiedBox<T>) -> Option<Ordering> {
PartialOrd::partial_cmp(&**self, &**other)
}
fn lt(&self, other: &UnifiedBox<T>) -> bool {
PartialOrd::lt(&**self, &**other)
}
fn le(&self, other: &UnifiedBox<T>) -> bool {
PartialOrd::le(&**self, &**other)
}
fn ge(&self, other: &UnifiedBox<T>) -> bool {
PartialOrd::ge(&**self, &**other)
}
fn gt(&self, other: &UnifiedBox<T>) -> bool {
PartialOrd::gt(&**self, &**other)
}
}
impl<T: DeviceCopy + Ord> Ord for UnifiedBox<T> {
fn cmp(&self, other: &UnifiedBox<T>) -> Ordering {
Ord::cmp(&**self, &**other)
}
}
impl<T: DeviceCopy + Hash> Hash for UnifiedBox<T> {
fn hash<H: Hasher>(&self, state: &mut H) {
(**self).hash(state);
}
}
/// Fixed-size buffer in unified memory.
///
/// See the [`module-level documentation`](../memory/index.html) for more details on unified memory.
#[derive(Debug)]
pub struct UnifiedBuffer<T: DeviceCopy> {
buf: UnifiedPointer<T>,
capacity: usize,
}
impl<T: DeviceCopy + Clone> UnifiedBuffer<T> {
/// Allocate a new unified buffer large enough to hold `size` `T`'s and initialized with
/// clones of `value`.
///
/// # Errors:
///
/// If the allocation fails, returns the error from CUDA. If `size` is large enough that
/// `size * mem::sizeof::<T>()` overflows usize, then returns InvalidMemoryAllocation.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let mut buffer = UnifiedBuffer::new(&0u64, 5).unwrap();
/// buffer[0] = 1;
/// ```
pub fn new(value: &T, size: usize) -> CudaResult<Self> {
unsafe {
let mut uninit = UnifiedBuffer::uninitialized(size)?;
for x in 0..size {
*uninit.get_unchecked_mut(x) = value.clone();
}
Ok(uninit)
}
}
/// Allocate a new unified buffer of the same size as `slice`, initialized with a clone of
/// the data in `slice`.
///
/// # Errors:
///
/// If the allocation fails, returns the error from CUDA.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let values = [0u64; 5];
/// let mut buffer = UnifiedBuffer::from_slice(&values).unwrap();
/// buffer[0] = 1;
/// ```
pub fn from_slice(slice: &[T]) -> CudaResult<Self> {
unsafe {
let mut uninit = UnifiedBuffer::uninitialized(slice.len())?;
for (i, x) in slice.iter().enumerate() {
*uninit.get_unchecked_mut(i) = x.clone();
}
Ok(uninit)
}
}
}
impl<T: DeviceCopy> UnifiedBuffer<T> {
/// Allocate a new unified buffer large enough to hold `size` `T`'s, but without
/// initializing the contents.
///
/// # Errors:
///
/// If the allocation fails, returns the error from CUDA. If `size` is large enough that
/// `size * mem::sizeof::<T>()` overflows usize, then returns InvalidMemoryAllocation.
///
/// # Safety:
///
/// The caller must ensure that the contents of the buffer are initialized before reading from
/// the buffer.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let mut buffer = unsafe { UnifiedBuffer::uninitialized(5).unwrap() };
/// for i in buffer.iter_mut() {
/// *i = 0u64;
/// }
/// ```
pub unsafe fn uninitialized(size: usize) -> CudaResult<Self> {
let bytes = size
.checked_mul(mem::size_of::<T>())
.ok_or(CudaError::InvalidMemoryAllocation)?;
let ptr = if bytes > 0 {
cuda_malloc_unified(bytes)?
} else {
UnifiedPointer::wrap(ptr::NonNull::dangling().as_ptr() as *mut T)
};
Ok(UnifiedBuffer {
buf: ptr,
capacity: size,
})
}
/// Extracts a slice containing the entire buffer.
///
/// Equivalent to `&s[..]`.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let buffer = UnifiedBuffer::new(&0u64, 5).unwrap();
/// let sum : u64 = buffer.as_slice().iter().sum();
/// ```
pub fn as_slice(&self) -> &[T] {
self
}
/// Extracts a mutable slice of the entire buffer.
///
/// Equivalent to `&mut s[..]`.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let mut buffer = UnifiedBuffer::new(&0u64, 5).unwrap();
/// for i in buffer.as_mut_slice() {
/// *i = 12u64;
/// }
/// ```
pub fn as_mut_slice(&mut self) -> &mut [T] {
self
}
/// Returns a `UnifiedPointer<T>` to the buffer.
///
/// The caller must ensure that the buffer outlives the returned pointer, or it will end up
/// pointing to garbage.
///
/// Modifying the buffer is guaranteed not to cause its buffer to be reallocated, so pointers
/// cannot be invalidated in that manner, but other types may be added in the future which can
/// reallocate.
pub fn as_unified_ptr(&mut self) -> UnifiedPointer<T> {
self.buf
}
/// Creates a `UnifiedBuffer<T>` directly from the raw components of another unified buffer.
///
/// # Safety
///
/// This is highly unsafe, due to the number of invariants that aren't
/// checked:
///
/// * `ptr` needs to have been previously allocated via `UnifiedBuffer` or
/// [`cuda_malloc_unified`](fn.cuda_malloc_unified.html).
/// * `ptr`'s `T` needs to have the same size and alignment as it was allocated with.
/// * `capacity` needs to be the capacity that the pointer was allocated with.
///
/// Violating these may cause problems like corrupting the CUDA driver's
/// internal data structures.
///
/// The ownership of `ptr` is effectively transferred to the
/// `UnifiedBuffer<T>` which may then deallocate, reallocate or change the
/// contents of memory pointed to by the pointer at will. Ensure
/// that nothing else uses the pointer after calling this
/// function.
///
/// # Examples:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use std::mem;
/// use rustacuda::memory::*;
///
/// let mut buffer = UnifiedBuffer::new(&0u64, 5).unwrap();
/// let ptr = buffer.as_unified_ptr();
/// let size = buffer.len();
///
/// mem::forget(buffer);
///
/// let buffer = unsafe { UnifiedBuffer::from_raw_parts(ptr, size) };
/// ```
pub unsafe fn from_raw_parts(ptr: UnifiedPointer<T>, capacity: usize) -> UnifiedBuffer<T> {
UnifiedBuffer { buf: ptr, capacity }
}
/// Destroy a `UnifiedBuffer`, returning an error.
///
/// Deallocating unified memory can return errors from previous asynchronous work. This function
/// destroys the given buffer and returns the error and the un-destroyed buffer on failure.
///
/// # Example:
///
/// ```
/// # let _context = rustacuda::quick_init().unwrap();
/// use rustacuda::memory::*;
/// let x = UnifiedBuffer::from_slice(&[10u32, 20, 30]).unwrap();
/// match UnifiedBuffer::drop(x) {
/// Ok(()) => println!("Successfully destroyed"),
/// Err((e, buf)) => {
/// println!("Failed to destroy buffer: {:?}", e);
/// // Do something with buf
/// },
/// }
/// ```
pub fn drop(mut uni_buf: UnifiedBuffer<T>) -> DropResult<UnifiedBuffer<T>> {
if uni_buf.buf.is_null() {
return Ok(());
}
if uni_buf.capacity > 0 && mem::size_of::<T>() > 0 {
let capacity = uni_buf.capacity;
let ptr = mem::replace(&mut uni_buf.buf, UnifiedPointer::null());
unsafe {
match cuda_free_unified(ptr) {
Ok(()) => {
mem::forget(uni_buf);
Ok(())
}
Err(e) => Err((e, UnifiedBuffer::from_raw_parts(ptr, capacity))),
}
}
} else {
Ok(())
}
}
}
impl<T: DeviceCopy> AsRef<[T]> for UnifiedBuffer<T> {
fn as_ref(&self) -> &[T] {
self
}
}
impl<T: DeviceCopy> AsMut<[T]> for UnifiedBuffer<T> {
fn as_mut(&mut self) -> &mut [T] {
self
}
}
impl<T: DeviceCopy> Deref for UnifiedBuffer<T> {
type Target = [T];
fn deref(&self) -> &[T] {
unsafe {
let p = self.buf.as_raw();
slice::from_raw_parts(p, self.capacity)
}
}
}
impl<T: DeviceCopy> DerefMut for UnifiedBuffer<T> {
fn deref_mut(&mut self) -> &mut [T] {
unsafe {
let ptr = self.buf.as_raw_mut();
slice::from_raw_parts_mut(ptr, self.capacity)
}
}
}
impl<T: DeviceCopy> Drop for UnifiedBuffer<T> {
fn drop(&mut self) {
if self.buf.is_null() {
return;
}
if self.capacity > 0 && mem::size_of::<T>() > 0 {
// No choice but to panic if this fails.
unsafe {
let ptr = mem::replace(&mut self.buf, UnifiedPointer::null());
cuda_free_unified(ptr).expect("Failed to deallocate CUDA unified memory.");
}
}
self.capacity = 0;
}
}
#[cfg(test)]
mod test_unified_box {
use super::*;
#[derive(Clone, Debug)]
struct ZeroSizedType;
unsafe impl ::memory::DeviceCopy for ZeroSizedType {}
#[test]
fn test_allocate_and_free() {
let _context = ::quick_init().unwrap();
let mut x = UnifiedBox::new(5u64).unwrap();
*x = 10;
assert_eq!(10, *x);
drop(x);
}
#[test]
fn test_allocates_for_non_zst() {
let _context = ::quick_init().unwrap();
let x = UnifiedBox::new(5u64).unwrap();
let ptr = UnifiedBox::into_unified(x);
assert!(!ptr.is_null());
let _ = unsafe { UnifiedBox::from_unified(ptr) };
}
#[test]
fn test_doesnt_allocate_for_zero_sized_type() {
let _context = ::quick_init().unwrap();
let x = UnifiedBox::new(ZeroSizedType).unwrap();
let ptr = UnifiedBox::into_unified(x);
assert!(ptr.is_null());
let _ = unsafe { UnifiedBox::from_unified(ptr) };
}
#[test]
fn test_into_from_unified() {
let _context = ::quick_init().unwrap();
let x = UnifiedBox::new(5u64).unwrap();
let ptr = UnifiedBox::into_unified(x);
let _ = unsafe { UnifiedBox::from_unified(ptr) };
}
#[test]
fn test_equality() {
let _context = ::quick_init().unwrap();
let x = UnifiedBox::new(5u64).unwrap();
let y = UnifiedBox::new(5u64).unwrap();
let z = UnifiedBox::new(0u64).unwrap();
assert_eq!(x, y);
assert!(x != z);
}
#[test]
fn test_ordering() {
let _context = ::quick_init().unwrap();
let x = UnifiedBox::new(1u64).unwrap();
let y = UnifiedBox::new(2u64).unwrap();
assert!(x < y);
}
}
#[cfg(test)]
mod test_unified_buffer {
use super::*;
use std::mem;
#[derive(Clone, Debug)]
struct ZeroSizedType;
unsafe impl ::memory::DeviceCopy for ZeroSizedType {}
#[test]
fn test_new() {
let _context = ::quick_init().unwrap();
let val = 0u64;
let mut buffer = UnifiedBuffer::new(&val, 5).unwrap();
buffer[0] = 1;
}
#[test]
fn test_from_slice() {
let _context = ::quick_init().unwrap();
let values = [0u64; 10];
let mut buffer = UnifiedBuffer::from_slice(&values).unwrap();
for i in buffer[0..3].iter_mut() {
*i = 10;
}
}
#[test]
fn from_raw_parts() {
let _context = ::quick_init().unwrap();
let mut buffer = UnifiedBuffer::new(&0u64, 5).unwrap();
buffer[2] = 1;
let ptr = buffer.as_unified_ptr();
let len = buffer.len();
mem::forget(buffer);
let buffer = unsafe { UnifiedBuffer::from_raw_parts(ptr, len) };
assert_eq!(&[0u64, 0, 1, 0, 0], buffer.as_slice());
drop(buffer);
}
#[test]
fn zero_length_buffer() {
let _context = ::quick_init().unwrap();
let buffer = UnifiedBuffer::new(&0u64, 0).unwrap();
drop(buffer);
}
#[test]
fn zero_size_type() {
let _context = ::quick_init().unwrap();
let buffer = UnifiedBuffer::new(&ZeroSizedType, 10).unwrap();
drop(buffer);
}
#[test]
fn overflows_usize() {
let _context = ::quick_init().unwrap();
let err = UnifiedBuffer::new(&0u64, ::std::usize::MAX - 1).unwrap_err();
assert_eq!(CudaError::InvalidMemoryAllocation, err);
}
}