1 //! This module contains the LLVM intrinsics bindings that provide the functionality for this
4 //! The LLVM assembly language is documented here: <https://llvm.org/docs/LangRef.html>
6 /// These intrinsics aren't linked directly from LLVM and are mostly undocumented, however they are
7 /// simply lowered to the matching LLVM instructions by the compiler. The associated instruction
8 /// is documented alongside each intrinsic.
9 extern "platform-intrinsic" {
11 pub(crate) fn simd_add<T>(x: T, y: T) -> T;
14 pub(crate) fn simd_sub<T>(x: T, y: T) -> T;
17 pub(crate) fn simd_mul<T>(x: T, y: T) -> T;
20 pub(crate) fn simd_div<T>(x: T, y: T) -> T;
23 pub(crate) fn simd_rem<T>(x: T, y: T) -> T;
26 pub(crate) fn simd_shl<T>(x: T, y: T) -> T;
29 pub(crate) fn simd_shr<T>(x: T, y: T) -> T;
32 pub(crate) fn simd_and<T>(x: T, y: T) -> T;
35 pub(crate) fn simd_or<T>(x: T, y: T) -> T;
38 pub(crate) fn simd_xor<T>(x: T, y: T) -> T;
40 /// fptoui/fptosi/uitofp/sitofp
41 pub(crate) fn simd_cast<T, U>(x: T) -> U;
42 /// follows Rust's `T as U` semantics, including saturating float casts
43 /// which amounts to the same as `simd_cast` for many cases
44 #[cfg(not(bootstrap))]
45 pub(crate) fn simd_as<T, U>(x: T) -> U;
48 pub(crate) fn simd_neg<T>(x: T) -> T;
51 pub(crate) fn simd_fabs<T>(x: T) -> T;
54 pub(crate) fn simd_fmin<T>(x: T, y: T) -> T;
55 pub(crate) fn simd_fmax<T>(x: T, y: T) -> T;
57 pub(crate) fn simd_eq<T, U>(x: T, y: T) -> U;
58 pub(crate) fn simd_ne<T, U>(x: T, y: T) -> U;
59 pub(crate) fn simd_lt<T, U>(x: T, y: T) -> U;
60 pub(crate) fn simd_le<T, U>(x: T, y: T) -> U;
61 pub(crate) fn simd_gt<T, U>(x: T, y: T) -> U;
62 pub(crate) fn simd_ge<T, U>(x: T, y: T) -> U;
65 pub(crate) fn simd_shuffle<T, U, V>(x: T, y: T, idx: U) -> V;
67 pub(crate) fn simd_gather<T, U, V>(val: T, ptr: U, mask: V) -> T;
68 pub(crate) fn simd_scatter<T, U, V>(val: T, ptr: U, mask: V);
71 pub(crate) fn simd_saturating_add<T>(x: T, y: T) -> T;
74 pub(crate) fn simd_saturating_sub<T>(x: T, y: T) -> T;
77 pub(crate) fn simd_reduce_add_ordered<T, U>(x: T, y: U) -> U;
78 pub(crate) fn simd_reduce_mul_ordered<T, U>(x: T, y: U) -> U;
80 pub(crate) fn simd_reduce_all<T>(x: T) -> bool;
82 pub(crate) fn simd_reduce_any<T>(x: T) -> bool;
83 pub(crate) fn simd_reduce_max<T, U>(x: T) -> U;
84 pub(crate) fn simd_reduce_min<T, U>(x: T) -> U;
85 pub(crate) fn simd_reduce_and<T, U>(x: T) -> U;
86 pub(crate) fn simd_reduce_or<T, U>(x: T) -> U;
87 pub(crate) fn simd_reduce_xor<T, U>(x: T) -> U;
89 // truncate integer vector to bitmask
91 pub(crate) fn simd_bitmask<T, U>(x: T) -> U;
94 pub(crate) fn simd_select<M, T>(m: M, a: T, b: T) -> T;
96 pub(crate) fn simd_select_bitmask<M, T>(m: M, a: T, b: T) -> T;