1 // Copyright 2012-2013 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 //! Unsafe pointer utility functions
17 use iter::{range, Iterator};
19 use option::{Option, Some, None};
22 #[cfg(not(test))] use cmp::{Eq, TotalEq, Ord};
24 /// Return the offset of the first null pointer in `buf`.
26 pub unsafe fn buf_len<T>(buf: **T) -> uint {
27 position(buf, |i| *i == null())
30 impl<T> Clone for *T {
32 fn clone(&self) -> *T {
37 impl<T> Clone for *mut T {
39 fn clone(&self) -> *mut T {
44 /// Return the first offset `i` such that `f(buf[i]) == true`.
46 pub unsafe fn position<T>(buf: *T, f: |&T| -> bool) -> uint {
49 if f(&(*buf.offset(i as int))) { return i; }
54 /// Create an unsafe null pointer
56 pub fn null<T>() -> *T { 0 as *T }
58 /// Create an unsafe mutable null pointer
60 pub fn mut_null<T>() -> *mut T { 0 as *mut T }
63 * Copies data from one location to another.
65 * Copies `count` elements (not bytes) from `src` to `dst`. The source
66 * and destination may overlap.
69 pub unsafe fn copy_memory<T>(dst: *mut T, src: *T, count: uint) {
70 intrinsics::copy_memory(dst, src, count)
74 * Copies data from one location to another.
76 * Copies `count` elements (not bytes) from `src` to `dst`. The source
77 * and destination may *not* overlap.
80 pub unsafe fn copy_nonoverlapping_memory<T>(dst: *mut T,
83 intrinsics::copy_nonoverlapping_memory(dst, src, count)
87 * Invokes memset on the specified pointer, setting `count * size_of::<T>()`
88 * bytes of memory starting at `dst` to `c`.
91 pub unsafe fn set_memory<T>(dst: *mut T, c: u8, count: uint) {
92 intrinsics::set_memory(dst, c, count)
96 * Zeroes out `count * size_of::<T>` bytes of memory at `dst`
99 pub unsafe fn zero_memory<T>(dst: *mut T, count: uint) {
100 set_memory(dst, 0, count);
104 * Swap the values at two mutable locations of the same type, without
105 * deinitialising either. They may overlap.
108 pub unsafe fn swap<T>(x: *mut T, y: *mut T) {
109 // Give ourselves some scratch space to work with
110 let mut tmp: T = mem::uninit();
111 let t: *mut T = &mut tmp;
114 copy_nonoverlapping_memory(t, &*x, 1);
115 copy_memory(x, &*y, 1); // `x` and `y` may overlap
116 copy_nonoverlapping_memory(y, &*t, 1);
118 // y and t now point to the same thing, but we need to completely forget `tmp`
119 // because it's no longer relevant.
124 * Replace the value at a mutable location with a new one, returning the old
125 * value, without deinitialising either.
128 pub unsafe fn replace<T>(dest: *mut T, mut src: T) -> T {
129 mem::swap(cast::transmute(dest), &mut src); // cannot overlap
134 * Reads the value from `*src` and returns it.
137 pub unsafe fn read<T>(src: *T) -> T {
138 let mut tmp: T = mem::uninit();
139 copy_nonoverlapping_memory(&mut tmp, src, 1);
144 * Reads the value from `*src` and nulls it out.
145 * This currently prevents destructors from executing.
148 pub unsafe fn read_and_zero<T>(dest: *mut T) -> T {
149 // Copy the data out from `dest`:
150 let tmp = read(&*dest);
152 // Now zero out `dest`:
153 zero_memory(dest, 1);
159 Given a **T (pointer to an array of pointers),
160 iterate through each *T, up to the provided `len`,
161 passing to the provided callback function
163 SAFETY NOTE: Pointer-arithmetic. Dragons be here.
165 pub unsafe fn array_each_with_len<T>(arr: **T, len: uint, cb: |*T|) {
167 fail!("ptr::array_each_with_len failure: arr input is null pointer");
169 //let start_ptr = *arr;
170 for e in range(0, len) {
171 let n = arr.offset(e as int);
177 Given a null-pointer-terminated **T (pointer to
178 an array of pointers), iterate through each *T,
179 passing to the provided callback function
181 SAFETY NOTE: This will only work with a null-terminated
182 pointer array. Barely less-dodgy Pointer Arithmetic.
185 pub unsafe fn array_each<T>(arr: **T, cb: |*T|) {
187 fail!("ptr::array_each_with_len failure: arr input is null pointer");
189 let len = buf_len(arr);
190 array_each_with_len(arr, len, cb);
193 /// Extension methods for raw pointers.
194 pub trait RawPtr<T> {
195 /// Returns the null pointer.
197 /// Returns true if the pointer is equal to the null pointer.
198 fn is_null(&self) -> bool;
199 /// Returns true if the pointer is not equal to the null pointer.
200 fn is_not_null(&self) -> bool { !self.is_null() }
201 /// Returns the value of this pointer (ie, the address it points to)
202 fn to_uint(&self) -> uint;
203 /// Returns `None` if the pointer is null, or else returns the value wrapped
208 /// While this method is useful for null-safety, it is important to note
209 /// that this is still an unsafe operation because the returned value could
210 /// be pointing to invalid memory.
211 unsafe fn to_option(&self) -> Option<&T>;
212 /// Calculates the offset from a pointer. The offset *must* be in-bounds of
213 /// the object, or one-byte-past-the-end. `count` is in units of T; e.g. a
214 /// `count` of 3 represents a pointer offset of `3 * sizeof::<T>()` bytes.
215 unsafe fn offset(self, count: int) -> Self;
218 impl<T> RawPtr<T> for *T {
220 fn null() -> *T { null() }
223 fn is_null(&self) -> bool { *self == RawPtr::null() }
226 fn to_uint(&self) -> uint { *self as uint }
229 unsafe fn offset(self, count: int) -> *T { intrinsics::offset(self, count) }
232 unsafe fn to_option(&self) -> Option<&T> {
236 Some(cast::transmute(*self))
241 impl<T> RawPtr<T> for *mut T {
243 fn null() -> *mut T { mut_null() }
246 fn is_null(&self) -> bool { *self == RawPtr::null() }
249 fn to_uint(&self) -> uint { *self as uint }
252 unsafe fn offset(self, count: int) -> *mut T { intrinsics::offset(self as *T, count) as *mut T }
255 unsafe fn to_option(&self) -> Option<&T> {
259 Some(cast::transmute(*self))
264 // Equality for pointers
268 fn eq(&self, other: &*T) -> bool {
272 fn ne(&self, other: &*T) -> bool { !self.eq(other) }
276 impl<T> TotalEq for *T {}
279 impl<T> Eq for *mut T {
281 fn eq(&self, other: &*mut T) -> bool {
285 fn ne(&self, other: &*mut T) -> bool { !self.eq(other) }
289 impl<T> TotalEq for *mut T {}
291 // Equivalence for pointers
293 impl<T> Equiv<*mut T> for *T {
294 fn equiv(&self, other: &*mut T) -> bool {
295 self.to_uint() == other.to_uint()
300 impl<T> Equiv<*T> for *mut T {
301 fn equiv(&self, other: &*T) -> bool {
302 self.to_uint() == other.to_uint()
306 // Equality for extern "C" fn pointers
308 mod externfnpointers {
312 impl<_R> Eq for extern "C" fn() -> _R {
314 fn eq(&self, other: &extern "C" fn() -> _R) -> bool {
315 let self_: *() = unsafe { cast::transmute(*self) };
316 let other_: *() = unsafe { cast::transmute(*other) };
320 fn ne(&self, other: &extern "C" fn() -> _R) -> bool {
324 macro_rules! fnptreq(
326 impl<_R,$($p),*> Eq for extern "C" fn($($p),*) -> _R {
328 fn eq(&self, other: &extern "C" fn($($p),*) -> _R) -> bool {
329 let self_: *() = unsafe { cast::transmute(*self) };
330 let other_: *() = unsafe { cast::transmute(*other) };
334 fn ne(&self, other: &extern "C" fn($($p),*) -> _R) -> bool {
347 // Comparison for pointers
351 fn lt(&self, other: &*T) -> bool {
355 fn le(&self, other: &*T) -> bool {
359 fn ge(&self, other: &*T) -> bool {
363 fn gt(&self, other: &*T) -> bool {
369 impl<T> Ord for *mut T {
371 fn lt(&self, other: &*mut T) -> bool {
375 fn le(&self, other: &*mut T) -> bool {
379 fn ge(&self, other: &*mut T) -> bool {
383 fn gt(&self, other: &*mut T) -> bool {
397 use slice::{ImmutableVector, MutableVector};
406 let mut p = Pair {fst: 10, snd: 20};
407 let pptr: *mut Pair = &mut p;
408 let iptr: *mut int = cast::transmute(pptr);
409 assert_eq!(*iptr, 10);
411 assert_eq!(*iptr, 30);
412 assert_eq!(p.fst, 30);
414 *pptr = Pair {fst: 50, snd: 60};
415 assert_eq!(*iptr, 50);
416 assert_eq!(p.fst, 50);
417 assert_eq!(p.snd, 60);
419 let v0 = ~[32000u16, 32001u16, 32002u16];
420 let mut v1 = ~[0u16, 0u16, 0u16];
422 copy_memory(v1.as_mut_ptr().offset(1),
423 v0.as_ptr().offset(1), 1);
424 assert!((v1[0] == 0u16 && v1[1] == 32001u16 && v1[2] == 0u16));
425 copy_memory(v1.as_mut_ptr(),
426 v0.as_ptr().offset(2), 1);
427 assert!((v1[0] == 32002u16 && v1[1] == 32001u16 &&
429 copy_memory(v1.as_mut_ptr().offset(2),
431 assert!((v1[0] == 32002u16 && v1[1] == 32001u16 &&
440 "hello".with_c_str(|p| {
442 assert!(2u == position(p, |c| *c == 'l' as c_char));
443 assert!(4u == position(p, |c| *c == 'o' as c_char));
444 assert!(5u == position(p, |c| *c == 0 as c_char));
451 "hello".with_c_str(|p0| {
452 "there".with_c_str(|p1| {
453 "thing".with_c_str(|p2| {
454 let v = ~[p0, p1, p2, null()];
456 assert_eq!(buf_len(v.as_ptr()), 3u);
465 let p: *int = null();
466 assert!(p.is_null());
467 assert!(!p.is_not_null());
469 let q = unsafe { p.offset(1) };
470 assert!(!q.is_null());
471 assert!(q.is_not_null());
473 let mp: *mut int = mut_null();
474 assert!(mp.is_null());
475 assert!(!mp.is_not_null());
477 let mq = unsafe { mp.offset(1) };
478 assert!(!mq.is_null());
479 assert!(mq.is_not_null());
483 fn test_to_option() {
485 let p: *int = null();
486 assert_eq!(p.to_option(), None);
489 assert_eq!(q.to_option().unwrap(), &2);
491 let p: *mut int = mut_null();
492 assert_eq!(p.to_option(), None);
494 let q: *mut int = &mut 2;
495 assert_eq!(q.to_option().unwrap(), &2);
500 fn test_ptr_addition() {
503 let mut ptr = xs.as_ptr();
504 let end = ptr.offset(16);
511 let mut xs_mut = xs.clone();
512 let mut m_ptr = xs_mut.as_mut_ptr();
513 let m_end = m_ptr.offset(16);
515 while m_ptr < m_end {
517 m_ptr = m_ptr.offset(1);
520 assert_eq!(xs_mut, ~[10, ..16]);
525 fn test_ptr_subtraction() {
527 let xs = ~[0,1,2,3,4,5,6,7,8,9];
529 let ptr = xs.as_ptr();
532 assert_eq!(*(ptr.offset(idx as int)), idx as int);
536 let mut xs_mut = xs.clone();
537 let m_start = xs_mut.as_mut_ptr();
538 let mut m_ptr = m_start.offset(9);
540 while m_ptr >= m_start {
542 m_ptr = m_ptr.offset(-1);
545 assert_eq!(xs_mut, ~[0,2,4,6,8,10,12,14,16,18]);
550 fn test_ptr_array_each_with_len() {
552 let one = "oneOne".to_c_str();
553 let two = "twoTwo".to_c_str();
554 let three = "threeThree".to_c_str();
556 one.with_ref(|buf| buf),
557 two.with_ref(|buf| buf),
558 three.with_ref(|buf| buf),
565 let mut iteration_count = 0;
566 array_each_with_len(arr.as_ptr(), arr.len(), |e| {
567 let actual = str::raw::from_c_str(e);
568 let expected = expected_arr[ctr].with_ref(|buf| {
569 str::raw::from_c_str(buf)
572 "test_ptr_array_each_with_len e: {}, a: {}",
574 assert_eq!(actual, expected);
576 iteration_count += 1;
578 assert_eq!(iteration_count, 3u);
583 fn test_ptr_array_each() {
585 let one = "oneOne".to_c_str();
586 let two = "twoTwo".to_c_str();
587 let three = "threeThree".to_c_str();
589 one.with_ref(|buf| buf),
590 two.with_ref(|buf| buf),
591 three.with_ref(|buf| buf),
592 // fake a null terminator
599 let arr_ptr = arr.as_ptr();
601 let mut iteration_count = 0;
602 array_each(arr_ptr, |e| {
603 let actual = str::raw::from_c_str(e);
604 let expected = expected_arr[ctr].with_ref(|buf| {
605 str::raw::from_c_str(buf)
608 "test_ptr_array_each e: {}, a: {}",
610 assert_eq!(actual, expected);
612 iteration_count += 1;
614 assert_eq!(iteration_count, 3);
620 fn test_ptr_array_each_with_len_null_ptr() {
622 array_each_with_len(0 as **libc::c_char, 1, |e| {
623 str::raw::from_c_str(e);
629 fn test_ptr_array_each_null_ptr() {
631 array_each(0 as **libc::c_char, |e| {
632 str::raw::from_c_str(e);
638 fn test_set_memory() {
639 let mut xs = [0u8, ..20];
640 let ptr = xs.as_mut_ptr();
641 unsafe { set_memory(ptr, 5u8, xs.len()); }
642 assert!(xs == [5u8, ..20]);