mirror of
https://github.com/rust-lang/rust.git
synced 2024-11-22 06:44:35 +00:00
simd_shuffle intrinsic: allow argument to be passed as vector (not just as array)
This commit is contained in:
parent
e9e27ab0cf
commit
194baa820d
@ -191,6 +191,14 @@ pub(super) fn codegen_simd_intrinsic_call<'tcx>(
|
|||||||
})
|
})
|
||||||
.try_into()
|
.try_into()
|
||||||
.unwrap(),
|
.unwrap(),
|
||||||
|
_ if idx_ty.is_simd()
|
||||||
|
&& matches!(
|
||||||
|
idx_ty.simd_size_and_type(fx.tcx).1.kind(),
|
||||||
|
ty::Uint(ty::UintTy::U32)
|
||||||
|
) =>
|
||||||
|
{
|
||||||
|
idx_ty.simd_size_and_type(fx.tcx).0.try_into().unwrap()
|
||||||
|
}
|
||||||
_ => {
|
_ => {
|
||||||
fx.tcx.dcx().span_err(
|
fx.tcx.dcx().span_err(
|
||||||
span,
|
span,
|
||||||
@ -213,6 +221,8 @@ pub(super) fn codegen_simd_intrinsic_call<'tcx>(
|
|||||||
|
|
||||||
let total_len = lane_count * 2;
|
let total_len = lane_count * 2;
|
||||||
|
|
||||||
|
// FIXME: this is a terrible abstraction-breaking hack.
|
||||||
|
// Find a way to reuse `immediate_const_vector` from `codegen_ssa` instead.
|
||||||
let indexes = {
|
let indexes = {
|
||||||
use rustc_middle::mir::interpret::*;
|
use rustc_middle::mir::interpret::*;
|
||||||
let idx_const = match &idx.node {
|
let idx_const = match &idx.node {
|
||||||
|
@ -353,19 +353,24 @@ pub fn generic_simd_intrinsic<'a, 'gcc, 'tcx>(
|
|||||||
}
|
}
|
||||||
|
|
||||||
if name == sym::simd_shuffle {
|
if name == sym::simd_shuffle {
|
||||||
// Make sure this is actually an array, since typeck only checks the length-suffixed
|
// Make sure this is actually an array or SIMD vector, since typeck only checks the length-suffixed
|
||||||
// version of this intrinsic.
|
// version of this intrinsic.
|
||||||
let n: u64 = match *args[2].layout.ty.kind() {
|
let idx_ty = args[2].layout.ty;
|
||||||
|
let n: u64 = match idx_ty.kind() {
|
||||||
ty::Array(ty, len) if matches!(*ty.kind(), ty::Uint(ty::UintTy::U32)) => {
|
ty::Array(ty, len) if matches!(*ty.kind(), ty::Uint(ty::UintTy::U32)) => {
|
||||||
len.try_eval_target_usize(bx.cx.tcx, ty::ParamEnv::reveal_all()).unwrap_or_else(
|
len.try_eval_target_usize(bx.cx.tcx, ty::ParamEnv::reveal_all()).unwrap_or_else(
|
||||||
|| span_bug!(span, "could not evaluate shuffle index array length"),
|
|| span_bug!(span, "could not evaluate shuffle index array length"),
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
_ => return_error!(InvalidMonomorphization::SimdShuffle {
|
_ if idx_ty.is_simd()
|
||||||
span,
|
&& matches!(
|
||||||
name,
|
idx_ty.simd_size_and_type(bx.cx.tcx).1.kind(),
|
||||||
ty: args[2].layout.ty
|
ty::Uint(ty::UintTy::U32)
|
||||||
}),
|
) =>
|
||||||
|
{
|
||||||
|
idx_ty.simd_size_and_type(bx.cx.tcx).0
|
||||||
|
}
|
||||||
|
_ => return_error!(InvalidMonomorphization::SimdShuffle { span, name, ty: idx_ty }),
|
||||||
};
|
};
|
||||||
require_simd!(ret_ty, InvalidMonomorphization::SimdReturn { span, name, ty: ret_ty });
|
require_simd!(ret_ty, InvalidMonomorphization::SimdReturn { span, name, ty: ret_ty });
|
||||||
|
|
||||||
|
@ -1279,19 +1279,24 @@ fn generic_simd_intrinsic<'ll, 'tcx>(
|
|||||||
}
|
}
|
||||||
|
|
||||||
if name == sym::simd_shuffle {
|
if name == sym::simd_shuffle {
|
||||||
// Make sure this is actually an array, since typeck only checks the length-suffixed
|
// Make sure this is actually an array or SIMD vector, since typeck only checks the length-suffixed
|
||||||
// version of this intrinsic.
|
// version of this intrinsic.
|
||||||
let n: u64 = match args[2].layout.ty.kind() {
|
let idx_ty = args[2].layout.ty;
|
||||||
|
let n: u64 = match idx_ty.kind() {
|
||||||
ty::Array(ty, len) if matches!(ty.kind(), ty::Uint(ty::UintTy::U32)) => {
|
ty::Array(ty, len) if matches!(ty.kind(), ty::Uint(ty::UintTy::U32)) => {
|
||||||
len.try_eval_target_usize(bx.cx.tcx, ty::ParamEnv::reveal_all()).unwrap_or_else(
|
len.try_eval_target_usize(bx.cx.tcx, ty::ParamEnv::reveal_all()).unwrap_or_else(
|
||||||
|| span_bug!(span, "could not evaluate shuffle index array length"),
|
|| span_bug!(span, "could not evaluate shuffle index array length"),
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
_ => return_error!(InvalidMonomorphization::SimdShuffle {
|
_ if idx_ty.is_simd()
|
||||||
span,
|
&& matches!(
|
||||||
name,
|
idx_ty.simd_size_and_type(bx.cx.tcx).1.kind(),
|
||||||
ty: args[2].layout.ty
|
ty::Uint(ty::UintTy::U32)
|
||||||
}),
|
) =>
|
||||||
|
{
|
||||||
|
idx_ty.simd_size_and_type(bx.cx.tcx).0
|
||||||
|
}
|
||||||
|
_ => return_error!(InvalidMonomorphization::SimdShuffle { span, name, ty: idx_ty }),
|
||||||
};
|
};
|
||||||
|
|
||||||
let (out_len, out_ty) = require_simd!(ret_ty, SimdReturn);
|
let (out_len, out_ty) = require_simd!(ret_ty, SimdReturn);
|
||||||
|
@ -232,7 +232,7 @@ extern "rust-intrinsic" {
|
|||||||
///
|
///
|
||||||
/// `T` must be a vector.
|
/// `T` must be a vector.
|
||||||
///
|
///
|
||||||
/// `U` must be a **const** array of `i32`s. This means it must either refer to a named
|
/// `U` must be a **const** array or vector of `u32`s. This means it must either refer to a named
|
||||||
/// const or be given as an inline const expression (`const { ... }`).
|
/// const or be given as an inline const expression (`const { ... }`).
|
||||||
///
|
///
|
||||||
/// `V` must be a vector with the same element type as `T` and the same length as `U`.
|
/// `V` must be a vector with the same element type as `T` and the same length as `U`.
|
||||||
|
@ -6,15 +6,20 @@
|
|||||||
#![allow(incomplete_features)]
|
#![allow(incomplete_features)]
|
||||||
#![feature(adt_const_params)]
|
#![feature(adt_const_params)]
|
||||||
|
|
||||||
|
use std::marker::ConstParamTy;
|
||||||
|
|
||||||
extern "rust-intrinsic" {
|
extern "rust-intrinsic" {
|
||||||
fn simd_shuffle<T, I, U>(a: T, b: T, i: I) -> U;
|
fn simd_shuffle<T, I, U>(a: T, b: T, i: I) -> U;
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Copy, Clone)]
|
#[derive(Copy, Clone, ConstParamTy, PartialEq, Eq)]
|
||||||
#[repr(simd)]
|
#[repr(simd)]
|
||||||
struct Simd<T, const N: usize>([T; N]);
|
struct Simd<T, const N: usize>([T; N]);
|
||||||
|
|
||||||
pub unsafe fn __shuffle_vector16<const IDX: [u32; 16], T, U>(x: T, y: T) -> U {
|
unsafe fn __shuffle_vector16<const IDX: [u32; 16], T, U>(x: T, y: T) -> U {
|
||||||
|
simd_shuffle(x, y, IDX)
|
||||||
|
}
|
||||||
|
unsafe fn __shuffle_vector16_v2<const IDX: Simd<u32, 16>, T, U>(x: T, y: T) -> U {
|
||||||
simd_shuffle(x, y, IDX)
|
simd_shuffle(x, y, IDX)
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -30,6 +35,17 @@ fn main() {
|
|||||||
let y: Simd<u8, 2> = simd_shuffle(a, b, I2);
|
let y: Simd<u8, 2> = simd_shuffle(a, b, I2);
|
||||||
assert_eq!(y.0, [1, 5]);
|
assert_eq!(y.0, [1, 5]);
|
||||||
}
|
}
|
||||||
|
// Test that we can also use a SIMD vector instead of a normal array for the shuffle.
|
||||||
|
const I1_SIMD: Simd<u32, 4> = Simd([0, 2, 4, 6]);
|
||||||
|
const I2_SIMD: Simd<u32, 2> = Simd([1, 5]);
|
||||||
|
unsafe {
|
||||||
|
let x: Simd<u8, 4> = simd_shuffle(a, b, I1_SIMD);
|
||||||
|
assert_eq!(x.0, [0, 2, 4, 6]);
|
||||||
|
|
||||||
|
let y: Simd<u8, 2> = simd_shuffle(a, b, I2_SIMD);
|
||||||
|
assert_eq!(y.0, [1, 5]);
|
||||||
|
}
|
||||||
|
|
||||||
// Test that an indirection (via an unnamed constant)
|
// Test that an indirection (via an unnamed constant)
|
||||||
// through a const generic parameter also works.
|
// through a const generic parameter also works.
|
||||||
// See https://github.com/rust-lang/rust/issues/113500 for details.
|
// See https://github.com/rust-lang/rust/issues/113500 for details.
|
||||||
@ -42,4 +58,11 @@ fn main() {
|
|||||||
Simd<u8, 16>,
|
Simd<u8, 16>,
|
||||||
>(a, b);
|
>(a, b);
|
||||||
}
|
}
|
||||||
|
unsafe {
|
||||||
|
__shuffle_vector16_v2::<
|
||||||
|
{ Simd([1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]) },
|
||||||
|
Simd<u8, 16>,
|
||||||
|
Simd<u8, 16>,
|
||||||
|
>(a, b);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user