1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180
//! This crate contains checked implementations of `transmute()`. //! //! The functions in this crate are not inherently safe, but just guarded against common simple mistakes //! (like trying to create an 8-byte type from 7 bytes). //! //! Those functions are exactly as safe as the data passed to them - creating a null pointer, //! for example, is not unsafe in and of itself, but dereferencing it certainly *is*, //! but they don't do that (see [here](https://github.com/nabijaczleweli/safe-transmute-rs/issues/1) //! for extended discussion). //! //! # Examples //! //! View bytes as a series of `u16`s: //! //! ``` //! # use safe_transmute::guarded_transmute_many; //! # unsafe { //! assert_eq!(guarded_transmute_many::<u16>(&[0x00, 0x01, //! 0x12, 0x34, //! // Spare byte, unused //! 0x00]).unwrap(), //! &[0x0100, 0x3412]); //! # } //! ``` //! //! View all bytes as a series of `u16`s: //! //! ``` //! # use safe_transmute::guarded_transmute_many_pedantic; //! # unsafe { //! assert_eq!(guarded_transmute_many_pedantic::<u16>(&[0x00, 0x01, //! 0x12, 0x34]).unwrap(), //! &[0x0100, 0x3412]); //! # } //! ``` //! //! View bytes as an `f64`: //! //! ``` //! # use safe_transmute::guarded_transmute; //! # unsafe { //! assert_eq!(guarded_transmute::<f64>(&[0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]).unwrap(), //! 0.0); //! # } //! ``` mod error; use std::slice; use std::mem::align_of; pub use self::error::{ErrorReason, Error}; /// Transmute a byte slice into a single instance of a `Copy`able type /// /// The byte slice must have at least enough bytes to fill a single instance of a type, /// extraneous data is ignored. /// /// # Examples /// /// ``` /// # use safe_transmute::guarded_transmute; /// // Little-endian /// # unsafe { /// assert_eq!(guarded_transmute::<u32>(&[0x00, 0x00, 0x00, 0x01]).unwrap(), 0x01000000); /// # } /// ``` pub unsafe fn guarded_transmute<T: Copy>(bytes: &[u8]) -> Result<T, Error> { if bytes.len() < align_of::<T>() { Err(Error { required: align_of::<T>(), actual: bytes.len(), reason: ErrorReason::NotEnoughBytes, }) } else { Ok(slice::from_raw_parts(bytes.as_ptr() as *const T, 1)[0]) } } /// Transmute a byte slice into a single instance of a `Copy`able type /// /// The byte slice must have exactly enough bytes to fill a single instance of a type. /// /// # Examples /// /// ``` /// # use safe_transmute::guarded_transmute_pedantic; /// // Little-endian /// # unsafe { /// assert_eq!(guarded_transmute_pedantic::<u16>(&[0x0F, 0x0E]).unwrap(), 0x0E0F); /// # } /// ``` pub unsafe fn guarded_transmute_pedantic<T: Copy>(bytes: &[u8]) -> Result<T, Error> { if bytes.len() != align_of::<T>() { Err(Error { required: align_of::<T>(), actual: bytes.len(), reason: ErrorReason::InexactByteCount, }) } else { Ok(slice::from_raw_parts(bytes.as_ptr() as *const T, 1)[0]) } } /// View a byte slice as a slice of an arbitrary type. /// /// The byte slice must have at least enough bytes to fill a single instance of a type, /// extraneous data is ignored. /// /// # Examples /// /// ``` /// # use safe_transmute::guarded_transmute_many; /// // Little-endian /// # unsafe { /// assert_eq!(guarded_transmute_many::<u16>(&[0x00, 0x01, 0x00, 0x02]).unwrap(), &[0x0100, 0x0200]); /// # } /// ``` pub unsafe fn guarded_transmute_many<T>(bytes: &[u8]) -> Result<&[T], Error> { if bytes.len() < align_of::<T>() { Err(Error { required: align_of::<T>(), actual: bytes.len(), reason: ErrorReason::NotEnoughBytes, }) } else { Ok(guarded_transmute_many_permissive(bytes)) } } /// View a byte slice as a slice of an arbitrary type. /// /// The resulting slice will have as many instances of a type as will fit, rounded down. /// /// # Examples /// /// ``` /// # use safe_transmute::guarded_transmute_many_permissive; /// // Little-endian /// # unsafe { /// assert_eq!(guarded_transmute_many_permissive::<u16>(&[0x00]), &[]); /// # } /// ``` pub unsafe fn guarded_transmute_many_permissive<T>(bytes: &[u8]) -> &[T] { slice::from_raw_parts(bytes.as_ptr() as *const T, (bytes.len() - (bytes.len() % align_of::<T>())) / align_of::<T>()) } /// View a byte slice as a slice of an arbitrary type. /// /// The byte slice must have at least enough bytes to fill a single instance of a type, /// and should not have extraneous data. /// /// # Examples /// /// ``` /// # use safe_transmute::guarded_transmute_many_pedantic; /// // Little-endian /// # unsafe { /// assert_eq!(guarded_transmute_many_pedantic::<u16>(&[0x0F, 0x0E, 0x0A, 0x0B]).unwrap(), &[0x0E0F, 0x0B0A]); /// # } /// ``` pub unsafe fn guarded_transmute_many_pedantic<T>(bytes: &[u8]) -> Result<&[T], Error> { if bytes.len() < align_of::<T>() { Err(Error { required: align_of::<T>(), actual: bytes.len(), reason: ErrorReason::NotEnoughBytes, }) } else if bytes.len() % align_of::<T>() != 0 { Err(Error { required: align_of::<T>(), actual: bytes.len(), reason: ErrorReason::InexactByteCount, }) } else { Ok(slice::from_raw_parts(bytes.as_ptr() as *const T, bytes.len() / align_of::<T>())) } }