2 use crate::cmp::Ordering::{self, Equal, Greater, Less};
4 use crate::slice::{self, SliceIndex};
6 impl<T: ?Sized> *mut T {
7 /// Returns `true` if the pointer is null.
9 /// Note that unsized types have many possible null pointers, as only the
10 /// raw data pointer is considered, not their length, vtable, etc.
11 /// Therefore, two pointers that are null may still not compare equal to
14 /// ## Behavior during const evaluation
16 /// When this function is used during const evaluation, it may return `false` for pointers
17 /// that turn out to be null at runtime. Specifically, when a pointer to some memory
18 /// is offset beyond its bounds in such a way that the resulting pointer is null,
19 /// the function will still return `false`. There is no way for CTFE to know
20 /// the absolute position of that memory, so we cannot tell if the pointer is
28 /// let mut s = [1, 2, 3];
29 /// let ptr: *mut u32 = s.as_mut_ptr();
30 /// assert!(!ptr.is_null());
32 #[stable(feature = "rust1", since = "1.0.0")]
33 #[rustc_const_unstable(feature = "const_ptr_is_null", issue = "74939")]
35 pub const fn is_null(self) -> bool {
36 // Compare via a cast to a thin pointer, so fat pointers are only
37 // considering their "data" part for null-ness.
38 (self as *mut u8).guaranteed_eq(null_mut())
41 /// Casts to a pointer of another type.
42 #[stable(feature = "ptr_cast", since = "1.38.0")]
43 #[rustc_const_stable(feature = "const_ptr_cast", since = "1.38.0")]
45 pub const fn cast<U>(self) -> *mut U {
49 /// Use the pointer value in a new pointer of another type.
51 /// In case `val` is a (fat) pointer to an unsized type, this operation
52 /// will ignore the pointer part, whereas for (thin) pointers to sized
53 /// types, this has the same effect as a simple cast.
55 /// The resulting pointer will have provenance of `self`, i.e., for a fat
56 /// pointer, this operation is semantically the same as creating a new
57 /// fat pointer with the data pointer value of `self` but the metadata of
62 /// This function is primarily useful for allowing byte-wise pointer
63 /// arithmetic on potentially fat pointers:
66 /// #![feature(set_ptr_value)]
67 /// # use core::fmt::Debug;
68 /// let mut arr: [i32; 3] = [1, 2, 3];
69 /// let mut ptr = arr.as_mut_ptr() as *mut dyn Debug;
70 /// let thin = ptr as *mut u8;
72 /// ptr = thin.add(8).with_metadata_of(ptr);
73 /// # assert_eq!(*(ptr as *mut i32), 3);
74 /// println!("{:?}", &*ptr); // will print "3"
77 #[unstable(feature = "set_ptr_value", issue = "75091")]
78 #[must_use = "returns a new pointer rather than modifying its argument"]
80 pub fn with_metadata_of<U>(self, mut val: *mut U) -> *mut U
84 let target = &mut val as *mut *mut U as *mut *mut u8;
85 // SAFETY: In case of a thin pointer, this operations is identical
86 // to a simple assignment. In case of a fat pointer, with the current
87 // fat pointer layout implementation, the first field of such a
88 // pointer is always the data pointer, which is likewise assigned.
89 unsafe { *target = self as *mut u8 };
93 /// Changes constness without changing the type.
95 /// This is a bit safer than `as` because it wouldn't silently change the type if the code is
98 /// While not strictly required (`*mut T` coerces to `*const T`), this is provided for symmetry
99 /// with [`cast_mut`] on `*const T` and may have documentation value if used instead of implicit
102 /// [`cast_mut`]: #method.cast_mut
103 #[unstable(feature = "ptr_const_cast", issue = "92675")]
104 #[rustc_const_unstable(feature = "ptr_const_cast", issue = "92675")]
105 pub const fn cast_const(self) -> *const T {
109 /// Casts a pointer to its raw bits.
111 /// This is equivalent to `as usize`, but is more specific to enhance readability.
112 /// The inverse method is [`from_bits`](#method.from_bits-1).
114 /// In particular, `*p as usize` and `p as usize` will both compile for
115 /// pointers to numeric types but do very different things, so using this
116 /// helps emphasize that reading the bits was intentional.
121 /// #![feature(ptr_to_from_bits)]
122 /// let mut array = [13, 42];
123 /// let mut it = array.iter_mut();
124 /// let p0: *mut i32 = it.next().unwrap();
125 /// assert_eq!(<*mut _>::from_bits(p0.to_bits()), p0);
126 /// let p1: *mut i32 = it.next().unwrap();
127 /// assert_eq!(p1.to_bits() - p0.to_bits(), 4);
129 #[unstable(feature = "ptr_to_from_bits", issue = "91126")]
130 pub fn to_bits(self) -> usize
137 /// Creates a pointer from its raw bits.
139 /// This is equivalent to `as *mut T`, but is more specific to enhance readability.
140 /// The inverse method is [`to_bits`](#method.to_bits-1).
145 /// #![feature(ptr_to_from_bits)]
146 /// use std::ptr::NonNull;
147 /// let dangling: *mut u8 = NonNull::dangling().as_ptr();
148 /// assert_eq!(<*mut u8>::from_bits(1), dangling);
150 #[unstable(feature = "ptr_to_from_bits", issue = "91126")]
151 pub fn from_bits(bits: usize) -> Self
158 /// Gets the "address" portion of the pointer.
160 /// This is similar to `self as usize`, which semantically discards *provenance* and
161 /// *address-space* information. However, unlike `self as usize`, casting the returned address
162 /// back to a pointer yields [`invalid`][], which is undefined behavior to dereference. To
163 /// properly restore the lost information and obtain a dereferencable pointer, use
164 /// [`with_addr`][pointer::with_addr] or [`map_addr`][pointer::map_addr].
166 /// If using those APIs is not possible because there is no way to preserve a pointer with the
167 /// required provenance, use [`expose_addr`][pointer::expose_addr] and
168 /// [`from_exposed_addr_mut`][from_exposed_addr_mut] instead. However, note that this makes
169 /// your code less portable and less amenable to tools that check for compliance with the Rust
172 /// On most platforms this will produce a value with the same bytes as the original
173 /// pointer, because all the bytes are dedicated to describing the address.
174 /// Platforms which need to store additional information in the pointer may
175 /// perform a change of representation to produce a value containing only the address
176 /// portion of the pointer. What that means is up to the platform to define.
178 /// This API and its claimed semantics are part of the Strict Provenance experiment, and as such
179 /// might change in the future (including possibly weakening this so it becomes wholly
180 /// equivalent to `self as usize`). See the [module documentation][crate::ptr] for details.
183 #[unstable(feature = "strict_provenance", issue = "95228")]
184 pub fn addr(self) -> usize
188 // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic.
189 // SAFETY: Pointer-to-integer transmutes are valid (if you are okay with losing the
191 unsafe { mem::transmute(self) }
194 /// Gets the "address" portion of the pointer, and 'exposes' the "provenance" part for future
195 /// use in [`from_exposed_addr`][].
197 /// This is equivalent to `self as usize`, which semantically discards *provenance* and
198 /// *address-space* information. Furthermore, this (like the `as` cast) has the implicit
199 /// side-effect of marking the provenance as 'exposed', so on platforms that support it you can
200 /// later call [`from_exposed_addr_mut`][] to reconstitute the original pointer including its
201 /// provenance. (Reconstructing address space information, if required, is your responsibility.)
203 /// Using this method means that code is *not* following Strict Provenance rules. Supporting
204 /// [`from_exposed_addr_mut`][] complicates specification and reasoning and may not be supported
205 /// by tools that help you to stay conformant with the Rust memory model, so it is recommended
206 /// to use [`addr`][pointer::addr] wherever possible.
208 /// On most platforms this will produce a value with the same bytes as the original pointer,
209 /// because all the bytes are dedicated to describing the address. Platforms which need to store
210 /// additional information in the pointer may not support this operation, since the 'expose'
211 /// side-effect which is required for [`from_exposed_addr_mut`][] to work is typically not
214 /// This API and its claimed semantics are part of the Strict Provenance experiment, see the
215 /// [module documentation][crate::ptr] for details.
217 /// [`from_exposed_addr_mut`]: from_exposed_addr_mut
220 #[unstable(feature = "strict_provenance", issue = "95228")]
221 pub fn expose_addr(self) -> usize
225 // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic.
229 /// Creates a new pointer with the given address.
231 /// This performs the same operation as an `addr as ptr` cast, but copies
232 /// the *address-space* and *provenance* of `self` to the new pointer.
233 /// This allows us to dynamically preserve and propagate this important
234 /// information in a way that is otherwise impossible with a unary cast.
236 /// This is equivalent to using [`wrapping_offset`][pointer::wrapping_offset] to offset
237 /// `self` to the given address, and therefore has all the same capabilities and restrictions.
239 /// This API and its claimed semantics are part of the Strict Provenance experiment,
240 /// see the [module documentation][crate::ptr] for details.
243 #[unstable(feature = "strict_provenance", issue = "95228")]
244 pub fn with_addr(self, addr: usize) -> Self
248 // FIXME(strict_provenance_magic): I am magic and should be a compiler intrinsic.
250 // In the mean-time, this operation is defined to be "as if" it was
251 // a wrapping_offset, so we can emulate it as such. This should properly
252 // restore pointer provenance even under today's compiler.
253 let self_addr = self.addr() as isize;
254 let dest_addr = addr as isize;
255 let offset = dest_addr.wrapping_sub(self_addr);
257 // This is the canonical desugarring of this operation
258 self.cast::<u8>().wrapping_offset(offset).cast::<T>()
261 /// Creates a new pointer by mapping `self`'s address to a new one.
263 /// This is a convenience for [`with_addr`][pointer::with_addr], see that method for details.
265 /// This API and its claimed semantics are part of the Strict Provenance experiment,
266 /// see the [module documentation][crate::ptr] for details.
269 #[unstable(feature = "strict_provenance", issue = "95228")]
270 pub fn map_addr(self, f: impl FnOnce(usize) -> usize) -> Self
274 self.with_addr(f(self.addr()))
277 /// Decompose a (possibly wide) pointer into its address and metadata components.
279 /// The pointer can be later reconstructed with [`from_raw_parts_mut`].
280 #[unstable(feature = "ptr_metadata", issue = "81513")]
281 #[rustc_const_unstable(feature = "ptr_metadata", issue = "81513")]
283 pub const fn to_raw_parts(self) -> (*mut (), <T as super::Pointee>::Metadata) {
284 (self.cast(), super::metadata(self))
287 /// Returns `None` if the pointer is null, or else returns a shared reference to
288 /// the value wrapped in `Some`. If the value may be uninitialized, [`as_uninit_ref`]
289 /// must be used instead.
291 /// For the mutable counterpart see [`as_mut`].
293 /// [`as_uninit_ref`]: #method.as_uninit_ref-1
294 /// [`as_mut`]: #method.as_mut
298 /// When calling this method, you have to ensure that *either* the pointer is null *or*
299 /// all of the following is true:
301 /// * The pointer must be properly aligned.
303 /// * It must be "dereferenceable" in the sense defined in [the module documentation].
305 /// * The pointer must point to an initialized instance of `T`.
307 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
308 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
309 /// In particular, while this reference exists, the memory the pointer points to must
310 /// not get mutated (except inside `UnsafeCell`).
312 /// This applies even if the result of this method is unused!
313 /// (The part about being initialized is not yet fully decided, but until
314 /// it is, the only safe approach is to ensure that they are indeed initialized.)
316 /// [the module documentation]: crate::ptr#safety
323 /// let ptr: *mut u8 = &mut 10u8 as *mut u8;
326 /// if let Some(val_back) = ptr.as_ref() {
327 /// println!("We got back the value: {val_back}!");
332 /// # Null-unchecked version
334 /// If you are sure the pointer can never be null and are looking for some kind of
335 /// `as_ref_unchecked` that returns the `&T` instead of `Option<&T>`, know that you can
336 /// dereference the pointer directly.
339 /// let ptr: *mut u8 = &mut 10u8 as *mut u8;
342 /// let val_back = &*ptr;
343 /// println!("We got back the value: {val_back}!");
346 #[stable(feature = "ptr_as_ref", since = "1.9.0")]
347 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
349 pub const unsafe fn as_ref<'a>(self) -> Option<&'a T> {
350 // SAFETY: the caller must guarantee that `self` is valid for a
351 // reference if it isn't null.
352 if self.is_null() { None } else { unsafe { Some(&*self) } }
355 /// Returns `None` if the pointer is null, or else returns a shared reference to
356 /// the value wrapped in `Some`. In contrast to [`as_ref`], this does not require
357 /// that the value has to be initialized.
359 /// For the mutable counterpart see [`as_uninit_mut`].
361 /// [`as_ref`]: #method.as_ref-1
362 /// [`as_uninit_mut`]: #method.as_uninit_mut
366 /// When calling this method, you have to ensure that *either* the pointer is null *or*
367 /// all of the following is true:
369 /// * The pointer must be properly aligned.
371 /// * It must be "dereferenceable" in the sense defined in [the module documentation].
373 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
374 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
375 /// In particular, while this reference exists, the memory the pointer points to must
376 /// not get mutated (except inside `UnsafeCell`).
378 /// This applies even if the result of this method is unused!
380 /// [the module documentation]: crate::ptr#safety
387 /// #![feature(ptr_as_uninit)]
389 /// let ptr: *mut u8 = &mut 10u8 as *mut u8;
392 /// if let Some(val_back) = ptr.as_uninit_ref() {
393 /// println!("We got back the value: {}!", val_back.assume_init());
398 #[unstable(feature = "ptr_as_uninit", issue = "75402")]
399 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
400 pub const unsafe fn as_uninit_ref<'a>(self) -> Option<&'a MaybeUninit<T>>
404 // SAFETY: the caller must guarantee that `self` meets all the
405 // requirements for a reference.
406 if self.is_null() { None } else { Some(unsafe { &*(self as *const MaybeUninit<T>) }) }
409 /// Calculates the offset from a pointer.
411 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
412 /// offset of `3 * size_of::<T>()` bytes.
416 /// If any of the following conditions are violated, the result is Undefined
419 /// * Both the starting and resulting pointer must be either in bounds or one
420 /// byte past the end of the same [allocated object].
422 /// * The computed offset, **in bytes**, cannot overflow an `isize`.
424 /// * The offset being in bounds cannot rely on "wrapping around" the address
425 /// space. That is, the infinite-precision sum, **in bytes** must fit in a usize.
427 /// The compiler and standard library generally tries to ensure allocations
428 /// never reach a size where an offset is a concern. For instance, `Vec`
429 /// and `Box` ensure they never allocate more than `isize::MAX` bytes, so
430 /// `vec.as_ptr().add(vec.len())` is always safe.
432 /// Most platforms fundamentally can't even construct such an allocation.
433 /// For instance, no known 64-bit platform can ever serve a request
434 /// for 2<sup>63</sup> bytes due to page-table limitations or splitting the address space.
435 /// However, some 32-bit and 16-bit platforms may successfully serve a request for
436 /// more than `isize::MAX` bytes with things like Physical Address
437 /// Extension. As such, memory acquired directly from allocators or memory
438 /// mapped files *may* be too large to handle with this function.
440 /// Consider using [`wrapping_offset`] instead if these constraints are
441 /// difficult to satisfy. The only advantage of this method is that it
442 /// enables more aggressive compiler optimizations.
444 /// [`wrapping_offset`]: #method.wrapping_offset
445 /// [allocated object]: crate::ptr#allocated-object
452 /// let mut s = [1, 2, 3];
453 /// let ptr: *mut u32 = s.as_mut_ptr();
456 /// println!("{}", *ptr.offset(1));
457 /// println!("{}", *ptr.offset(2));
460 #[stable(feature = "rust1", since = "1.0.0")]
461 #[must_use = "returns a new pointer rather than modifying its argument"]
462 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
464 pub const unsafe fn offset(self, count: isize) -> *mut T
468 // SAFETY: the caller must uphold the safety contract for `offset`.
469 // The obtained pointer is valid for writes since the caller must
470 // guarantee that it points to the same allocated object as `self`.
471 unsafe { intrinsics::offset(self, count) as *mut T }
474 /// Calculates the offset from a pointer in bytes.
476 /// `count` is in units of **bytes**.
478 /// This is purely a convenience for casting to a `u8` pointer and
479 /// using [offset][pointer::offset] on it. See that method for documentation
480 /// and safety requirements.
482 /// For non-`Sized` pointees this operation changes only the data pointer,
483 /// leaving the metadata untouched.
486 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
487 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
488 pub const unsafe fn byte_offset(self, count: isize) -> Self {
489 // SAFETY: the caller must uphold the safety contract for `offset`.
490 let this = unsafe { self.cast::<u8>().offset(count).cast::<()>() };
491 from_raw_parts_mut::<T>(this, metadata(self))
494 /// Calculates the offset from a pointer using wrapping arithmetic.
495 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
496 /// offset of `3 * size_of::<T>()` bytes.
500 /// This operation itself is always safe, but using the resulting pointer is not.
502 /// The resulting pointer "remembers" the [allocated object] that `self` points to; it must not
503 /// be used to read or write other allocated objects.
505 /// In other words, `let z = x.wrapping_offset((y as isize) - (x as isize))` does *not* make `z`
506 /// the same as `y` even if we assume `T` has size `1` and there is no overflow: `z` is still
507 /// attached to the object `x` is attached to, and dereferencing it is Undefined Behavior unless
508 /// `x` and `y` point into the same allocated object.
510 /// Compared to [`offset`], this method basically delays the requirement of staying within the
511 /// same allocated object: [`offset`] is immediate Undefined Behavior when crossing object
512 /// boundaries; `wrapping_offset` produces a pointer but still leads to Undefined Behavior if a
513 /// pointer is dereferenced when it is out-of-bounds of the object it is attached to. [`offset`]
514 /// can be optimized better and is thus preferable in performance-sensitive code.
516 /// The delayed check only considers the value of the pointer that was dereferenced, not the
517 /// intermediate values used during the computation of the final result. For example,
518 /// `x.wrapping_offset(o).wrapping_offset(o.wrapping_neg())` is always the same as `x`. In other
519 /// words, leaving the allocated object and then re-entering it later is permitted.
521 /// [`offset`]: #method.offset
522 /// [allocated object]: crate::ptr#allocated-object
529 /// // Iterate using a raw pointer in increments of two elements
530 /// let mut data = [1u8, 2, 3, 4, 5];
531 /// let mut ptr: *mut u8 = data.as_mut_ptr();
533 /// let end_rounded_up = ptr.wrapping_offset(6);
535 /// while ptr != end_rounded_up {
539 /// ptr = ptr.wrapping_offset(step);
541 /// assert_eq!(&data, &[0, 2, 0, 4, 0]);
543 #[stable(feature = "ptr_wrapping_offset", since = "1.16.0")]
544 #[must_use = "returns a new pointer rather than modifying its argument"]
545 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
547 pub const fn wrapping_offset(self, count: isize) -> *mut T
551 // SAFETY: the `arith_offset` intrinsic has no prerequisites to be called.
552 unsafe { intrinsics::arith_offset(self, count) as *mut T }
555 /// Calculates the offset from a pointer in bytes using wrapping arithmetic.
557 /// `count` is in units of **bytes**.
559 /// This is purely a convenience for casting to a `u8` pointer and
560 /// using [wrapping_offset][pointer::wrapping_offset] on it. See that method
561 /// for documentation.
563 /// For non-`Sized` pointees this operation changes only the data pointer,
564 /// leaving the metadata untouched.
567 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
568 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
569 pub const fn wrapping_byte_offset(self, count: isize) -> Self {
570 from_raw_parts_mut::<T>(
571 self.cast::<u8>().wrapping_offset(count).cast::<()>(),
576 /// Returns `None` if the pointer is null, or else returns a unique reference to
577 /// the value wrapped in `Some`. If the value may be uninitialized, [`as_uninit_mut`]
578 /// must be used instead.
580 /// For the shared counterpart see [`as_ref`].
582 /// [`as_uninit_mut`]: #method.as_uninit_mut
583 /// [`as_ref`]: #method.as_ref-1
587 /// When calling this method, you have to ensure that *either* the pointer is null *or*
588 /// all of the following is true:
590 /// * The pointer must be properly aligned.
592 /// * It must be "dereferenceable" in the sense defined in [the module documentation].
594 /// * The pointer must point to an initialized instance of `T`.
596 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
597 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
598 /// In particular, while this reference exists, the memory the pointer points to must
599 /// not get accessed (read or written) through any other pointer.
601 /// This applies even if the result of this method is unused!
602 /// (The part about being initialized is not yet fully decided, but until
603 /// it is, the only safe approach is to ensure that they are indeed initialized.)
605 /// [the module documentation]: crate::ptr#safety
612 /// let mut s = [1, 2, 3];
613 /// let ptr: *mut u32 = s.as_mut_ptr();
614 /// let first_value = unsafe { ptr.as_mut().unwrap() };
615 /// *first_value = 4;
616 /// # assert_eq!(s, [4, 2, 3]);
617 /// println!("{s:?}"); // It'll print: "[4, 2, 3]".
620 /// # Null-unchecked version
622 /// If you are sure the pointer can never be null and are looking for some kind of
623 /// `as_mut_unchecked` that returns the `&mut T` instead of `Option<&mut T>`, know that
624 /// you can dereference the pointer directly.
627 /// let mut s = [1, 2, 3];
628 /// let ptr: *mut u32 = s.as_mut_ptr();
629 /// let first_value = unsafe { &mut *ptr };
630 /// *first_value = 4;
631 /// # assert_eq!(s, [4, 2, 3]);
632 /// println!("{s:?}"); // It'll print: "[4, 2, 3]".
634 #[stable(feature = "ptr_as_ref", since = "1.9.0")]
635 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
637 pub const unsafe fn as_mut<'a>(self) -> Option<&'a mut T> {
638 // SAFETY: the caller must guarantee that `self` is be valid for
639 // a mutable reference if it isn't null.
640 if self.is_null() { None } else { unsafe { Some(&mut *self) } }
643 /// Returns `None` if the pointer is null, or else returns a unique reference to
644 /// the value wrapped in `Some`. In contrast to [`as_mut`], this does not require
645 /// that the value has to be initialized.
647 /// For the shared counterpart see [`as_uninit_ref`].
649 /// [`as_mut`]: #method.as_mut
650 /// [`as_uninit_ref`]: #method.as_uninit_ref-1
654 /// When calling this method, you have to ensure that *either* the pointer is null *or*
655 /// all of the following is true:
657 /// * The pointer must be properly aligned.
659 /// * It must be "dereferenceable" in the sense defined in [the module documentation].
661 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
662 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
663 /// In particular, while this reference exists, the memory the pointer points to must
664 /// not get accessed (read or written) through any other pointer.
666 /// This applies even if the result of this method is unused!
668 /// [the module documentation]: crate::ptr#safety
670 #[unstable(feature = "ptr_as_uninit", issue = "75402")]
671 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
672 pub const unsafe fn as_uninit_mut<'a>(self) -> Option<&'a mut MaybeUninit<T>>
676 // SAFETY: the caller must guarantee that `self` meets all the
677 // requirements for a reference.
678 if self.is_null() { None } else { Some(unsafe { &mut *(self as *mut MaybeUninit<T>) }) }
681 /// Returns whether two pointers are guaranteed to be equal.
683 /// At runtime this function behaves like `self == other`.
684 /// However, in some contexts (e.g., compile-time evaluation),
685 /// it is not always possible to determine equality of two pointers, so this function may
686 /// spuriously return `false` for pointers that later actually turn out to be equal.
687 /// But when it returns `true`, the pointers are guaranteed to be equal.
689 /// This function is the mirror of [`guaranteed_ne`], but not its inverse. There are pointer
690 /// comparisons for which both functions return `false`.
692 /// [`guaranteed_ne`]: #method.guaranteed_ne
694 /// The return value may change depending on the compiler version and unsafe code might not
695 /// rely on the result of this function for soundness. It is suggested to only use this function
696 /// for performance optimizations where spurious `false` return values by this function do not
697 /// affect the outcome, but just the performance.
698 /// The consequences of using this method to make runtime and compile-time code behave
699 /// differently have not been explored. This method should not be used to introduce such
700 /// differences, and it should also not be stabilized before we have a better understanding
702 #[unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
703 #[rustc_const_unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
705 pub const fn guaranteed_eq(self, other: *mut T) -> bool
709 intrinsics::ptr_guaranteed_eq(self as *const _, other as *const _)
712 /// Returns whether two pointers are guaranteed to be unequal.
714 /// At runtime this function behaves like `self != other`.
715 /// However, in some contexts (e.g., compile-time evaluation),
716 /// it is not always possible to determine the inequality of two pointers, so this function may
717 /// spuriously return `false` for pointers that later actually turn out to be unequal.
718 /// But when it returns `true`, the pointers are guaranteed to be unequal.
720 /// This function is the mirror of [`guaranteed_eq`], but not its inverse. There are pointer
721 /// comparisons for which both functions return `false`.
723 /// [`guaranteed_eq`]: #method.guaranteed_eq
725 /// The return value may change depending on the compiler version and unsafe code might not
726 /// rely on the result of this function for soundness. It is suggested to only use this function
727 /// for performance optimizations where spurious `false` return values by this function do not
728 /// affect the outcome, but just the performance.
729 /// The consequences of using this method to make runtime and compile-time code behave
730 /// differently have not been explored. This method should not be used to introduce such
731 /// differences, and it should also not be stabilized before we have a better understanding
733 #[unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
734 #[rustc_const_unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
736 pub const unsafe fn guaranteed_ne(self, other: *mut T) -> bool
740 intrinsics::ptr_guaranteed_ne(self as *const _, other as *const _)
743 /// Calculates the distance between two pointers. The returned value is in
744 /// units of T: the distance in bytes divided by `mem::size_of::<T>()`.
746 /// This function is the inverse of [`offset`].
748 /// [`offset`]: #method.offset-1
752 /// If any of the following conditions are violated, the result is Undefined
755 /// * Both the starting and other pointer must be either in bounds or one
756 /// byte past the end of the same [allocated object].
758 /// * Both pointers must be *derived from* a pointer to the same object.
759 /// (See below for an example.)
761 /// * The distance between the pointers, in bytes, must be an exact multiple
762 /// of the size of `T`.
764 /// * The distance between the pointers, **in bytes**, cannot overflow an `isize`.
766 /// * The distance being in bounds cannot rely on "wrapping around" the address space.
768 /// Rust types are never larger than `isize::MAX` and Rust allocations never wrap around the
769 /// address space, so two pointers within some value of any Rust type `T` will always satisfy
770 /// the last two conditions. The standard library also generally ensures that allocations
771 /// never reach a size where an offset is a concern. For instance, `Vec` and `Box` ensure they
772 /// never allocate more than `isize::MAX` bytes, so `ptr_into_vec.offset_from(vec.as_ptr())`
773 /// always satisfies the last two conditions.
775 /// Most platforms fundamentally can't even construct such a large allocation.
776 /// For instance, no known 64-bit platform can ever serve a request
777 /// for 2<sup>63</sup> bytes due to page-table limitations or splitting the address space.
778 /// However, some 32-bit and 16-bit platforms may successfully serve a request for
779 /// more than `isize::MAX` bytes with things like Physical Address
780 /// Extension. As such, memory acquired directly from allocators or memory
781 /// mapped files *may* be too large to handle with this function.
782 /// (Note that [`offset`] and [`add`] also have a similar limitation and hence cannot be used on
783 /// such large allocations either.)
785 /// [`add`]: #method.add
786 /// [allocated object]: crate::ptr#allocated-object
790 /// This function panics if `T` is a Zero-Sized Type ("ZST").
797 /// let mut a = [0; 5];
798 /// let ptr1: *mut i32 = &mut a[1];
799 /// let ptr2: *mut i32 = &mut a[3];
801 /// assert_eq!(ptr2.offset_from(ptr1), 2);
802 /// assert_eq!(ptr1.offset_from(ptr2), -2);
803 /// assert_eq!(ptr1.offset(2), ptr2);
804 /// assert_eq!(ptr2.offset(-2), ptr1);
808 /// *Incorrect* usage:
811 /// let ptr1 = Box::into_raw(Box::new(0u8));
812 /// let ptr2 = Box::into_raw(Box::new(1u8));
813 /// let diff = (ptr2 as isize).wrapping_sub(ptr1 as isize);
814 /// // Make ptr2_other an "alias" of ptr2, but derived from ptr1.
815 /// let ptr2_other = (ptr1 as *mut u8).wrapping_offset(diff);
816 /// assert_eq!(ptr2 as usize, ptr2_other as usize);
817 /// // Since ptr2_other and ptr2 are derived from pointers to different objects,
818 /// // computing their offset is undefined behavior, even though
819 /// // they point to the same address!
821 /// let zero = ptr2_other.offset_from(ptr2); // Undefined Behavior
824 #[stable(feature = "ptr_offset_from", since = "1.47.0")]
825 #[rustc_const_unstable(feature = "const_ptr_offset_from", issue = "92980")]
827 pub const unsafe fn offset_from(self, origin: *const T) -> isize
831 // SAFETY: the caller must uphold the safety contract for `offset_from`.
832 unsafe { (self as *const T).offset_from(origin) }
835 /// Calculates the distance between two pointers. The returned value is in
836 /// units of **bytes**.
838 /// This is purely a convenience for casting to a `u8` pointer and
839 /// using [offset_from][pointer::offset_from] on it. See that method for
840 /// documentation and safety requirements.
842 /// For non-`Sized` pointees this operation considers only the data pointers,
843 /// ignoring the metadata.
845 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
846 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
847 pub const unsafe fn byte_offset_from(self, origin: *const T) -> isize {
848 // SAFETY: the caller must uphold the safety contract for `offset_from`.
849 unsafe { self.cast::<u8>().offset_from(origin.cast::<u8>()) }
852 /// Calculates the distance between two pointers, *where it's known that
853 /// `self` is equal to or greater than `origin`*. The returned value is in
854 /// units of T: the distance in bytes is divided by `mem::size_of::<T>()`.
856 /// This computes the same value that [`offset_from`](#method.offset_from)
857 /// would compute, but with the added precondition that that the offset is
858 /// guaranteed to be non-negative. This method is equivalent to
859 /// `usize::from(self.offset_from(origin)).unwrap_unchecked()`,
860 /// but it provides slightly more information to the optimizer, which can
861 /// sometimes allow it to optimize slightly better with some backends.
863 /// This method can be though of as recovering the `count` that was passed
864 /// to [`add`](#method.add) (or, with the parameters in the other order,
865 /// to [`sub`](#method.sub)). The following are all equivalent, assuming
866 /// that their safety preconditions are met:
868 /// # #![feature(ptr_sub_ptr)]
869 /// # unsafe fn blah(ptr: *mut i32, origin: *mut i32, count: usize) -> bool {
870 /// ptr.sub_ptr(origin) == count
872 /// origin.add(count) == ptr
874 /// ptr.sub(count) == origin
880 /// - The distance between the pointers must be non-negative (`self >= origin`)
882 /// - *All* the safety conditions of [`offset_from`](#method.offset_from)
883 /// apply to this method as well; see it for the full details.
885 /// Importantly, despite the return type of this method being able to represent
886 /// a larger offset, it's still *not permitted* to pass pointers which differ
887 /// by more than `isize::MAX` *bytes*. As such, the result of this method will
888 /// always be less than or equal to `isize::MAX as usize`.
892 /// This function panics if `T` is a Zero-Sized Type ("ZST").
897 /// #![feature(ptr_sub_ptr)]
899 /// let mut a = [0; 5];
900 /// let p: *mut i32 = a.as_mut_ptr();
902 /// let ptr1: *mut i32 = p.add(1);
903 /// let ptr2: *mut i32 = p.add(3);
905 /// assert_eq!(ptr2.sub_ptr(ptr1), 2);
906 /// assert_eq!(ptr1.add(2), ptr2);
907 /// assert_eq!(ptr2.sub(2), ptr1);
908 /// assert_eq!(ptr2.sub_ptr(ptr2), 0);
911 /// // This would be incorrect, as the pointers are not correctly ordered:
912 /// // ptr1.offset_from(ptr2)
913 #[unstable(feature = "ptr_sub_ptr", issue = "95892")]
914 #[rustc_const_unstable(feature = "const_ptr_sub_ptr", issue = "95892")]
916 pub const unsafe fn sub_ptr(self, origin: *const T) -> usize
920 // SAFETY: the caller must uphold the safety contract for `sub_ptr`.
921 unsafe { (self as *const T).sub_ptr(origin) }
924 /// Calculates the offset from a pointer (convenience for `.offset(count as isize)`).
926 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
927 /// offset of `3 * size_of::<T>()` bytes.
931 /// If any of the following conditions are violated, the result is Undefined
934 /// * Both the starting and resulting pointer must be either in bounds or one
935 /// byte past the end of the same [allocated object].
937 /// * The computed offset, **in bytes**, cannot overflow an `isize`.
939 /// * The offset being in bounds cannot rely on "wrapping around" the address
940 /// space. That is, the infinite-precision sum must fit in a `usize`.
942 /// The compiler and standard library generally tries to ensure allocations
943 /// never reach a size where an offset is a concern. For instance, `Vec`
944 /// and `Box` ensure they never allocate more than `isize::MAX` bytes, so
945 /// `vec.as_ptr().add(vec.len())` is always safe.
947 /// Most platforms fundamentally can't even construct such an allocation.
948 /// For instance, no known 64-bit platform can ever serve a request
949 /// for 2<sup>63</sup> bytes due to page-table limitations or splitting the address space.
950 /// However, some 32-bit and 16-bit platforms may successfully serve a request for
951 /// more than `isize::MAX` bytes with things like Physical Address
952 /// Extension. As such, memory acquired directly from allocators or memory
953 /// mapped files *may* be too large to handle with this function.
955 /// Consider using [`wrapping_add`] instead if these constraints are
956 /// difficult to satisfy. The only advantage of this method is that it
957 /// enables more aggressive compiler optimizations.
959 /// [`wrapping_add`]: #method.wrapping_add
960 /// [allocated object]: crate::ptr#allocated-object
967 /// let s: &str = "123";
968 /// let ptr: *const u8 = s.as_ptr();
971 /// println!("{}", *ptr.add(1) as char);
972 /// println!("{}", *ptr.add(2) as char);
975 #[stable(feature = "pointer_methods", since = "1.26.0")]
976 #[must_use = "returns a new pointer rather than modifying its argument"]
977 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
979 pub const unsafe fn add(self, count: usize) -> Self
983 // SAFETY: the caller must uphold the safety contract for `offset`.
984 unsafe { self.offset(count as isize) }
987 /// Calculates the offset from a pointer in bytes (convenience for `.byte_offset(count as isize)`).
989 /// `count` is in units of bytes.
991 /// This is purely a convenience for casting to a `u8` pointer and
992 /// using [add][pointer::add] on it. See that method for documentation
993 /// and safety requirements.
995 /// For non-`Sized` pointees this operation changes only the data pointer,
996 /// leaving the metadata untouched.
999 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
1000 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
1001 pub const unsafe fn byte_add(self, count: usize) -> Self {
1002 // SAFETY: the caller must uphold the safety contract for `add`.
1003 let this = unsafe { self.cast::<u8>().add(count).cast::<()>() };
1004 from_raw_parts_mut::<T>(this, metadata(self))
1007 /// Calculates the offset from a pointer (convenience for
1008 /// `.offset((count as isize).wrapping_neg())`).
1010 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
1011 /// offset of `3 * size_of::<T>()` bytes.
1015 /// If any of the following conditions are violated, the result is Undefined
1018 /// * Both the starting and resulting pointer must be either in bounds or one
1019 /// byte past the end of the same [allocated object].
1021 /// * The computed offset cannot exceed `isize::MAX` **bytes**.
1023 /// * The offset being in bounds cannot rely on "wrapping around" the address
1024 /// space. That is, the infinite-precision sum must fit in a usize.
1026 /// The compiler and standard library generally tries to ensure allocations
1027 /// never reach a size where an offset is a concern. For instance, `Vec`
1028 /// and `Box` ensure they never allocate more than `isize::MAX` bytes, so
1029 /// `vec.as_ptr().add(vec.len()).sub(vec.len())` is always safe.
1031 /// Most platforms fundamentally can't even construct such an allocation.
1032 /// For instance, no known 64-bit platform can ever serve a request
1033 /// for 2<sup>63</sup> bytes due to page-table limitations or splitting the address space.
1034 /// However, some 32-bit and 16-bit platforms may successfully serve a request for
1035 /// more than `isize::MAX` bytes with things like Physical Address
1036 /// Extension. As such, memory acquired directly from allocators or memory
1037 /// mapped files *may* be too large to handle with this function.
1039 /// Consider using [`wrapping_sub`] instead if these constraints are
1040 /// difficult to satisfy. The only advantage of this method is that it
1041 /// enables more aggressive compiler optimizations.
1043 /// [`wrapping_sub`]: #method.wrapping_sub
1044 /// [allocated object]: crate::ptr#allocated-object
1051 /// let s: &str = "123";
1054 /// let end: *const u8 = s.as_ptr().add(3);
1055 /// println!("{}", *end.sub(1) as char);
1056 /// println!("{}", *end.sub(2) as char);
1059 #[stable(feature = "pointer_methods", since = "1.26.0")]
1060 #[must_use = "returns a new pointer rather than modifying its argument"]
1061 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
1063 pub const unsafe fn sub(self, count: usize) -> Self
1067 // SAFETY: the caller must uphold the safety contract for `offset`.
1068 unsafe { self.offset((count as isize).wrapping_neg()) }
1071 /// Calculates the offset from a pointer in bytes (convenience for
1072 /// `.byte_offset((count as isize).wrapping_neg())`).
1074 /// `count` is in units of bytes.
1076 /// This is purely a convenience for casting to a `u8` pointer and
1077 /// using [sub][pointer::sub] on it. See that method for documentation
1078 /// and safety requirements.
1080 /// For non-`Sized` pointees this operation changes only the data pointer,
1081 /// leaving the metadata untouched.
1084 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
1085 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
1086 pub const unsafe fn byte_sub(self, count: usize) -> Self {
1087 // SAFETY: the caller must uphold the safety contract for `sub`.
1088 let this = unsafe { self.cast::<u8>().sub(count).cast::<()>() };
1089 from_raw_parts_mut::<T>(this, metadata(self))
1092 /// Calculates the offset from a pointer using wrapping arithmetic.
1093 /// (convenience for `.wrapping_offset(count as isize)`)
1095 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
1096 /// offset of `3 * size_of::<T>()` bytes.
1100 /// This operation itself is always safe, but using the resulting pointer is not.
1102 /// The resulting pointer "remembers" the [allocated object] that `self` points to; it must not
1103 /// be used to read or write other allocated objects.
1105 /// In other words, `let z = x.wrapping_add((y as usize) - (x as usize))` does *not* make `z`
1106 /// the same as `y` even if we assume `T` has size `1` and there is no overflow: `z` is still
1107 /// attached to the object `x` is attached to, and dereferencing it is Undefined Behavior unless
1108 /// `x` and `y` point into the same allocated object.
1110 /// Compared to [`add`], this method basically delays the requirement of staying within the
1111 /// same allocated object: [`add`] is immediate Undefined Behavior when crossing object
1112 /// boundaries; `wrapping_add` produces a pointer but still leads to Undefined Behavior if a
1113 /// pointer is dereferenced when it is out-of-bounds of the object it is attached to. [`add`]
1114 /// can be optimized better and is thus preferable in performance-sensitive code.
1116 /// The delayed check only considers the value of the pointer that was dereferenced, not the
1117 /// intermediate values used during the computation of the final result. For example,
1118 /// `x.wrapping_add(o).wrapping_sub(o)` is always the same as `x`. In other words, leaving the
1119 /// allocated object and then re-entering it later is permitted.
1121 /// [`add`]: #method.add
1122 /// [allocated object]: crate::ptr#allocated-object
1129 /// // Iterate using a raw pointer in increments of two elements
1130 /// let data = [1u8, 2, 3, 4, 5];
1131 /// let mut ptr: *const u8 = data.as_ptr();
1133 /// let end_rounded_up = ptr.wrapping_add(6);
1135 /// // This loop prints "1, 3, 5, "
1136 /// while ptr != end_rounded_up {
1138 /// print!("{}, ", *ptr);
1140 /// ptr = ptr.wrapping_add(step);
1143 #[stable(feature = "pointer_methods", since = "1.26.0")]
1144 #[must_use = "returns a new pointer rather than modifying its argument"]
1145 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
1147 pub const fn wrapping_add(self, count: usize) -> Self
1151 self.wrapping_offset(count as isize)
1154 /// Calculates the offset from a pointer in bytes using wrapping arithmetic.
1155 /// (convenience for `.wrapping_byte_offset(count as isize)`)
1157 /// `count` is in units of bytes.
1159 /// This is purely a convenience for casting to a `u8` pointer and
1160 /// using [wrapping_add][pointer::wrapping_add] on it. See that method for documentation.
1162 /// For non-`Sized` pointees this operation changes only the data pointer,
1163 /// leaving the metadata untouched.
1166 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
1167 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
1168 pub const fn wrapping_byte_add(self, count: usize) -> Self {
1169 from_raw_parts_mut::<T>(self.cast::<u8>().wrapping_add(count).cast::<()>(), metadata(self))
1172 /// Calculates the offset from a pointer using wrapping arithmetic.
1173 /// (convenience for `.wrapping_offset((count as isize).wrapping_neg())`)
1175 /// `count` is in units of T; e.g., a `count` of 3 represents a pointer
1176 /// offset of `3 * size_of::<T>()` bytes.
1180 /// This operation itself is always safe, but using the resulting pointer is not.
1182 /// The resulting pointer "remembers" the [allocated object] that `self` points to; it must not
1183 /// be used to read or write other allocated objects.
1185 /// In other words, `let z = x.wrapping_sub((x as usize) - (y as usize))` does *not* make `z`
1186 /// the same as `y` even if we assume `T` has size `1` and there is no overflow: `z` is still
1187 /// attached to the object `x` is attached to, and dereferencing it is Undefined Behavior unless
1188 /// `x` and `y` point into the same allocated object.
1190 /// Compared to [`sub`], this method basically delays the requirement of staying within the
1191 /// same allocated object: [`sub`] is immediate Undefined Behavior when crossing object
1192 /// boundaries; `wrapping_sub` produces a pointer but still leads to Undefined Behavior if a
1193 /// pointer is dereferenced when it is out-of-bounds of the object it is attached to. [`sub`]
1194 /// can be optimized better and is thus preferable in performance-sensitive code.
1196 /// The delayed check only considers the value of the pointer that was dereferenced, not the
1197 /// intermediate values used during the computation of the final result. For example,
1198 /// `x.wrapping_add(o).wrapping_sub(o)` is always the same as `x`. In other words, leaving the
1199 /// allocated object and then re-entering it later is permitted.
1201 /// [`sub`]: #method.sub
1202 /// [allocated object]: crate::ptr#allocated-object
1209 /// // Iterate using a raw pointer in increments of two elements (backwards)
1210 /// let data = [1u8, 2, 3, 4, 5];
1211 /// let mut ptr: *const u8 = data.as_ptr();
1212 /// let start_rounded_down = ptr.wrapping_sub(2);
1213 /// ptr = ptr.wrapping_add(4);
1215 /// // This loop prints "5, 3, 1, "
1216 /// while ptr != start_rounded_down {
1218 /// print!("{}, ", *ptr);
1220 /// ptr = ptr.wrapping_sub(step);
1223 #[stable(feature = "pointer_methods", since = "1.26.0")]
1224 #[must_use = "returns a new pointer rather than modifying its argument"]
1225 #[rustc_const_stable(feature = "const_ptr_offset", since = "1.61.0")]
1227 pub const fn wrapping_sub(self, count: usize) -> Self
1231 self.wrapping_offset((count as isize).wrapping_neg())
1234 /// Calculates the offset from a pointer in bytes using wrapping arithmetic.
1235 /// (convenience for `.wrapping_offset((count as isize).wrapping_neg())`)
1237 /// `count` is in units of bytes.
1239 /// This is purely a convenience for casting to a `u8` pointer and
1240 /// using [wrapping_sub][pointer::wrapping_sub] on it. See that method for documentation.
1242 /// For non-`Sized` pointees this operation changes only the data pointer,
1243 /// leaving the metadata untouched.
1246 #[unstable(feature = "pointer_byte_offsets", issue = "96283")]
1247 #[rustc_const_unstable(feature = "const_pointer_byte_offsets", issue = "96283")]
1248 pub const fn wrapping_byte_sub(self, count: usize) -> Self {
1249 from_raw_parts_mut::<T>(self.cast::<u8>().wrapping_sub(count).cast::<()>(), metadata(self))
1252 /// Reads the value from `self` without moving it. This leaves the
1253 /// memory in `self` unchanged.
1255 /// See [`ptr::read`] for safety concerns and examples.
1257 /// [`ptr::read`]: crate::ptr::read()
1258 #[stable(feature = "pointer_methods", since = "1.26.0")]
1259 #[rustc_const_unstable(feature = "const_ptr_read", issue = "80377")]
1261 pub const unsafe fn read(self) -> T
1265 // SAFETY: the caller must uphold the safety contract for ``.
1266 unsafe { read(self) }
1269 /// Performs a volatile read of the value from `self` without moving it. This
1270 /// leaves the memory in `self` unchanged.
1272 /// Volatile operations are intended to act on I/O memory, and are guaranteed
1273 /// to not be elided or reordered by the compiler across other volatile
1276 /// See [`ptr::read_volatile`] for safety concerns and examples.
1278 /// [`ptr::read_volatile`]: crate::ptr::read_volatile()
1279 #[stable(feature = "pointer_methods", since = "1.26.0")]
1281 pub unsafe fn read_volatile(self) -> T
1285 // SAFETY: the caller must uphold the safety contract for `read_volatile`.
1286 unsafe { read_volatile(self) }
1289 /// Reads the value from `self` without moving it. This leaves the
1290 /// memory in `self` unchanged.
1292 /// Unlike `read`, the pointer may be unaligned.
1294 /// See [`ptr::read_unaligned`] for safety concerns and examples.
1296 /// [`ptr::read_unaligned`]: crate::ptr::read_unaligned()
1297 #[stable(feature = "pointer_methods", since = "1.26.0")]
1298 #[rustc_const_unstable(feature = "const_ptr_read", issue = "80377")]
1300 pub const unsafe fn read_unaligned(self) -> T
1304 // SAFETY: the caller must uphold the safety contract for `read_unaligned`.
1305 unsafe { read_unaligned(self) }
1308 /// Copies `count * size_of<T>` bytes from `self` to `dest`. The source
1309 /// and destination may overlap.
1311 /// NOTE: this has the *same* argument order as [`ptr::copy`].
1313 /// See [`ptr::copy`] for safety concerns and examples.
1315 /// [`ptr::copy`]: crate::ptr::copy()
1316 #[rustc_const_stable(feature = "const_intrinsic_copy", since = "1.63.0")]
1317 #[stable(feature = "pointer_methods", since = "1.26.0")]
1319 pub const unsafe fn copy_to(self, dest: *mut T, count: usize)
1323 // SAFETY: the caller must uphold the safety contract for `copy`.
1324 unsafe { copy(self, dest, count) }
1327 /// Copies `count * size_of<T>` bytes from `self` to `dest`. The source
1328 /// and destination may *not* overlap.
1330 /// NOTE: this has the *same* argument order as [`ptr::copy_nonoverlapping`].
1332 /// See [`ptr::copy_nonoverlapping`] for safety concerns and examples.
1334 /// [`ptr::copy_nonoverlapping`]: crate::ptr::copy_nonoverlapping()
1335 #[rustc_const_stable(feature = "const_intrinsic_copy", since = "1.63.0")]
1336 #[stable(feature = "pointer_methods", since = "1.26.0")]
1338 pub const unsafe fn copy_to_nonoverlapping(self, dest: *mut T, count: usize)
1342 // SAFETY: the caller must uphold the safety contract for `copy_nonoverlapping`.
1343 unsafe { copy_nonoverlapping(self, dest, count) }
1346 /// Copies `count * size_of<T>` bytes from `src` to `self`. The source
1347 /// and destination may overlap.
1349 /// NOTE: this has the *opposite* argument order of [`ptr::copy`].
1351 /// See [`ptr::copy`] for safety concerns and examples.
1353 /// [`ptr::copy`]: crate::ptr::copy()
1354 #[rustc_const_stable(feature = "const_intrinsic_copy", since = "1.63.0")]
1355 #[stable(feature = "pointer_methods", since = "1.26.0")]
1357 pub const unsafe fn copy_from(self, src: *const T, count: usize)
1361 // SAFETY: the caller must uphold the safety contract for `copy`.
1362 unsafe { copy(src, self, count) }
1365 /// Copies `count * size_of<T>` bytes from `src` to `self`. The source
1366 /// and destination may *not* overlap.
1368 /// NOTE: this has the *opposite* argument order of [`ptr::copy_nonoverlapping`].
1370 /// See [`ptr::copy_nonoverlapping`] for safety concerns and examples.
1372 /// [`ptr::copy_nonoverlapping`]: crate::ptr::copy_nonoverlapping()
1373 #[rustc_const_stable(feature = "const_intrinsic_copy", since = "1.63.0")]
1374 #[stable(feature = "pointer_methods", since = "1.26.0")]
1376 pub const unsafe fn copy_from_nonoverlapping(self, src: *const T, count: usize)
1380 // SAFETY: the caller must uphold the safety contract for `copy_nonoverlapping`.
1381 unsafe { copy_nonoverlapping(src, self, count) }
1384 /// Executes the destructor (if any) of the pointed-to value.
1386 /// See [`ptr::drop_in_place`] for safety concerns and examples.
1388 /// [`ptr::drop_in_place`]: crate::ptr::drop_in_place()
1389 #[stable(feature = "pointer_methods", since = "1.26.0")]
1391 pub unsafe fn drop_in_place(self) {
1392 // SAFETY: the caller must uphold the safety contract for `drop_in_place`.
1393 unsafe { drop_in_place(self) }
1396 /// Overwrites a memory location with the given value without reading or
1397 /// dropping the old value.
1399 /// See [`ptr::write`] for safety concerns and examples.
1401 /// [`ptr::write`]: crate::ptr::write()
1402 #[stable(feature = "pointer_methods", since = "1.26.0")]
1403 #[rustc_const_unstable(feature = "const_ptr_write", issue = "86302")]
1405 pub const unsafe fn write(self, val: T)
1409 // SAFETY: the caller must uphold the safety contract for `write`.
1410 unsafe { write(self, val) }
1413 /// Invokes memset on the specified pointer, setting `count * size_of::<T>()`
1414 /// bytes of memory starting at `self` to `val`.
1416 /// See [`ptr::write_bytes`] for safety concerns and examples.
1418 /// [`ptr::write_bytes`]: crate::ptr::write_bytes()
1419 #[doc(alias = "memset")]
1420 #[stable(feature = "pointer_methods", since = "1.26.0")]
1421 #[rustc_const_unstable(feature = "const_ptr_write", issue = "86302")]
1423 pub const unsafe fn write_bytes(self, val: u8, count: usize)
1427 // SAFETY: the caller must uphold the safety contract for `write_bytes`.
1428 unsafe { write_bytes(self, val, count) }
1431 /// Performs a volatile write of a memory location with the given value without
1432 /// reading or dropping the old value.
1434 /// Volatile operations are intended to act on I/O memory, and are guaranteed
1435 /// to not be elided or reordered by the compiler across other volatile
1438 /// See [`ptr::write_volatile`] for safety concerns and examples.
1440 /// [`ptr::write_volatile`]: crate::ptr::write_volatile()
1441 #[stable(feature = "pointer_methods", since = "1.26.0")]
1443 pub unsafe fn write_volatile(self, val: T)
1447 // SAFETY: the caller must uphold the safety contract for `write_volatile`.
1448 unsafe { write_volatile(self, val) }
1451 /// Overwrites a memory location with the given value without reading or
1452 /// dropping the old value.
1454 /// Unlike `write`, the pointer may be unaligned.
1456 /// See [`ptr::write_unaligned`] for safety concerns and examples.
1458 /// [`ptr::write_unaligned`]: crate::ptr::write_unaligned()
1459 #[stable(feature = "pointer_methods", since = "1.26.0")]
1460 #[rustc_const_unstable(feature = "const_ptr_write", issue = "86302")]
1462 pub const unsafe fn write_unaligned(self, val: T)
1466 // SAFETY: the caller must uphold the safety contract for `write_unaligned`.
1467 unsafe { write_unaligned(self, val) }
1470 /// Replaces the value at `self` with `src`, returning the old
1471 /// value, without dropping either.
1473 /// See [`ptr::replace`] for safety concerns and examples.
1475 /// [`ptr::replace`]: crate::ptr::replace()
1476 #[stable(feature = "pointer_methods", since = "1.26.0")]
1478 pub unsafe fn replace(self, src: T) -> T
1482 // SAFETY: the caller must uphold the safety contract for `replace`.
1483 unsafe { replace(self, src) }
1486 /// Swaps the values at two mutable locations of the same type, without
1487 /// deinitializing either. They may overlap, unlike `mem::swap` which is
1488 /// otherwise equivalent.
1490 /// See [`ptr::swap`] for safety concerns and examples.
1492 /// [`ptr::swap`]: crate::ptr::swap()
1493 #[stable(feature = "pointer_methods", since = "1.26.0")]
1494 #[rustc_const_unstable(feature = "const_swap", issue = "83163")]
1496 pub const unsafe fn swap(self, with: *mut T)
1500 // SAFETY: the caller must uphold the safety contract for `swap`.
1501 unsafe { swap(self, with) }
1504 /// Computes the offset that needs to be applied to the pointer in order to make it aligned to
1507 /// If it is not possible to align the pointer, the implementation returns
1508 /// `usize::MAX`. It is permissible for the implementation to *always*
1509 /// return `usize::MAX`. Only your algorithm's performance can depend
1510 /// on getting a usable offset here, not its correctness.
1512 /// The offset is expressed in number of `T` elements, and not bytes. The value returned can be
1513 /// used with the `wrapping_add` method.
1515 /// There are no guarantees whatsoever that offsetting the pointer will not overflow or go
1516 /// beyond the allocation that the pointer points into. It is up to the caller to ensure that
1517 /// the returned offset is correct in all terms other than alignment.
1521 /// The function panics if `align` is not a power-of-two.
1525 /// Accessing adjacent `u8` as `u16`
1528 /// # fn foo(n: usize) {
1529 /// # use std::mem::align_of;
1531 /// let x = [5u8, 6u8, 7u8, 8u8, 9u8];
1532 /// let ptr = x.as_ptr().add(n) as *const u8;
1533 /// let offset = ptr.align_offset(align_of::<u16>());
1534 /// if offset < x.len() - n - 1 {
1535 /// let u16_ptr = ptr.add(offset) as *const u16;
1536 /// assert_ne!(*u16_ptr, 500);
1538 /// // while the pointer can be aligned via `offset`, it would point
1539 /// // outside the allocation
1543 #[stable(feature = "align_offset", since = "1.36.0")]
1544 #[rustc_const_unstable(feature = "const_align_offset", issue = "90962")]
1545 pub const fn align_offset(self, align: usize) -> usize
1549 if !align.is_power_of_two() {
1550 panic!("align_offset: align is not a power-of-two");
1553 fn rt_impl<T>(p: *mut T, align: usize) -> usize {
1554 // SAFETY: `align` has been checked to be a power of 2 above
1555 unsafe { align_offset(p, align) }
1558 const fn ctfe_impl<T>(_: *mut T, _: usize) -> usize {
1563 // It is permissible for `align_offset` to always return `usize::MAX`,
1564 // algorithm correctness can not depend on `align_offset` returning non-max values.
1566 // As such the behaviour can't change after replacing `align_offset` with `usize::MAX`, only performance can.
1567 unsafe { intrinsics::const_eval_select((self, align), ctfe_impl, rt_impl) }
1570 /// Returns whether the pointer is properly aligned for `T`.
1573 #[unstable(feature = "pointer_is_aligned", issue = "96284")]
1574 pub fn is_aligned(self) -> bool
1578 self.is_aligned_to(core::mem::align_of::<T>())
1581 /// Returns whether the pointer is aligned to `align`.
1583 /// For non-`Sized` pointees this operation considers only the data pointer,
1584 /// ignoring the metadata.
1588 /// The function panics if `align` is not a power-of-two (this includes 0).
1591 #[unstable(feature = "pointer_is_aligned", issue = "96284")]
1592 pub fn is_aligned_to(self, align: usize) -> bool {
1593 if !align.is_power_of_two() {
1594 panic!("is_aligned_to: align is not a power-of-two");
1597 // SAFETY: `is_power_of_two()` will return `false` for zero.
1598 unsafe { core::intrinsics::assume(align != 0) };
1600 // Cast is needed for `T: !Sized`
1601 self.cast::<u8>().addr() % align == 0
1606 /// Returns the length of a raw slice.
1608 /// The returned value is the number of **elements**, not the number of bytes.
1610 /// This function is safe, even when the raw slice cannot be cast to a slice
1611 /// reference because the pointer is null or unaligned.
1616 /// #![feature(slice_ptr_len)]
1619 /// let slice: *mut [i8] = ptr::slice_from_raw_parts_mut(ptr::null_mut(), 3);
1620 /// assert_eq!(slice.len(), 3);
1623 #[unstable(feature = "slice_ptr_len", issue = "71146")]
1624 #[rustc_const_unstable(feature = "const_slice_ptr_len", issue = "71146")]
1625 pub const fn len(self) -> usize {
1629 /// Returns `true` if the raw slice has a length of 0.
1634 /// #![feature(slice_ptr_len)]
1636 /// let mut a = [1, 2, 3];
1637 /// let ptr = &mut a as *mut [_];
1638 /// assert!(!ptr.is_empty());
1641 #[unstable(feature = "slice_ptr_len", issue = "71146")]
1642 #[rustc_const_unstable(feature = "const_slice_ptr_len", issue = "71146")]
1643 pub const fn is_empty(self) -> bool {
1647 /// Divides one mutable raw slice into two at an index.
1649 /// The first will contain all indices from `[0, mid)` (excluding
1650 /// the index `mid` itself) and the second will contain all
1651 /// indices from `[mid, len)` (excluding the index `len` itself).
1655 /// Panics if `mid > len`.
1659 /// `mid` must be [in-bounds] of the underlying [allocated object].
1660 /// Which means `self` must be dereferenceable and span a single allocation
1661 /// that is at least `mid * size_of::<T>()` bytes long. Not upholding these
1662 /// requirements is *[undefined behavior]* even if the resulting pointers are not used.
1664 /// Since `len` being in-bounds it is not a safety invariant of `*mut [T]` the
1665 /// safety requirements of this method are the same as for [`split_at_mut_unchecked`].
1666 /// The explicit bounds check is only as useful as `len` is correct.
1668 /// [`split_at_mut_unchecked`]: #method.split_at_mut_unchecked
1669 /// [in-bounds]: #method.add
1670 /// [allocated object]: crate::ptr#allocated-object
1671 /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
1676 /// #![feature(raw_slice_split)]
1677 /// #![feature(slice_ptr_get)]
1679 /// let mut v = [1, 0, 3, 0, 5, 6];
1680 /// let ptr = &mut v as *mut [_];
1682 /// let (left, right) = ptr.split_at_mut(2);
1683 /// assert_eq!(&*left, [1, 0]);
1684 /// assert_eq!(&*right, [3, 0, 5, 6]);
1689 #[unstable(feature = "raw_slice_split", issue = "95595")]
1690 pub unsafe fn split_at_mut(self, mid: usize) -> (*mut [T], *mut [T]) {
1691 assert!(mid <= self.len());
1692 // SAFETY: The assert above is only a safety-net as long as `self.len()` is correct
1693 // The actual safety requirements of this function are the same as for `split_at_mut_unchecked`
1694 unsafe { self.split_at_mut_unchecked(mid) }
1697 /// Divides one mutable raw slice into two at an index, without doing bounds checking.
1699 /// The first will contain all indices from `[0, mid)` (excluding
1700 /// the index `mid` itself) and the second will contain all
1701 /// indices from `[mid, len)` (excluding the index `len` itself).
1705 /// `mid` must be [in-bounds] of the underlying [allocated object].
1706 /// Which means `self` must be dereferenceable and span a single allocation
1707 /// that is at least `mid * size_of::<T>()` bytes long. Not upholding these
1708 /// requirements is *[undefined behavior]* even if the resulting pointers are not used.
1710 /// [in-bounds]: #method.add
1711 /// [out-of-bounds index]: #method.add
1712 /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
1717 /// #![feature(raw_slice_split)]
1719 /// let mut v = [1, 0, 3, 0, 5, 6];
1720 /// // scoped to restrict the lifetime of the borrows
1722 /// let ptr = &mut v as *mut [_];
1723 /// let (left, right) = ptr.split_at_mut_unchecked(2);
1724 /// assert_eq!(&*left, [1, 0]);
1725 /// assert_eq!(&*right, [3, 0, 5, 6]);
1726 /// (&mut *left)[1] = 2;
1727 /// (&mut *right)[1] = 4;
1729 /// assert_eq!(v, [1, 2, 3, 4, 5, 6]);
1732 #[unstable(feature = "raw_slice_split", issue = "95595")]
1733 pub unsafe fn split_at_mut_unchecked(self, mid: usize) -> (*mut [T], *mut [T]) {
1734 let len = self.len();
1735 let ptr = self.as_mut_ptr();
1737 // SAFETY: Caller must pass a valid pointer and an index that is in-bounds.
1738 let tail = unsafe { ptr.add(mid) };
1740 crate::ptr::slice_from_raw_parts_mut(ptr, mid),
1741 crate::ptr::slice_from_raw_parts_mut(tail, len - mid),
1745 /// Returns a raw pointer to the slice's buffer.
1747 /// This is equivalent to casting `self` to `*mut T`, but more type-safe.
1752 /// #![feature(slice_ptr_get)]
1755 /// let slice: *mut [i8] = ptr::slice_from_raw_parts_mut(ptr::null_mut(), 3);
1756 /// assert_eq!(slice.as_mut_ptr(), ptr::null_mut());
1759 #[unstable(feature = "slice_ptr_get", issue = "74265")]
1760 #[rustc_const_unstable(feature = "slice_ptr_get", issue = "74265")]
1761 pub const fn as_mut_ptr(self) -> *mut T {
1765 /// Returns a raw pointer to an element or subslice, without doing bounds
1768 /// Calling this method with an [out-of-bounds index] or when `self` is not dereferenceable
1769 /// is *[undefined behavior]* even if the resulting pointer is not used.
1771 /// [out-of-bounds index]: #method.add
1772 /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
1777 /// #![feature(slice_ptr_get)]
1779 /// let x = &mut [1, 2, 4] as *mut [i32];
1782 /// assert_eq!(x.get_unchecked_mut(1), x.as_mut_ptr().add(1));
1785 #[unstable(feature = "slice_ptr_get", issue = "74265")]
1786 #[rustc_const_unstable(feature = "const_slice_index", issue = "none")]
1788 pub const unsafe fn get_unchecked_mut<I>(self, index: I) -> *mut I::Output
1790 I: ~const SliceIndex<[T]>,
1792 // SAFETY: the caller ensures that `self` is dereferenceable and `index` in-bounds.
1793 unsafe { index.get_unchecked_mut(self) }
1796 /// Returns `None` if the pointer is null, or else returns a shared slice to
1797 /// the value wrapped in `Some`. In contrast to [`as_ref`], this does not require
1798 /// that the value has to be initialized.
1800 /// For the mutable counterpart see [`as_uninit_slice_mut`].
1802 /// [`as_ref`]: #method.as_ref-1
1803 /// [`as_uninit_slice_mut`]: #method.as_uninit_slice_mut
1807 /// When calling this method, you have to ensure that *either* the pointer is null *or*
1808 /// all of the following is true:
1810 /// * The pointer must be [valid] for reads for `ptr.len() * mem::size_of::<T>()` many bytes,
1811 /// and it must be properly aligned. This means in particular:
1813 /// * The entire memory range of this slice must be contained within a single [allocated object]!
1814 /// Slices can never span across multiple allocated objects.
1816 /// * The pointer must be aligned even for zero-length slices. One
1817 /// reason for this is that enum layout optimizations may rely on references
1818 /// (including slices of any length) being aligned and non-null to distinguish
1819 /// them from other data. You can obtain a pointer that is usable as `data`
1820 /// for zero-length slices using [`NonNull::dangling()`].
1822 /// * The total size `ptr.len() * mem::size_of::<T>()` of the slice must be no larger than `isize::MAX`.
1823 /// See the safety documentation of [`pointer::offset`].
1825 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
1826 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
1827 /// In particular, while this reference exists, the memory the pointer points to must
1828 /// not get mutated (except inside `UnsafeCell`).
1830 /// This applies even if the result of this method is unused!
1832 /// See also [`slice::from_raw_parts`][].
1834 /// [valid]: crate::ptr#safety
1835 /// [allocated object]: crate::ptr#allocated-object
1837 #[unstable(feature = "ptr_as_uninit", issue = "75402")]
1838 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
1839 pub const unsafe fn as_uninit_slice<'a>(self) -> Option<&'a [MaybeUninit<T>]> {
1843 // SAFETY: the caller must uphold the safety contract for `as_uninit_slice`.
1844 Some(unsafe { slice::from_raw_parts(self as *const MaybeUninit<T>, self.len()) })
1848 /// Returns `None` if the pointer is null, or else returns a unique slice to
1849 /// the value wrapped in `Some`. In contrast to [`as_mut`], this does not require
1850 /// that the value has to be initialized.
1852 /// For the shared counterpart see [`as_uninit_slice`].
1854 /// [`as_mut`]: #method.as_mut
1855 /// [`as_uninit_slice`]: #method.as_uninit_slice-1
1859 /// When calling this method, you have to ensure that *either* the pointer is null *or*
1860 /// all of the following is true:
1862 /// * The pointer must be [valid] for reads and writes for `ptr.len() * mem::size_of::<T>()`
1863 /// many bytes, and it must be properly aligned. This means in particular:
1865 /// * The entire memory range of this slice must be contained within a single [allocated object]!
1866 /// Slices can never span across multiple allocated objects.
1868 /// * The pointer must be aligned even for zero-length slices. One
1869 /// reason for this is that enum layout optimizations may rely on references
1870 /// (including slices of any length) being aligned and non-null to distinguish
1871 /// them from other data. You can obtain a pointer that is usable as `data`
1872 /// for zero-length slices using [`NonNull::dangling()`].
1874 /// * The total size `ptr.len() * mem::size_of::<T>()` of the slice must be no larger than `isize::MAX`.
1875 /// See the safety documentation of [`pointer::offset`].
1877 /// * You must enforce Rust's aliasing rules, since the returned lifetime `'a` is
1878 /// arbitrarily chosen and does not necessarily reflect the actual lifetime of the data.
1879 /// In particular, while this reference exists, the memory the pointer points to must
1880 /// not get accessed (read or written) through any other pointer.
1882 /// This applies even if the result of this method is unused!
1884 /// See also [`slice::from_raw_parts_mut`][].
1886 /// [valid]: crate::ptr#safety
1887 /// [allocated object]: crate::ptr#allocated-object
1889 #[unstable(feature = "ptr_as_uninit", issue = "75402")]
1890 #[rustc_const_unstable(feature = "const_ptr_as_ref", issue = "91822")]
1891 pub const unsafe fn as_uninit_slice_mut<'a>(self) -> Option<&'a mut [MaybeUninit<T>]> {
1895 // SAFETY: the caller must uphold the safety contract for `as_uninit_slice_mut`.
1896 Some(unsafe { slice::from_raw_parts_mut(self as *mut MaybeUninit<T>, self.len()) })
1901 // Equality for pointers
1902 #[stable(feature = "rust1", since = "1.0.0")]
1903 impl<T: ?Sized> PartialEq for *mut T {
1905 fn eq(&self, other: &*mut T) -> bool {
1910 #[stable(feature = "rust1", since = "1.0.0")]
1911 impl<T: ?Sized> Eq for *mut T {}
1913 #[stable(feature = "rust1", since = "1.0.0")]
1914 impl<T: ?Sized> Ord for *mut T {
1916 fn cmp(&self, other: &*mut T) -> Ordering {
1919 } else if self == other {
1927 #[stable(feature = "rust1", since = "1.0.0")]
1928 impl<T: ?Sized> PartialOrd for *mut T {
1930 fn partial_cmp(&self, other: &*mut T) -> Option<Ordering> {
1931 Some(self.cmp(other))
1935 fn lt(&self, other: &*mut T) -> bool {
1940 fn le(&self, other: &*mut T) -> bool {
1945 fn gt(&self, other: &*mut T) -> bool {
1950 fn ge(&self, other: &*mut T) -> bool {