Revert "rustc: Fix (again) simd vectors by-val in ABI"
This reverts commit 3cc8f738d4
.
This commit is contained in:
parent
d570b36cd9
commit
086f5a55be
9 changed files with 9 additions and 332 deletions
|
@ -80,7 +80,9 @@ impl LtoModuleCodegen {
|
||||||
let module = module.take().unwrap();
|
let module = module.take().unwrap();
|
||||||
{
|
{
|
||||||
let config = cgcx.config(module.kind);
|
let config = cgcx.config(module.kind);
|
||||||
run_pass_manager(cgcx, &module, config, false);
|
let llmod = module.module_llvm.llmod();
|
||||||
|
let tm = &*module.module_llvm.tm;
|
||||||
|
run_pass_manager(cgcx, tm, llmod, config, false);
|
||||||
timeline.record("fat-done");
|
timeline.record("fat-done");
|
||||||
}
|
}
|
||||||
Ok(module)
|
Ok(module)
|
||||||
|
@ -555,7 +557,8 @@ fn thin_lto(cgcx: &CodegenContext,
|
||||||
}
|
}
|
||||||
|
|
||||||
fn run_pass_manager(cgcx: &CodegenContext,
|
fn run_pass_manager(cgcx: &CodegenContext,
|
||||||
module: &ModuleCodegen,
|
tm: &llvm::TargetMachine,
|
||||||
|
llmod: &llvm::Module,
|
||||||
config: &ModuleConfig,
|
config: &ModuleConfig,
|
||||||
thin: bool) {
|
thin: bool) {
|
||||||
// Now we have one massive module inside of llmod. Time to run the
|
// Now we have one massive module inside of llmod. Time to run the
|
||||||
|
@ -566,8 +569,7 @@ fn run_pass_manager(cgcx: &CodegenContext,
|
||||||
debug!("running the pass manager");
|
debug!("running the pass manager");
|
||||||
unsafe {
|
unsafe {
|
||||||
let pm = llvm::LLVMCreatePassManager();
|
let pm = llvm::LLVMCreatePassManager();
|
||||||
let llmod = module.module_llvm.llmod();
|
llvm::LLVMRustAddAnalysisPasses(tm, pm, llmod);
|
||||||
llvm::LLVMRustAddAnalysisPasses(module.module_llvm.tm, pm, llmod);
|
|
||||||
|
|
||||||
if config.verify_llvm_ir {
|
if config.verify_llvm_ir {
|
||||||
let pass = llvm::LLVMRustFindAndCreatePass("verify\0".as_ptr() as *const _);
|
let pass = llvm::LLVMRustFindAndCreatePass("verify\0".as_ptr() as *const _);
|
||||||
|
@ -862,7 +864,7 @@ impl ThinModule {
|
||||||
// little differently.
|
// little differently.
|
||||||
info!("running thin lto passes over {}", module.name);
|
info!("running thin lto passes over {}", module.name);
|
||||||
let config = cgcx.config(module.kind);
|
let config = cgcx.config(module.kind);
|
||||||
run_pass_manager(cgcx, &module, config, true);
|
run_pass_manager(cgcx, module.module_llvm.tm, llmod, config, true);
|
||||||
cgcx.save_temp_bitcode(&module, "thin-lto-after-pm");
|
cgcx.save_temp_bitcode(&module, "thin-lto-after-pm");
|
||||||
timeline.record("thin-done");
|
timeline.record("thin-done");
|
||||||
}
|
}
|
||||||
|
|
|
@ -633,7 +633,7 @@ unsafe fn optimize(cgcx: &CodegenContext,
|
||||||
None,
|
None,
|
||||||
&format!("llvm module passes [{}]", module_name.unwrap()),
|
&format!("llvm module passes [{}]", module_name.unwrap()),
|
||||||
|| {
|
|| {
|
||||||
llvm::LLVMRunPassManager(mpm, llmod);
|
llvm::LLVMRunPassManager(mpm, llmod)
|
||||||
});
|
});
|
||||||
|
|
||||||
// Deallocate managers that we're now done with
|
// Deallocate managers that we're now done with
|
||||||
|
@ -691,38 +691,6 @@ unsafe fn codegen(cgcx: &CodegenContext,
|
||||||
create_msvc_imps(cgcx, llcx, llmod);
|
create_msvc_imps(cgcx, llcx, llmod);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Ok now this one's a super interesting invocations. SIMD in rustc is
|
|
||||||
// difficult where we want some parts of the program to be able to use
|
|
||||||
// some SIMD features while other parts of the program don't. The real
|
|
||||||
// tough part is that we want this to actually work correctly!
|
|
||||||
//
|
|
||||||
// We go to great lengths to make sure this works, and one crucial
|
|
||||||
// aspect is that vector arguments (simd types) are never passed by
|
|
||||||
// value in the ABI of functions. It turns out, however, that LLVM will
|
|
||||||
// undo our "clever work" of passing vector types by reference. Its
|
|
||||||
// argument promotion pass will promote these by-ref arguments to
|
|
||||||
// by-val. That, however, introduces codegen errors!
|
|
||||||
//
|
|
||||||
// The upstream LLVM bug [1] has unfortunatey not really seen a lot of
|
|
||||||
// activity. The Rust bug [2], however, has seen quite a lot of reports
|
|
||||||
// of this in the wild. As a result, this is worked around locally here.
|
|
||||||
// We have a custom transformation, `LLVMRustDemoteSimdArguments`, which
|
|
||||||
// does the opposite of argument promotion by demoting any by-value SIMD
|
|
||||||
// arguments in function signatures to pointers intead of being
|
|
||||||
// by-value.
|
|
||||||
//
|
|
||||||
// This operates at the LLVM IR layer because LLVM is thwarting our
|
|
||||||
// codegen and this is the only chance we get to make sure it's correct
|
|
||||||
// before we hit codegen.
|
|
||||||
//
|
|
||||||
// Hopefully one day the upstream LLVM bug will be fixed and we'll no
|
|
||||||
// longer need this!
|
|
||||||
//
|
|
||||||
// [1]: https://bugs.llvm.org/show_bug.cgi?id=37358
|
|
||||||
// [2]: https://github.com/rust-lang/rust/issues/50154
|
|
||||||
llvm::LLVMRustDemoteSimdArguments(llmod);
|
|
||||||
cgcx.save_temp_bitcode(&module, "simd-demoted");
|
|
||||||
|
|
||||||
// A codegen-specific pass manager is used to generate object
|
// A codegen-specific pass manager is used to generate object
|
||||||
// files for an LLVM module.
|
// files for an LLVM module.
|
||||||
//
|
//
|
||||||
|
|
|
@ -1138,8 +1138,6 @@ extern "C" {
|
||||||
/// Runs a pass manager on a module.
|
/// Runs a pass manager on a module.
|
||||||
pub fn LLVMRunPassManager(PM: &PassManager<'a>, M: &'a Module) -> Bool;
|
pub fn LLVMRunPassManager(PM: &PassManager<'a>, M: &'a Module) -> Bool;
|
||||||
|
|
||||||
pub fn LLVMRustDemoteSimdArguments(M: &'a Module);
|
|
||||||
|
|
||||||
pub fn LLVMInitializePasses();
|
pub fn LLVMInitializePasses();
|
||||||
|
|
||||||
pub fn LLVMPassManagerBuilderCreate() -> &'static mut PassManagerBuilder;
|
pub fn LLVMPassManagerBuilderCreate() -> &'static mut PassManagerBuilder;
|
||||||
|
|
|
@ -162,9 +162,7 @@ fn main() {
|
||||||
}
|
}
|
||||||
|
|
||||||
build_helper::rerun_if_changed_anything_in_dir(Path::new("../rustllvm"));
|
build_helper::rerun_if_changed_anything_in_dir(Path::new("../rustllvm"));
|
||||||
cfg
|
cfg.file("../rustllvm/PassWrapper.cpp")
|
||||||
.file("../rustllvm/DemoteSimd.cpp")
|
|
||||||
.file("../rustllvm/PassWrapper.cpp")
|
|
||||||
.file("../rustllvm/RustWrapper.cpp")
|
.file("../rustllvm/RustWrapper.cpp")
|
||||||
.file("../rustllvm/ArchiveWrapper.cpp")
|
.file("../rustllvm/ArchiveWrapper.cpp")
|
||||||
.file("../rustllvm/Linker.cpp")
|
.file("../rustllvm/Linker.cpp")
|
||||||
|
|
|
@ -1,189 +0,0 @@
|
||||||
// Copyright 2018 The Rust Project Developers. See the COPYRIGHT
|
|
||||||
// file at the top-level directory of this distribution and at
|
|
||||||
// http://rust-lang.org/COPYRIGHT.
|
|
||||||
//
|
|
||||||
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
||||||
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
||||||
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
||||||
// option. This file may not be copied, modified, or distributed
|
|
||||||
// except according to those terms.
|
|
||||||
|
|
||||||
#include <vector>
|
|
||||||
#include <set>
|
|
||||||
|
|
||||||
#include "rustllvm.h"
|
|
||||||
|
|
||||||
#if LLVM_VERSION_GE(5, 0)
|
|
||||||
|
|
||||||
#include "llvm/IR/CallSite.h"
|
|
||||||
#include "llvm/IR/Module.h"
|
|
||||||
#include "llvm/ADT/STLExtras.h"
|
|
||||||
|
|
||||||
using namespace llvm;
|
|
||||||
|
|
||||||
static std::vector<Function*>
|
|
||||||
GetFunctionsWithSimdArgs(Module *M) {
|
|
||||||
std::vector<Function*> Ret;
|
|
||||||
|
|
||||||
for (auto &F : M->functions()) {
|
|
||||||
// Skip all intrinsic calls as these are always tightly controlled to "work
|
|
||||||
// correctly", so no need to fixup any of these.
|
|
||||||
if (F.isIntrinsic())
|
|
||||||
continue;
|
|
||||||
|
|
||||||
// We're only interested in rustc-defined functions, not unstably-defined
|
|
||||||
// imported SIMD ffi functions.
|
|
||||||
if (F.isDeclaration())
|
|
||||||
continue;
|
|
||||||
|
|
||||||
// Argument promotion only happens on internal functions, so skip demoting
|
|
||||||
// arguments in external functions like FFI shims and such.
|
|
||||||
if (!F.hasLocalLinkage())
|
|
||||||
continue;
|
|
||||||
|
|
||||||
// If any argument to this function is a by-value vector type, then that's
|
|
||||||
// bad! The compiler didn't generate any functions that looked like this,
|
|
||||||
// and we try to rely on LLVM to not do this! Argument promotion may,
|
|
||||||
// however, promote arguments from behind references. In any case, figure
|
|
||||||
// out if we're interested in demoting this argument.
|
|
||||||
if (any_of(F.args(), [](Argument &arg) { return arg.getType()->isVectorTy(); }))
|
|
||||||
Ret.push_back(&F);
|
|
||||||
}
|
|
||||||
|
|
||||||
return Ret;
|
|
||||||
}
|
|
||||||
|
|
||||||
extern "C" void
|
|
||||||
LLVMRustDemoteSimdArguments(LLVMModuleRef Mod) {
|
|
||||||
Module *M = unwrap(Mod);
|
|
||||||
|
|
||||||
auto Functions = GetFunctionsWithSimdArgs(M);
|
|
||||||
|
|
||||||
for (auto F : Functions) {
|
|
||||||
// Build up our list of new parameters and new argument attributes.
|
|
||||||
// We're only changing those arguments which are vector types.
|
|
||||||
SmallVector<Type*, 8> Params;
|
|
||||||
SmallVector<AttributeSet, 8> ArgAttrVec;
|
|
||||||
auto PAL = F->getAttributes();
|
|
||||||
for (auto &Arg : F->args()) {
|
|
||||||
auto *Ty = Arg.getType();
|
|
||||||
if (Ty->isVectorTy()) {
|
|
||||||
Params.push_back(PointerType::get(Ty, 0));
|
|
||||||
ArgAttrVec.push_back(AttributeSet());
|
|
||||||
} else {
|
|
||||||
Params.push_back(Ty);
|
|
||||||
ArgAttrVec.push_back(PAL.getParamAttributes(Arg.getArgNo()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Replace `F` with a new function with our new signature. I'm... not really
|
|
||||||
// sure how this works, but this is all the steps `ArgumentPromotion` does
|
|
||||||
// to replace a signature as well.
|
|
||||||
assert(!F->isVarArg()); // ArgumentPromotion should skip these fns
|
|
||||||
FunctionType *NFTy = FunctionType::get(F->getReturnType(), Params, false);
|
|
||||||
Function *NF = Function::Create(NFTy, F->getLinkage(), F->getName());
|
|
||||||
NF->copyAttributesFrom(F);
|
|
||||||
NF->setSubprogram(F->getSubprogram());
|
|
||||||
F->setSubprogram(nullptr);
|
|
||||||
NF->setAttributes(AttributeList::get(F->getContext(),
|
|
||||||
PAL.getFnAttributes(),
|
|
||||||
PAL.getRetAttributes(),
|
|
||||||
ArgAttrVec));
|
|
||||||
ArgAttrVec.clear();
|
|
||||||
F->getParent()->getFunctionList().insert(F->getIterator(), NF);
|
|
||||||
NF->takeName(F);
|
|
||||||
|
|
||||||
// Iterate over all invocations of `F`, updating all `call` instructions to
|
|
||||||
// store immediate vector types in a local `alloc` instead of a by-value
|
|
||||||
// vector.
|
|
||||||
//
|
|
||||||
// Like before, much of this is copied from the `ArgumentPromotion` pass in
|
|
||||||
// LLVM.
|
|
||||||
SmallVector<Value*, 16> Args;
|
|
||||||
while (!F->use_empty()) {
|
|
||||||
CallSite CS(F->user_back());
|
|
||||||
assert(CS.getCalledFunction() == F);
|
|
||||||
Instruction *Call = CS.getInstruction();
|
|
||||||
const AttributeList &CallPAL = CS.getAttributes();
|
|
||||||
|
|
||||||
// Loop over the operands, inserting an `alloca` and a store for any
|
|
||||||
// argument we're demoting to be by reference
|
|
||||||
//
|
|
||||||
// FIXME: we probably want to figure out an LLVM pass to run and clean up
|
|
||||||
// this function and instructions we're generating, we should in theory
|
|
||||||
// only generate a maximum number of `alloca` instructions rather than
|
|
||||||
// one-per-variable unconditionally.
|
|
||||||
CallSite::arg_iterator AI = CS.arg_begin();
|
|
||||||
size_t ArgNo = 0;
|
|
||||||
for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E;
|
|
||||||
++I, ++AI, ++ArgNo) {
|
|
||||||
if (I->getType()->isVectorTy()) {
|
|
||||||
AllocaInst *AllocA = new AllocaInst(I->getType(), 0, nullptr, "", Call);
|
|
||||||
new StoreInst(*AI, AllocA, Call);
|
|
||||||
Args.push_back(AllocA);
|
|
||||||
ArgAttrVec.push_back(AttributeSet());
|
|
||||||
} else {
|
|
||||||
Args.push_back(*AI);
|
|
||||||
ArgAttrVec.push_back(CallPAL.getParamAttributes(ArgNo));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
assert(AI == CS.arg_end());
|
|
||||||
|
|
||||||
// Create a new call instructions which we'll use to replace the old call
|
|
||||||
// instruction, copying over as many attributes and such as possible.
|
|
||||||
SmallVector<OperandBundleDef, 1> OpBundles;
|
|
||||||
CS.getOperandBundlesAsDefs(OpBundles);
|
|
||||||
|
|
||||||
CallSite NewCS;
|
|
||||||
if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
|
|
||||||
InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
|
|
||||||
Args, OpBundles, "", Call);
|
|
||||||
} else {
|
|
||||||
auto *NewCall = CallInst::Create(NF, Args, OpBundles, "", Call);
|
|
||||||
NewCall->setTailCallKind(cast<CallInst>(Call)->getTailCallKind());
|
|
||||||
NewCS = NewCall;
|
|
||||||
}
|
|
||||||
NewCS.setCallingConv(CS.getCallingConv());
|
|
||||||
NewCS.setAttributes(
|
|
||||||
AttributeList::get(F->getContext(), CallPAL.getFnAttributes(),
|
|
||||||
CallPAL.getRetAttributes(), ArgAttrVec));
|
|
||||||
NewCS->setDebugLoc(Call->getDebugLoc());
|
|
||||||
Args.clear();
|
|
||||||
ArgAttrVec.clear();
|
|
||||||
Call->replaceAllUsesWith(NewCS.getInstruction());
|
|
||||||
NewCS->takeName(Call);
|
|
||||||
Call->eraseFromParent();
|
|
||||||
}
|
|
||||||
|
|
||||||
// Splice the body of the old function right into the new function.
|
|
||||||
NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList());
|
|
||||||
|
|
||||||
// Update our new function to replace all uses of the by-value argument with
|
|
||||||
// loads of the pointer argument we've generated.
|
|
||||||
//
|
|
||||||
// FIXME: we probably want to only generate one load instruction per
|
|
||||||
// function? Or maybe run an LLVM pass to clean up this function?
|
|
||||||
for (Function::arg_iterator I = F->arg_begin(),
|
|
||||||
E = F->arg_end(),
|
|
||||||
I2 = NF->arg_begin();
|
|
||||||
I != E;
|
|
||||||
++I, ++I2) {
|
|
||||||
if (I->getType()->isVectorTy()) {
|
|
||||||
I->replaceAllUsesWith(new LoadInst(&*I2, "", &NF->begin()->front()));
|
|
||||||
} else {
|
|
||||||
I->replaceAllUsesWith(&*I2);
|
|
||||||
}
|
|
||||||
I2->takeName(&*I);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Delete all references to the old function, it should be entirely dead
|
|
||||||
// now.
|
|
||||||
M->getFunctionList().remove(F);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
#else // LLVM_VERSION_GE(8, 0)
|
|
||||||
extern "C" void
|
|
||||||
LLVMRustDemoteSimdArguments(LLVMModuleRef Mod) {
|
|
||||||
}
|
|
||||||
#endif // LLVM_VERSION_GE(8, 0)
|
|
|
@ -1,13 +0,0 @@
|
||||||
-include ../../run-make-fulldeps/tools.mk
|
|
||||||
|
|
||||||
ifeq ($(TARGET),x86_64-unknown-linux-gnu)
|
|
||||||
all:
|
|
||||||
$(RUSTC) t1.rs -C opt-level=3
|
|
||||||
$(TMPDIR)/t1
|
|
||||||
$(RUSTC) t2.rs -C opt-level=3
|
|
||||||
$(TMPDIR)/t2
|
|
||||||
$(RUSTC) t3.rs -C opt-level=3
|
|
||||||
$(TMPDIR)/t3
|
|
||||||
else
|
|
||||||
all:
|
|
||||||
endif
|
|
|
@ -1,21 +0,0 @@
|
||||||
use std::arch::x86_64;
|
|
||||||
|
|
||||||
fn main() {
|
|
||||||
if !is_x86_feature_detected!("avx2") {
|
|
||||||
return println!("AVX2 is not supported on this machine/build.");
|
|
||||||
}
|
|
||||||
let load_bytes: [u8; 32] = [0x0f; 32];
|
|
||||||
let lb_ptr = load_bytes.as_ptr();
|
|
||||||
let reg_load = unsafe {
|
|
||||||
x86_64::_mm256_loadu_si256(
|
|
||||||
lb_ptr as *const x86_64::__m256i
|
|
||||||
)
|
|
||||||
};
|
|
||||||
println!("{:?}", reg_load);
|
|
||||||
let mut store_bytes: [u8; 32] = [0; 32];
|
|
||||||
let sb_ptr = store_bytes.as_mut_ptr();
|
|
||||||
unsafe {
|
|
||||||
x86_64::_mm256_storeu_si256(sb_ptr as *mut x86_64::__m256i, reg_load);
|
|
||||||
}
|
|
||||||
assert_eq!(load_bytes, store_bytes);
|
|
||||||
}
|
|
|
@ -1,14 +0,0 @@
|
||||||
use std::arch::x86_64::*;
|
|
||||||
|
|
||||||
fn main() {
|
|
||||||
if !is_x86_feature_detected!("avx") {
|
|
||||||
return println!("AVX is not supported on this machine/build.");
|
|
||||||
}
|
|
||||||
unsafe {
|
|
||||||
let f = _mm256_set_pd(2.0, 2.0, 2.0, 2.0);
|
|
||||||
let r = _mm256_mul_pd(f, f);
|
|
||||||
|
|
||||||
union A { a: __m256d, b: [f64; 4] }
|
|
||||||
assert_eq!(A { a: r }.b, [4.0, 4.0, 4.0, 4.0]);
|
|
||||||
}
|
|
||||||
}
|
|
|
@ -1,52 +0,0 @@
|
||||||
use std::arch::x86_64::*;
|
|
||||||
|
|
||||||
#[target_feature(enable = "avx")]
|
|
||||||
unsafe fn avx_mul(a: __m256, b: __m256) -> __m256 {
|
|
||||||
_mm256_mul_ps(a, b)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[target_feature(enable = "avx")]
|
|
||||||
unsafe fn avx_store(p: *mut f32, a: __m256) {
|
|
||||||
_mm256_storeu_ps(p, a)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[target_feature(enable = "avx")]
|
|
||||||
unsafe fn avx_setr(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32, h: f32) -> __m256 {
|
|
||||||
_mm256_setr_ps(a, b, c, d, e, f, g, h)
|
|
||||||
}
|
|
||||||
|
|
||||||
#[target_feature(enable = "avx")]
|
|
||||||
unsafe fn avx_set1(a: f32) -> __m256 {
|
|
||||||
_mm256_set1_ps(a)
|
|
||||||
}
|
|
||||||
|
|
||||||
struct Avx(__m256);
|
|
||||||
|
|
||||||
fn mul(a: Avx, b: Avx) -> Avx {
|
|
||||||
unsafe { Avx(avx_mul(a.0, b.0)) }
|
|
||||||
}
|
|
||||||
|
|
||||||
fn set1(a: f32) -> Avx {
|
|
||||||
unsafe { Avx(avx_set1(a)) }
|
|
||||||
}
|
|
||||||
|
|
||||||
fn setr(a: f32, b: f32, c: f32, d: f32, e: f32, f: f32, g: f32, h: f32) -> Avx {
|
|
||||||
unsafe { Avx(avx_setr(a, b, c, d, e, f, g, h)) }
|
|
||||||
}
|
|
||||||
|
|
||||||
unsafe fn store(p: *mut f32, a: Avx) {
|
|
||||||
avx_store(p, a.0);
|
|
||||||
}
|
|
||||||
|
|
||||||
fn main() {
|
|
||||||
if !is_x86_feature_detected!("avx") {
|
|
||||||
return println!("AVX is not supported on this machine/build.");
|
|
||||||
}
|
|
||||||
let mut result = [0.0f32; 8];
|
|
||||||
let a = mul(setr(0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0), set1(0.25));
|
|
||||||
unsafe {
|
|
||||||
store(result.as_mut_ptr(), a);
|
|
||||||
}
|
|
||||||
|
|
||||||
assert_eq!(result, [0.0, 0.25, 0.5, 0.75, 1.0, 1.25, 1.50, 1.75]);
|
|
||||||
}
|
|
Loading…
Add table
Add a link
Reference in a new issue