expose ordered/unordered/nanless intirnsics
This commit is contained in:
parent
01cc5b3e19
commit
07ce659dd0
5 changed files with 210 additions and 237 deletions
|
|
@ -39,10 +39,14 @@ struct b8x16(
|
|||
);
|
||||
|
||||
extern "platform-intrinsic" {
|
||||
fn simd_reduce_add<T, U>(x: T) -> U;
|
||||
fn simd_reduce_mul<T, U>(x: T) -> U;
|
||||
fn simd_reduce_add_unordered<T, U>(x: T) -> U;
|
||||
fn simd_reduce_mul_unordered<T, U>(x: T) -> U;
|
||||
fn simd_reduce_add_ordered<T, U>(x: T, acc: U) -> U;
|
||||
fn simd_reduce_mul_ordered<T, U>(x: T, acc: U) -> U;
|
||||
fn simd_reduce_min<T, U>(x: T) -> U;
|
||||
fn simd_reduce_max<T, U>(x: T) -> U;
|
||||
fn simd_reduce_min_nanless<T, U>(x: T) -> U;
|
||||
fn simd_reduce_max_nanless<T, U>(x: T) -> U;
|
||||
fn simd_reduce_and<T, U>(x: T) -> U;
|
||||
fn simd_reduce_or<T, U>(x: T) -> U;
|
||||
fn simd_reduce_xor<T, U>(x: T) -> U;
|
||||
|
|
@ -53,91 +57,113 @@ extern "platform-intrinsic" {
|
|||
fn main() {
|
||||
unsafe {
|
||||
let x = i32x4(1, -2, 3, 4);
|
||||
let r: i32 = simd_reduce_add(x);
|
||||
assert!(r == 6_i32);
|
||||
let r: i32 = simd_reduce_mul(x);
|
||||
assert!(r == -24_i32);
|
||||
let r: i32 = simd_reduce_add_unordered(x);
|
||||
assert_eq!(r, 6_i32);
|
||||
let r: i32 = simd_reduce_mul_unordered(x);
|
||||
assert_eq!(r, -24_i32);
|
||||
let r: i32 = simd_reduce_add_ordered(x, -1);
|
||||
assert_eq!(r, 5_i32);
|
||||
let r: i32 = simd_reduce_mul_ordered(x, -1);
|
||||
assert_eq!(r, 24_i32);
|
||||
|
||||
let r: i32 = simd_reduce_min(x);
|
||||
assert!(r == -21_i32);
|
||||
assert_eq!(r, -2_i32);
|
||||
let r: i32 = simd_reduce_max(x);
|
||||
assert!(r == 4_i32);
|
||||
assert_eq!(r, 4_i32);
|
||||
|
||||
let x = i32x4(-1, -1, -1, -1);
|
||||
let r: i32 = simd_reduce_and(x);
|
||||
assert!(r == -1_i32);
|
||||
assert_eq!(r, -1_i32);
|
||||
let r: i32 = simd_reduce_or(x);
|
||||
assert!(r == -1_i32);
|
||||
assert_eq!(r, -1_i32);
|
||||
let r: i32 = simd_reduce_xor(x);
|
||||
assert!(r == 0_i32);
|
||||
assert_eq!(r, 0_i32);
|
||||
|
||||
let x = i32x4(-1, -1, 0, -1);
|
||||
let r: i32 = simd_reduce_and(x);
|
||||
assert!(r == 0_i32);
|
||||
assert_eq!(r, 0_i32);
|
||||
let r: i32 = simd_reduce_or(x);
|
||||
assert!(r == -1_i32);
|
||||
assert_eq!(r, -1_i32);
|
||||
let r: i32 = simd_reduce_xor(x);
|
||||
assert!(r == -1_i32);
|
||||
assert_eq!(r, -1_i32);
|
||||
}
|
||||
|
||||
unsafe {
|
||||
let x = u32x4(1, 2, 3, 4);
|
||||
let r: u32 = simd_reduce_add(x);
|
||||
assert!(r == 10_u32);
|
||||
let r: u32 = simd_reduce_mul(x);
|
||||
assert!(r == 24_u32);
|
||||
let r: u32 = simd_reduce_add_unordered(x);
|
||||
assert_eq!(r, 10_u32);
|
||||
let r: u32 = simd_reduce_mul_unordered(x);
|
||||
assert_eq!(r, 24_u32);
|
||||
let r: u32 = simd_reduce_add_ordered(x, 1);
|
||||
assert_eq!(r, 11_u32);
|
||||
let r: u32 = simd_reduce_mul_ordered(x, 2);
|
||||
assert_eq!(r, 48_u32);
|
||||
|
||||
let r: u32 = simd_reduce_min(x);
|
||||
assert!(r == 1_u32);
|
||||
assert_eq!(r, 1_u32);
|
||||
let r: u32 = simd_reduce_max(x);
|
||||
assert!(r == 4_u32);
|
||||
assert_eq!(r, 4_u32);
|
||||
|
||||
let t = u32::max_value();
|
||||
let x = u32x4(t, t, t, t);
|
||||
let r: u32 = simd_reduce_and(x);
|
||||
assert!(r == t);
|
||||
assert_eq!(r, t);
|
||||
let r: u32 = simd_reduce_or(x);
|
||||
assert!(r == t);
|
||||
assert_eq!(r, t);
|
||||
let r: u32 = simd_reduce_xor(x);
|
||||
assert!(r == 0_u32);
|
||||
assert_eq!(r, 0_u32);
|
||||
|
||||
let x = u32x4(t, t, 0, t);
|
||||
let r: u32 = simd_reduce_and(x);
|
||||
assert!(r == 0_u32);
|
||||
assert_eq!(r, 0_u32);
|
||||
let r: u32 = simd_reduce_or(x);
|
||||
assert!(r == t);
|
||||
assert_eq!(r, t);
|
||||
let r: u32 = simd_reduce_xor(x);
|
||||
assert!(r == t);
|
||||
assert_eq!(r, t);
|
||||
}
|
||||
|
||||
unsafe {
|
||||
let x = f32x4(1., -2., 3., 4.);
|
||||
let r: f32 = simd_reduce_add(x);
|
||||
assert!(r == 6_f32);
|
||||
let r: f32 = simd_reduce_mul(x);
|
||||
assert!(r == -24_f32);
|
||||
let r: f32 = simd_reduce_add_unordered(x);
|
||||
assert_eq!(r, 6_f32);
|
||||
let r: f32 = simd_reduce_mul_unordered(x);
|
||||
assert_eq!(r, -24_f32);
|
||||
// FIXME: only works correctly for accumulator, 0:
|
||||
// https://bugs.llvm.org/show_bug.cgi?id=36734
|
||||
let r: f32 = simd_reduce_add_ordered(x, 0.);
|
||||
assert_eq!(r, 6_f32);
|
||||
// FIXME: only works correctly for accumulator, 1:
|
||||
// https://bugs.llvm.org/show_bug.cgi?id=36734
|
||||
let r: f32 = simd_reduce_mul_ordered(x, 1.);
|
||||
assert_eq!(r, -24_f32);
|
||||
|
||||
let r: f32 = simd_reduce_min(x);
|
||||
assert!(r == -2_f32);
|
||||
assert_eq!(r, -2_f32);
|
||||
let r: f32 = simd_reduce_max(x);
|
||||
assert!(r == 4_f32);
|
||||
assert_eq!(r, 4_f32);
|
||||
let r: f32 = simd_reduce_min_nanless(x);
|
||||
assert_eq!(r, -2_f32);
|
||||
let r: f32 = simd_reduce_max_nanless(x);
|
||||
assert_eq!(r, 4_f32);
|
||||
}
|
||||
|
||||
unsafe {
|
||||
let x = b8x4(!0, !0, !0, !0);
|
||||
let r: bool = simd_reduce_all(x);
|
||||
//let r: bool = foobar(x);
|
||||
assert!(r);
|
||||
assert_eq!(r, true);
|
||||
let r: bool = simd_reduce_any(x);
|
||||
assert!(r);
|
||||
assert_eq!(r, true);
|
||||
|
||||
let x = b8x4(!0, !0, 0, !0);
|
||||
let r: bool = simd_reduce_all(x);
|
||||
assert!(!r);
|
||||
assert_eq!(r, false);
|
||||
let r: bool = simd_reduce_any(x);
|
||||
assert!(r);
|
||||
assert_eq!(r, true);
|
||||
|
||||
let x = b8x4(0, 0, 0, 0);
|
||||
let r: bool = simd_reduce_all(x);
|
||||
assert!(!r);
|
||||
assert_eq!(r, false);
|
||||
let r: bool = simd_reduce_any(x);
|
||||
assert!(!r);
|
||||
assert_eq!(r, false);
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue