1 //! Basic functions for dealing with memory.
3 //! This module contains functions for querying the size and alignment of
4 //! types, initializing and manipulating memory.
6 #![stable(feature = "rust1", since = "1.0.0")]
13 use marker::{Copy, PhantomData, Sized};
15 use ops::{Deref, DerefMut};
17 #[stable(feature = "rust1", since = "1.0.0")]
18 pub use intrinsics::transmute;
20 /// Takes ownership and "forgets" about the value **without running its destructor**.
22 /// Any resources the value manages, such as heap memory or a file handle, will linger
23 /// forever in an unreachable state. However, it does not guarantee that pointers
24 /// to this memory will remain valid.
26 /// * If you want to leak memory, see [`Box::leak`][leak].
27 /// * If you want to obtain a raw pointer to the memory, see [`Box::into_raw`][into_raw].
28 /// * If you want to dispose of a value properly, running its destructor, see
29 /// [`mem::drop`][drop].
33 /// `forget` is not marked as `unsafe`, because Rust's safety guarantees
34 /// do not include a guarantee that destructors will always run. For example,
35 /// a program can create a reference cycle using [`Rc`][rc], or call
36 /// [`process::exit`][exit] to exit without running destructors. Thus, allowing
37 /// `mem::forget` from safe code does not fundamentally change Rust's safety
40 /// That said, leaking resources such as memory or I/O objects is usually undesirable,
41 /// so `forget` is only recommended for specialized use cases like those shown below.
43 /// Because forgetting a value is allowed, any `unsafe` code you write must
44 /// allow for this possibility. You cannot return a value and expect that the
45 /// caller will necessarily run the value's destructor.
47 /// [rc]: ../../std/rc/struct.Rc.html
48 /// [exit]: ../../std/process/fn.exit.html
52 /// Leak an I/O object, never closing the file:
56 /// use std::fs::File;
58 /// let file = File::open("foo.txt").unwrap();
59 /// mem::forget(file);
62 /// The practical use cases for `forget` are rather specialized and mainly come
63 /// up in unsafe or FFI code.
67 /// You have created an uninitialized value using [`mem::uninitialized`][uninit].
68 /// You must either initialize or `forget` it on every computation path before
69 /// Rust drops it automatically, like at the end of a scope or after a panic.
70 /// Running the destructor on an uninitialized value would be [undefined behavior][ub].
76 /// # let some_condition = false;
78 /// let mut uninit_vec: Vec<u32> = mem::uninitialized();
80 /// if some_condition {
81 /// // Initialize the variable.
82 /// ptr::write(&mut uninit_vec, Vec::new());
84 /// // Forget the uninitialized value so its destructor doesn't run.
85 /// mem::forget(uninit_vec);
92 /// You have duplicated the bytes making up a value, without doing a proper
93 /// [`Clone`][clone]. You need the value's destructor to run only once,
94 /// because a double `free` is undefined behavior.
96 /// An example is a possible implementation of [`mem::swap`][swap]:
102 /// # #[allow(dead_code)]
103 /// fn swap<T>(x: &mut T, y: &mut T) {
105 /// // Give ourselves some scratch space to work with
106 /// let mut t: T = mem::uninitialized();
108 /// // Perform the swap, `&mut` pointers never alias
109 /// ptr::copy_nonoverlapping(&*x, &mut t, 1);
110 /// ptr::copy_nonoverlapping(&*y, x, 1);
111 /// ptr::copy_nonoverlapping(&t, y, 1);
113 /// // y and t now point to the same thing, but we need to completely
114 /// // forget `t` because we do not want to run the destructor for `T`
115 /// // on its value, which is still owned somewhere outside this function.
121 /// [drop]: fn.drop.html
122 /// [uninit]: fn.uninitialized.html
123 /// [clone]: ../clone/trait.Clone.html
124 /// [swap]: fn.swap.html
125 /// [box]: ../../std/boxed/struct.Box.html
126 /// [leak]: ../../std/boxed/struct.Box.html#method.leak
127 /// [into_raw]: ../../std/boxed/struct.Box.html#method.into_raw
128 /// [ub]: ../../reference/behavior-considered-undefined.html
130 #[stable(feature = "rust1", since = "1.0.0")]
131 pub fn forget<T>(t: T) {
132 ManuallyDrop::new(t);
135 /// Like [`forget`], but also accepts unsized values.
137 /// This function is just a shim intended to be removed when the `unsized_locals` feature gets
140 /// [`forget`]: fn.forget.html
142 #[unstable(feature = "forget_unsized", issue = "0")]
143 pub fn forget_unsized<T: ?Sized>(t: T) {
144 unsafe { intrinsics::forget(t) }
147 /// Returns the size of a type in bytes.
149 /// More specifically, this is the offset in bytes between successive elements
150 /// in an array with that item type including alignment padding. Thus, for any
151 /// type `T` and length `n`, `[T; n]` has a size of `n * size_of::<T>()`.
153 /// In general, the size of a type is not stable across compilations, but
154 /// specific types such as primitives are.
156 /// The following table gives the size for primitives.
158 /// Type | size_of::\<Type>()
159 /// ---- | ---------------
176 /// Furthermore, `usize` and `isize` have the same size.
178 /// The types `*const T`, `&T`, `Box<T>`, `Option<&T>`, and `Option<Box<T>>` all have
179 /// the same size. If `T` is Sized, all of those types have the same size as `usize`.
181 /// The mutability of a pointer does not change its size. As such, `&T` and `&mut T`
182 /// have the same size. Likewise for `*const T` and `*mut T`.
184 /// # Size of `#[repr(C)]` items
186 /// The `C` representation for items has a defined layout. With this layout,
187 /// the size of items is also stable as long as all fields have a stable size.
189 /// ## Size of Structs
191 /// For `structs`, the size is determined by the following algorithm.
193 /// For each field in the struct ordered by declaration order:
195 /// 1. Add the size of the field.
196 /// 2. Round up the current size to the nearest multiple of the next field's [alignment].
198 /// Finally, round the size of the struct to the nearest multiple of its [alignment].
199 /// The alignment of the struct is usually the largest alignment of all its
200 /// fields; this can be changed with the use of `repr(align(N))`.
202 /// Unlike `C`, zero sized structs are not rounded up to one byte in size.
206 /// Enums that carry no data other than the discriminant have the same size as C enums
207 /// on the platform they are compiled for.
209 /// ## Size of Unions
211 /// The size of a union is the size of its largest field.
213 /// Unlike `C`, zero sized unions are not rounded up to one byte in size.
220 /// // Some primitives
221 /// assert_eq!(4, mem::size_of::<i32>());
222 /// assert_eq!(8, mem::size_of::<f64>());
223 /// assert_eq!(0, mem::size_of::<()>());
226 /// assert_eq!(8, mem::size_of::<[i32; 2]>());
227 /// assert_eq!(12, mem::size_of::<[i32; 3]>());
228 /// assert_eq!(0, mem::size_of::<[i32; 0]>());
231 /// // Pointer size equality
232 /// assert_eq!(mem::size_of::<&i32>(), mem::size_of::<*const i32>());
233 /// assert_eq!(mem::size_of::<&i32>(), mem::size_of::<Box<i32>>());
234 /// assert_eq!(mem::size_of::<&i32>(), mem::size_of::<Option<&i32>>());
235 /// assert_eq!(mem::size_of::<Box<i32>>(), mem::size_of::<Option<Box<i32>>>());
238 /// Using `#[repr(C)]`.
244 /// struct FieldStruct {
250 /// // The size of the first field is 1, so add 1 to the size. Size is 1.
251 /// // The alignment of the second field is 2, so add 1 to the size for padding. Size is 2.
252 /// // The size of the second field is 2, so add 2 to the size. Size is 4.
253 /// // The alignment of the third field is 1, so add 0 to the size for padding. Size is 4.
254 /// // The size of the third field is 1, so add 1 to the size. Size is 5.
255 /// // Finally, the alignment of the struct is 2 (because the largest alignment amongst its
256 /// // fields is 2), so add 1 to the size for padding. Size is 6.
257 /// assert_eq!(6, mem::size_of::<FieldStruct>());
260 /// struct TupleStruct(u8, u16, u8);
262 /// // Tuple structs follow the same rules.
263 /// assert_eq!(6, mem::size_of::<TupleStruct>());
265 /// // Note that reordering the fields can lower the size. We can remove both padding bytes
266 /// // by putting `third` before `second`.
268 /// struct FieldStructOptimized {
274 /// assert_eq!(4, mem::size_of::<FieldStructOptimized>());
276 /// // Union size is the size of the largest field.
278 /// union ExampleUnion {
283 /// assert_eq!(2, mem::size_of::<ExampleUnion>());
286 /// [alignment]: ./fn.align_of.html
288 #[stable(feature = "rust1", since = "1.0.0")]
290 pub const fn size_of<T>() -> usize {
291 intrinsics::size_of::<T>()
294 /// Returns the size of the pointed-to value in bytes.
296 /// This is usually the same as `size_of::<T>()`. However, when `T` *has* no
297 /// statically known size, e.g., a slice [`[T]`][slice] or a [trait object],
298 /// then `size_of_val` can be used to get the dynamically-known size.
300 /// [slice]: ../../std/primitive.slice.html
301 /// [trait object]: ../../book/first-edition/trait-objects.html
308 /// assert_eq!(4, mem::size_of_val(&5i32));
310 /// let x: [u8; 13] = [0; 13];
311 /// let y: &[u8] = &x;
312 /// assert_eq!(13, mem::size_of_val(y));
315 #[stable(feature = "rust1", since = "1.0.0")]
316 pub fn size_of_val<T: ?Sized>(val: &T) -> usize {
317 unsafe { intrinsics::size_of_val(val) }
320 /// Returns the [ABI]-required minimum alignment of a type.
322 /// Every reference to a value of the type `T` must be a multiple of this number.
324 /// This is the alignment used for struct fields. It may be smaller than the preferred alignment.
326 /// [ABI]: https://en.wikipedia.org/wiki/Application_binary_interface
331 /// # #![allow(deprecated)]
334 /// assert_eq!(4, mem::min_align_of::<i32>());
337 #[stable(feature = "rust1", since = "1.0.0")]
338 #[rustc_deprecated(reason = "use `align_of` instead", since = "1.2.0")]
339 pub fn min_align_of<T>() -> usize {
340 intrinsics::min_align_of::<T>()
343 /// Returns the [ABI]-required minimum alignment of the type of the value that `val` points to.
345 /// Every reference to a value of the type `T` must be a multiple of this number.
347 /// [ABI]: https://en.wikipedia.org/wiki/Application_binary_interface
352 /// # #![allow(deprecated)]
355 /// assert_eq!(4, mem::min_align_of_val(&5i32));
358 #[stable(feature = "rust1", since = "1.0.0")]
359 #[rustc_deprecated(reason = "use `align_of_val` instead", since = "1.2.0")]
360 pub fn min_align_of_val<T: ?Sized>(val: &T) -> usize {
361 unsafe { intrinsics::min_align_of_val(val) }
364 /// Returns the [ABI]-required minimum alignment of a type.
366 /// Every reference to a value of the type `T` must be a multiple of this number.
368 /// This is the alignment used for struct fields. It may be smaller than the preferred alignment.
370 /// [ABI]: https://en.wikipedia.org/wiki/Application_binary_interface
377 /// assert_eq!(4, mem::align_of::<i32>());
380 #[stable(feature = "rust1", since = "1.0.0")]
382 pub const fn align_of<T>() -> usize {
383 intrinsics::min_align_of::<T>()
386 /// Returns the [ABI]-required minimum alignment of the type of the value that `val` points to.
388 /// Every reference to a value of the type `T` must be a multiple of this number.
390 /// [ABI]: https://en.wikipedia.org/wiki/Application_binary_interface
397 /// assert_eq!(4, mem::align_of_val(&5i32));
400 #[stable(feature = "rust1", since = "1.0.0")]
401 pub fn align_of_val<T: ?Sized>(val: &T) -> usize {
402 unsafe { intrinsics::min_align_of_val(val) }
405 /// Returns whether dropping values of type `T` matters.
407 /// This is purely an optimization hint, and may be implemented conservatively:
408 /// it may return `true` for types that don't actually need to be dropped.
409 /// As such always returning `true` would be a valid implementation of
410 /// this function. However if this function actually returns `false`, then you
411 /// can be certain dropping `T` has no side effect.
413 /// Low level implementations of things like collections, which need to manually
414 /// drop their data, should use this function to avoid unnecessarily
415 /// trying to drop all their contents when they are destroyed. This might not
416 /// make a difference in release builds (where a loop that has no side-effects
417 /// is easily detected and eliminated), but is often a big win for debug builds.
419 /// Note that `ptr::drop_in_place` already performs this check, so if your workload
420 /// can be reduced to some small number of drop_in_place calls, using this is
421 /// unnecessary. In particular note that you can drop_in_place a slice, and that
422 /// will do a single needs_drop check for all the values.
424 /// Types like Vec therefore just `drop_in_place(&mut self[..])` without using
425 /// needs_drop explicitly. Types like HashMap, on the other hand, have to drop
426 /// values one at a time and should use this API.
431 /// Here's an example of how a collection might make use of needs_drop:
434 /// use std::{mem, ptr};
436 /// pub struct MyCollection<T> {
440 /// # impl<T> MyCollection<T> {
441 /// # fn iter_mut(&mut self) -> &mut [T] { &mut self.data }
442 /// # fn free_buffer(&mut self) {}
445 /// impl<T> Drop for MyCollection<T> {
446 /// fn drop(&mut self) {
449 /// if mem::needs_drop::<T>() {
450 /// for x in self.iter_mut() {
451 /// ptr::drop_in_place(x);
454 /// self.free_buffer();
460 #[stable(feature = "needs_drop", since = "1.21.0")]
461 #[rustc_const_unstable(feature = "const_needs_drop")]
462 pub const fn needs_drop<T>() -> bool {
463 intrinsics::needs_drop::<T>()
466 /// Creates a value whose bytes are all zero.
468 /// This has the same effect as allocating space with
469 /// [`mem::uninitialized`][uninit] and then zeroing it out. It is useful for
470 /// FFI sometimes, but should generally be avoided.
472 /// There is no guarantee that an all-zero byte-pattern represents a valid value of
473 /// some type `T`. If `T` has a destructor and the value is destroyed (due to
474 /// a panic or the end of a scope) before being initialized, then the destructor
475 /// will run on zeroed data, likely leading to [undefined behavior][ub].
477 /// See also the documentation for [`mem::uninitialized`][uninit], which has
478 /// many of the same caveats.
480 /// [uninit]: fn.uninitialized.html
481 /// [ub]: ../../reference/behavior-considered-undefined.html
488 /// let x: i32 = unsafe { mem::zeroed() };
489 /// assert_eq!(0, x);
492 #[stable(feature = "rust1", since = "1.0.0")]
493 pub unsafe fn zeroed<T>() -> T {
494 intrinsics::panic_if_uninhabited::<T>();
498 /// Bypasses Rust's normal memory-initialization checks by pretending to
499 /// produce a value of type `T`, while doing nothing at all.
501 /// **This is incredibly dangerous and should not be done lightly. Deeply
502 /// consider initializing your memory with a default value instead.**
504 /// This is useful for FFI functions and initializing arrays sometimes,
505 /// but should generally be avoided.
507 /// # Undefined behavior
509 /// It is [undefined behavior][ub] to read uninitialized memory, even just an
510 /// uninitialized boolean. For instance, if you branch on the value of such
511 /// a boolean, your program may take one, both, or neither of the branches.
513 /// Writing to the uninitialized value is similarly dangerous. Rust believes the
514 /// value is initialized, and will therefore try to [`Drop`] the uninitialized
515 /// value and its fields if you try to overwrite it in a normal manner. The only way
516 /// to safely initialize an uninitialized value is with [`ptr::write`][write],
517 /// [`ptr::copy`][copy], or [`ptr::copy_nonoverlapping`][copy_no].
519 /// If the value does implement [`Drop`], it must be initialized before
520 /// it goes out of scope (and therefore would be dropped). Note that this
521 /// includes a `panic` occurring and unwinding the stack suddenly.
523 /// If you partially initialize an array, you may need to use
524 /// [`ptr::drop_in_place`][drop_in_place] to remove the elements you have fully
525 /// initialized followed by [`mem::forget`][mem_forget] to prevent drop running
526 /// on the array. If a partially allocated array is dropped this will lead to
527 /// undefined behaviour.
531 /// Here's how to safely initialize an array of [`Vec`]s.
537 /// // Only declare the array. This safely leaves it
538 /// // uninitialized in a way that Rust will track for us.
539 /// // However we can't initialize it element-by-element
540 /// // safely, and we can't use the `[value; 1000]`
541 /// // constructor because it only works with `Copy` data.
542 /// let mut data: [Vec<u32>; 1000];
545 /// // So we need to do this to initialize it.
546 /// data = mem::uninitialized();
548 /// // DANGER ZONE: if anything panics or otherwise
549 /// // incorrectly reads the array here, we will have
550 /// // Undefined Behavior.
552 /// // It's ok to mutably iterate the data, since this
553 /// // doesn't involve reading it at all.
554 /// // (ptr and len are statically known for arrays)
555 /// for elem in &mut data[..] {
556 /// // *elem = Vec::new() would try to drop the
557 /// // uninitialized memory at `elem` -- bad!
559 /// // Vec::new doesn't allocate or do really
560 /// // anything. It's only safe to call here
561 /// // because we know it won't panic.
562 /// ptr::write(elem, Vec::new());
565 /// // SAFE ZONE: everything is initialized.
568 /// println!("{:?}", &data[0]);
571 /// This example emphasizes exactly how delicate and dangerous using `mem::uninitialized`
572 /// can be. Note that the [`vec!`] macro *does* let you initialize every element with a
573 /// value that is only [`Clone`], so the following is semantically equivalent and
574 /// vastly less dangerous, as long as you can live with an extra heap
578 /// let data: Vec<Vec<u32>> = vec![Vec::new(); 1000];
579 /// println!("{:?}", &data[0]);
582 /// This example shows how to handle partially initialized arrays, which could
583 /// be found in low-level datastructures.
589 /// // Count the number of elements we have assigned.
590 /// let mut data_len: usize = 0;
591 /// let mut data: [String; 1000];
594 /// data = mem::uninitialized();
596 /// for elem in &mut data[0..500] {
597 /// ptr::write(elem, String::from("hello"));
601 /// // For each item in the array, drop if we allocated it.
602 /// for i in &mut data[0..data_len] {
603 /// ptr::drop_in_place(i);
606 /// // Forget the data. If this is allowed to drop, you may see a crash such as:
607 /// // 'mem_uninit_test(2457,0x7fffb55dd380) malloc: *** error for object
608 /// // 0x7ff3b8402920: pointer being freed was not allocated'
609 /// mem::forget(data);
612 /// [`Vec`]: ../../std/vec/struct.Vec.html
613 /// [`vec!`]: ../../std/macro.vec.html
614 /// [`Clone`]: ../../std/clone/trait.Clone.html
615 /// [ub]: ../../reference/behavior-considered-undefined.html
616 /// [write]: ../ptr/fn.write.html
617 /// [drop_in_place]: ../ptr/fn.drop_in_place.html
618 /// [mem_zeroed]: fn.zeroed.html
619 /// [mem_forget]: fn.forget.html
620 /// [copy]: ../intrinsics/fn.copy.html
621 /// [copy_no]: ../intrinsics/fn.copy_nonoverlapping.html
622 /// [`Drop`]: ../ops/trait.Drop.html
624 #[rustc_deprecated(since = "2.0.0", reason = "use `mem::MaybeUninit::uninitialized` instead")]
625 #[stable(feature = "rust1", since = "1.0.0")]
626 pub unsafe fn uninitialized<T>() -> T {
627 intrinsics::panic_if_uninhabited::<T>();
631 /// Swaps the values at two mutable locations, without deinitializing either one.
641 /// mem::swap(&mut x, &mut y);
643 /// assert_eq!(42, x);
644 /// assert_eq!(5, y);
647 #[stable(feature = "rust1", since = "1.0.0")]
648 pub fn swap<T>(x: &mut T, y: &mut T) {
650 ptr::swap_nonoverlapping_one(x, y);
654 /// Moves `src` into the referenced `dest`, returning the previous `dest` value.
656 /// Neither value is dropped.
660 /// A simple example:
665 /// let mut v: Vec<i32> = vec![1, 2];
667 /// let old_v = mem::replace(&mut v, vec![3, 4, 5]);
668 /// assert_eq!(2, old_v.len());
669 /// assert_eq!(3, v.len());
672 /// `replace` allows consumption of a struct field by replacing it with another value.
673 /// Without `replace` you can run into issues like these:
675 /// ```compile_fail,E0507
676 /// struct Buffer<T> { buf: Vec<T> }
678 /// impl<T> Buffer<T> {
679 /// fn get_and_reset(&mut self) -> Vec<T> {
680 /// // error: cannot move out of dereference of `&mut`-pointer
681 /// let buf = self.buf;
682 /// self.buf = Vec::new();
688 /// Note that `T` does not necessarily implement [`Clone`], so it can't even clone and reset
689 /// `self.buf`. But `replace` can be used to disassociate the original value of `self.buf` from
690 /// `self`, allowing it to be returned:
693 /// # #![allow(dead_code)]
696 /// # struct Buffer<T> { buf: Vec<T> }
697 /// impl<T> Buffer<T> {
698 /// fn get_and_reset(&mut self) -> Vec<T> {
699 /// mem::replace(&mut self.buf, Vec::new())
704 /// [`Clone`]: ../../std/clone/trait.Clone.html
706 #[stable(feature = "rust1", since = "1.0.0")]
707 pub fn replace<T>(dest: &mut T, mut src: T) -> T {
708 swap(dest, &mut src);
712 /// Disposes of a value.
714 /// This does call the argument's implementation of [`Drop`][drop].
716 /// This effectively does nothing for types which implement `Copy`, e.g.
717 /// integers. Such values are copied and _then_ moved into the function, so the
718 /// value persists after this function call.
720 /// This function is not magic; it is literally defined as
723 /// pub fn drop<T>(_x: T) { }
726 /// Because `_x` is moved into the function, it is automatically dropped before
727 /// the function returns.
729 /// [drop]: ../ops/trait.Drop.html
736 /// let v = vec![1, 2, 3];
738 /// drop(v); // explicitly drop the vector
741 /// Since [`RefCell`] enforces the borrow rules at runtime, `drop` can
742 /// release a [`RefCell`] borrow:
745 /// use std::cell::RefCell;
747 /// let x = RefCell::new(1);
749 /// let mut mutable_borrow = x.borrow_mut();
750 /// *mutable_borrow = 1;
752 /// drop(mutable_borrow); // relinquish the mutable borrow on this slot
754 /// let borrow = x.borrow();
755 /// println!("{}", *borrow);
758 /// Integers and other types implementing [`Copy`] are unaffected by `drop`.
761 /// #[derive(Copy, Clone)]
766 /// drop(x); // a copy of `x` is moved and dropped
767 /// drop(y); // a copy of `y` is moved and dropped
769 /// println!("x: {}, y: {}", x, y.0); // still available
772 /// [`RefCell`]: ../../std/cell/struct.RefCell.html
773 /// [`Copy`]: ../../std/marker/trait.Copy.html
775 #[stable(feature = "rust1", since = "1.0.0")]
776 pub fn drop<T>(_x: T) { }
778 /// Interprets `src` as having type `&U`, and then reads `src` without moving
779 /// the contained value.
781 /// This function will unsafely assume the pointer `src` is valid for
782 /// [`size_of::<U>`][size_of] bytes by transmuting `&T` to `&U` and then reading
783 /// the `&U`. It will also unsafely create a copy of the contained value instead of
784 /// moving out of `src`.
786 /// It is not a compile-time error if `T` and `U` have different sizes, but it
787 /// is highly encouraged to only invoke this function where `T` and `U` have the
788 /// same size. This function triggers [undefined behavior][ub] if `U` is larger than
791 /// [ub]: ../../reference/behavior-considered-undefined.html
792 /// [size_of]: fn.size_of.html
804 /// let foo_slice = [10u8];
807 /// // Copy the data from 'foo_slice' and treat it as a 'Foo'
808 /// let mut foo_struct: Foo = mem::transmute_copy(&foo_slice);
809 /// assert_eq!(foo_struct.bar, 10);
811 /// // Modify the copied data
812 /// foo_struct.bar = 20;
813 /// assert_eq!(foo_struct.bar, 20);
816 /// // The contents of 'foo_slice' should not have changed
817 /// assert_eq!(foo_slice, [10]);
820 #[stable(feature = "rust1", since = "1.0.0")]
821 pub unsafe fn transmute_copy<T, U>(src: &T) -> U {
822 ptr::read_unaligned(src as *const T as *const U)
825 /// Opaque type representing the discriminant of an enum.
827 /// See the [`discriminant`] function in this module for more information.
829 /// [`discriminant`]: fn.discriminant.html
830 #[stable(feature = "discriminant_value", since = "1.21.0")]
831 pub struct Discriminant<T>(u64, PhantomData<fn() -> T>);
833 // N.B. These trait implementations cannot be derived because we don't want any bounds on T.
835 #[stable(feature = "discriminant_value", since = "1.21.0")]
836 impl<T> Copy for Discriminant<T> {}
838 #[stable(feature = "discriminant_value", since = "1.21.0")]
839 impl<T> clone::Clone for Discriminant<T> {
840 fn clone(&self) -> Self {
845 #[stable(feature = "discriminant_value", since = "1.21.0")]
846 impl<T> cmp::PartialEq for Discriminant<T> {
847 fn eq(&self, rhs: &Self) -> bool {
852 #[stable(feature = "discriminant_value", since = "1.21.0")]
853 impl<T> cmp::Eq for Discriminant<T> {}
855 #[stable(feature = "discriminant_value", since = "1.21.0")]
856 impl<T> hash::Hash for Discriminant<T> {
857 fn hash<H: hash::Hasher>(&self, state: &mut H) {
862 #[stable(feature = "discriminant_value", since = "1.21.0")]
863 impl<T> fmt::Debug for Discriminant<T> {
864 fn fmt(&self, fmt: &mut fmt::Formatter) -> fmt::Result {
865 fmt.debug_tuple("Discriminant")
871 /// Returns a value uniquely identifying the enum variant in `v`.
873 /// If `T` is not an enum, calling this function will not result in undefined behavior, but the
874 /// return value is unspecified.
878 /// The discriminant of an enum variant may change if the enum definition changes. A discriminant
879 /// of some variant will not change between compilations with the same compiler.
883 /// This can be used to compare enums that carry data, while disregarding
889 /// enum Foo { A(&'static str), B(i32), C(i32) }
891 /// assert!(mem::discriminant(&Foo::A("bar")) == mem::discriminant(&Foo::A("baz")));
892 /// assert!(mem::discriminant(&Foo::B(1)) == mem::discriminant(&Foo::B(2)));
893 /// assert!(mem::discriminant(&Foo::B(3)) != mem::discriminant(&Foo::C(3)));
895 #[stable(feature = "discriminant_value", since = "1.21.0")]
896 pub fn discriminant<T>(v: &T) -> Discriminant<T> {
898 Discriminant(intrinsics::discriminant_value(v), PhantomData)
902 /// A wrapper to inhibit compiler from automatically calling `T`’s destructor.
904 /// This wrapper is 0-cost.
908 /// This wrapper helps with explicitly documenting the drop order dependencies between fields of
912 /// use std::mem::ManuallyDrop;
916 /// struct FruitBox {
917 /// // Immediately clear there’s something non-trivial going on with these fields.
918 /// peach: ManuallyDrop<Peach>,
919 /// melon: Melon, // Field that’s independent of the other two.
920 /// banana: ManuallyDrop<Banana>,
923 /// impl Drop for FruitBox {
924 /// fn drop(&mut self) {
926 /// // Explicit ordering in which field destructors are run specified in the intuitive
927 /// // location – the destructor of the structure containing the fields.
928 /// // Moreover, one can now reorder fields within the struct however much they want.
929 /// ManuallyDrop::drop(&mut self.peach);
930 /// ManuallyDrop::drop(&mut self.banana);
932 /// // After destructor for `FruitBox` runs (this function), the destructor for Melon gets
933 /// // invoked in the usual manner, as it is not wrapped in `ManuallyDrop`.
937 #[stable(feature = "manually_drop", since = "1.20.0")]
938 #[lang = "manually_drop"]
939 #[derive(Copy, Clone, Debug, Default, PartialEq, Eq, PartialOrd, Ord, Hash)]
941 pub struct ManuallyDrop<T: ?Sized> {
945 impl<T> ManuallyDrop<T> {
946 /// Wrap a value to be manually dropped.
951 /// use std::mem::ManuallyDrop;
952 /// ManuallyDrop::new(Box::new(()));
954 #[stable(feature = "manually_drop", since = "1.20.0")]
956 pub const fn new(value: T) -> ManuallyDrop<T> {
957 ManuallyDrop { value }
960 /// Extract the value from the `ManuallyDrop` container.
962 /// This allows the value to be dropped again.
967 /// use std::mem::ManuallyDrop;
968 /// let x = ManuallyDrop::new(Box::new(()));
969 /// let _: Box<()> = ManuallyDrop::into_inner(x); // This drops the `Box`.
971 #[stable(feature = "manually_drop", since = "1.20.0")]
973 pub const fn into_inner(slot: ManuallyDrop<T>) -> T {
977 /// Takes the contained value out.
979 /// This method is primarily intended for moving out values in drop.
980 /// Instead of using [`ManuallyDrop::drop`] to manually drop the value,
981 /// you can use this method to take the value and use it however desired.
982 /// `Drop` will be invoked on the returned value following normal end-of-scope rules.
984 /// If you have ownership of the container, you can use [`ManuallyDrop::into_inner`] instead.
988 /// This function semantically moves out the contained value without preventing further usage.
989 /// It is up to the user of this method to ensure that this container is not used again.
991 /// [`ManuallyDrop::drop`]: #method.drop
992 /// [`ManuallyDrop::into_inner`]: #method.into_inner
993 #[must_use = "if you don't need the value, you can use `ManuallyDrop::drop` instead"]
994 #[unstable(feature = "manually_drop_take", issue = "55422")]
996 pub unsafe fn take(slot: &mut ManuallyDrop<T>) -> T {
997 ManuallyDrop::into_inner(ptr::read(slot))
1001 impl<T: ?Sized> ManuallyDrop<T> {
1002 /// Manually drops the contained value.
1004 /// If you have ownership of the value, you can use [`ManuallyDrop::into_inner`] instead.
1008 /// This function runs the destructor of the contained value and thus the wrapped value
1009 /// now represents uninitialized data. It is up to the user of this method to ensure the
1010 /// uninitialized data is not actually used.
1012 /// [`ManuallyDrop::into_inner`]: #method.into_inner
1013 #[stable(feature = "manually_drop", since = "1.20.0")]
1015 pub unsafe fn drop(slot: &mut ManuallyDrop<T>) {
1016 ptr::drop_in_place(&mut slot.value)
1020 #[stable(feature = "manually_drop", since = "1.20.0")]
1021 impl<T: ?Sized> Deref for ManuallyDrop<T> {
1024 fn deref(&self) -> &T {
1029 #[stable(feature = "manually_drop", since = "1.20.0")]
1030 impl<T: ?Sized> DerefMut for ManuallyDrop<T> {
1032 fn deref_mut(&mut self) -> &mut T {
1037 /// A newtype to construct uninitialized instances of `T`
1038 #[allow(missing_debug_implementations)]
1039 #[unstable(feature = "maybe_uninit", issue = "53491")]
1040 // NOTE after stabilizing `MaybeUninit` proceed to deprecate `mem::{uninitialized,zeroed}`
1041 pub union MaybeUninit<T> {
1043 value: ManuallyDrop<T>,
1046 impl<T> MaybeUninit<T> {
1047 /// Create a new `MaybeUninit` initialized with the given value.
1049 /// Note that dropping a `MaybeUninit` will never call `T`'s drop code.
1050 /// It is your responsibility to make sure `T` gets dropped if it got initialized.
1051 #[unstable(feature = "maybe_uninit", issue = "53491")]
1053 pub const fn new(val: T) -> MaybeUninit<T> {
1054 MaybeUninit { value: ManuallyDrop::new(val) }
1057 /// Create a new `MaybeUninit` in an uninitialized state.
1059 /// Note that dropping a `MaybeUninit` will never call `T`'s drop code.
1060 /// It is your responsibility to make sure `T` gets dropped if it got initialized.
1061 #[unstable(feature = "maybe_uninit", issue = "53491")]
1063 pub const fn uninitialized() -> MaybeUninit<T> {
1064 MaybeUninit { uninit: () }
1067 /// Create a new `MaybeUninit` in an uninitialized state, with the memory being
1068 /// filled with `0` bytes. It depends on `T` whether that already makes for
1069 /// proper initialization. For example, `MaybeUninit<usize>::zeroed()` is initialized,
1070 /// but `MaybeUninit<&'static i32>::zeroed()` is not because references must not
1073 /// Note that dropping a `MaybeUninit` will never call `T`'s drop code.
1074 /// It is your responsibility to make sure `T` gets dropped if it got initialized.
1075 #[unstable(feature = "maybe_uninit", issue = "53491")]
1077 pub fn zeroed() -> MaybeUninit<T> {
1078 let mut u = MaybeUninit::<T>::uninitialized();
1080 u.as_mut_ptr().write_bytes(0u8, 1);
1085 /// Set the value of the `MaybeUninit`. This overwrites any previous value without dropping it.
1086 #[unstable(feature = "maybe_uninit", issue = "53491")]
1088 pub fn set(&mut self, val: T) {
1090 self.value = ManuallyDrop::new(val);
1094 /// Extract the value from the `MaybeUninit` container. This is a great way
1095 /// to ensure that the data will get dropped, because the resulting `T` is
1096 /// subject to the usual drop handling.
1100 /// It is up to the caller to guarantee that the `MaybeUninit` really is in an initialized
1101 /// state, otherwise this will immediately cause undefined behavior.
1102 #[unstable(feature = "maybe_uninit", issue = "53491")]
1104 pub unsafe fn into_inner(self) -> T {
1105 intrinsics::panic_if_uninhabited::<T>();
1106 ManuallyDrop::into_inner(self.value)
1109 /// Get a reference to the contained value.
1113 /// It is up to the caller to guarantee that the `MaybeUninit` really is in an initialized
1114 /// state, otherwise this will immediately cause undefined behavior.
1115 #[unstable(feature = "maybe_uninit", issue = "53491")]
1117 pub unsafe fn get_ref(&self) -> &T {
1121 /// Get a mutable reference to the contained value.
1125 /// It is up to the caller to guarantee that the `MaybeUninit` really is in an initialized
1126 /// state, otherwise this will immediately cause undefined behavior.
1127 // FIXME(#53491): We currently rely on the above being incorrect, i.e., we have references
1128 // to uninitialized data (e.g., in `libcore/fmt/float.rs`). We should make
1129 // a final decision about the rules before stabilization.
1130 #[unstable(feature = "maybe_uninit", issue = "53491")]
1132 pub unsafe fn get_mut(&mut self) -> &mut T {
1136 /// Get a pointer to the contained value. Reading from this pointer will be undefined
1137 /// behavior unless the `MaybeUninit` is initialized.
1138 #[unstable(feature = "maybe_uninit", issue = "53491")]
1140 pub fn as_ptr(&self) -> *const T {
1141 unsafe { &*self.value as *const T }
1144 /// Get a mutable pointer to the contained value. Reading from this pointer will be undefined
1145 /// behavior unless the `MaybeUninit` is initialized.
1146 #[unstable(feature = "maybe_uninit", issue = "53491")]
1148 pub fn as_mut_ptr(&mut self) -> *mut T {
1149 unsafe { &mut *self.value as *mut T }
1152 /// Get a pointer to the first element of the array.
1153 #[unstable(feature = "maybe_uninit", issue = "53491")]
1155 pub fn first_ptr(this: &[MaybeUninit<T>]) -> *const T {
1156 this as *const [MaybeUninit<T>] as *const T
1159 /// Get a mutable pointer to the first element of the array.
1160 #[unstable(feature = "maybe_uninit", issue = "53491")]
1162 pub fn first_ptr_mut(this: &mut [MaybeUninit<T>]) -> *mut T {
1163 this as *mut [MaybeUninit<T>] as *mut T