2014-06-28 15:57:36 -05:00
|
|
|
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
|
|
|
|
// file at the top-level directory of this distribution and at
|
|
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
|
|
//
|
|
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
|
|
// option. This file may not be copied, modified, or distributed
|
|
|
|
// except according to those terms.
|
2014-10-15 01:05:01 -05:00
|
|
|
|
2014-06-28 15:57:36 -05:00
|
|
|
use core::ptr::*;
|
|
|
|
use core::mem;
|
2015-01-02 01:53:35 -06:00
|
|
|
use std::iter::repeat;
|
2014-06-28 15:57:36 -05:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test() {
|
|
|
|
unsafe {
|
|
|
|
struct Pair {
|
|
|
|
fst: int,
|
|
|
|
snd: int
|
|
|
|
};
|
|
|
|
let mut p = Pair {fst: 10, snd: 20};
|
|
|
|
let pptr: *mut Pair = &mut p;
|
|
|
|
let iptr: *mut int = mem::transmute(pptr);
|
|
|
|
assert_eq!(*iptr, 10);
|
|
|
|
*iptr = 30;
|
|
|
|
assert_eq!(*iptr, 30);
|
|
|
|
assert_eq!(p.fst, 30);
|
|
|
|
|
|
|
|
*pptr = Pair {fst: 50, snd: 60};
|
|
|
|
assert_eq!(*iptr, 50);
|
|
|
|
assert_eq!(p.fst, 50);
|
|
|
|
assert_eq!(p.snd, 60);
|
|
|
|
|
|
|
|
let v0 = vec![32000u16, 32001u16, 32002u16];
|
|
|
|
let mut v1 = vec![0u16, 0u16, 0u16];
|
|
|
|
|
|
|
|
copy_memory(v1.as_mut_ptr().offset(1),
|
|
|
|
v0.as_ptr().offset(1), 1);
|
2014-10-15 01:05:01 -05:00
|
|
|
assert!((v1[0] == 0u16 &&
|
|
|
|
v1[1] == 32001u16 &&
|
|
|
|
v1[2] == 0u16));
|
2014-06-28 15:57:36 -05:00
|
|
|
copy_memory(v1.as_mut_ptr(),
|
|
|
|
v0.as_ptr().offset(2), 1);
|
2014-10-15 01:05:01 -05:00
|
|
|
assert!((v1[0] == 32002u16 &&
|
|
|
|
v1[1] == 32001u16 &&
|
|
|
|
v1[2] == 0u16));
|
2014-06-28 15:57:36 -05:00
|
|
|
copy_memory(v1.as_mut_ptr().offset(2),
|
2015-02-03 07:50:52 -06:00
|
|
|
v0.as_ptr(), 1);
|
2014-10-15 01:05:01 -05:00
|
|
|
assert!((v1[0] == 32002u16 &&
|
|
|
|
v1[1] == 32001u16 &&
|
|
|
|
v1[2] == 32000u16));
|
2014-06-28 15:57:36 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_is_null() {
|
|
|
|
let p: *const int = null();
|
|
|
|
assert!(p.is_null());
|
|
|
|
|
|
|
|
let q = unsafe { p.offset(1) };
|
|
|
|
assert!(!q.is_null());
|
|
|
|
|
2014-10-15 01:05:01 -05:00
|
|
|
let mp: *mut int = null_mut();
|
2014-06-28 15:57:36 -05:00
|
|
|
assert!(mp.is_null());
|
|
|
|
|
|
|
|
let mq = unsafe { mp.offset(1) };
|
|
|
|
assert!(!mq.is_null());
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2014-08-20 15:06:34 -05:00
|
|
|
fn test_as_ref() {
|
2014-06-28 15:57:36 -05:00
|
|
|
unsafe {
|
|
|
|
let p: *const int = null();
|
2014-08-20 15:06:34 -05:00
|
|
|
assert_eq!(p.as_ref(), None);
|
2014-06-28 15:57:36 -05:00
|
|
|
|
|
|
|
let q: *const int = &2;
|
2014-08-20 15:06:34 -05:00
|
|
|
assert_eq!(q.as_ref().unwrap(), &2);
|
2014-06-28 15:57:36 -05:00
|
|
|
|
2014-10-15 01:05:01 -05:00
|
|
|
let p: *mut int = null_mut();
|
2014-08-20 15:06:34 -05:00
|
|
|
assert_eq!(p.as_ref(), None);
|
2014-06-28 15:57:36 -05:00
|
|
|
|
|
|
|
let q: *mut int = &mut 2;
|
2014-08-20 15:06:34 -05:00
|
|
|
assert_eq!(q.as_ref().unwrap(), &2);
|
|
|
|
|
|
|
|
// Lifetime inference
|
2015-01-25 15:05:03 -06:00
|
|
|
let u = 2;
|
2014-08-20 15:06:34 -05:00
|
|
|
{
|
|
|
|
let p: *const int = &u as *const _;
|
|
|
|
assert_eq!(p.as_ref().unwrap(), &2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_as_mut() {
|
|
|
|
unsafe {
|
2014-10-15 01:05:01 -05:00
|
|
|
let p: *mut int = null_mut();
|
2014-08-20 15:06:34 -05:00
|
|
|
assert!(p.as_mut() == None);
|
|
|
|
|
|
|
|
let q: *mut int = &mut 2;
|
|
|
|
assert!(q.as_mut().unwrap() == &mut 2);
|
|
|
|
|
|
|
|
// Lifetime inference
|
2015-01-25 15:05:03 -06:00
|
|
|
let mut u = 2;
|
2014-08-20 15:06:34 -05:00
|
|
|
{
|
|
|
|
let p: *mut int = &mut u as *mut _;
|
|
|
|
assert!(p.as_mut().unwrap() == &mut 2);
|
|
|
|
}
|
2014-06-28 15:57:36 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_ptr_addition() {
|
|
|
|
unsafe {
|
2015-01-25 15:05:03 -06:00
|
|
|
let xs = repeat(5).take(16).collect::<Vec<_>>();
|
2014-06-28 15:57:36 -05:00
|
|
|
let mut ptr = xs.as_ptr();
|
|
|
|
let end = ptr.offset(16);
|
|
|
|
|
|
|
|
while ptr < end {
|
|
|
|
assert_eq!(*ptr, 5);
|
|
|
|
ptr = ptr.offset(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
let mut xs_mut = xs;
|
|
|
|
let mut m_ptr = xs_mut.as_mut_ptr();
|
|
|
|
let m_end = m_ptr.offset(16);
|
|
|
|
|
|
|
|
while m_ptr < m_end {
|
|
|
|
*m_ptr += 5;
|
|
|
|
m_ptr = m_ptr.offset(1);
|
|
|
|
}
|
|
|
|
|
2015-01-25 15:05:03 -06:00
|
|
|
assert!(xs_mut == repeat(10).take(16).collect::<Vec<_>>());
|
2014-06-28 15:57:36 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_ptr_subtraction() {
|
|
|
|
unsafe {
|
|
|
|
let xs = vec![0,1,2,3,4,5,6,7,8,9];
|
|
|
|
let mut idx = 9i8;
|
|
|
|
let ptr = xs.as_ptr();
|
|
|
|
|
|
|
|
while idx >= 0i8 {
|
|
|
|
assert_eq!(*(ptr.offset(idx as int)), idx as int);
|
|
|
|
idx = idx - 1i8;
|
|
|
|
}
|
|
|
|
|
|
|
|
let mut xs_mut = xs;
|
|
|
|
let m_start = xs_mut.as_mut_ptr();
|
|
|
|
let mut m_ptr = m_start.offset(9);
|
|
|
|
|
|
|
|
while m_ptr >= m_start {
|
|
|
|
*m_ptr += *m_ptr;
|
|
|
|
m_ptr = m_ptr.offset(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
assert!(xs_mut == vec![0,2,4,6,8,10,12,14,16,18]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_set_memory() {
|
2014-12-30 02:19:41 -06:00
|
|
|
let mut xs = [0u8; 20];
|
2014-06-28 15:57:36 -05:00
|
|
|
let ptr = xs.as_mut_ptr();
|
|
|
|
unsafe { set_memory(ptr, 5u8, xs.len()); }
|
2014-12-30 02:19:41 -06:00
|
|
|
assert!(xs == [5u8; 20]);
|
2014-06-28 15:57:36 -05:00
|
|
|
}
|
2015-02-10 07:37:44 -06:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_unsized_unique() {
|
|
|
|
let xs: &mut [_] = &mut [1, 2, 3];
|
2015-02-12 09:33:21 -06:00
|
|
|
let ptr = unsafe { Unique::new(xs as *mut [_]) };
|
|
|
|
let ys = unsafe { &mut **ptr };
|
2015-02-10 07:37:44 -06:00
|
|
|
let zs: &mut [_] = &mut [1, 2, 3];
|
|
|
|
assert!(ys == zs);
|
|
|
|
}
|