1 //! Compiler intrinsics.
3 //! The corresponding definitions are in `compiler/rustc_codegen_llvm/src/intrinsic.rs`.
4 //! The corresponding const implementations are in `compiler/rustc_mir/src/interpret/intrinsics.rs`
8 //! Note: any changes to the constness of intrinsics should be discussed with the language team.
9 //! This includes changes in the stability of the constness.
11 //! In order to make an intrinsic usable at compile-time, one needs to copy the implementation
12 //! from <https://github.com/rust-lang/miri/blob/master/src/shims/intrinsics.rs> to
13 //! `compiler/rustc_mir/src/interpret/intrinsics.rs` and add a
14 //! `#[rustc_const_unstable(feature = "foo", issue = "01234")]` to the intrinsic.
16 //! If an intrinsic is supposed to be used from a `const fn` with a `rustc_const_stable` attribute,
17 //! the intrinsic's attribute must be `rustc_const_stable`, too. Such a change should not be done
18 //! without T-lang consultation, because it bakes a feature into the language that cannot be
19 //! replicated in user code without compiler support.
23 //! The volatile intrinsics provide operations intended to act on I/O
24 //! memory, which are guaranteed to not be reordered by the compiler
25 //! across other volatile intrinsics. See the LLVM documentation on
28 //! [volatile]: https://llvm.org/docs/LangRef.html#volatile-memory-accesses
32 //! The atomic intrinsics provide common atomic operations on machine
33 //! words, with multiple possible memory orderings. They obey the same
34 //! semantics as C++11. See the LLVM documentation on [[atomics]].
36 //! [atomics]: https://llvm.org/docs/Atomics.html
38 //! A quick refresher on memory ordering:
40 //! * Acquire - a barrier for acquiring a lock. Subsequent reads and writes
41 //! take place after the barrier.
42 //! * Release - a barrier for releasing a lock. Preceding reads and writes
43 //! take place before the barrier.
44 //! * Sequentially consistent - sequentially consistent operations are
45 //! guaranteed to happen in order. This is the standard mode for working
46 //! with atomic types and is equivalent to Java's `volatile`.
49 feature = "core_intrinsics",
50 reason = "intrinsics are unlikely to ever be stabilized, instead \
51 they should be used through stabilized interfaces \
52 in the rest of the standard library",
55 #![allow(missing_docs)]
57 use crate::marker::DiscriminantKind;
60 // These imports are used for simplifying intra-doc links
61 #[allow(unused_imports)]
62 #[cfg(all(target_has_atomic = "8", target_has_atomic = "32", target_has_atomic = "ptr"))]
63 use crate::sync::atomic::{self, AtomicBool, AtomicI32, AtomicIsize, AtomicU32, Ordering};
65 #[stable(feature = "drop_in_place", since = "1.8.0")]
67 reason = "no longer an intrinsic - use `ptr::drop_in_place` directly",
71 pub unsafe fn drop_in_place<T: ?Sized>(to_drop: *mut T) {
72 // SAFETY: see `ptr::drop_in_place`
73 unsafe { crate::ptr::drop_in_place(to_drop) }
76 extern "rust-intrinsic" {
77 // N.B., these intrinsics take raw pointers because they mutate aliased
78 // memory, which is not valid for either `&` or `&mut`.
80 /// Stores a value if the current value is the same as the `old` value.
82 /// The stabilized version of this intrinsic is available on the
83 /// [`atomic`] types via the `compare_exchange` method by passing
84 /// [`Ordering::SeqCst`] as both the `success` and `failure` parameters.
85 /// For example, [`AtomicBool::compare_exchange`].
86 pub fn atomic_cxchg<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
87 /// Stores a value if the current value is the same as the `old` value.
89 /// The stabilized version of this intrinsic is available on the
90 /// [`atomic`] types via the `compare_exchange` method by passing
91 /// [`Ordering::Acquire`] as both the `success` and `failure` parameters.
92 /// For example, [`AtomicBool::compare_exchange`].
93 pub fn atomic_cxchg_acq<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
94 /// Stores a value if the current value is the same as the `old` value.
96 /// The stabilized version of this intrinsic is available on the
97 /// [`atomic`] types via the `compare_exchange` method by passing
98 /// [`Ordering::Release`] as the `success` and [`Ordering::Relaxed`] as the
99 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
100 pub fn atomic_cxchg_rel<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
101 /// Stores a value if the current value is the same as the `old` value.
103 /// The stabilized version of this intrinsic is available on the
104 /// [`atomic`] types via the `compare_exchange` method by passing
105 /// [`Ordering::AcqRel`] as the `success` and [`Ordering::Acquire`] as the
106 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
107 pub fn atomic_cxchg_acqrel<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
108 /// Stores a value if the current value is the same as the `old` value.
110 /// The stabilized version of this intrinsic is available on the
111 /// [`atomic`] types via the `compare_exchange` method by passing
112 /// [`Ordering::Relaxed`] as both the `success` and `failure` parameters.
113 /// For example, [`AtomicBool::compare_exchange`].
114 pub fn atomic_cxchg_relaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
115 /// Stores a value if the current value is the same as the `old` value.
117 /// The stabilized version of this intrinsic is available on the
118 /// [`atomic`] types via the `compare_exchange` method by passing
119 /// [`Ordering::SeqCst`] as the `success` and [`Ordering::Relaxed`] as the
120 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
121 pub fn atomic_cxchg_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
122 /// Stores a value if the current value is the same as the `old` value.
124 /// The stabilized version of this intrinsic is available on the
125 /// [`atomic`] types via the `compare_exchange` method by passing
126 /// [`Ordering::SeqCst`] as the `success` and [`Ordering::Acquire`] as the
127 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
128 pub fn atomic_cxchg_failacq<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
129 /// Stores a value if the current value is the same as the `old` value.
131 /// The stabilized version of this intrinsic is available on the
132 /// [`atomic`] types via the `compare_exchange` method by passing
133 /// [`Ordering::Acquire`] as the `success` and [`Ordering::Relaxed`] as the
134 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
135 pub fn atomic_cxchg_acq_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
136 /// Stores a value if the current value is the same as the `old` value.
138 /// The stabilized version of this intrinsic is available on the
139 /// [`atomic`] types via the `compare_exchange` method by passing
140 /// [`Ordering::AcqRel`] as the `success` and [`Ordering::Relaxed`] as the
141 /// `failure` parameters. For example, [`AtomicBool::compare_exchange`].
142 pub fn atomic_cxchg_acqrel_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
144 /// Stores a value if the current value is the same as the `old` value.
146 /// The stabilized version of this intrinsic is available on the
147 /// [`atomic`] types via the `compare_exchange_weak` method by passing
148 /// [`Ordering::SeqCst`] as both the `success` and `failure` parameters.
149 /// For example, [`AtomicBool::compare_exchange_weak`].
150 pub fn atomic_cxchgweak<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
151 /// Stores a value if the current value is the same as the `old` value.
153 /// The stabilized version of this intrinsic is available on the
154 /// [`atomic`] types via the `compare_exchange_weak` method by passing
155 /// [`Ordering::Acquire`] as both the `success` and `failure` parameters.
156 /// For example, [`AtomicBool::compare_exchange_weak`].
157 pub fn atomic_cxchgweak_acq<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
158 /// Stores a value if the current value is the same as the `old` value.
160 /// The stabilized version of this intrinsic is available on the
161 /// [`atomic`] types via the `compare_exchange_weak` method by passing
162 /// [`Ordering::Release`] as the `success` and [`Ordering::Relaxed`] as the
163 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
164 pub fn atomic_cxchgweak_rel<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
165 /// Stores a value if the current value is the same as the `old` value.
167 /// The stabilized version of this intrinsic is available on the
168 /// [`atomic`] types via the `compare_exchange_weak` method by passing
169 /// [`Ordering::AcqRel`] as the `success` and [`Ordering::Acquire`] as the
170 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
171 pub fn atomic_cxchgweak_acqrel<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
172 /// Stores a value if the current value is the same as the `old` value.
174 /// The stabilized version of this intrinsic is available on the
175 /// [`atomic`] types via the `compare_exchange_weak` method by passing
176 /// [`Ordering::Relaxed`] as both the `success` and `failure` parameters.
177 /// For example, [`AtomicBool::compare_exchange_weak`].
178 pub fn atomic_cxchgweak_relaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
179 /// Stores a value if the current value is the same as the `old` value.
181 /// The stabilized version of this intrinsic is available on the
182 /// [`atomic`] types via the `compare_exchange_weak` method by passing
183 /// [`Ordering::SeqCst`] as the `success` and [`Ordering::Relaxed`] as the
184 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
185 pub fn atomic_cxchgweak_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
186 /// Stores a value if the current value is the same as the `old` value.
188 /// The stabilized version of this intrinsic is available on the
189 /// [`atomic`] types via the `compare_exchange_weak` method by passing
190 /// [`Ordering::SeqCst`] as the `success` and [`Ordering::Acquire`] as the
191 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
192 pub fn atomic_cxchgweak_failacq<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
193 /// Stores a value if the current value is the same as the `old` value.
195 /// The stabilized version of this intrinsic is available on the
196 /// [`atomic`] types via the `compare_exchange_weak` method by passing
197 /// [`Ordering::Acquire`] as the `success` and [`Ordering::Relaxed`] as the
198 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
199 pub fn atomic_cxchgweak_acq_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
200 /// Stores a value if the current value is the same as the `old` value.
202 /// The stabilized version of this intrinsic is available on the
203 /// [`atomic`] types via the `compare_exchange_weak` method by passing
204 /// [`Ordering::AcqRel`] as the `success` and [`Ordering::Relaxed`] as the
205 /// `failure` parameters. For example, [`AtomicBool::compare_exchange_weak`].
206 pub fn atomic_cxchgweak_acqrel_failrelaxed<T: Copy>(dst: *mut T, old: T, src: T) -> (T, bool);
208 /// Loads the current value of the pointer.
210 /// The stabilized version of this intrinsic is available on the
211 /// [`atomic`] types via the `load` method by passing
212 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::load`].
213 pub fn atomic_load<T: Copy>(src: *const T) -> T;
214 /// Loads the current value of the pointer.
216 /// The stabilized version of this intrinsic is available on the
217 /// [`atomic`] types via the `load` method by passing
218 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::load`].
219 pub fn atomic_load_acq<T: Copy>(src: *const T) -> T;
220 /// Loads the current value of the pointer.
222 /// The stabilized version of this intrinsic is available on the
223 /// [`atomic`] types via the `load` method by passing
224 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::load`].
225 pub fn atomic_load_relaxed<T: Copy>(src: *const T) -> T;
226 pub fn atomic_load_unordered<T: Copy>(src: *const T) -> T;
228 /// Stores the value at the specified memory location.
230 /// The stabilized version of this intrinsic is available on the
231 /// [`atomic`] types via the `store` method by passing
232 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::store`].
233 pub fn atomic_store<T: Copy>(dst: *mut T, val: T);
234 /// Stores the value at the specified memory location.
236 /// The stabilized version of this intrinsic is available on the
237 /// [`atomic`] types via the `store` method by passing
238 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::store`].
239 pub fn atomic_store_rel<T: Copy>(dst: *mut T, val: T);
240 /// Stores the value at the specified memory location.
242 /// The stabilized version of this intrinsic is available on the
243 /// [`atomic`] types via the `store` method by passing
244 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::store`].
245 pub fn atomic_store_relaxed<T: Copy>(dst: *mut T, val: T);
246 pub fn atomic_store_unordered<T: Copy>(dst: *mut T, val: T);
248 /// Stores the value at the specified memory location, returning the old value.
250 /// The stabilized version of this intrinsic is available on the
251 /// [`atomic`] types via the `swap` method by passing
252 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::swap`].
253 pub fn atomic_xchg<T: Copy>(dst: *mut T, src: T) -> T;
254 /// Stores the value at the specified memory location, returning the old value.
256 /// The stabilized version of this intrinsic is available on the
257 /// [`atomic`] types via the `swap` method by passing
258 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::swap`].
259 pub fn atomic_xchg_acq<T: Copy>(dst: *mut T, src: T) -> T;
260 /// Stores the value at the specified memory location, returning the old value.
262 /// The stabilized version of this intrinsic is available on the
263 /// [`atomic`] types via the `swap` method by passing
264 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::swap`].
265 pub fn atomic_xchg_rel<T: Copy>(dst: *mut T, src: T) -> T;
266 /// Stores the value at the specified memory location, returning the old value.
268 /// The stabilized version of this intrinsic is available on the
269 /// [`atomic`] types via the `swap` method by passing
270 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicBool::swap`].
271 pub fn atomic_xchg_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
272 /// Stores the value at the specified memory location, returning the old value.
274 /// The stabilized version of this intrinsic is available on the
275 /// [`atomic`] types via the `swap` method by passing
276 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::swap`].
277 pub fn atomic_xchg_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
279 /// Adds to the current value, returning the previous value.
281 /// The stabilized version of this intrinsic is available on the
282 /// [`atomic`] types via the `fetch_add` method by passing
283 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicIsize::fetch_add`].
284 pub fn atomic_xadd<T: Copy>(dst: *mut T, src: T) -> T;
285 /// Adds to the current value, returning the previous value.
287 /// The stabilized version of this intrinsic is available on the
288 /// [`atomic`] types via the `fetch_add` method by passing
289 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicIsize::fetch_add`].
290 pub fn atomic_xadd_acq<T: Copy>(dst: *mut T, src: T) -> T;
291 /// Adds to the current value, returning the previous value.
293 /// The stabilized version of this intrinsic is available on the
294 /// [`atomic`] types via the `fetch_add` method by passing
295 /// [`Ordering::Release`] as the `order`. For example, [`AtomicIsize::fetch_add`].
296 pub fn atomic_xadd_rel<T: Copy>(dst: *mut T, src: T) -> T;
297 /// Adds to the current value, returning the previous value.
299 /// The stabilized version of this intrinsic is available on the
300 /// [`atomic`] types via the `fetch_add` method by passing
301 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicIsize::fetch_add`].
302 pub fn atomic_xadd_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
303 /// Adds to the current value, returning the previous value.
305 /// The stabilized version of this intrinsic is available on the
306 /// [`atomic`] types via the `fetch_add` method by passing
307 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicIsize::fetch_add`].
308 pub fn atomic_xadd_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
310 /// Subtract from the current value, returning the previous value.
312 /// The stabilized version of this intrinsic is available on the
313 /// [`atomic`] types via the `fetch_sub` method by passing
314 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicIsize::fetch_sub`].
315 pub fn atomic_xsub<T: Copy>(dst: *mut T, src: T) -> T;
316 /// Subtract from the current value, returning the previous value.
318 /// The stabilized version of this intrinsic is available on the
319 /// [`atomic`] types via the `fetch_sub` method by passing
320 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicIsize::fetch_sub`].
321 pub fn atomic_xsub_acq<T: Copy>(dst: *mut T, src: T) -> T;
322 /// Subtract from the current value, returning the previous value.
324 /// The stabilized version of this intrinsic is available on the
325 /// [`atomic`] types via the `fetch_sub` method by passing
326 /// [`Ordering::Release`] as the `order`. For example, [`AtomicIsize::fetch_sub`].
327 pub fn atomic_xsub_rel<T: Copy>(dst: *mut T, src: T) -> T;
328 /// Subtract from the current value, returning the previous value.
330 /// The stabilized version of this intrinsic is available on the
331 /// [`atomic`] types via the `fetch_sub` method by passing
332 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicIsize::fetch_sub`].
333 pub fn atomic_xsub_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
334 /// Subtract from the current value, returning the previous value.
336 /// The stabilized version of this intrinsic is available on the
337 /// [`atomic`] types via the `fetch_sub` method by passing
338 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicIsize::fetch_sub`].
339 pub fn atomic_xsub_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
341 /// Bitwise and with the current value, returning the previous value.
343 /// The stabilized version of this intrinsic is available on the
344 /// [`atomic`] types via the `fetch_and` method by passing
345 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::fetch_and`].
346 pub fn atomic_and<T: Copy>(dst: *mut T, src: T) -> T;
347 /// Bitwise and with the current value, returning the previous value.
349 /// The stabilized version of this intrinsic is available on the
350 /// [`atomic`] types via the `fetch_and` method by passing
351 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::fetch_and`].
352 pub fn atomic_and_acq<T: Copy>(dst: *mut T, src: T) -> T;
353 /// Bitwise and with the current value, returning the previous value.
355 /// The stabilized version of this intrinsic is available on the
356 /// [`atomic`] types via the `fetch_and` method by passing
357 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::fetch_and`].
358 pub fn atomic_and_rel<T: Copy>(dst: *mut T, src: T) -> T;
359 /// Bitwise and with the current value, returning the previous value.
361 /// The stabilized version of this intrinsic is available on the
362 /// [`atomic`] types via the `fetch_and` method by passing
363 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicBool::fetch_and`].
364 pub fn atomic_and_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
365 /// Bitwise and with the current value, returning the previous value.
367 /// The stabilized version of this intrinsic is available on the
368 /// [`atomic`] types via the `fetch_and` method by passing
369 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::fetch_and`].
370 pub fn atomic_and_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
372 /// Bitwise nand with the current value, returning the previous value.
374 /// The stabilized version of this intrinsic is available on the
375 /// [`AtomicBool`] type via the `fetch_nand` method by passing
376 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::fetch_nand`].
377 pub fn atomic_nand<T: Copy>(dst: *mut T, src: T) -> T;
378 /// Bitwise nand with the current value, returning the previous value.
380 /// The stabilized version of this intrinsic is available on the
381 /// [`AtomicBool`] type via the `fetch_nand` method by passing
382 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::fetch_nand`].
383 pub fn atomic_nand_acq<T: Copy>(dst: *mut T, src: T) -> T;
384 /// Bitwise nand with the current value, returning the previous value.
386 /// The stabilized version of this intrinsic is available on the
387 /// [`AtomicBool`] type via the `fetch_nand` method by passing
388 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::fetch_nand`].
389 pub fn atomic_nand_rel<T: Copy>(dst: *mut T, src: T) -> T;
390 /// Bitwise nand with the current value, returning the previous value.
392 /// The stabilized version of this intrinsic is available on the
393 /// [`AtomicBool`] type via the `fetch_nand` method by passing
394 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicBool::fetch_nand`].
395 pub fn atomic_nand_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
396 /// Bitwise nand with the current value, returning the previous value.
398 /// The stabilized version of this intrinsic is available on the
399 /// [`AtomicBool`] type via the `fetch_nand` method by passing
400 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::fetch_nand`].
401 pub fn atomic_nand_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
403 /// Bitwise or with the current value, returning the previous value.
405 /// The stabilized version of this intrinsic is available on the
406 /// [`atomic`] types via the `fetch_or` method by passing
407 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::fetch_or`].
408 pub fn atomic_or<T: Copy>(dst: *mut T, src: T) -> T;
409 /// Bitwise or with the current value, returning the previous value.
411 /// The stabilized version of this intrinsic is available on the
412 /// [`atomic`] types via the `fetch_or` method by passing
413 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::fetch_or`].
414 pub fn atomic_or_acq<T: Copy>(dst: *mut T, src: T) -> T;
415 /// Bitwise or with the current value, returning the previous value.
417 /// The stabilized version of this intrinsic is available on the
418 /// [`atomic`] types via the `fetch_or` method by passing
419 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::fetch_or`].
420 pub fn atomic_or_rel<T: Copy>(dst: *mut T, src: T) -> T;
421 /// Bitwise or with the current value, returning the previous value.
423 /// The stabilized version of this intrinsic is available on the
424 /// [`atomic`] types via the `fetch_or` method by passing
425 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicBool::fetch_or`].
426 pub fn atomic_or_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
427 /// Bitwise or with the current value, returning the previous value.
429 /// The stabilized version of this intrinsic is available on the
430 /// [`atomic`] types via the `fetch_or` method by passing
431 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::fetch_or`].
432 pub fn atomic_or_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
434 /// Bitwise xor with the current value, returning the previous value.
436 /// The stabilized version of this intrinsic is available on the
437 /// [`atomic`] types via the `fetch_xor` method by passing
438 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicBool::fetch_xor`].
439 pub fn atomic_xor<T: Copy>(dst: *mut T, src: T) -> T;
440 /// Bitwise xor with the current value, returning the previous value.
442 /// The stabilized version of this intrinsic is available on the
443 /// [`atomic`] types via the `fetch_xor` method by passing
444 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicBool::fetch_xor`].
445 pub fn atomic_xor_acq<T: Copy>(dst: *mut T, src: T) -> T;
446 /// Bitwise xor with the current value, returning the previous value.
448 /// The stabilized version of this intrinsic is available on the
449 /// [`atomic`] types via the `fetch_xor` method by passing
450 /// [`Ordering::Release`] as the `order`. For example, [`AtomicBool::fetch_xor`].
451 pub fn atomic_xor_rel<T: Copy>(dst: *mut T, src: T) -> T;
452 /// Bitwise xor with the current value, returning the previous value.
454 /// The stabilized version of this intrinsic is available on the
455 /// [`atomic`] types via the `fetch_xor` method by passing
456 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicBool::fetch_xor`].
457 pub fn atomic_xor_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
458 /// Bitwise xor with the current value, returning the previous value.
460 /// The stabilized version of this intrinsic is available on the
461 /// [`atomic`] types via the `fetch_xor` method by passing
462 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicBool::fetch_xor`].
463 pub fn atomic_xor_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
465 /// Maximum with the current value using a signed comparison.
467 /// The stabilized version of this intrinsic is available on the
468 /// [`atomic`] signed integer types via the `fetch_max` method by passing
469 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicI32::fetch_max`].
470 pub fn atomic_max<T: Copy>(dst: *mut T, src: T) -> T;
471 /// Maximum with the current value using a signed comparison.
473 /// The stabilized version of this intrinsic is available on the
474 /// [`atomic`] signed integer types via the `fetch_max` method by passing
475 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicI32::fetch_max`].
476 pub fn atomic_max_acq<T: Copy>(dst: *mut T, src: T) -> T;
477 /// Maximum with the current value using a signed comparison.
479 /// The stabilized version of this intrinsic is available on the
480 /// [`atomic`] signed integer types via the `fetch_max` method by passing
481 /// [`Ordering::Release`] as the `order`. For example, [`AtomicI32::fetch_max`].
482 pub fn atomic_max_rel<T: Copy>(dst: *mut T, src: T) -> T;
483 /// Maximum with the current value using a signed comparison.
485 /// The stabilized version of this intrinsic is available on the
486 /// [`atomic`] signed integer types via the `fetch_max` method by passing
487 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicI32::fetch_max`].
488 pub fn atomic_max_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
489 /// Maximum with the current value.
491 /// The stabilized version of this intrinsic is available on the
492 /// [`atomic`] signed integer types via the `fetch_max` method by passing
493 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicI32::fetch_max`].
494 pub fn atomic_max_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
496 /// Minimum with the current value using a signed comparison.
498 /// The stabilized version of this intrinsic is available on the
499 /// [`atomic`] signed integer types via the `fetch_min` method by passing
500 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicI32::fetch_min`].
501 pub fn atomic_min<T: Copy>(dst: *mut T, src: T) -> T;
502 /// Minimum with the current value using a signed comparison.
504 /// The stabilized version of this intrinsic is available on the
505 /// [`atomic`] signed integer types via the `fetch_min` method by passing
506 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicI32::fetch_min`].
507 pub fn atomic_min_acq<T: Copy>(dst: *mut T, src: T) -> T;
508 /// Minimum with the current value using a signed comparison.
510 /// The stabilized version of this intrinsic is available on the
511 /// [`atomic`] signed integer types via the `fetch_min` method by passing
512 /// [`Ordering::Release`] as the `order`. For example, [`AtomicI32::fetch_min`].
513 pub fn atomic_min_rel<T: Copy>(dst: *mut T, src: T) -> T;
514 /// Minimum with the current value using a signed comparison.
516 /// The stabilized version of this intrinsic is available on the
517 /// [`atomic`] signed integer types via the `fetch_min` method by passing
518 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicI32::fetch_min`].
519 pub fn atomic_min_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
520 /// Minimum with the current value using a signed comparison.
522 /// The stabilized version of this intrinsic is available on the
523 /// [`atomic`] signed integer types via the `fetch_min` method by passing
524 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicI32::fetch_min`].
525 pub fn atomic_min_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
527 /// Minimum with the current value using an unsigned comparison.
529 /// The stabilized version of this intrinsic is available on the
530 /// [`atomic`] unsigned integer types via the `fetch_min` method by passing
531 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicU32::fetch_min`].
532 pub fn atomic_umin<T: Copy>(dst: *mut T, src: T) -> T;
533 /// Minimum with the current value using an unsigned comparison.
535 /// The stabilized version of this intrinsic is available on the
536 /// [`atomic`] unsigned integer types via the `fetch_min` method by passing
537 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicU32::fetch_min`].
538 pub fn atomic_umin_acq<T: Copy>(dst: *mut T, src: T) -> T;
539 /// Minimum with the current value using an unsigned comparison.
541 /// The stabilized version of this intrinsic is available on the
542 /// [`atomic`] unsigned integer types via the `fetch_min` method by passing
543 /// [`Ordering::Release`] as the `order`. For example, [`AtomicU32::fetch_min`].
544 pub fn atomic_umin_rel<T: Copy>(dst: *mut T, src: T) -> T;
545 /// Minimum with the current value using an unsigned comparison.
547 /// The stabilized version of this intrinsic is available on the
548 /// [`atomic`] unsigned integer types via the `fetch_min` method by passing
549 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicU32::fetch_min`].
550 pub fn atomic_umin_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
551 /// Minimum with the current value using an unsigned comparison.
553 /// The stabilized version of this intrinsic is available on the
554 /// [`atomic`] unsigned integer types via the `fetch_min` method by passing
555 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicU32::fetch_min`].
556 pub fn atomic_umin_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
558 /// Maximum with the current value using an unsigned comparison.
560 /// The stabilized version of this intrinsic is available on the
561 /// [`atomic`] unsigned integer types via the `fetch_max` method by passing
562 /// [`Ordering::SeqCst`] as the `order`. For example, [`AtomicU32::fetch_max`].
563 pub fn atomic_umax<T: Copy>(dst: *mut T, src: T) -> T;
564 /// Maximum with the current value using an unsigned comparison.
566 /// The stabilized version of this intrinsic is available on the
567 /// [`atomic`] unsigned integer types via the `fetch_max` method by passing
568 /// [`Ordering::Acquire`] as the `order`. For example, [`AtomicU32::fetch_max`].
569 pub fn atomic_umax_acq<T: Copy>(dst: *mut T, src: T) -> T;
570 /// Maximum with the current value using an unsigned comparison.
572 /// The stabilized version of this intrinsic is available on the
573 /// [`atomic`] unsigned integer types via the `fetch_max` method by passing
574 /// [`Ordering::Release`] as the `order`. For example, [`AtomicU32::fetch_max`].
575 pub fn atomic_umax_rel<T: Copy>(dst: *mut T, src: T) -> T;
576 /// Maximum with the current value using an unsigned comparison.
578 /// The stabilized version of this intrinsic is available on the
579 /// [`atomic`] unsigned integer types via the `fetch_max` method by passing
580 /// [`Ordering::AcqRel`] as the `order`. For example, [`AtomicU32::fetch_max`].
581 pub fn atomic_umax_acqrel<T: Copy>(dst: *mut T, src: T) -> T;
582 /// Maximum with the current value using an unsigned comparison.
584 /// The stabilized version of this intrinsic is available on the
585 /// [`atomic`] unsigned integer types via the `fetch_max` method by passing
586 /// [`Ordering::Relaxed`] as the `order`. For example, [`AtomicU32::fetch_max`].
587 pub fn atomic_umax_relaxed<T: Copy>(dst: *mut T, src: T) -> T;
589 /// The `prefetch` intrinsic is a hint to the code generator to insert a prefetch instruction
590 /// if supported; otherwise, it is a no-op.
591 /// Prefetches have no effect on the behavior of the program but can change its performance
594 /// The `locality` argument must be a constant integer and is a temporal locality specifier
595 /// ranging from (0) - no locality, to (3) - extremely local keep in cache.
597 /// This intrinsic does not have a stable counterpart.
598 pub fn prefetch_read_data<T>(data: *const T, locality: i32);
599 /// The `prefetch` intrinsic is a hint to the code generator to insert a prefetch instruction
600 /// if supported; otherwise, it is a no-op.
601 /// Prefetches have no effect on the behavior of the program but can change its performance
604 /// The `locality` argument must be a constant integer and is a temporal locality specifier
605 /// ranging from (0) - no locality, to (3) - extremely local keep in cache.
607 /// This intrinsic does not have a stable counterpart.
608 pub fn prefetch_write_data<T>(data: *const T, locality: i32);
609 /// The `prefetch` intrinsic is a hint to the code generator to insert a prefetch instruction
610 /// if supported; otherwise, it is a no-op.
611 /// Prefetches have no effect on the behavior of the program but can change its performance
614 /// The `locality` argument must be a constant integer and is a temporal locality specifier
615 /// ranging from (0) - no locality, to (3) - extremely local keep in cache.
617 /// This intrinsic does not have a stable counterpart.
618 pub fn prefetch_read_instruction<T>(data: *const T, locality: i32);
619 /// The `prefetch` intrinsic is a hint to the code generator to insert a prefetch instruction
620 /// if supported; otherwise, it is a no-op.
621 /// Prefetches have no effect on the behavior of the program but can change its performance
624 /// The `locality` argument must be a constant integer and is a temporal locality specifier
625 /// ranging from (0) - no locality, to (3) - extremely local keep in cache.
627 /// This intrinsic does not have a stable counterpart.
628 pub fn prefetch_write_instruction<T>(data: *const T, locality: i32);
631 extern "rust-intrinsic" {
634 /// The stabilized version of this intrinsic is available in
635 /// [`atomic::fence`] by passing [`Ordering::SeqCst`]
637 pub fn atomic_fence();
640 /// The stabilized version of this intrinsic is available in
641 /// [`atomic::fence`] by passing [`Ordering::Acquire`]
643 pub fn atomic_fence_acq();
646 /// The stabilized version of this intrinsic is available in
647 /// [`atomic::fence`] by passing [`Ordering::Release`]
649 pub fn atomic_fence_rel();
652 /// The stabilized version of this intrinsic is available in
653 /// [`atomic::fence`] by passing [`Ordering::AcqRel`]
655 pub fn atomic_fence_acqrel();
657 /// A compiler-only memory barrier.
659 /// Memory accesses will never be reordered across this barrier by the
660 /// compiler, but no instructions will be emitted for it. This is
661 /// appropriate for operations on the same thread that may be preempted,
662 /// such as when interacting with signal handlers.
664 /// The stabilized version of this intrinsic is available in
665 /// [`atomic::compiler_fence`] by passing [`Ordering::SeqCst`]
667 pub fn atomic_singlethreadfence();
668 /// A compiler-only memory barrier.
670 /// Memory accesses will never be reordered across this barrier by the
671 /// compiler, but no instructions will be emitted for it. This is
672 /// appropriate for operations on the same thread that may be preempted,
673 /// such as when interacting with signal handlers.
675 /// The stabilized version of this intrinsic is available in
676 /// [`atomic::compiler_fence`] by passing [`Ordering::Acquire`]
678 pub fn atomic_singlethreadfence_acq();
679 /// A compiler-only memory barrier.
681 /// Memory accesses will never be reordered across this barrier by the
682 /// compiler, but no instructions will be emitted for it. This is
683 /// appropriate for operations on the same thread that may be preempted,
684 /// such as when interacting with signal handlers.
686 /// The stabilized version of this intrinsic is available in
687 /// [`atomic::compiler_fence`] by passing [`Ordering::Release`]
689 pub fn atomic_singlethreadfence_rel();
690 /// A compiler-only memory barrier.
692 /// Memory accesses will never be reordered across this barrier by the
693 /// compiler, but no instructions will be emitted for it. This is
694 /// appropriate for operations on the same thread that may be preempted,
695 /// such as when interacting with signal handlers.
697 /// The stabilized version of this intrinsic is available in
698 /// [`atomic::compiler_fence`] by passing [`Ordering::AcqRel`]
700 pub fn atomic_singlethreadfence_acqrel();
702 /// Magic intrinsic that derives its meaning from attributes
703 /// attached to the function.
705 /// For example, dataflow uses this to inject static assertions so
706 /// that `rustc_peek(potentially_uninitialized)` would actually
707 /// double-check that dataflow did indeed compute that it is
708 /// uninitialized at that point in the control flow.
710 /// This intrinsic should not be used outside of the compiler.
711 pub fn rustc_peek<T>(_: T) -> T;
713 /// Aborts the execution of the process.
715 /// Note that, unlike most intrinsics, this is safe to call;
716 /// it does not require an `unsafe` block.
717 /// Therefore, implementations must not require the user to uphold
718 /// any safety invariants.
720 /// [`std::process::abort`](../../std/process/fn.abort.html) is to be preferred if possible,
721 /// as its behavior is more user-friendly and more stable.
723 /// The current implementation of `intrinsics::abort` is to invoke an invalid instruction,
724 /// on most platforms.
726 /// process will probably terminate with a signal like `SIGABRT`, `SIGILL`, `SIGTRAP`, `SIGSEGV` or
727 /// `SIGBUS`. The precise behaviour is not guaranteed and not stable.
730 /// Informs the optimizer that this point in the code is not reachable,
731 /// enabling further optimizations.
733 /// N.B., this is very different from the `unreachable!()` macro: Unlike the
734 /// macro, which panics when it is executed, it is *undefined behavior* to
735 /// reach code marked with this function.
737 /// The stabilized version of this intrinsic is [`core::hint::unreachable_unchecked`].
738 #[rustc_const_stable(feature = "const_unreachable_unchecked", since = "1.57.0")]
739 pub fn unreachable() -> !;
741 /// Informs the optimizer that a condition is always true.
742 /// If the condition is false, the behavior is undefined.
744 /// No code is generated for this intrinsic, but the optimizer will try
745 /// to preserve it (and its condition) between passes, which may interfere
746 /// with optimization of surrounding code and reduce performance. It should
747 /// not be used if the invariant can be discovered by the optimizer on its
748 /// own, or if it does not enable any significant optimizations.
750 /// This intrinsic does not have a stable counterpart.
751 #[rustc_const_unstable(feature = "const_assume", issue = "76972")]
752 pub fn assume(b: bool);
754 /// Hints to the compiler that branch condition is likely to be true.
755 /// Returns the value passed to it.
757 /// Any use other than with `if` statements will probably not have an effect.
759 /// Note that, unlike most intrinsics, this is safe to call;
760 /// it does not require an `unsafe` block.
761 /// Therefore, implementations must not require the user to uphold
762 /// any safety invariants.
764 /// This intrinsic does not have a stable counterpart.
765 #[rustc_const_unstable(feature = "const_likely", issue = "none")]
766 pub fn likely(b: bool) -> bool;
768 /// Hints to the compiler that branch condition is likely to be false.
769 /// Returns the value passed to it.
771 /// Any use other than with `if` statements will probably not have an effect.
773 /// Note that, unlike most intrinsics, this is safe to call;
774 /// it does not require an `unsafe` block.
775 /// Therefore, implementations must not require the user to uphold
776 /// any safety invariants.
778 /// This intrinsic does not have a stable counterpart.
779 #[rustc_const_unstable(feature = "const_likely", issue = "none")]
780 pub fn unlikely(b: bool) -> bool;
782 /// Executes a breakpoint trap, for inspection by a debugger.
784 /// This intrinsic does not have a stable counterpart.
787 /// The size of a type in bytes.
789 /// Note that, unlike most intrinsics, this is safe to call;
790 /// it does not require an `unsafe` block.
791 /// Therefore, implementations must not require the user to uphold
792 /// any safety invariants.
794 /// More specifically, this is the offset in bytes between successive
795 /// items of the same type, including alignment padding.
797 /// The stabilized version of this intrinsic is [`core::mem::size_of`].
798 #[rustc_const_stable(feature = "const_size_of", since = "1.40.0")]
799 pub fn size_of<T>() -> usize;
801 /// The minimum alignment of a type.
803 /// Note that, unlike most intrinsics, this is safe to call;
804 /// it does not require an `unsafe` block.
805 /// Therefore, implementations must not require the user to uphold
806 /// any safety invariants.
808 /// The stabilized version of this intrinsic is [`core::mem::align_of`].
809 #[rustc_const_stable(feature = "const_min_align_of", since = "1.40.0")]
810 pub fn min_align_of<T>() -> usize;
811 /// The preferred alignment of a type.
813 /// This intrinsic does not have a stable counterpart.
814 /// It's "tracking issue" is [#91971](https://github.com/rust-lang/rust/issues/91971).
815 #[rustc_const_unstable(feature = "const_pref_align_of", issue = "91971")]
816 pub fn pref_align_of<T>() -> usize;
818 /// The size of the referenced value in bytes.
820 /// The stabilized version of this intrinsic is [`mem::size_of_val`].
821 #[rustc_const_unstable(feature = "const_size_of_val", issue = "46571")]
822 pub fn size_of_val<T: ?Sized>(_: *const T) -> usize;
823 /// The required alignment of the referenced value.
825 /// The stabilized version of this intrinsic is [`core::mem::align_of_val`].
826 #[rustc_const_unstable(feature = "const_align_of_val", issue = "46571")]
827 pub fn min_align_of_val<T: ?Sized>(_: *const T) -> usize;
829 /// Gets a static string slice containing the name of a type.
831 /// Note that, unlike most intrinsics, this is safe to call;
832 /// it does not require an `unsafe` block.
833 /// Therefore, implementations must not require the user to uphold
834 /// any safety invariants.
836 /// The stabilized version of this intrinsic is [`core::any::type_name`].
837 #[rustc_const_unstable(feature = "const_type_name", issue = "63084")]
838 pub fn type_name<T: ?Sized>() -> &'static str;
840 /// Gets an identifier which is globally unique to the specified type. This
841 /// function will return the same value for a type regardless of whichever
842 /// crate it is invoked in.
844 /// Note that, unlike most intrinsics, this is safe to call;
845 /// it does not require an `unsafe` block.
846 /// Therefore, implementations must not require the user to uphold
847 /// any safety invariants.
849 /// The stabilized version of this intrinsic is [`core::any::TypeId::of`].
850 #[rustc_const_unstable(feature = "const_type_id", issue = "77125")]
851 pub fn type_id<T: ?Sized + 'static>() -> u64;
853 /// A guard for unsafe functions that cannot ever be executed if `T` is uninhabited:
854 /// This will statically either panic, or do nothing.
856 /// This intrinsic does not have a stable counterpart.
857 #[rustc_const_stable(feature = "const_assert_type", since = "1.59.0")]
858 pub fn assert_inhabited<T>();
860 /// A guard for unsafe functions that cannot ever be executed if `T` does not permit
861 /// zero-initialization: This will statically either panic, or do nothing.
863 /// This intrinsic does not have a stable counterpart.
864 #[rustc_const_unstable(feature = "const_assert_type2", issue = "none")]
865 pub fn assert_zero_valid<T>();
867 /// A guard for unsafe functions that cannot ever be executed if `T` has invalid
868 /// bit patterns: This will statically either panic, or do nothing.
870 /// This intrinsic does not have a stable counterpart.
871 #[rustc_const_unstable(feature = "const_assert_type2", issue = "none")]
872 pub fn assert_uninit_valid<T>();
874 /// Gets a reference to a static `Location` indicating where it was called.
876 /// Note that, unlike most intrinsics, this is safe to call;
877 /// it does not require an `unsafe` block.
878 /// Therefore, implementations must not require the user to uphold
879 /// any safety invariants.
881 /// Consider using [`core::panic::Location::caller`] instead.
882 #[rustc_const_unstable(feature = "const_caller_location", issue = "76156")]
883 pub fn caller_location() -> &'static crate::panic::Location<'static>;
885 /// Moves a value out of scope without running drop glue.
887 /// This exists solely for [`mem::forget_unsized`]; normal `forget` uses
888 /// `ManuallyDrop` instead.
890 /// Note that, unlike most intrinsics, this is safe to call;
891 /// it does not require an `unsafe` block.
892 /// Therefore, implementations must not require the user to uphold
893 /// any safety invariants.
894 #[rustc_const_unstable(feature = "const_intrinsic_forget", issue = "none")]
895 pub fn forget<T: ?Sized>(_: T);
897 /// Reinterprets the bits of a value of one type as another type.
899 /// Both types must have the same size. Neither the original, nor the result,
900 /// may be an [invalid value](../../nomicon/what-unsafe-does.html).
902 /// `transmute` is semantically equivalent to a bitwise move of one type
903 /// into another. It copies the bits from the source value into the
904 /// destination value, then forgets the original. It's equivalent to C's
905 /// `memcpy` under the hood, just like `transmute_copy`.
907 /// Because `transmute` is a by-value operation, alignment of the *transmuted values
908 /// themselves* is not a concern. As with any other function, the compiler already ensures
909 /// both `T` and `U` are properly aligned. However, when transmuting values that *point
910 /// elsewhere* (such as pointers, references, boxes…), the caller has to ensure proper
911 /// alignment of the pointed-to values.
913 /// `transmute` is **incredibly** unsafe. There are a vast number of ways to
914 /// cause [undefined behavior][ub] with this function. `transmute` should be
915 /// the absolute last resort.
917 /// Transmuting pointers to integers in a `const` context is [undefined behavior][ub].
918 /// Any attempt to use the resulting value for integer operations will abort const-evaluation.
920 /// The [nomicon](../../nomicon/transmutes.html) has additional
923 /// [ub]: ../../reference/behavior-considered-undefined.html
927 /// There are a few things that `transmute` is really useful for.
929 /// Turning a pointer into a function pointer. This is *not* portable to
930 /// machines where function pointers and data pointers have different sizes.
933 /// fn foo() -> i32 {
936 /// let pointer = foo as *const ();
937 /// let function = unsafe {
938 /// std::mem::transmute::<*const (), fn() -> i32>(pointer)
940 /// assert_eq!(function(), 0);
943 /// Extending a lifetime, or shortening an invariant lifetime. This is
944 /// advanced, very unsafe Rust!
947 /// struct R<'a>(&'a i32);
948 /// unsafe fn extend_lifetime<'b>(r: R<'b>) -> R<'static> {
949 /// std::mem::transmute::<R<'b>, R<'static>>(r)
952 /// unsafe fn shorten_invariant_lifetime<'b, 'c>(r: &'b mut R<'static>)
953 /// -> &'b mut R<'c> {
954 /// std::mem::transmute::<&'b mut R<'static>, &'b mut R<'c>>(r)
960 /// Don't despair: many uses of `transmute` can be achieved through other means.
961 /// Below are common applications of `transmute` which can be replaced with safer
964 /// Turning raw bytes(`&[u8]`) to `u32`, `f64`, etc.:
967 /// let raw_bytes = [0x78, 0x56, 0x34, 0x12];
969 /// let num = unsafe {
970 /// std::mem::transmute::<[u8; 4], u32>(raw_bytes)
973 /// // use `u32::from_ne_bytes` instead
974 /// let num = u32::from_ne_bytes(raw_bytes);
975 /// // or use `u32::from_le_bytes` or `u32::from_be_bytes` to specify the endianness
976 /// let num = u32::from_le_bytes(raw_bytes);
977 /// assert_eq!(num, 0x12345678);
978 /// let num = u32::from_be_bytes(raw_bytes);
979 /// assert_eq!(num, 0x78563412);
982 /// Turning a pointer into a `usize`:
986 /// let ptr_num_transmute = unsafe {
987 /// std::mem::transmute::<&i32, usize>(ptr)
990 /// // Use an `as` cast instead
991 /// let ptr_num_cast = ptr as *const i32 as usize;
994 /// Turning a `*mut T` into an `&mut T`:
997 /// let ptr: *mut i32 = &mut 0;
998 /// let ref_transmuted = unsafe {
999 /// std::mem::transmute::<*mut i32, &mut i32>(ptr)
1002 /// // Use a reborrow instead
1003 /// let ref_casted = unsafe { &mut *ptr };
1006 /// Turning an `&mut T` into an `&mut U`:
1009 /// let ptr = &mut 0;
1010 /// let val_transmuted = unsafe {
1011 /// std::mem::transmute::<&mut i32, &mut u32>(ptr)
1014 /// // Now, put together `as` and reborrowing - note the chaining of `as`
1015 /// // `as` is not transitive
1016 /// let val_casts = unsafe { &mut *(ptr as *mut i32 as *mut u32) };
1019 /// Turning an `&str` into a `&[u8]`:
1022 /// // this is not a good way to do this.
1023 /// let slice = unsafe { std::mem::transmute::<&str, &[u8]>("Rust") };
1024 /// assert_eq!(slice, &[82, 117, 115, 116]);
1026 /// // You could use `str::as_bytes`
1027 /// let slice = "Rust".as_bytes();
1028 /// assert_eq!(slice, &[82, 117, 115, 116]);
1030 /// // Or, just use a byte string, if you have control over the string
1032 /// assert_eq!(b"Rust", &[82, 117, 115, 116]);
1035 /// Turning a `Vec<&T>` into a `Vec<Option<&T>>`.
1037 /// To transmute the inner type of the contents of a container, you must make sure to not
1038 /// violate any of the container's invariants. For `Vec`, this means that both the size
1039 /// *and alignment* of the inner types have to match. Other containers might rely on the
1040 /// size of the type, alignment, or even the `TypeId`, in which case transmuting wouldn't
1041 /// be possible at all without violating the container invariants.
1044 /// let store = [0, 1, 2, 3];
1045 /// let v_orig = store.iter().collect::<Vec<&i32>>();
1047 /// // clone the vector as we will reuse them later
1048 /// let v_clone = v_orig.clone();
1050 /// // Using transmute: this relies on the unspecified data layout of `Vec`, which is a
1051 /// // bad idea and could cause Undefined Behavior.
1052 /// // However, it is no-copy.
1053 /// let v_transmuted = unsafe {
1054 /// std::mem::transmute::<Vec<&i32>, Vec<Option<&i32>>>(v_clone)
1057 /// let v_clone = v_orig.clone();
1059 /// // This is the suggested, safe way.
1060 /// // It does copy the entire vector, though, into a new array.
1061 /// let v_collected = v_clone.into_iter()
1063 /// .collect::<Vec<Option<&i32>>>();
1065 /// let v_clone = v_orig.clone();
1067 /// // This is the proper no-copy, unsafe way of "transmuting" a `Vec`, without relying on the
1068 /// // data layout. Instead of literally calling `transmute`, we perform a pointer cast, but
1069 /// // in terms of converting the original inner type (`&i32`) to the new one (`Option<&i32>`),
1070 /// // this has all the same caveats. Besides the information provided above, also consult the
1071 /// // [`from_raw_parts`] documentation.
1072 /// let v_from_raw = unsafe {
1073 // FIXME Update this when vec_into_raw_parts is stabilized
1074 /// // Ensure the original vector is not dropped.
1075 /// let mut v_clone = std::mem::ManuallyDrop::new(v_clone);
1076 /// Vec::from_raw_parts(v_clone.as_mut_ptr() as *mut Option<&i32>,
1078 /// v_clone.capacity())
1082 /// [`from_raw_parts`]: ../../std/vec/struct.Vec.html#method.from_raw_parts
1084 /// Implementing `split_at_mut`:
1087 /// use std::{slice, mem};
1089 /// // There are multiple ways to do this, and there are multiple problems
1090 /// // with the following (transmute) way.
1091 /// fn split_at_mut_transmute<T>(slice: &mut [T], mid: usize)
1092 /// -> (&mut [T], &mut [T]) {
1093 /// let len = slice.len();
1094 /// assert!(mid <= len);
1096 /// let slice2 = mem::transmute::<&mut [T], &mut [T]>(slice);
1097 /// // first: transmute is not type safe; all it checks is that T and
1098 /// // U are of the same size. Second, right here, you have two
1099 /// // mutable references pointing to the same memory.
1100 /// (&mut slice[0..mid], &mut slice2[mid..len])
1104 /// // This gets rid of the type safety problems; `&mut *` will *only* give
1105 /// // you an `&mut T` from an `&mut T` or `*mut T`.
1106 /// fn split_at_mut_casts<T>(slice: &mut [T], mid: usize)
1107 /// -> (&mut [T], &mut [T]) {
1108 /// let len = slice.len();
1109 /// assert!(mid <= len);
1111 /// let slice2 = &mut *(slice as *mut [T]);
1112 /// // however, you still have two mutable references pointing to
1113 /// // the same memory.
1114 /// (&mut slice[0..mid], &mut slice2[mid..len])
1118 /// // This is how the standard library does it. This is the best method, if
1119 /// // you need to do something like this
1120 /// fn split_at_stdlib<T>(slice: &mut [T], mid: usize)
1121 /// -> (&mut [T], &mut [T]) {
1122 /// let len = slice.len();
1123 /// assert!(mid <= len);
1125 /// let ptr = slice.as_mut_ptr();
1126 /// // This now has three mutable references pointing at the same
1127 /// // memory. `slice`, the rvalue ret.0, and the rvalue ret.1.
1128 /// // `slice` is never used after `let ptr = ...`, and so one can
1129 /// // treat it as "dead", and therefore, you only have two real
1130 /// // mutable slices.
1131 /// (slice::from_raw_parts_mut(ptr, mid),
1132 /// slice::from_raw_parts_mut(ptr.add(mid), len - mid))
1136 #[stable(feature = "rust1", since = "1.0.0")]
1137 #[rustc_const_stable(feature = "const_transmute", since = "1.46.0")]
1138 #[rustc_diagnostic_item = "transmute"]
1139 pub fn transmute<T, U>(e: T) -> U;
1141 /// Returns `true` if the actual type given as `T` requires drop
1142 /// glue; returns `false` if the actual type provided for `T`
1143 /// implements `Copy`.
1145 /// If the actual type neither requires drop glue nor implements
1146 /// `Copy`, then the return value of this function is unspecified.
1148 /// Note that, unlike most intrinsics, this is safe to call;
1149 /// it does not require an `unsafe` block.
1150 /// Therefore, implementations must not require the user to uphold
1151 /// any safety invariants.
1153 /// The stabilized version of this intrinsic is [`mem::needs_drop`](crate::mem::needs_drop).
1154 #[rustc_const_stable(feature = "const_needs_drop", since = "1.40.0")]
1155 pub fn needs_drop<T>() -> bool;
1157 /// Calculates the offset from a pointer.
1159 /// This is implemented as an intrinsic to avoid converting to and from an
1160 /// integer, since the conversion would throw away aliasing information.
1164 /// Both the starting and resulting pointer must be either in bounds or one
1165 /// byte past the end of an allocated object. If either pointer is out of
1166 /// bounds or arithmetic overflow occurs then any further use of the
1167 /// returned value will result in undefined behavior.
1169 /// The stabilized version of this intrinsic is [`pointer::offset`].
1170 #[must_use = "returns a new pointer rather than modifying its argument"]
1171 #[rustc_const_unstable(feature = "const_ptr_offset", issue = "71499")]
1172 pub fn offset<T>(dst: *const T, offset: isize) -> *const T;
1174 /// Calculates the offset from a pointer, potentially wrapping.
1176 /// This is implemented as an intrinsic to avoid converting to and from an
1177 /// integer, since the conversion inhibits certain optimizations.
1181 /// Unlike the `offset` intrinsic, this intrinsic does not restrict the
1182 /// resulting pointer to point into or one byte past the end of an allocated
1183 /// object, and it wraps with two's complement arithmetic. The resulting
1184 /// value is not necessarily valid to be used to actually access memory.
1186 /// The stabilized version of this intrinsic is [`pointer::wrapping_offset`].
1187 #[must_use = "returns a new pointer rather than modifying its argument"]
1188 #[rustc_const_unstable(feature = "const_ptr_offset", issue = "71499")]
1189 pub fn arith_offset<T>(dst: *const T, offset: isize) -> *const T;
1191 /// Equivalent to the appropriate `llvm.memcpy.p0i8.0i8.*` intrinsic, with
1192 /// a size of `count` * `size_of::<T>()` and an alignment of
1193 /// `min_align_of::<T>()`
1195 /// The volatile parameter is set to `true`, so it will not be optimized out
1196 /// unless size is equal to zero.
1198 /// This intrinsic does not have a stable counterpart.
1199 pub fn volatile_copy_nonoverlapping_memory<T>(dst: *mut T, src: *const T, count: usize);
1200 /// Equivalent to the appropriate `llvm.memmove.p0i8.0i8.*` intrinsic, with
1201 /// a size of `count * size_of::<T>()` and an alignment of
1202 /// `min_align_of::<T>()`
1204 /// The volatile parameter is set to `true`, so it will not be optimized out
1205 /// unless size is equal to zero.
1207 /// This intrinsic does not have a stable counterpart.
1208 pub fn volatile_copy_memory<T>(dst: *mut T, src: *const T, count: usize);
1209 /// Equivalent to the appropriate `llvm.memset.p0i8.*` intrinsic, with a
1210 /// size of `count * size_of::<T>()` and an alignment of
1211 /// `min_align_of::<T>()`.
1213 /// The volatile parameter is set to `true`, so it will not be optimized out
1214 /// unless size is equal to zero.
1216 /// This intrinsic does not have a stable counterpart.
1217 pub fn volatile_set_memory<T>(dst: *mut T, val: u8, count: usize);
1219 /// Performs a volatile load from the `src` pointer.
1221 /// The stabilized version of this intrinsic is [`core::ptr::read_volatile`].
1222 pub fn volatile_load<T>(src: *const T) -> T;
1223 /// Performs a volatile store to the `dst` pointer.
1225 /// The stabilized version of this intrinsic is [`core::ptr::write_volatile`].
1226 pub fn volatile_store<T>(dst: *mut T, val: T);
1228 /// Performs a volatile load from the `src` pointer
1229 /// The pointer is not required to be aligned.
1231 /// This intrinsic does not have a stable counterpart.
1232 pub fn unaligned_volatile_load<T>(src: *const T) -> T;
1233 /// Performs a volatile store to the `dst` pointer.
1234 /// The pointer is not required to be aligned.
1236 /// This intrinsic does not have a stable counterpart.
1237 pub fn unaligned_volatile_store<T>(dst: *mut T, val: T);
1239 /// Returns the square root of an `f32`
1241 /// The stabilized version of this intrinsic is
1242 /// [`f32::sqrt`](../../std/primitive.f32.html#method.sqrt)
1243 pub fn sqrtf32(x: f32) -> f32;
1244 /// Returns the square root of an `f64`
1246 /// The stabilized version of this intrinsic is
1247 /// [`f64::sqrt`](../../std/primitive.f64.html#method.sqrt)
1248 pub fn sqrtf64(x: f64) -> f64;
1250 /// Raises an `f32` to an integer power.
1252 /// The stabilized version of this intrinsic is
1253 /// [`f32::powi`](../../std/primitive.f32.html#method.powi)
1254 pub fn powif32(a: f32, x: i32) -> f32;
1255 /// Raises an `f64` to an integer power.
1257 /// The stabilized version of this intrinsic is
1258 /// [`f64::powi`](../../std/primitive.f64.html#method.powi)
1259 pub fn powif64(a: f64, x: i32) -> f64;
1261 /// Returns the sine of an `f32`.
1263 /// The stabilized version of this intrinsic is
1264 /// [`f32::sin`](../../std/primitive.f32.html#method.sin)
1265 pub fn sinf32(x: f32) -> f32;
1266 /// Returns the sine of an `f64`.
1268 /// The stabilized version of this intrinsic is
1269 /// [`f64::sin`](../../std/primitive.f64.html#method.sin)
1270 pub fn sinf64(x: f64) -> f64;
1272 /// Returns the cosine of an `f32`.
1274 /// The stabilized version of this intrinsic is
1275 /// [`f32::cos`](../../std/primitive.f32.html#method.cos)
1276 pub fn cosf32(x: f32) -> f32;
1277 /// Returns the cosine of an `f64`.
1279 /// The stabilized version of this intrinsic is
1280 /// [`f64::cos`](../../std/primitive.f64.html#method.cos)
1281 pub fn cosf64(x: f64) -> f64;
1283 /// Raises an `f32` to an `f32` power.
1285 /// The stabilized version of this intrinsic is
1286 /// [`f32::powf`](../../std/primitive.f32.html#method.powf)
1287 pub fn powf32(a: f32, x: f32) -> f32;
1288 /// Raises an `f64` to an `f64` power.
1290 /// The stabilized version of this intrinsic is
1291 /// [`f64::powf`](../../std/primitive.f64.html#method.powf)
1292 pub fn powf64(a: f64, x: f64) -> f64;
1294 /// Returns the exponential of an `f32`.
1296 /// The stabilized version of this intrinsic is
1297 /// [`f32::exp`](../../std/primitive.f32.html#method.exp)
1298 pub fn expf32(x: f32) -> f32;
1299 /// Returns the exponential of an `f64`.
1301 /// The stabilized version of this intrinsic is
1302 /// [`f64::exp`](../../std/primitive.f64.html#method.exp)
1303 pub fn expf64(x: f64) -> f64;
1305 /// Returns 2 raised to the power of an `f32`.
1307 /// The stabilized version of this intrinsic is
1308 /// [`f32::exp2`](../../std/primitive.f32.html#method.exp2)
1309 pub fn exp2f32(x: f32) -> f32;
1310 /// Returns 2 raised to the power of an `f64`.
1312 /// The stabilized version of this intrinsic is
1313 /// [`f64::exp2`](../../std/primitive.f64.html#method.exp2)
1314 pub fn exp2f64(x: f64) -> f64;
1316 /// Returns the natural logarithm of an `f32`.
1318 /// The stabilized version of this intrinsic is
1319 /// [`f32::ln`](../../std/primitive.f32.html#method.ln)
1320 pub fn logf32(x: f32) -> f32;
1321 /// Returns the natural logarithm of an `f64`.
1323 /// The stabilized version of this intrinsic is
1324 /// [`f64::ln`](../../std/primitive.f64.html#method.ln)
1325 pub fn logf64(x: f64) -> f64;
1327 /// Returns the base 10 logarithm of an `f32`.
1329 /// The stabilized version of this intrinsic is
1330 /// [`f32::log10`](../../std/primitive.f32.html#method.log10)
1331 pub fn log10f32(x: f32) -> f32;
1332 /// Returns the base 10 logarithm of an `f64`.
1334 /// The stabilized version of this intrinsic is
1335 /// [`f64::log10`](../../std/primitive.f64.html#method.log10)
1336 pub fn log10f64(x: f64) -> f64;
1338 /// Returns the base 2 logarithm of an `f32`.
1340 /// The stabilized version of this intrinsic is
1341 /// [`f32::log2`](../../std/primitive.f32.html#method.log2)
1342 pub fn log2f32(x: f32) -> f32;
1343 /// Returns the base 2 logarithm of an `f64`.
1345 /// The stabilized version of this intrinsic is
1346 /// [`f64::log2`](../../std/primitive.f64.html#method.log2)
1347 pub fn log2f64(x: f64) -> f64;
1349 /// Returns `a * b + c` for `f32` values.
1351 /// The stabilized version of this intrinsic is
1352 /// [`f32::mul_add`](../../std/primitive.f32.html#method.mul_add)
1353 pub fn fmaf32(a: f32, b: f32, c: f32) -> f32;
1354 /// Returns `a * b + c` for `f64` values.
1356 /// The stabilized version of this intrinsic is
1357 /// [`f64::mul_add`](../../std/primitive.f64.html#method.mul_add)
1358 pub fn fmaf64(a: f64, b: f64, c: f64) -> f64;
1360 /// Returns the absolute value of an `f32`.
1362 /// The stabilized version of this intrinsic is
1363 /// [`f32::abs`](../../std/primitive.f32.html#method.abs)
1364 pub fn fabsf32(x: f32) -> f32;
1365 /// Returns the absolute value of an `f64`.
1367 /// The stabilized version of this intrinsic is
1368 /// [`f64::abs`](../../std/primitive.f64.html#method.abs)
1369 pub fn fabsf64(x: f64) -> f64;
1371 /// Returns the minimum of two `f32` values.
1373 /// Note that, unlike most intrinsics, this is safe to call;
1374 /// it does not require an `unsafe` block.
1375 /// Therefore, implementations must not require the user to uphold
1376 /// any safety invariants.
1378 /// The stabilized version of this intrinsic is
1380 pub fn minnumf32(x: f32, y: f32) -> f32;
1381 /// Returns the minimum of two `f64` values.
1383 /// Note that, unlike most intrinsics, this is safe to call;
1384 /// it does not require an `unsafe` block.
1385 /// Therefore, implementations must not require the user to uphold
1386 /// any safety invariants.
1388 /// The stabilized version of this intrinsic is
1390 pub fn minnumf64(x: f64, y: f64) -> f64;
1391 /// Returns the maximum of two `f32` values.
1393 /// Note that, unlike most intrinsics, this is safe to call;
1394 /// it does not require an `unsafe` block.
1395 /// Therefore, implementations must not require the user to uphold
1396 /// any safety invariants.
1398 /// The stabilized version of this intrinsic is
1400 pub fn maxnumf32(x: f32, y: f32) -> f32;
1401 /// Returns the maximum of two `f64` values.
1403 /// Note that, unlike most intrinsics, this is safe to call;
1404 /// it does not require an `unsafe` block.
1405 /// Therefore, implementations must not require the user to uphold
1406 /// any safety invariants.
1408 /// The stabilized version of this intrinsic is
1410 pub fn maxnumf64(x: f64, y: f64) -> f64;
1412 /// Copies the sign from `y` to `x` for `f32` values.
1414 /// The stabilized version of this intrinsic is
1415 /// [`f32::copysign`](../../std/primitive.f32.html#method.copysign)
1416 pub fn copysignf32(x: f32, y: f32) -> f32;
1417 /// Copies the sign from `y` to `x` for `f64` values.
1419 /// The stabilized version of this intrinsic is
1420 /// [`f64::copysign`](../../std/primitive.f64.html#method.copysign)
1421 pub fn copysignf64(x: f64, y: f64) -> f64;
1423 /// Returns the largest integer less than or equal to an `f32`.
1425 /// The stabilized version of this intrinsic is
1426 /// [`f32::floor`](../../std/primitive.f32.html#method.floor)
1427 pub fn floorf32(x: f32) -> f32;
1428 /// Returns the largest integer less than or equal to an `f64`.
1430 /// The stabilized version of this intrinsic is
1431 /// [`f64::floor`](../../std/primitive.f64.html#method.floor)
1432 pub fn floorf64(x: f64) -> f64;
1434 /// Returns the smallest integer greater than or equal to an `f32`.
1436 /// The stabilized version of this intrinsic is
1437 /// [`f32::ceil`](../../std/primitive.f32.html#method.ceil)
1438 pub fn ceilf32(x: f32) -> f32;
1439 /// Returns the smallest integer greater than or equal to an `f64`.
1441 /// The stabilized version of this intrinsic is
1442 /// [`f64::ceil`](../../std/primitive.f64.html#method.ceil)
1443 pub fn ceilf64(x: f64) -> f64;
1445 /// Returns the integer part of an `f32`.
1447 /// The stabilized version of this intrinsic is
1448 /// [`f32::trunc`](../../std/primitive.f32.html#method.trunc)
1449 pub fn truncf32(x: f32) -> f32;
1450 /// Returns the integer part of an `f64`.
1452 /// The stabilized version of this intrinsic is
1453 /// [`f64::trunc`](../../std/primitive.f64.html#method.trunc)
1454 pub fn truncf64(x: f64) -> f64;
1456 /// Returns the nearest integer to an `f32`. May raise an inexact floating-point exception
1457 /// if the argument is not an integer.
1458 pub fn rintf32(x: f32) -> f32;
1459 /// Returns the nearest integer to an `f64`. May raise an inexact floating-point exception
1460 /// if the argument is not an integer.
1461 pub fn rintf64(x: f64) -> f64;
1463 /// Returns the nearest integer to an `f32`.
1465 /// This intrinsic does not have a stable counterpart.
1466 pub fn nearbyintf32(x: f32) -> f32;
1467 /// Returns the nearest integer to an `f64`.
1469 /// This intrinsic does not have a stable counterpart.
1470 pub fn nearbyintf64(x: f64) -> f64;
1472 /// Returns the nearest integer to an `f32`. Rounds half-way cases away from zero.
1474 /// The stabilized version of this intrinsic is
1475 /// [`f32::round`](../../std/primitive.f32.html#method.round)
1476 pub fn roundf32(x: f32) -> f32;
1477 /// Returns the nearest integer to an `f64`. Rounds half-way cases away from zero.
1479 /// The stabilized version of this intrinsic is
1480 /// [`f64::round`](../../std/primitive.f64.html#method.round)
1481 pub fn roundf64(x: f64) -> f64;
1483 /// Float addition that allows optimizations based on algebraic rules.
1484 /// May assume inputs are finite.
1486 /// This intrinsic does not have a stable counterpart.
1487 pub fn fadd_fast<T: Copy>(a: T, b: T) -> T;
1489 /// Float subtraction that allows optimizations based on algebraic rules.
1490 /// May assume inputs are finite.
1492 /// This intrinsic does not have a stable counterpart.
1493 pub fn fsub_fast<T: Copy>(a: T, b: T) -> T;
1495 /// Float multiplication that allows optimizations based on algebraic rules.
1496 /// May assume inputs are finite.
1498 /// This intrinsic does not have a stable counterpart.
1499 pub fn fmul_fast<T: Copy>(a: T, b: T) -> T;
1501 /// Float division that allows optimizations based on algebraic rules.
1502 /// May assume inputs are finite.
1504 /// This intrinsic does not have a stable counterpart.
1505 pub fn fdiv_fast<T: Copy>(a: T, b: T) -> T;
1507 /// Float remainder that allows optimizations based on algebraic rules.
1508 /// May assume inputs are finite.
1510 /// This intrinsic does not have a stable counterpart.
1511 pub fn frem_fast<T: Copy>(a: T, b: T) -> T;
1513 /// Convert with LLVM’s fptoui/fptosi, which may return undef for values out of range
1514 /// (<https://github.com/rust-lang/rust/issues/10184>)
1516 /// Stabilized as [`f32::to_int_unchecked`] and [`f64::to_int_unchecked`].
1517 pub fn float_to_int_unchecked<Float: Copy, Int: Copy>(value: Float) -> Int;
1519 /// Returns the number of bits set in an integer type `T`
1521 /// Note that, unlike most intrinsics, this is safe to call;
1522 /// it does not require an `unsafe` block.
1523 /// Therefore, implementations must not require the user to uphold
1524 /// any safety invariants.
1526 /// The stabilized versions of this intrinsic are available on the integer
1527 /// primitives via the `count_ones` method. For example,
1528 /// [`u32::count_ones`]
1529 #[rustc_const_stable(feature = "const_ctpop", since = "1.40.0")]
1530 pub fn ctpop<T: Copy>(x: T) -> T;
1532 /// Returns the number of leading unset bits (zeroes) in an integer type `T`.
1534 /// Note that, unlike most intrinsics, this is safe to call;
1535 /// it does not require an `unsafe` block.
1536 /// Therefore, implementations must not require the user to uphold
1537 /// any safety invariants.
1539 /// The stabilized versions of this intrinsic are available on the integer
1540 /// primitives via the `leading_zeros` method. For example,
1541 /// [`u32::leading_zeros`]
1546 /// #![feature(core_intrinsics)]
1548 /// use std::intrinsics::ctlz;
1550 /// let x = 0b0001_1100_u8;
1551 /// let num_leading = ctlz(x);
1552 /// assert_eq!(num_leading, 3);
1555 /// An `x` with value `0` will return the bit width of `T`.
1558 /// #![feature(core_intrinsics)]
1560 /// use std::intrinsics::ctlz;
1563 /// let num_leading = ctlz(x);
1564 /// assert_eq!(num_leading, 16);
1566 #[rustc_const_stable(feature = "const_ctlz", since = "1.40.0")]
1567 pub fn ctlz<T: Copy>(x: T) -> T;
1569 /// Like `ctlz`, but extra-unsafe as it returns `undef` when
1570 /// given an `x` with value `0`.
1572 /// This intrinsic does not have a stable counterpart.
1577 /// #![feature(core_intrinsics)]
1579 /// use std::intrinsics::ctlz_nonzero;
1581 /// let x = 0b0001_1100_u8;
1582 /// let num_leading = unsafe { ctlz_nonzero(x) };
1583 /// assert_eq!(num_leading, 3);
1585 #[rustc_const_stable(feature = "constctlz", since = "1.50.0")]
1586 pub fn ctlz_nonzero<T: Copy>(x: T) -> T;
1588 /// Returns the number of trailing unset bits (zeroes) in an integer type `T`.
1590 /// Note that, unlike most intrinsics, this is safe to call;
1591 /// it does not require an `unsafe` block.
1592 /// Therefore, implementations must not require the user to uphold
1593 /// any safety invariants.
1595 /// The stabilized versions of this intrinsic are available on the integer
1596 /// primitives via the `trailing_zeros` method. For example,
1597 /// [`u32::trailing_zeros`]
1602 /// #![feature(core_intrinsics)]
1604 /// use std::intrinsics::cttz;
1606 /// let x = 0b0011_1000_u8;
1607 /// let num_trailing = cttz(x);
1608 /// assert_eq!(num_trailing, 3);
1611 /// An `x` with value `0` will return the bit width of `T`:
1614 /// #![feature(core_intrinsics)]
1616 /// use std::intrinsics::cttz;
1619 /// let num_trailing = cttz(x);
1620 /// assert_eq!(num_trailing, 16);
1622 #[rustc_const_stable(feature = "const_cttz", since = "1.40.0")]
1623 pub fn cttz<T: Copy>(x: T) -> T;
1625 /// Like `cttz`, but extra-unsafe as it returns `undef` when
1626 /// given an `x` with value `0`.
1628 /// This intrinsic does not have a stable counterpart.
1633 /// #![feature(core_intrinsics)]
1635 /// use std::intrinsics::cttz_nonzero;
1637 /// let x = 0b0011_1000_u8;
1638 /// let num_trailing = unsafe { cttz_nonzero(x) };
1639 /// assert_eq!(num_trailing, 3);
1641 #[rustc_const_stable(feature = "const_cttz", since = "1.53.0")]
1642 pub fn cttz_nonzero<T: Copy>(x: T) -> T;
1644 /// Reverses the bytes in an integer type `T`.
1646 /// Note that, unlike most intrinsics, this is safe to call;
1647 /// it does not require an `unsafe` block.
1648 /// Therefore, implementations must not require the user to uphold
1649 /// any safety invariants.
1651 /// The stabilized versions of this intrinsic are available on the integer
1652 /// primitives via the `swap_bytes` method. For example,
1653 /// [`u32::swap_bytes`]
1654 #[rustc_const_stable(feature = "const_bswap", since = "1.40.0")]
1655 pub fn bswap<T: Copy>(x: T) -> T;
1657 /// Reverses the bits in an integer type `T`.
1659 /// Note that, unlike most intrinsics, this is safe to call;
1660 /// it does not require an `unsafe` block.
1661 /// Therefore, implementations must not require the user to uphold
1662 /// any safety invariants.
1664 /// The stabilized versions of this intrinsic are available on the integer
1665 /// primitives via the `reverse_bits` method. For example,
1666 /// [`u32::reverse_bits`]
1667 #[rustc_const_stable(feature = "const_bitreverse", since = "1.40.0")]
1668 pub fn bitreverse<T: Copy>(x: T) -> T;
1670 /// Performs checked integer addition.
1672 /// Note that, unlike most intrinsics, this is safe to call;
1673 /// it does not require an `unsafe` block.
1674 /// Therefore, implementations must not require the user to uphold
1675 /// any safety invariants.
1677 /// The stabilized versions of this intrinsic are available on the integer
1678 /// primitives via the `overflowing_add` method. For example,
1679 /// [`u32::overflowing_add`]
1680 #[rustc_const_stable(feature = "const_int_overflow", since = "1.40.0")]
1681 pub fn add_with_overflow<T: Copy>(x: T, y: T) -> (T, bool);
1683 /// Performs checked integer subtraction
1685 /// Note that, unlike most intrinsics, this is safe to call;
1686 /// it does not require an `unsafe` block.
1687 /// Therefore, implementations must not require the user to uphold
1688 /// any safety invariants.
1690 /// The stabilized versions of this intrinsic are available on the integer
1691 /// primitives via the `overflowing_sub` method. For example,
1692 /// [`u32::overflowing_sub`]
1693 #[rustc_const_stable(feature = "const_int_overflow", since = "1.40.0")]
1694 pub fn sub_with_overflow<T: Copy>(x: T, y: T) -> (T, bool);
1696 /// Performs checked integer multiplication
1698 /// Note that, unlike most intrinsics, this is safe to call;
1699 /// it does not require an `unsafe` block.
1700 /// Therefore, implementations must not require the user to uphold
1701 /// any safety invariants.
1703 /// The stabilized versions of this intrinsic are available on the integer
1704 /// primitives via the `overflowing_mul` method. For example,
1705 /// [`u32::overflowing_mul`]
1706 #[rustc_const_stable(feature = "const_int_overflow", since = "1.40.0")]
1707 pub fn mul_with_overflow<T: Copy>(x: T, y: T) -> (T, bool);
1709 /// Performs an exact division, resulting in undefined behavior where
1710 /// `x % y != 0` or `y == 0` or `x == T::MIN && y == -1`
1712 /// This intrinsic does not have a stable counterpart.
1713 pub fn exact_div<T: Copy>(x: T, y: T) -> T;
1715 /// Performs an unchecked division, resulting in undefined behavior
1716 /// where `y == 0` or `x == T::MIN && y == -1`
1718 /// Safe wrappers for this intrinsic are available on the integer
1719 /// primitives via the `checked_div` method. For example,
1720 /// [`u32::checked_div`]
1721 #[rustc_const_stable(feature = "const_int_unchecked_arith", since = "1.52.0")]
1722 pub fn unchecked_div<T: Copy>(x: T, y: T) -> T;
1723 /// Returns the remainder of an unchecked division, resulting in
1724 /// undefined behavior when `y == 0` or `x == T::MIN && y == -1`
1726 /// Safe wrappers for this intrinsic are available on the integer
1727 /// primitives via the `checked_rem` method. For example,
1728 /// [`u32::checked_rem`]
1729 #[rustc_const_stable(feature = "const_int_unchecked_arith", since = "1.52.0")]
1730 pub fn unchecked_rem<T: Copy>(x: T, y: T) -> T;
1732 /// Performs an unchecked left shift, resulting in undefined behavior when
1733 /// `y < 0` or `y >= N`, where N is the width of T in bits.
1735 /// Safe wrappers for this intrinsic are available on the integer
1736 /// primitives via the `checked_shl` method. For example,
1737 /// [`u32::checked_shl`]
1738 #[rustc_const_stable(feature = "const_int_unchecked", since = "1.40.0")]
1739 pub fn unchecked_shl<T: Copy>(x: T, y: T) -> T;
1740 /// Performs an unchecked right shift, resulting in undefined behavior when
1741 /// `y < 0` or `y >= N`, where N is the width of T in bits.
1743 /// Safe wrappers for this intrinsic are available on the integer
1744 /// primitives via the `checked_shr` method. For example,
1745 /// [`u32::checked_shr`]
1746 #[rustc_const_stable(feature = "const_int_unchecked", since = "1.40.0")]
1747 pub fn unchecked_shr<T: Copy>(x: T, y: T) -> T;
1749 /// Returns the result of an unchecked addition, resulting in
1750 /// undefined behavior when `x + y > T::MAX` or `x + y < T::MIN`.
1752 /// This intrinsic does not have a stable counterpart.
1753 #[rustc_const_unstable(feature = "const_int_unchecked_arith", issue = "none")]
1754 pub fn unchecked_add<T: Copy>(x: T, y: T) -> T;
1756 /// Returns the result of an unchecked subtraction, resulting in
1757 /// undefined behavior when `x - y > T::MAX` or `x - y < T::MIN`.
1759 /// This intrinsic does not have a stable counterpart.
1760 #[rustc_const_unstable(feature = "const_int_unchecked_arith", issue = "none")]
1761 pub fn unchecked_sub<T: Copy>(x: T, y: T) -> T;
1763 /// Returns the result of an unchecked multiplication, resulting in
1764 /// undefined behavior when `x * y > T::MAX` or `x * y < T::MIN`.
1766 /// This intrinsic does not have a stable counterpart.
1767 #[rustc_const_unstable(feature = "const_int_unchecked_arith", issue = "none")]
1768 pub fn unchecked_mul<T: Copy>(x: T, y: T) -> T;
1770 /// Performs rotate left.
1772 /// Note that, unlike most intrinsics, this is safe to call;
1773 /// it does not require an `unsafe` block.
1774 /// Therefore, implementations must not require the user to uphold
1775 /// any safety invariants.
1777 /// The stabilized versions of this intrinsic are available on the integer
1778 /// primitives via the `rotate_left` method. For example,
1779 /// [`u32::rotate_left`]
1780 #[rustc_const_stable(feature = "const_int_rotate", since = "1.40.0")]
1781 pub fn rotate_left<T: Copy>(x: T, y: T) -> T;
1783 /// Performs rotate right.
1785 /// Note that, unlike most intrinsics, this is safe to call;
1786 /// it does not require an `unsafe` block.
1787 /// Therefore, implementations must not require the user to uphold
1788 /// any safety invariants.
1790 /// The stabilized versions of this intrinsic are available on the integer
1791 /// primitives via the `rotate_right` method. For example,
1792 /// [`u32::rotate_right`]
1793 #[rustc_const_stable(feature = "const_int_rotate", since = "1.40.0")]
1794 pub fn rotate_right<T: Copy>(x: T, y: T) -> T;
1796 /// Returns (a + b) mod 2<sup>N</sup>, where N is the width of T in bits.
1798 /// Note that, unlike most intrinsics, this is safe to call;
1799 /// it does not require an `unsafe` block.
1800 /// Therefore, implementations must not require the user to uphold
1801 /// any safety invariants.
1803 /// The stabilized versions of this intrinsic are available on the integer
1804 /// primitives via the `wrapping_add` method. For example,
1805 /// [`u32::wrapping_add`]
1806 #[rustc_const_stable(feature = "const_int_wrapping", since = "1.40.0")]
1807 pub fn wrapping_add<T: Copy>(a: T, b: T) -> T;
1808 /// Returns (a - b) mod 2<sup>N</sup>, where N is the width of T in bits.
1810 /// Note that, unlike most intrinsics, this is safe to call;
1811 /// it does not require an `unsafe` block.
1812 /// Therefore, implementations must not require the user to uphold
1813 /// any safety invariants.
1815 /// The stabilized versions of this intrinsic are available on the integer
1816 /// primitives via the `wrapping_sub` method. For example,
1817 /// [`u32::wrapping_sub`]
1818 #[rustc_const_stable(feature = "const_int_wrapping", since = "1.40.0")]
1819 pub fn wrapping_sub<T: Copy>(a: T, b: T) -> T;
1820 /// Returns (a * b) mod 2<sup>N</sup>, where N is the width of T in bits.
1822 /// Note that, unlike most intrinsics, this is safe to call;
1823 /// it does not require an `unsafe` block.
1824 /// Therefore, implementations must not require the user to uphold
1825 /// any safety invariants.
1827 /// The stabilized versions of this intrinsic are available on the integer
1828 /// primitives via the `wrapping_mul` method. For example,
1829 /// [`u32::wrapping_mul`]
1830 #[rustc_const_stable(feature = "const_int_wrapping", since = "1.40.0")]
1831 pub fn wrapping_mul<T: Copy>(a: T, b: T) -> T;
1833 /// Computes `a + b`, saturating at numeric bounds.
1835 /// Note that, unlike most intrinsics, this is safe to call;
1836 /// it does not require an `unsafe` block.
1837 /// Therefore, implementations must not require the user to uphold
1838 /// any safety invariants.
1840 /// The stabilized versions of this intrinsic are available on the integer
1841 /// primitives via the `saturating_add` method. For example,
1842 /// [`u32::saturating_add`]
1843 #[rustc_const_stable(feature = "const_int_saturating", since = "1.40.0")]
1844 pub fn saturating_add<T: Copy>(a: T, b: T) -> T;
1845 /// Computes `a - b`, saturating at numeric bounds.
1847 /// Note that, unlike most intrinsics, this is safe to call;
1848 /// it does not require an `unsafe` block.
1849 /// Therefore, implementations must not require the user to uphold
1850 /// any safety invariants.
1852 /// The stabilized versions of this intrinsic are available on the integer
1853 /// primitives via the `saturating_sub` method. For example,
1854 /// [`u32::saturating_sub`]
1855 #[rustc_const_stable(feature = "const_int_saturating", since = "1.40.0")]
1856 pub fn saturating_sub<T: Copy>(a: T, b: T) -> T;
1858 /// Returns the value of the discriminant for the variant in 'v';
1859 /// if `T` has no discriminant, returns `0`.
1861 /// Note that, unlike most intrinsics, this is safe to call;
1862 /// it does not require an `unsafe` block.
1863 /// Therefore, implementations must not require the user to uphold
1864 /// any safety invariants.
1866 /// The stabilized version of this intrinsic is [`core::mem::discriminant`].
1867 #[rustc_const_unstable(feature = "const_discriminant", issue = "69821")]
1868 pub fn discriminant_value<T>(v: &T) -> <T as DiscriminantKind>::Discriminant;
1870 /// Returns the number of variants of the type `T` cast to a `usize`;
1871 /// if `T` has no variants, returns `0`. Uninhabited variants will be counted.
1873 /// Note that, unlike most intrinsics, this is safe to call;
1874 /// it does not require an `unsafe` block.
1875 /// Therefore, implementations must not require the user to uphold
1876 /// any safety invariants.
1878 /// The to-be-stabilized version of this intrinsic is [`mem::variant_count`].
1879 #[rustc_const_unstable(feature = "variant_count", issue = "73662")]
1880 pub fn variant_count<T>() -> usize;
1882 /// Rust's "try catch" construct which invokes the function pointer `try_fn`
1883 /// with the data pointer `data`.
1885 /// The third argument is a function called if a panic occurs. This function
1886 /// takes the data pointer and a pointer to the target-specific exception
1887 /// object that was caught. For more information see the compiler's
1888 /// source as well as std's catch implementation.
1889 pub fn r#try(try_fn: fn(*mut u8), data: *mut u8, catch_fn: fn(*mut u8, *mut u8)) -> i32;
1891 /// Emits a `!nontemporal` store according to LLVM (see their docs).
1892 /// Probably will never become stable.
1893 pub fn nontemporal_store<T>(ptr: *mut T, val: T);
1895 /// See documentation of `<*const T>::offset_from` for details.
1896 #[rustc_const_unstable(feature = "const_ptr_offset_from", issue = "41079")]
1897 pub fn ptr_offset_from<T>(ptr: *const T, base: *const T) -> isize;
1899 /// See documentation of `<*const T>::guaranteed_eq` for details.
1901 /// Note that, unlike most intrinsics, this is safe to call;
1902 /// it does not require an `unsafe` block.
1903 /// Therefore, implementations must not require the user to uphold
1904 /// any safety invariants.
1905 #[rustc_const_unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
1906 pub fn ptr_guaranteed_eq<T>(ptr: *const T, other: *const T) -> bool;
1908 /// See documentation of `<*const T>::guaranteed_ne` for details.
1910 /// Note that, unlike most intrinsics, this is safe to call;
1911 /// it does not require an `unsafe` block.
1912 /// Therefore, implementations must not require the user to uphold
1913 /// any safety invariants.
1914 #[rustc_const_unstable(feature = "const_raw_ptr_comparison", issue = "53020")]
1915 pub fn ptr_guaranteed_ne<T>(ptr: *const T, other: *const T) -> bool;
1917 /// Allocate at compile time. Should not be called at runtime.
1918 #[rustc_const_unstable(feature = "const_heap", issue = "79597")]
1919 pub fn const_allocate(size: usize, align: usize) -> *mut u8;
1921 /// Determines whether the raw bytes of the two values are equal.
1923 /// This is particularly handy for arrays, since it allows things like just
1924 /// comparing `i96`s instead of forcing `alloca`s for `[6 x i16]`.
1926 /// Above some backend-decided threshold this will emit calls to `memcmp`,
1927 /// like slice equality does, instead of causing massive code size.
1931 /// It's UB to call this if any of the *bytes* in `*a` or `*b` are uninitialized.
1932 /// Note that this is a stricter criterion than just the *values* being
1933 /// fully-initialized: if `T` has padding, it's UB to call this intrinsic.
1935 /// (The implementation is allowed to branch on the results of comparisons,
1936 /// which is UB if any of their inputs are `undef`.)
1937 #[rustc_const_unstable(feature = "const_intrinsic_raw_eq", issue = "none")]
1938 pub fn raw_eq<T>(a: &T, b: &T) -> bool;
1940 /// See documentation of [`std::hint::black_box`] for details.
1942 /// [`std::hint::black_box`]: crate::hint::black_box
1943 pub fn black_box<T>(dummy: T) -> T;
1946 // Some functions are defined here because they accidentally got made
1947 // available in this module on stable. See <https://github.com/rust-lang/rust/issues/15702>.
1948 // (`transmute` also falls into this category, but it cannot be wrapped due to the
1949 // check that `T` and `U` have the same size.)
1951 /// Checks whether `ptr` is properly aligned with respect to
1952 /// `align_of::<T>()`.
1953 pub(crate) fn is_aligned_and_not_null<T>(ptr: *const T) -> bool {
1954 !ptr.is_null() && ptr as usize % mem::align_of::<T>() == 0
1957 /// Checks whether the regions of memory starting at `src` and `dst` of size
1958 /// `count * size_of::<T>()` do *not* overlap.
1959 #[cfg(debug_assertions)]
1960 pub(crate) fn is_nonoverlapping<T>(src: *const T, dst: *const T, count: usize) -> bool {
1961 let src_usize = src as usize;
1962 let dst_usize = dst as usize;
1963 let size = mem::size_of::<T>().checked_mul(count).unwrap();
1964 let diff = if src_usize > dst_usize { src_usize - dst_usize } else { dst_usize - src_usize };
1965 // If the absolute distance between the ptrs is at least as big as the size of the buffer,
1966 // they do not overlap.
1970 /// Copies `count * size_of::<T>()` bytes from `src` to `dst`. The source
1971 /// and destination must *not* overlap.
1973 /// For regions of memory which might overlap, use [`copy`] instead.
1975 /// `copy_nonoverlapping` is semantically equivalent to C's [`memcpy`], but
1976 /// with the argument order swapped.
1978 /// [`memcpy`]: https://en.cppreference.com/w/c/string/byte/memcpy
1982 /// Behavior is undefined if any of the following conditions are violated:
1984 /// * `src` must be [valid] for reads of `count * size_of::<T>()` bytes.
1986 /// * `dst` must be [valid] for writes of `count * size_of::<T>()` bytes.
1988 /// * Both `src` and `dst` must be properly aligned.
1990 /// * The region of memory beginning at `src` with a size of `count *
1991 /// size_of::<T>()` bytes must *not* overlap with the region of memory
1992 /// beginning at `dst` with the same size.
1994 /// Like [`read`], `copy_nonoverlapping` creates a bitwise copy of `T`, regardless of
1995 /// whether `T` is [`Copy`]. If `T` is not [`Copy`], using *both* the values
1996 /// in the region beginning at `*src` and the region beginning at `*dst` can
1997 /// [violate memory safety][read-ownership].
1999 /// Note that even if the effectively copied size (`count * size_of::<T>()`) is
2000 /// `0`, the pointers must be non-null and properly aligned.
2002 /// [`read`]: crate::ptr::read
2003 /// [read-ownership]: crate::ptr::read#ownership-of-the-returned-value
2004 /// [valid]: crate::ptr#safety
2008 /// Manually implement [`Vec::append`]:
2013 /// /// Moves all the elements of `src` into `dst`, leaving `src` empty.
2014 /// fn append<T>(dst: &mut Vec<T>, src: &mut Vec<T>) {
2015 /// let src_len = src.len();
2016 /// let dst_len = dst.len();
2018 /// // Ensure that `dst` has enough capacity to hold all of `src`.
2019 /// dst.reserve(src_len);
2022 /// // The call to offset is always safe because `Vec` will never
2023 /// // allocate more than `isize::MAX` bytes.
2024 /// let dst_ptr = dst.as_mut_ptr().offset(dst_len as isize);
2025 /// let src_ptr = src.as_ptr();
2027 /// // Truncate `src` without dropping its contents. We do this first,
2028 /// // to avoid problems in case something further down panics.
2031 /// // The two regions cannot overlap because mutable references do
2032 /// // not alias, and two different vectors cannot own the same
2034 /// ptr::copy_nonoverlapping(src_ptr, dst_ptr, src_len);
2036 /// // Notify `dst` that it now holds the contents of `src`.
2037 /// dst.set_len(dst_len + src_len);
2041 /// let mut a = vec!['r'];
2042 /// let mut b = vec!['u', 's', 't'];
2044 /// append(&mut a, &mut b);
2046 /// assert_eq!(a, &['r', 'u', 's', 't']);
2047 /// assert!(b.is_empty());
2050 /// [`Vec::append`]: ../../std/vec/struct.Vec.html#method.append
2051 #[doc(alias = "memcpy")]
2052 #[stable(feature = "rust1", since = "1.0.0")]
2053 #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")]
2055 pub const unsafe fn copy_nonoverlapping<T>(src: *const T, dst: *mut T, count: usize) {
2056 extern "rust-intrinsic" {
2057 #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")]
2058 pub fn copy_nonoverlapping<T>(src: *const T, dst: *mut T, count: usize);
2061 #[cfg(debug_assertions)]
2062 fn runtime_check<T>(src: *const T, dst: *mut T, count: usize) {
2063 if !is_aligned_and_not_null(src)
2064 || !is_aligned_and_not_null(dst)
2065 || !is_nonoverlapping(src, dst, count)
2067 // Not panicking to keep codegen impact smaller.
2071 #[cfg(debug_assertions)]
2072 const fn compiletime_check<T>(_src: *const T, _dst: *mut T, _count: usize) {}
2073 #[cfg(debug_assertions)]
2074 // SAFETY: As per our safety precondition, we may assume that the `abort` above is never reached.
2075 // Therefore, compiletime_check and runtime_check are observably equivalent.
2077 const_eval_select((src, dst, count), compiletime_check, runtime_check);
2080 // SAFETY: the safety contract for `copy_nonoverlapping` must be
2081 // upheld by the caller.
2082 unsafe { copy_nonoverlapping(src, dst, count) }
2085 /// Copies `count * size_of::<T>()` bytes from `src` to `dst`. The source
2086 /// and destination may overlap.
2088 /// If the source and destination will *never* overlap,
2089 /// [`copy_nonoverlapping`] can be used instead.
2091 /// `copy` is semantically equivalent to C's [`memmove`], but with the argument
2092 /// order swapped. Copying takes place as if the bytes were copied from `src`
2093 /// to a temporary array and then copied from the array to `dst`.
2095 /// [`memmove`]: https://en.cppreference.com/w/c/string/byte/memmove
2099 /// Behavior is undefined if any of the following conditions are violated:
2101 /// * `src` must be [valid] for reads of `count * size_of::<T>()` bytes.
2103 /// * `dst` must be [valid] for writes of `count * size_of::<T>()` bytes.
2105 /// * Both `src` and `dst` must be properly aligned.
2107 /// Like [`read`], `copy` creates a bitwise copy of `T`, regardless of
2108 /// whether `T` is [`Copy`]. If `T` is not [`Copy`], using both the values
2109 /// in the region beginning at `*src` and the region beginning at `*dst` can
2110 /// [violate memory safety][read-ownership].
2112 /// Note that even if the effectively copied size (`count * size_of::<T>()`) is
2113 /// `0`, the pointers must be non-null and properly aligned.
2115 /// [`read`]: crate::ptr::read
2116 /// [read-ownership]: crate::ptr::read#ownership-of-the-returned-value
2117 /// [valid]: crate::ptr#safety
2121 /// Efficiently create a Rust vector from an unsafe buffer:
2128 /// /// * `ptr` must be correctly aligned for its type and non-zero.
2129 /// /// * `ptr` must be valid for reads of `elts` contiguous elements of type `T`.
2130 /// /// * Those elements must not be used after calling this function unless `T: Copy`.
2131 /// # #[allow(dead_code)]
2132 /// unsafe fn from_buf_raw<T>(ptr: *const T, elts: usize) -> Vec<T> {
2133 /// let mut dst = Vec::with_capacity(elts);
2135 /// // SAFETY: Our precondition ensures the source is aligned and valid,
2136 /// // and `Vec::with_capacity` ensures that we have usable space to write them.
2137 /// ptr::copy(ptr, dst.as_mut_ptr(), elts);
2139 /// // SAFETY: We created it with this much capacity earlier,
2140 /// // and the previous `copy` has initialized these elements.
2141 /// dst.set_len(elts);
2145 #[doc(alias = "memmove")]
2146 #[stable(feature = "rust1", since = "1.0.0")]
2147 #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")]
2149 pub const unsafe fn copy<T>(src: *const T, dst: *mut T, count: usize) {
2150 extern "rust-intrinsic" {
2151 #[rustc_const_unstable(feature = "const_intrinsic_copy", issue = "80697")]
2152 fn copy<T>(src: *const T, dst: *mut T, count: usize);
2155 #[cfg(debug_assertions)]
2156 fn runtime_check<T>(src: *const T, dst: *mut T) {
2157 if !is_aligned_and_not_null(src) || !is_aligned_and_not_null(dst) {
2158 // Not panicking to keep codegen impact smaller.
2162 #[cfg(debug_assertions)]
2163 const fn compiletime_check<T>(_src: *const T, _dst: *mut T) {}
2164 #[cfg(debug_assertions)]
2165 // SAFETY: As per our safety precondition, we may assume that the `abort` above is never reached.
2166 // Therefore, compiletime_check and runtime_check are observably equivalent.
2168 const_eval_select((src, dst), compiletime_check, runtime_check);
2171 // SAFETY: the safety contract for `copy` must be upheld by the caller.
2172 unsafe { copy(src, dst, count) }
2175 /// Sets `count * size_of::<T>()` bytes of memory starting at `dst` to
2178 /// `write_bytes` is similar to C's [`memset`], but sets `count *
2179 /// size_of::<T>()` bytes to `val`.
2181 /// [`memset`]: https://en.cppreference.com/w/c/string/byte/memset
2185 /// Behavior is undefined if any of the following conditions are violated:
2187 /// * `dst` must be [valid] for writes of `count * size_of::<T>()` bytes.
2189 /// * `dst` must be properly aligned.
2191 /// Additionally, the caller must ensure that writing `count *
2192 /// size_of::<T>()` bytes to the given region of memory results in a valid
2193 /// value of `T`. Using a region of memory typed as a `T` that contains an
2194 /// invalid value of `T` is undefined behavior.
2196 /// Note that even if the effectively copied size (`count * size_of::<T>()`) is
2197 /// `0`, the pointer must be non-null and properly aligned.
2199 /// [valid]: crate::ptr#safety
2208 /// let mut vec = vec![0u32; 4];
2210 /// let vec_ptr = vec.as_mut_ptr();
2211 /// ptr::write_bytes(vec_ptr, 0xfe, 2);
2213 /// assert_eq!(vec, [0xfefefefe, 0xfefefefe, 0, 0]);
2216 /// Creating an invalid value:
2221 /// let mut v = Box::new(0i32);
2224 /// // Leaks the previously held value by overwriting the `Box<T>` with
2225 /// // a null pointer.
2226 /// ptr::write_bytes(&mut v as *mut Box<i32>, 0, 1);
2229 /// // At this point, using or dropping `v` results in undefined behavior.
2230 /// // drop(v); // ERROR
2232 /// // Even leaking `v` "uses" it, and hence is undefined behavior.
2233 /// // mem::forget(v); // ERROR
2235 /// // In fact, `v` is invalid according to basic type layout invariants, so *any*
2236 /// // operation touching it is undefined behavior.
2237 /// // let v2 = v; // ERROR
2240 /// // Let us instead put in a valid value
2241 /// ptr::write(&mut v as *mut Box<i32>, Box::new(42i32));
2244 /// // Now the box is fine
2245 /// assert_eq!(*v, 42);
2247 #[stable(feature = "rust1", since = "1.0.0")]
2248 #[rustc_const_unstable(feature = "const_ptr_write", issue = "86302")]
2250 pub const unsafe fn write_bytes<T>(dst: *mut T, val: u8, count: usize) {
2251 extern "rust-intrinsic" {
2252 #[rustc_const_unstable(feature = "const_ptr_write", issue = "86302")]
2253 fn write_bytes<T>(dst: *mut T, val: u8, count: usize);
2256 #[cfg(debug_assertions)]
2257 fn runtime_check<T>(ptr: *mut T) {
2259 is_aligned_and_not_null(ptr),
2260 "attempt to write to unaligned or null pointer"
2263 #[cfg(debug_assertions)]
2264 const fn compiletime_check<T>(_ptr: *mut T) {}
2265 #[cfg(debug_assertions)]
2266 // SAFETY: runtime debug-assertions are a best-effort basis; it's fine to
2267 // not do them during compile time
2269 const_eval_select((dst,), compiletime_check, runtime_check);
2272 // SAFETY: the safety contract for `write_bytes` must be upheld by the caller.
2273 unsafe { write_bytes(dst, val, count) }
2276 /// Selects which function to call depending on the context.
2278 /// If this function is evaluated at compile-time, then a call to this
2279 /// intrinsic will be replaced with a call to `called_in_const`. It gets
2280 /// replaced with a call to `called_at_rt` otherwise.
2282 /// # Type Requirements
2284 /// The two functions must be both function items. They cannot be function
2285 /// pointers or closures.
2287 /// `arg` will be the arguments that will be passed to either one of the
2288 /// two functions, therefore, both functions must accept the same type of
2289 /// arguments. Both functions must return RET.
2293 /// The two functions must behave observably equivalent. Safe code in other
2294 /// crates may assume that calling a `const fn` at compile-time and at run-time
2295 /// produces the same result. A function that produces a different result when
2296 /// evaluated at run-time, or has any other observable side-effects, is
2299 /// Here is an example of how this could cause a problem:
2301 /// #![feature(const_eval_select)]
2302 /// use std::hint::unreachable_unchecked;
2303 /// use std::intrinsics::const_eval_select;
2306 /// pub const fn inconsistent() -> i32 {
2307 /// fn runtime() -> i32 { 1 }
2308 /// const fn compiletime() -> i32 { 2 }
2311 // // ⚠ This code violates the required equivalence of `compiletime`
2312 /// // and `runtime`.
2313 /// const_eval_select((), compiletime, runtime)
2318 /// const X: i32 = inconsistent();
2319 /// let x = inconsistent();
2320 /// if x != X { unsafe { unreachable_unchecked(); }}
2323 /// This code causes Undefined Behavior when being run, since the
2324 /// `unreachable_unchecked` is actually being reached. The bug is in *crate A*,
2325 /// which violates the principle that a `const fn` must behave the same at
2326 /// compile-time and at run-time. The unsafe code in crate B is fine.
2328 feature = "const_eval_select",
2330 reason = "const_eval_select will never be stable"
2332 #[rustc_const_unstable(feature = "const_eval_select", issue = "none")]
2333 #[lang = "const_eval_select"]
2334 #[rustc_do_not_const_check]
2335 pub const unsafe fn const_eval_select<ARG, F, G, RET>(
2337 _called_in_const: F,
2341 F: ~const FnOnce<ARG, Output = RET>,
2342 G: FnOnce<ARG, Output = RET> + ~const Drop,
2344 called_at_rt.call_once(arg)
2348 feature = "const_eval_select",
2350 reason = "const_eval_select will never be stable"
2352 #[rustc_const_unstable(feature = "const_eval_select", issue = "none")]
2353 #[lang = "const_eval_select_ct"]
2354 pub const unsafe fn const_eval_select_ct<ARG, F, G, RET>(
2360 F: ~const FnOnce<ARG, Output = RET>,
2361 G: FnOnce<ARG, Output = RET> + ~const Drop,
2363 called_in_const.call_once(arg)